rustorch 0.6.29

Production-ready PyTorch-compatible deep learning library in Rust with special mathematical functions (gamma, Bessel, error functions), statistical distributions, Fourier transforms (FFT/RFFT), matrix decomposition (SVD/QR/LU/eigenvalue), automatic differentiation, neural networks, computer vision transforms, complete GPU acceleration (CUDA/Metal/OpenCL), SIMD optimizations, parallel processing, WebAssembly browser support, comprehensive distributed learning support, and performance validation
Documentation
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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
//! Enhanced optimizers for WebAssembly  
//! WebAssembly向け強化最適化アルゴリズム

use crate::optim::*;
use std::collections::HashMap;
use wasm_bindgen::prelude::*;

// WASM-compatible optimizer implementations / WASM互換最適化実装

/// Legacy WASM SGD optimizer (f32 interface for compatibility)
/// 互換性のための従来のWASM SGDオプティマイザ(f32インタフェース)
#[wasm_bindgen]
pub struct WasmSGD {
    learning_rate: f32,
    momentum: f32,
    weight_decay: f32,
    nesterov: bool,
    momentum_buffers: HashMap<String, Vec<f32>>,
}

#[wasm_bindgen]
impl WasmSGD {
    /// Create new SGD optimizer
    #[wasm_bindgen(constructor)]
    pub fn new(learning_rate: f32) -> Self {
        Self {
            learning_rate,
            momentum: 0.0,
            weight_decay: 0.0,
            nesterov: false,
            momentum_buffers: HashMap::new(),
        }
    }

    /// Create SGD with momentum
    #[wasm_bindgen]
    pub fn with_momentum(learning_rate: f32, momentum: f32) -> WasmSGD {
        Self {
            learning_rate,
            momentum,
            weight_decay: 0.0,
            nesterov: false,
            momentum_buffers: HashMap::new(),
        }
    }

    /// Update parameters - legacy f32 interface
    #[wasm_bindgen]
    pub fn step(&mut self, param_id: &str, parameters: Vec<f32>, gradients: Vec<f32>) -> Vec<f32> {
        if parameters.len() != gradients.len() {
            return parameters; // Return original params on error
        }

        // Convert to f64 for enhanced optimizer
        let params_f64: Vec<f64> = parameters.iter().map(|&x| x as f64).collect();
        let grads_f64: Vec<f64> = gradients.iter().map(|&x| x as f64).collect();

        // Use enhanced SGD implementation (would need to be implemented)
        // For now, use simple SGD logic
        let mut updated_params = params_f64;
        for (i, grad) in grads_f64.iter().enumerate() {
            updated_params[i] -= self.learning_rate as f64 * grad;
        }

        // Convert back to f32
        updated_params.iter().map(|&x| x as f32).collect()
    }

    /// Get learning rate
    #[wasm_bindgen]
    pub fn get_learning_rate(&self) -> f32 {
        self.learning_rate
    }

    /// Set learning rate
    #[wasm_bindgen]
    pub fn set_learning_rate(&mut self, lr: f32) {
        self.learning_rate = lr;
    }
}

/// Enhanced SGD optimizer with f64 precision
/// f64精度を持つ強化SGDオプティマイザ
#[wasm_bindgen]
pub struct SGDWasm {
    learning_rate: f64,
    momentum: f64,
    dampening: f64,
    weight_decay: f64,
    nesterov: bool,
    velocity: HashMap<String, Vec<f64>>,
}

#[wasm_bindgen]
impl SGDWasm {
    #[wasm_bindgen(constructor)]
    pub fn new(
        learning_rate: f64,
        momentum: f64,
        dampening: f64,
        weight_decay: f64,
        nesterov: bool,
    ) -> SGDWasm {
        SGDWasm {
            learning_rate,
            momentum,
            dampening,
            weight_decay,
            nesterov,
            velocity: HashMap::new(),
        }
    }

    #[wasm_bindgen]
    pub fn step(&mut self, param_name: &str, params: &mut [f64], gradients: &[f64]) {
        if params.len() != gradients.len() {
            return;
        }

        // Get or initialize velocity
        let velocity = self
            .velocity
            .entry(param_name.to_string())
            .or_insert_with(|| vec![0.0; params.len()]);

        for i in 0..params.len() {
            let mut grad = gradients[i];

            // Apply weight decay
            if self.weight_decay != 0.0 {
                grad += self.weight_decay * params[i];
            }

            // Apply momentum
            if self.momentum != 0.0 {
                velocity[i] = self.momentum * velocity[i] + (1.0 - self.dampening) * grad;

                if self.nesterov {
                    grad = grad + self.momentum * velocity[i];
                } else {
                    grad = velocity[i];
                }
            }

            // Update parameter
            params[i] -= self.learning_rate * grad;
        }
    }

    #[wasm_bindgen]
    pub fn get_learning_rate(&self) -> f64 {
        self.learning_rate
    }

    #[wasm_bindgen]
    pub fn set_learning_rate(&mut self, lr: f64) {
        self.learning_rate = lr;
    }

    #[wasm_bindgen]
    pub fn reset_state(&mut self) {
        self.velocity.clear();
    }
}

#[wasm_bindgen]
pub struct AdamWasm {
    learning_rate: f64,
    beta1: f64,
    beta2: f64,
    epsilon: f64,
    weight_decay: f64,
    step_count: u64,
    m: HashMap<String, Vec<f64>>, // First moment
    v: HashMap<String, Vec<f64>>, // Second moment
}

#[wasm_bindgen]
impl AdamWasm {
    #[wasm_bindgen(constructor)]
    pub fn new(
        learning_rate: f64,
        beta1: f64,
        beta2: f64,
        epsilon: f64,
        weight_decay: f64,
    ) -> AdamWasm {
        AdamWasm {
            learning_rate,
            beta1,
            beta2,
            epsilon,
            weight_decay,
            step_count: 0,
            m: HashMap::new(),
            v: HashMap::new(),
        }
    }

    #[wasm_bindgen]
    pub fn step(&mut self, param_name: &str, params: &mut [f64], gradients: &[f64]) {
        if params.len() != gradients.len() {
            return;
        }

        self.step_count += 1;

        // Get or initialize moments
        let m = self
            .m
            .entry(param_name.to_string())
            .or_insert_with(|| vec![0.0; params.len()]);
        let v = self
            .v
            .entry(param_name.to_string())
            .or_insert_with(|| vec![0.0; params.len()]);

        for i in 0..params.len() {
            let mut grad = gradients[i];

            // Apply weight decay
            if self.weight_decay != 0.0 {
                grad += self.weight_decay * params[i];
            }

            // Update biased first moment estimate
            m[i] = self.beta1 * m[i] + (1.0 - self.beta1) * grad;

            // Update biased second raw moment estimate
            v[i] = self.beta2 * v[i] + (1.0 - self.beta2) * grad * grad;

            // Compute bias-corrected first moment estimate
            let m_hat = m[i] / (1.0 - self.beta1.powi(self.step_count as i32));

            // Compute bias-corrected second raw moment estimate
            let v_hat = v[i] / (1.0 - self.beta2.powi(self.step_count as i32));

            // Update parameter
            params[i] -= self.learning_rate * m_hat / (v_hat.sqrt() + self.epsilon);
        }
    }

    #[wasm_bindgen]
    pub fn get_learning_rate(&self) -> f64 {
        self.learning_rate
    }

    #[wasm_bindgen]
    pub fn set_learning_rate(&mut self, lr: f64) {
        self.learning_rate = lr;
    }

    #[wasm_bindgen]
    pub fn get_step_count(&self) -> u64 {
        self.step_count
    }

    #[wasm_bindgen]
    pub fn reset_state(&mut self) {
        self.step_count = 0;
        self.m.clear();
        self.v.clear();
    }
}

#[wasm_bindgen]
pub struct RMSpropWasm {
    learning_rate: f64,
    alpha: f64,
    epsilon: f64,
    weight_decay: f64,
    momentum: f64,
    v: HashMap<String, Vec<f64>>, // Moving average of squared gradients
    momentum_buffer: HashMap<String, Vec<f64>>,
}

#[wasm_bindgen]
impl RMSpropWasm {
    #[wasm_bindgen(constructor)]
    pub fn new(
        learning_rate: f64,
        alpha: f64,
        epsilon: f64,
        weight_decay: f64,
        momentum: f64,
    ) -> RMSpropWasm {
        RMSpropWasm {
            learning_rate,
            alpha,
            epsilon,
            weight_decay,
            momentum,
            v: HashMap::new(),
            momentum_buffer: HashMap::new(),
        }
    }

    #[wasm_bindgen]
    pub fn step(&mut self, param_name: &str, params: &mut [f64], gradients: &[f64]) {
        if params.len() != gradients.len() {
            return;
        }

        // Get or initialize state
        let v = self
            .v
            .entry(param_name.to_string())
            .or_insert_with(|| vec![0.0; params.len()]);
        let momentum_buffer = self
            .momentum_buffer
            .entry(param_name.to_string())
            .or_insert_with(|| vec![0.0; params.len()]);

        for i in 0..params.len() {
            let mut grad = gradients[i];

            // Apply weight decay
            if self.weight_decay != 0.0 {
                grad += self.weight_decay * params[i];
            }

            // Update exponential moving average of squared gradients
            v[i] = self.alpha * v[i] + (1.0 - self.alpha) * grad * grad;

            let update = if self.momentum > 0.0 {
                momentum_buffer[i] =
                    self.momentum * momentum_buffer[i] + grad / (v[i].sqrt() + self.epsilon);
                momentum_buffer[i]
            } else {
                grad / (v[i].sqrt() + self.epsilon)
            };

            // Update parameter
            params[i] -= self.learning_rate * update;
        }
    }

    #[wasm_bindgen]
    pub fn get_learning_rate(&self) -> f64 {
        self.learning_rate
    }

    #[wasm_bindgen]
    pub fn set_learning_rate(&mut self, lr: f64) {
        self.learning_rate = lr;
    }

    #[wasm_bindgen]
    pub fn reset_state(&mut self) {
        self.v.clear();
        self.momentum_buffer.clear();
    }
}

#[wasm_bindgen]
pub struct AdaGradWasm {
    learning_rate: f64,
    epsilon: f64,
    weight_decay: f64,
    sum_sq_gradients: HashMap<String, Vec<f64>>,
}

#[wasm_bindgen]
impl AdaGradWasm {
    #[wasm_bindgen(constructor)]
    pub fn new(learning_rate: f64, epsilon: f64, weight_decay: f64) -> AdaGradWasm {
        AdaGradWasm {
            learning_rate,
            epsilon,
            weight_decay,
            sum_sq_gradients: HashMap::new(),
        }
    }

    #[wasm_bindgen]
    pub fn step(&mut self, param_name: &str, params: &mut [f64], gradients: &[f64]) {
        if params.len() != gradients.len() {
            return;
        }

        // Get or initialize accumulated squared gradients
        let sum_sq = self
            .sum_sq_gradients
            .entry(param_name.to_string())
            .or_insert_with(|| vec![0.0; params.len()]);

        for i in 0..params.len() {
            let mut grad = gradients[i];

            // Apply weight decay
            if self.weight_decay != 0.0 {
                grad += self.weight_decay * params[i];
            }

            // Accumulate squared gradients
            sum_sq[i] += grad * grad;

            // Update parameter
            params[i] -= self.learning_rate * grad / (sum_sq[i].sqrt() + self.epsilon);
        }
    }

    #[wasm_bindgen]
    pub fn get_learning_rate(&self) -> f64 {
        self.learning_rate
    }

    #[wasm_bindgen]
    pub fn set_learning_rate(&mut self, lr: f64) {
        self.learning_rate = lr;
    }

    #[wasm_bindgen]
    pub fn reset_state(&mut self) {
        self.sum_sq_gradients.clear();
    }
}

// Optimizer utility functions / 最適化ユーティリティ関数
#[wasm_bindgen]
pub fn learning_rate_schedule_wasm(
    initial_lr: f64,
    step: u64,
    decay_rate: f64,
    decay_steps: u64,
) -> f64 {
    initial_lr * decay_rate.powi((step / decay_steps) as i32)
}

#[wasm_bindgen]
pub fn cosine_annealing_wasm(initial_lr: f64, current_step: u64, total_steps: u64) -> f64 {
    let min_lr = initial_lr * 0.01;
    min_lr
        + (initial_lr - min_lr)
            * 0.5
            * (1.0 + ((current_step as f64 * std::f64::consts::PI) / total_steps as f64).cos())
}