DeepBoltzmannMachine

Struct DeepBoltzmannMachine 

Source
pub struct DeepBoltzmannMachine { /* private fields */ }
Expand description

Deep Boltzmann Machine with multiple layers

Implementations§

Source§

impl DeepBoltzmannMachine

Source

pub fn new( layer_sizes: Vec<usize>, temperature: f64, learning_rate: f64, ) -> Result<Self>

Create a new Deep Boltzmann Machine

Examples found in repository?
examples/quantum_boltzmann.rs (lines 130-134)
127fn deep_boltzmann_demo() -> Result<()> {
128    // Create a 3-layer DBM
129    let layer_sizes = vec![8, 4, 2];
130    let mut dbm = DeepBoltzmannMachine::new(
131        layer_sizes.clone(),
132        1.0,  // temperature
133        0.01, // learning rate
134    )?;
135
136    println!("   Created Deep Boltzmann Machine:");
137    println!("   - Architecture: {:?}", layer_sizes);
138    println!("   - Total layers: {}", dbm.rbms().len());
139
140    // Generate hierarchical data
141    let data = generate_hierarchical_data(300, 8);
142
143    // Layer-wise pretraining
144    println!("\n   Performing layer-wise pretraining...");
145    dbm.pretrain(
146        &data, 50, // epochs per layer
147        30, // batch size
148    )?;
149
150    println!("\n   Pretraining complete!");
151    println!("   Each layer learned increasingly abstract features");
152
153    Ok(())
154}
Source

pub fn pretrain( &mut self, data: &Array2<f64>, epochs_per_layer: usize, batch_size: usize, ) -> Result<()>

Layer-wise pretraining

Examples found in repository?
examples/quantum_boltzmann.rs (lines 145-148)
127fn deep_boltzmann_demo() -> Result<()> {
128    // Create a 3-layer DBM
129    let layer_sizes = vec![8, 4, 2];
130    let mut dbm = DeepBoltzmannMachine::new(
131        layer_sizes.clone(),
132        1.0,  // temperature
133        0.01, // learning rate
134    )?;
135
136    println!("   Created Deep Boltzmann Machine:");
137    println!("   - Architecture: {:?}", layer_sizes);
138    println!("   - Total layers: {}", dbm.rbms().len());
139
140    // Generate hierarchical data
141    let data = generate_hierarchical_data(300, 8);
142
143    // Layer-wise pretraining
144    println!("\n   Performing layer-wise pretraining...");
145    dbm.pretrain(
146        &data, 50, // epochs per layer
147        30, // batch size
148    )?;
149
150    println!("\n   Pretraining complete!");
151    println!("   Each layer learned increasingly abstract features");
152
153    Ok(())
154}
Source

pub fn rbms(&self) -> &[QuantumRBM]

Get the RBMs

Examples found in repository?
examples/quantum_boltzmann.rs (line 138)
127fn deep_boltzmann_demo() -> Result<()> {
128    // Create a 3-layer DBM
129    let layer_sizes = vec![8, 4, 2];
130    let mut dbm = DeepBoltzmannMachine::new(
131        layer_sizes.clone(),
132        1.0,  // temperature
133        0.01, // learning rate
134    )?;
135
136    println!("   Created Deep Boltzmann Machine:");
137    println!("   - Architecture: {:?}", layer_sizes);
138    println!("   - Total layers: {}", dbm.rbms().len());
139
140    // Generate hierarchical data
141    let data = generate_hierarchical_data(300, 8);
142
143    // Layer-wise pretraining
144    println!("\n   Performing layer-wise pretraining...");
145    dbm.pretrain(
146        &data, 50, // epochs per layer
147        30, // batch size
148    )?;
149
150    println!("\n   Pretraining complete!");
151    println!("   Each layer learned increasingly abstract features");
152
153    Ok(())
154}

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<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

Source§

impl<T> Ungil for T
where T: Send,