lluni/rust-nn
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Optimized activation functions

Browse source
This commit is contained in:
lluni 2023-02-04 19:15:00 +01:00
parent f2d3d00ce6
commit a02110f2db
Signed by: lluni
GPG key ID: ACEEB468BC325D35
1 changed files with 8 additions and 24 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

32
src/functions/activation_functions.rs
View file

@ -42,64 +42,48 @@ fn sigmoid(x: f64) -> f64 {
pub fn logistic(matrix: &Array1<f64>) -> Array1<f64> { pub fn logistic(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(sigmoid);
*x = sigmoid(*x);
}
result result
} }
pub fn logistic_prime(matrix: &Array1<f64>) -> Array1<f64> { pub fn logistic_prime(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(|x| sigmoid(x * (1.0 - sigmoid(x))));
*x = sigmoid(*x * (1.0 - sigmoid(*x)));
}
result result
} }
pub fn tanh(matrix: &Array1<f64>) -> Array1<f64> { pub fn tanh(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(|x| x.tanh());
*x = (*x).tanh();
}
result result
} }
pub fn tanh_prime(matrix: &Array1<f64>) -> Array1<f64> { pub fn tanh_prime(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(|x| 1.0 - x.tanh().pow(2));
*x = 1.0 - (*x).tanh().pow(2);
}
result result
} }
pub fn relu(matrix: &Array1<f64>) -> Array1<f64> { pub fn relu(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(|x| x.max(0.0));
*x = (*x).max(0.0);
}
result result
} }
pub fn relu_prime(matrix: &Array1<f64>) -> Array1<f64> { pub fn relu_prime(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(|x| if x <= 0.0 { 0.0 } else { 1.0 });
*x = if (*x) <= 0.0 { 0.0 } else { 1.0 };
}
result result
} }
pub fn leaky_relu(matrix: &Array1<f64>) -> Array1<f64> { pub fn leaky_relu(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(|x| x.max(0.001 * x));
*x = (*x).max(0.001 * (*x));
}
result result
} }
pub fn leaky_relu_prime(matrix: &Array1<f64>) -> Array1<f64> { pub fn leaky_relu_prime(matrix: &Array1<f64>) -> Array1<f64> {
let mut result = matrix.clone(); let mut result = matrix.clone();
for x in result.iter_mut() { result.mapv_inplace(|x| if x <= 0.0 { 0.001 } else { 1.0 });
*x = if (*x) <= 0.0 { 0.001 } else { 1.0 };
}
result result
} }