revonet
Library Listed Dormant
Rust implementation of real-coded genetic algorithm for solving optimization problems and training of neural networks. The latter is also known as neuroevolution.
- Downloads
- 9
- Dependents
- 0
- Stars
- 20
- Forks
- 4
- Contributors
- 1
- Commits
- 73
- Latest release
- 0.2.1 ·
About
Rust implementation of real-coded genetic algorithm for solving optimization problems and training of neural networks. The latter is also known as neuroevolution.
Features:
- real-coded Evolutionary Algorithm
- NeuroEvolutionary tuning of weights of Neural Network with fixed structure
- supports several feed-forward architectures

- automatically computes statistics for single and multiple runs for EA and NE
- EA settings and results can be saved to json
- allows defining user-specified objective functions for EA and NE (see examples below)
Read the full README
Examples
Real-coded genetic algorithm
let pop_size = 20u32; // population size.
let problem_dim = 10u32; // number of optimization parameters.
let problem = RosenbrockProblem{}; // objective function.
let gen_count = 10u32; // generations number.
let settings = GASettings::new(pop_size, gen_count, problem_dim);
let mut ga: GA<RosenbrockProblem> = GA::new(settings, &problem); // init GA.
let res = ga.run(settings).expect("Error during GA run"); // run and fetch the results.
// get and print results of the current run.
println!("\n\nGA results: {:?}", res);
// make multiple runs and get combined results.
let res = ga.run_multiple(settings, 10 as u32).expect("Error during multiple GA runs");
println!("\n\nResults of multple GA runs: {:?}", res);
Run evolution of NN weights to solve regression problem
let (pop_size, gen_count, param_count) = (20, 20, 100); // gene_count does not matter here as NN structure is defined by a problem.
let settings = EASettings::new(pop_size, gen_count, param_count);
let problem = SymbolicRegressionProblem::new_f();
let mut ne: NE<SymbolicRegressionProblem> = NE::new(&problem);
let res = ne.run(settings).expect("Error: NE result is empty");
println!("result: {:?}", res);
println!("\nbest individual: {:?}", res.best);
Creating multilayered neural network with 2 hidden layers with sigmoid activation and with linear output nodes.
const INPUT_SIZE: usize = 20;
const OUTPUT_SIZE: usize = 2;
let mut rng = rand::thread_rng(); // needed for weights initialization when NN is built.
let mut net: MultilayeredNetwork = MultilayeredNetwork::new(INPUT_SIZE, OUTPUT_SIZE);
net.add_hidden_layer(30 as usize, ActivationFunctionType::Sigmoid)
.add_hidden_layer(20 as usize, ActivationFunctionType::Sigmoid)
.build(&mut rng, NeuralArchitecture::Multilayered); // `build` finishes creation of neural network.
let (ws, bs) = net.get_weights(); // `ws` and `bs` are `Vec` arrays containing weights and biases for each layer.
assert!(ws.len() == 3); // number of elements equals to number of hidden layers + 1 output layer
assert!(bs.len() == 3); // number of elements equals to number of hidden layers + 1 output layer
Creating custom optimization problem for GA
// Dummy problem returning random fitness.
pub struct DummyProblem;
impl Problem for DummyProblem {
// Function to evaluate a specific individual.
fn compute<T: Individual>(&self, ind: &mut T) -> f32 {
// use `to_vec` to get real-coded representation of an individual.
let v = ind.to_vec().unwrap();
let mut rng: StdRng = StdRng::from_seed(&[0]);
rng.gen::<f32>()
}
}
Creating custom problem for NN evolution
// Dummy problem returning random fitness.
struct RandomNEProblem {}
impl RandomNEProblem {
fn new() -> RandomNEProblem {
RandomNEProblem{}
}
}
impl NeuroProblem for RandomNEProblem {
// return number of NN inputs.
fn get_inputs_num(&self) -> usize {1}
// return number of NN outputs.
fn get_outputs_num(&self) -> usize {1}
// return NN with random weights and a fixed structure. For now the structure should be the same all the time to make sure that crossover is possible. Likely to change in the future.
fn get_default_net(&self) -> MultilayeredNetwork {
let mut rng = rand::thread_rng();
let mut net: MultilayeredNetwork = MultilayeredNetwork::new(self.get_inputs_num(), self.get_outputs_num());
net.add_hidden_layer(5 as usize, ActivationFunctionType::Sigmoid)
.build(&mut rng, NeuralArchitecture::Multilayered);
net
}
// Function to evaluate performance of a given NN.
fn compute_with_net<T: NeuralNetwork>(&self, nn: &mut T) -> f32 {
let mut rng: StdRng = StdRng::from_seed(&[0]);
let mut input = (0..self.get_inputs_num())
.map(|_| rng.gen::<f32>())
.collect::<Vec<f32>>();
// compute NN output using random input.
let mut output = nn.compute(&input);
output[0]
}
}
Compatibility
- Runs on
- GPU support unknown
What shows it
- no dependency or feature matches a backend row
- Native code
- None found
- No native code found
- Python bindings
- No Python binding crate found
- License
- GPL-3.0
Compare with similar projects
Order: strongest tier first, then most downloads, then name, with unmeasured values last. A library counts downloads over 30 days. An app counts binary downloads per release. An app with none counts its crate downloads over 30 days. ML Rust runs this catalogue, so its closest project always gets a row.
| Project | Downloads | Dependents | Stars | Latest release | Runs on (GPU) | Native code | License |
|---|---|---|---|---|---|---|---|
|
Rust implementation of real-coded genetic algorithm for solving optimization problems and training of neural networks. The latter is also known as neuroevolution. |
9 downloads over 30 days | 0 | 20 | 0.2.1 | GPU support unknown | No native code found | GPL-3.0 |
|
A Rust implementation of the Leiden algorithm for community detection in large networks. Also in Tabular data and classic ML. |
1,765 downloads over 30 days | 1 | 1 | 0.1.0 | GPU support unknown | No native code found | MIT |
|
radiate Listed
A Rust library for genetic algorithms and artificial evolution. Python bindings Also in Tabular data and classic ML. |
971 downloads over 30 days | 0 | 257 | 1.3.2 | GPU support unknown | No native code found | MIT |
|
genevo provides building blocks to run simulations of optimization and search problems using genetic algorithms (GA). Execute genetic algorithm (GA) simulations in a customizable and extensible way. Also in Tabular data and classic ML. |
372 downloads over 30 days | 1 | 185 | 0.7.1 | GPU support unknown | No native code found | Apache-2.0 OR MIT |
|
Flexible, reusable reinforcement learning (Q learning) implementation Also in Train models. |
150 downloads over 30 days | 0 | 165 | 0.6.0 | GPU support unknown | No native code found | MPL-2.0 |
|
Open AI environments bindings for Rust Also in Train models. |
75 downloads over 30 days | 2 | 70 | 2.2.1 | GPU support unknown | No native code found | Apache-2.0 OR MIT |
|
treeboost Listed
Gradient-boosted decision trees for tabular data: trains a baseline model in one call, with full control over boosting modes and configs, and Scalar, AVX-512, SVE2, WGPU and CUDA backends. Python bindings Also in Tabular data and classic ML. |
18 downloads over 30 days | 0 | 9 | 0.1.2 | CUDA, WebGPU | No native code found | Apache-2.0 |
All projects in Tabular data and classic MLAll projects in Train models
Why ListedNo archive, New or Featured rule places it, so it is Listed.
What it lacks for Featured
- It has 0 active dependents and 0 new dependents in 365 days. Featured needs 11 active dependents or 9 new dependents in 365 days. The repository route reads 20 stars, 4 forks and 1 contributor. It needs 4,539 stars, 434 forks and 79 contributors together.
- The project is dormant and not finished. Dormancy rule
What else the check found
- The last activity is on 20 Aug 2017, 3368 days ago. That reaches the 365 days the rules expect, so the project is dormant. Dormancy rule
Not measured: Latest release fails cargo check.
Check notes
- the repo manifest Cargo.toml declares the crate, and no release commit proves the link
Exact rules: Listed, Featured library. The check on applied thresholds version 9.
Every rule outcome, as the check records it
expected-interval: version 0.2.1 base 300, capped at 3 releases = 150, raised to the 365-day floor: E = 365 daysdormancy: last activity 2017-08-20, 3368 days ago, E = 365: dormantfeatured: not featured: active_users 0 < 11 and new_adopters 0 < 9 and repository route stars 20 (needs 4539), forks 4 (needs 434), contributors 1 (needs 79); dormant and not stablelisted: listed: no archive, new or featured rule applies
Measurements and sources
Each signal row shows the raw value, its source and the fetch date. The Sources list gathers every distinct source on this page. Movement needs more history.
Sources6 sources
- Description: the crates.io description
- crates.io database dump, fetched
- RustSec advisory database, fetched
- GitHub repository, fetched
- repo manifest, fetched
- GitHub contributors, fetched
Adoption0 active dependents, 0 new dependents in 365 days1 not measured
| Signal | Value | Source | Fetched | Counts |
|---|---|---|---|---|
| Active dependents | 0 | crates.io database dump | Yes | |
| New dependents (365 days) | 0 | crates.io database dump | Yes | |
| Peak active dependents | 0 | crates.io database dump | Yes | |
| Active dependents as a share of the peak | 1 | crates.io database dump | Yes | |
| Binary downloads per release | Not measured | Yes |
MaintenanceLatest human commit: 9 years ago3 not measured
| Signal | Value | Source | Fetched | Counts |
|---|---|---|---|---|
| Latest human commit | 2017-08-20 | GitHub repository | Yes | |
| Latest release | 2017-08-20 | crates.io database dump | Yes | |
| First release | 2017-07-14 | crates.io database dump | Yes | |
| Latest version | 0.2.1 | crates.io database dump | Yes | |
| Days the oldest outside issue waits for a reply | 0 | GitHub repository | Yes | |
| Maintainer replies over 365 days | 0 | GitHub repository | Yes | |
| Repository archived | false | GitHub repository | Yes | |
| Repository gone | false | GitHub repository | Yes | |
| Release commit or manifest in the repo | true | repo manifest | Yes | |
| Published docs | true | crates.io database dump | Yes | |
| Latest release fails cargo check | Not measured | Yes | ||
| Build check date | Not measured | Yes | ||
| Build check toolchain | Not measured | Yes |
SecurityUnpatched vulnerabilities: none
| Signal | Value | Source | Fetched | Counts |
|---|---|---|---|---|
| Unpatched vulnerabilities past the grace window | none | RustSec advisory database | Yes | |
| RustSec unmaintained advisory | none | RustSec advisory database | Yes | |
| Deprecation notice | none | crates.io database dump | Yes | |
| Deprecated requirement | none | crates.io database dump | Yes |
Distribution3 releases, 9 downloads over 30 days5 not measured
| Signal | Value | Source | Fetched | Counts |
|---|---|---|---|---|
| Releases | 3 | crates.io database dump | Yes | |
| Downloads over 30 days | 9 | crates.io database dump | Yes | |
| Binary downloads over the last 3 releases | Not measured | Yes | ||
| Homebrew installs on request over 365 days | Not measured | Yes | ||
| Repology repository families | Not measured | Yes | ||
| Docker pull growth over 90 days | Not measured | Yes | ||
| Docker pulls at the growth baseline | Not measured | Yes | ||
| Every version a prerelease | false | crates.io database dump | Yes | |
| Every version 0.0.x | false | crates.io database dump | Yes | |
| Every version yanked | false | crates.io database dump | Yes | |
| Crate deleted from crates.io | false | crates.io database dump | Yes |
Repository20 stars, 4 forks, 1 contributors, 73 commits. Stars alone never qualify a project.
| Signal | Value | Source | Fetched | Counts |
|---|---|---|---|---|
| GitHub stars | 20 | GitHub repository | Yes — one part of the repository route | |
| GitHub forks | 4 | GitHub repository | Yes — one part of the repository route | |
| Contributors with a GitHub account | 1 | GitHub contributors | Yes — one part of the repository route | |
| Commits on the default branch | 73 | GitHub repository | No | |
| Repository's main crate left out of the entry | none | crates.io database dump | Yes |
Facts that never count
| Signal | Value | Source | Fetched | Counts |
|---|---|---|---|---|
| License | GPL-3.0 | crates.io database dump | No | |
| Runs on, from listed crates and their direct dependencies | GPU support unknown | crates.io database dump | No | |
| What shows each backend | no dependency or feature matches a backend row | crates.io database dump | No | |
| Native code, from listed crates and their dependencies | No native code found | crates.io database dump | No | |
| Python bindings, from direct dependencies of listed crates | No Python binding crate found | crates.io database dump | No | |
| Crates that depend on a listed crate directly | 0 | crates.io database dump | No |
Corrections and review history
No correction applies to this entry.
Judgments
A judgment enters only through an approved issue and a merged pull request.
No judgment applies to this entry.