[−][src]Struct radiate::models::neat::layers::dense::Dense
Fields
inputs: Vec<i32>
outputs: Vec<i32>
nodes: HashMap<i32, *mut Neuron>
edges: HashMap<i32, Edge>
layer_type: LayerType
activation: Activation
Methods
impl Dense
[src]
pub fn new(
num_in: i32,
num_out: i32,
layer_type: LayerType,
activation: Activation,
counter: &mut Counter
) -> Self
[src]
num_in: i32,
num_out: i32,
layer_type: LayerType,
activation: Activation,
counter: &mut Counter
) -> Self
create a new fully connected dense layer. Each input is connected to each output with a randomly generated weight attached to the connection
pub fn add_node(
&mut self,
counter: &mut Counter,
activation: Activation
) -> Option<*mut Neuron>
[src]
&mut self,
counter: &mut Counter,
activation: Activation
) -> Option<*mut Neuron>
Add a node to the network by getting a random edge and inserting the new node inbetween that edge's source and destination nodes. The old weight is pushed forward while the new weight is randomly chosen and put between the old source node and the new node
pub fn add_edge(&mut self, counter: &mut Counter) -> Option<Edge>
[src]
add a connection to the network. Randomly get a sending node that cannot be an output and a receiving node which is not an input node, the validate that the desired connection can be made. If it can be, make the connection with a weight of .5 in order to minimally impact the network
pub fn see(&self)
[src]
Trait Implementations
impl Clone for Dense
[src]
Implement clone for the neat neural network in order to facilitate proper crossover and mutation for the network
fn clone(&self) -> Self
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Debug for Dense
[src]
impl Display for Dense
[src]
Simple override of display for neat to debug a little cleaner
impl Drop for Dense
[src]
Because the tree is made out of raw mutable pointers, if those pointers are not dropped, there is a severe memory leak, like possibly gigs of ram over only a few generations depending on the size of the generation This drop implementation will recursivley drop all nodes in the tree
impl Layer for Dense
[src]
fn propagate(&mut self, data: &Vec<f64>) -> Option<Vec<f64>>
[src]
Feed a vec of inputs through the network, will panic! if the shapes of the values do not match or if something goes wrong within the feed forward process.
fn backprop(&mut self, error: &Vec<f64>, learning_rate: f64) -> Option<Vec<f64>>
[src]
Backpropagation algorithm, transfer the error through the network and change the weights of the edges accordinly, this is pretty straight forward due to the design of the neat graph
fn as_ref_any(&self) -> &dyn Any where
Self: Sized + 'static,
[src]
Self: Sized + 'static,
fn as_mut_any(&mut self) -> &mut dyn Any where
Self: Sized + 'static,
[src]
Self: Sized + 'static,
fn shape(&self) -> (usize, usize)
[src]
fn max_marker(&self) -> i32
[src]
find the max edge innovation number from the network for determing the genetic_structure of this network
impl Mutate<Dense> for Dense where
Dense: Layer,
[src]
Dense: Layer,
fn mutate(
child: &mut Dense,
_: &Dense,
parent_two: &Dense,
env: &Arc<RwLock<NeatEnvironment>>,
crossover_rate: f32
) where
Self: Sized + Send + Sync,
[src]
child: &mut Dense,
_: &Dense,
parent_two: &Dense,
env: &Arc<RwLock<NeatEnvironment>>,
crossover_rate: f32
) where
Self: Sized + Send + Sync,
fn distance(one: &Dense, two: &Dense, env: &Arc<RwLock<NeatEnvironment>>) -> f64
[src]
impl PartialEq<Dense> for Dense
[src]
Implement partialeq for neat because if neat itself is to be used as a problem, it must be able to compare one to another
impl Send for Dense
[src]
These must be implemneted for the network or any type to be used within seperate threads. Because implementing the functions themselves is dangerious and unsafe and i'm not smart enough to do that from scratch, these "implmenetaions" will get rid of the error and realistically they don't need to be implemneted for the program to work
impl Sync for Dense
[src]
Auto Trait Implementations
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<L> LayerClone for L where
L: 'static + Layer + Clone,
[src]
L: 'static + Layer + Clone,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = !
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,