1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
use crate::primitives::Vector;
use super::Adam;
use crate::optim::Optimizer;
impl Adam {
/// Creates a new Adam optimizer with the given learning rate and default hyperparameters.
///
/// Default values:
/// - beta1 = 0.9
/// - beta2 = 0.999
/// - epsilon = 1e-8
///
/// # Arguments
///
/// * `learning_rate` - Step size (typical values: 0.001, 0.0001)
///
/// # Example
///
/// ```
/// use aprender::optim::Adam;
///
/// let optimizer = Adam::new(0.001);
/// assert!((optimizer.learning_rate() - 0.001).abs() < 1e-9);
/// ```
#[must_use]
pub fn new(learning_rate: f32) -> Self {
Self {
learning_rate,
beta1: 0.9,
beta2: 0.999,
epsilon: 1e-8,
m: None,
v: None,
t: 0,
}
}
/// Sets the beta1 parameter (exponential decay rate for first moment).
///
/// # Arguments
///
/// * `beta1` - Value between 0.0 and 1.0 (typical: 0.9)
///
/// # Example
///
/// ```
/// use aprender::optim::Adam;
///
/// let optimizer = Adam::new(0.001).with_beta1(0.95);
/// assert!((optimizer.beta1() - 0.95).abs() < 1e-9);
/// ```
#[must_use]
pub fn with_beta1(mut self, beta1: f32) -> Self {
self.beta1 = beta1;
self
}
/// Sets the beta2 parameter (exponential decay rate for second moment).
///
/// # Arguments
///
/// * `beta2` - Value between 0.0 and 1.0 (typical: 0.999)
///
/// # Example
///
/// ```
/// use aprender::optim::Adam;
///
/// let optimizer = Adam::new(0.001).with_beta2(0.9999);
/// assert!((optimizer.beta2() - 0.9999).abs() < 1e-9);
/// ```
#[must_use]
pub fn with_beta2(mut self, beta2: f32) -> Self {
self.beta2 = beta2;
self
}
/// Sets the epsilon parameter (numerical stability constant).
///
/// # Arguments
///
/// * `epsilon` - Small positive value (typical: 1e-8)
///
/// # Example
///
/// ```
/// use aprender::optim::Adam;
///
/// let optimizer = Adam::new(0.001).with_epsilon(1e-7);
/// assert!((optimizer.epsilon() - 1e-7).abs() < 1e-15);
/// ```
#[must_use]
pub fn with_epsilon(mut self, epsilon: f32) -> Self {
self.epsilon = epsilon;
self
}
/// Returns the learning rate.
#[must_use]
pub fn learning_rate(&self) -> f32 {
self.learning_rate
}
/// Returns the beta1 parameter.
#[must_use]
pub fn beta1(&self) -> f32 {
self.beta1
}
/// Returns the beta2 parameter.
#[must_use]
pub fn beta2(&self) -> f32 {
self.beta2
}
/// Returns the epsilon parameter.
#[must_use]
pub fn epsilon(&self) -> f32 {
self.epsilon
}
/// Returns the number of steps taken.
#[must_use]
pub fn steps(&self) -> usize {
self.t
}
/// Updates parameters using gradients with adaptive learning rates.
///
/// # Arguments
///
/// * `params` - Mutable reference to parameter vector
/// * `gradients` - Gradient vector (same length as params)
///
/// # Panics
///
/// Panics if params and gradients have different lengths.
///
/// # Example
///
/// ```
/// use aprender::optim::Adam;
/// use aprender::primitives::Vector;
///
/// let mut optimizer = Adam::new(0.001);
/// let mut params = Vector::from_slice(&[1.0, 2.0]);
/// let gradients = Vector::from_slice(&[0.1, 0.2]);
///
/// optimizer.step(&mut params, &gradients);
/// ```
pub fn step(&mut self, params: &mut Vector<f32>, gradients: &Vector<f32>) {
assert_eq!(
params.len(),
gradients.len(),
"Parameters and gradients must have same length"
);
let n = params.len();
// Initialize moment estimates if needed
if self.m.is_none()
|| self
.m
.as_ref()
.expect("First moment estimate must be initialized")
.len()
!= n
{
self.m = Some(vec![0.0; n]);
self.v = Some(vec![0.0; n]);
self.t = 0;
}
self.t += 1;
let t = self.t as f32;
let m = self.m.as_mut().expect("First moment was just initialized");
let v = self.v.as_mut().expect("Second moment was just initialized");
// Compute bias-corrected learning rate
let lr_t =
self.learning_rate * (1.0 - self.beta2.powf(t)).sqrt() / (1.0 - self.beta1.powf(t));
for i in 0..n {
let g = gradients[i];
// Update biased first moment estimate
m[i] = self.beta1 * m[i] + (1.0 - self.beta1) * g;
// Update biased second raw moment estimate
v[i] = self.beta2 * v[i] + (1.0 - self.beta2) * g * g;
// Update parameters
params[i] -= lr_t * m[i] / (v[i].sqrt() + self.epsilon);
}
}
/// Resets the optimizer state (moment estimates and step counter).
///
/// Call this when starting training on a new model or after significant
/// changes to the optimization problem.
///
/// # Example
///
/// ```
/// use aprender::optim::Adam;
/// use aprender::primitives::Vector;
///
/// let mut optimizer = Adam::new(0.001);
/// let mut params = Vector::from_slice(&[1.0]);
/// let gradients = Vector::from_slice(&[1.0]);
///
/// optimizer.step(&mut params, &gradients);
/// assert_eq!(optimizer.steps(), 1);
///
/// optimizer.reset();
/// assert_eq!(optimizer.steps(), 0);
/// ```
pub fn reset(&mut self) {
self.m = None;
self.v = None;
self.t = 0;
}
}
impl Optimizer for Adam {
fn step(&mut self, params: &mut Vector<f32>, gradients: &Vector<f32>) {
self.step(params, gradients);
}
fn reset(&mut self) {
self.reset();
}
}