Skip to main content

ProgressiveNetworks

Struct ProgressiveNetworks 

Source
pub struct ProgressiveNetworks<T: Float + Debug + Send + Sync + 'static> { /* private fields */ }
Expand description

Progressive Networks for continual learning.

Each new task gets its own column (set of layers). Previous columns are frozen and lateral connections from frozen columns feed into the new column, enabling knowledge transfer without forgetting.

Implementations§

Source§

impl<T: Float + Debug + Send + Sync + 'static> ProgressiveNetworks<T>

Source

pub fn new(hidden_sizes: Vec<usize>) -> Self

Create a new progressive network with the given hidden layer sizes.

No columns are created initially; call add_task_column for each task.

Source

pub fn add_task_column( &mut self, input_size: usize, output_size: usize, ) -> Result<usize>

Add a new column for a new task.

input_size - dimensionality of the input features. output_size - dimensionality of the output.

Returns the column index (task id). All previously existing columns are frozen.

Source

pub fn forward(&self, input: &Array1<T>, task_id: usize) -> Result<Array1<T>>

Forward pass through the network for a specific task.

For columns beyond the first, lateral connections from all previous columns are added at each hidden layer.

Source

pub fn forward_with_laterals( &self, input: &Array1<T>, task_id: usize, ) -> Result<(Array1<T>, Vec<Array1<T>>)>

Forward pass that also returns intermediate activations from all columns.

Returns (final_output, all_intermediate_activations) where all_intermediate_activations[col][layer] is the activation at that layer of that column.

Source

pub fn freeze_column(&mut self, column_id: usize) -> Result<()>

Freeze a specific column (mark as non-trainable).

Source

pub fn num_columns(&self) -> usize

Return the number of columns (one per task).

Source

pub fn get_column_parameters( &self, column_id: usize, ) -> Result<&NetworkColumn<T>>

Get a reference to a specific column’s parameters.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V