pub struct EvolutionaryNAS {
pub population: Arc<RwLock<Vec<ArchitectureCandidate>>>,
/* private fields */
}Expand description
Evolutionary Neural Architecture Search Engine
Fields§
§population: Arc<RwLock<Vec<ArchitectureCandidate>>>Implementations§
Source§impl EvolutionaryNAS
impl EvolutionaryNAS
Sourcepub fn new(config: EvolutionaryConfig) -> Result<Self>
pub fn new(config: EvolutionaryConfig) -> Result<Self>
Create a new evolutionary NAS engine
Sourcepub async fn initialize_population(&mut self) -> Result<()>
pub async fn initialize_population(&mut self) -> Result<()>
Initialize the population with random architectures
Sourcepub async fn evolve(&mut self) -> Result<ArchitectureCandidate>
pub async fn evolve(&mut self) -> Result<ArchitectureCandidate>
Run the evolutionary optimization process
Sourcepub fn get_evolution_statistics(&self) -> &[GenerationStatistics]
pub fn get_evolution_statistics(&self) -> &[GenerationStatistics]
Get evolution statistics
Sourcepub async fn export_best_architectures(
&self,
count: usize,
) -> Result<Vec<ArchitectureCandidate>>
pub async fn export_best_architectures( &self, count: usize, ) -> Result<Vec<ArchitectureCandidate>>
Export the best architectures
Auto Trait Implementations§
impl !RefUnwindSafe for EvolutionaryNAS
impl !UnwindSafe for EvolutionaryNAS
impl Freeze for EvolutionaryNAS
impl Send for EvolutionaryNAS
impl Sync for EvolutionaryNAS
impl Unpin for EvolutionaryNAS
impl UnsafeUnpin for EvolutionaryNAS
Blanket Implementations§
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
impl<T> ErasedDestructor for Twhere
T: 'static,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.