pub struct MetaPolicyNetwork {
pub policy_weights: Array3<f64>,
pub meta_weights: Array3<f64>,
pub policy_bias: Array2<f64>,
pub meta_bias: Array2<f64>,
pub layer_sizes: Vec<usize>,
pub adaptive_learning_rates: Array2<f64>,
pub meta_gradient_accumulator: Array3<f64>,
pub second_order_info: Array3<f64>,
pub curriculum_difficulty: f64,
pub problem_embeddings: HashMap<String, Array1<f64>>,
}
Expand description
Advanced Neural Network with Meta-Learning Capabilities
Fields§
§policy_weights: Array3<f64>
Primary policy weights
meta_weights: Array3<f64>
Meta-policy weights for learning rate adaptation
policy_bias: Array2<f64>
Bias terms
meta_bias: Array2<f64>
§layer_sizes: Vec<usize>
Network architecture
adaptive_learning_rates: Array2<f64>
Adaptive learning rates per parameter
meta_gradient_accumulator: Array3<f64>
Meta-gradient accumulator
second_order_info: Array3<f64>
Higher-order derivative tracking
curriculum_difficulty: f64
Curriculum learning difficulty
problem_embeddings: HashMap<String, Array1<f64>>
Problem class embeddings
Implementations§
Source§impl MetaPolicyNetwork
impl MetaPolicyNetwork
Sourcepub fn new(
_input_size: usize,
output_size: usize,
hidden_sizes: Vec<usize>,
) -> Self
pub fn new( _input_size: usize, output_size: usize, hidden_sizes: Vec<usize>, ) -> Self
Create new meta-policy network with hierarchical structure
Sourcepub fn meta_forward(
&mut self,
state_features: &ArrayView1<'_, f64>,
problem_class: &str,
meta_context: &Array1<f64>,
) -> (Array1<f64>, Array1<f64>)
pub fn meta_forward( &mut self, state_features: &ArrayView1<'_, f64>, problem_class: &str, meta_context: &Array1<f64>, ) -> (Array1<f64>, Array1<f64>)
Forward pass with meta-learning augmentation
Sourcepub fn meta_update(
&mut self,
meta_gradients: &MetaGradients,
base_learning_rate: f64,
meta_learning_rate: f64,
)
pub fn meta_update( &mut self, meta_gradients: &MetaGradients, base_learning_rate: f64, meta_learning_rate: f64, )
Update network using meta-gradients
Trait Implementations§
Source§impl Clone for MetaPolicyNetwork
impl Clone for MetaPolicyNetwork
Source§fn clone(&self) -> MetaPolicyNetwork
fn clone(&self) -> MetaPolicyNetwork
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreAuto Trait Implementations§
impl Freeze for MetaPolicyNetwork
impl RefUnwindSafe for MetaPolicyNetwork
impl Send for MetaPolicyNetwork
impl Sync for MetaPolicyNetwork
impl Unpin for MetaPolicyNetwork
impl UnwindSafe for MetaPolicyNetwork
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.