aprender-core 0.29.1

Next-generation machine learning library in pure Rust
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
438
439
440
441
442
443
444

    #[test]
    fn test_linear_curriculum_basic() {
        let mut curriculum = LinearCurriculum::new(10);

        assert_eq!(curriculum.stage(), 0.0);
        assert!(!curriculum.is_complete());

        curriculum.advance();
        assert!((curriculum.stage() - 0.1).abs() < 0.01);

        // Advance to completion
        for _ in 0..15 {
            curriculum.advance();
        }

        assert!(curriculum.is_complete());
        assert!((curriculum.stage() - 1.0).abs() < 0.01);
    }

    #[test]
    fn test_linear_curriculum_threshold() {
        let curriculum = LinearCurriculum::new(10).with_difficulty_range(0.2, 0.8);

        // At stage 0, threshold should be 0.2
        assert!((curriculum.current_threshold() - 0.2).abs() < 0.01);
    }

    #[test]
    fn test_linear_curriculum_reset() {
        let mut curriculum = LinearCurriculum::new(10);

        curriculum.advance();
        curriculum.advance();
        curriculum.reset();

        assert_eq!(curriculum.stage(), 0.0);
    }

    #[test]
    fn test_exponential_curriculum() {
        let mut curriculum = ExponentialCurriculum::new(0.3);

        assert_eq!(curriculum.stage(), 0.0);

        curriculum.advance();
        let stage1 = curriculum.stage();

        curriculum.advance();
        let stage2 = curriculum.stage();

        // Should grow exponentially
        assert!(stage1 > 0.0);
        assert!(stage2 > stage1);
        assert!(stage2 < 1.0);
    }

    #[test]
    fn test_exponential_curriculum_completion() {
        let mut curriculum = ExponentialCurriculum::new(0.5);

        for _ in 0..50 {
            curriculum.advance();
        }

        assert!(curriculum.is_complete());
    }

    #[test]
    fn test_self_paced_curriculum_basic() {
        let mut curriculum = SelfPacedCurriculum::new(0.25, 1.5);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.1),
            ScoredSample::new(vec![2.0], 2.0, 0.2),
            ScoredSample::new(vec![3.0], 3.0, 0.5),
            ScoredSample::new(vec![4.0], 4.0, 0.8),
        ];

        curriculum.add_samples(samples);

        // With threshold 0.25, only first two samples (0.1, 0.2) should be eligible
        let initial = curriculum.n_eligible();
        assert!(
            initial >= 1 && initial <= 2,
            "Expected 1-2 eligible, got {}",
            initial
        );

        // Advance threshold (0.25 * 1.5 = 0.375)
        curriculum.advance();
        // Now samples with difficulty <= 0.375 should be eligible
        let after_advance = curriculum.n_eligible();
        assert!(
            after_advance >= initial,
            "Should have more eligible after advance"
        );
    }

    #[test]
    fn test_self_paced_curriculum_next_batch() {
        let mut curriculum = SelfPacedCurriculum::new(1.0, 1.5);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.1),
            ScoredSample::new(vec![2.0], 2.0, 0.2),
            ScoredSample::new(vec![3.0], 3.0, 0.3),
        ];

        curriculum.add_samples(samples);

        let batch1 = curriculum.next_batch(2);
        assert_eq!(batch1.len(), 2);

        let batch2 = curriculum.next_batch(2);
        assert_eq!(batch2.len(), 1); // Only one left
    }

    #[test]
    fn test_self_paced_curriculum_update_difficulties() {
        let mut curriculum = SelfPacedCurriculum::new(0.5, 1.5);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.1),
            ScoredSample::new(vec![2.0], 2.0, 0.2),
        ];

        curriculum.add_samples(samples);

        // Update with new difficulty function
        curriculum.update_difficulties(|_features, target| target * 0.1);

        // Check difficulties were updated
        let eligible = curriculum.eligible_samples();
        assert!(eligible[0].difficulty <= eligible.get(1).map_or(f64::MAX, |s| s.difficulty));
    }

    #[test]
    fn test_loss_difficulty_scorer() {
        let mut scorer = LossDifficultyScorer::new();
        scorer.fit(&[1.0, 2.0, 3.0, 4.0, 5.0]); // mean = 3.0

        // Sample at mean should have low difficulty
        let diff_at_mean = scorer.score(&[0.0], 3.0);
        // Sample far from mean should have high difficulty
        let diff_far = scorer.score(&[0.0], 10.0);

        assert!(diff_at_mean < diff_far);
    }

    #[test]
    fn test_feature_norm_scorer() {
        let scorer = FeatureNormScorer::new();

        // Small feature vector
        let small = scorer.score(&[1.0, 0.0], 0.0);
        // Large feature vector
        let large = scorer.score(&[3.0, 4.0], 0.0);

        assert!(small < large);
        assert!((large - 5.0).abs() < 0.01); // sqrt(9 + 16) = 5
    }

    #[test]
    fn test_curriculum_trainer_basic() {
        let scheduler = LinearCurriculum::new(5);
        let mut trainer = CurriculumTrainer::new(scheduler);

        let features = vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0];
        let targets = vec![1.0, 2.0, 3.0];
        let scorer = FeatureNormScorer::new();

        trainer
            .add_samples(&features, &targets, 2, &scorer)
            .unwrap();

        assert_eq!(trainer.stage(), 0.0);
        assert!(!trainer.is_complete());
    }

    #[test]
    fn test_curriculum_trainer_eligible_samples() {
        let scheduler = LinearCurriculum::new(2);
        let mut trainer = CurriculumTrainer::new(scheduler);

        // Features with varying norms
        let features = vec![
            1.0, 0.0, // norm = 1
            3.0, 4.0, // norm = 5
            0.5, 0.0, // norm = 0.5
        ];
        let targets = vec![1.0, 2.0, 3.0];
        let scorer = FeatureNormScorer::new();

        trainer
            .add_samples(&features, &targets, 2, &scorer)
            .unwrap();

        // At stage 0, only easiest samples
        let eligible = trainer.n_eligible();
        assert!(eligible > 0);
        assert!(eligible <= 3);

        // Advance and check more are eligible
        trainer.advance();
        let eligible_after = trainer.n_eligible();
        assert!(eligible_after >= eligible);
    }

    #[test]
    fn test_curriculum_trainer_dimension_mismatch() {
        let scheduler = LinearCurriculum::new(5);
        let mut trainer = CurriculumTrainer::new(scheduler);

        let features = vec![1.0, 2.0, 3.0]; // 3 features, doesn't divide by 2
        let targets = vec![1.0];
        let scorer = FeatureNormScorer::new();

        let result = trainer.add_samples(&features, &targets, 2, &scorer);
        assert!(result.is_err());
    }

    #[test]
    fn test_curriculum_trainer_target_mismatch() {
        let scheduler = LinearCurriculum::new(5);
        let mut trainer = CurriculumTrainer::new(scheduler);

        let features = vec![1.0, 2.0, 3.0, 4.0]; // 2 samples
        let targets = vec![1.0, 2.0, 3.0]; // 3 targets (mismatch!)
        let scorer = FeatureNormScorer::new();

        let result = trainer.add_samples(&features, &targets, 2, &scorer);
        assert!(result.is_err());
    }

    #[test]
    fn test_scored_sample_creation() {
        let sample = ScoredSample::new(vec![1.0, 2.0], 3.0, 0.5);

        assert_eq!(sample.features, vec![1.0, 2.0]);
        assert_eq!(sample.target, 3.0);
        assert_eq!(sample.difficulty, 0.5);
    }

    #[test]
    fn test_linear_curriculum_default() {
        let curriculum = LinearCurriculum::default();
        assert_eq!(curriculum.stage(), 0.0);
    }

    #[test]
    fn test_exponential_curriculum_default() {
        let curriculum = ExponentialCurriculum::default();
        assert_eq!(curriculum.stage(), 0.0);
    }

    #[test]
    fn test_self_paced_max_threshold() {
        let mut curriculum = SelfPacedCurriculum::new(0.1, 2.0).with_max_threshold(0.5);

        // Advance many times
        for _ in 0..10 {
            curriculum.advance();
        }

        assert!(curriculum.threshold() <= 0.5);
    }

    #[test]
    fn test_self_paced_empty() {
        let curriculum = SelfPacedCurriculum::new(0.5, 1.5);

        // Empty curriculum should be "complete"
        assert!(curriculum.is_complete());
        assert_eq!(curriculum.stage(), 1.0);
    }

    #[test]
    fn test_linear_curriculum_zero_stages() {
        let mut curriculum = LinearCurriculum::new(0);
        // step_size should be 1.0 when n_stages is 0
        assert_eq!(curriculum.stage(), 0.0);

        curriculum.advance();
        // After one advance with step_size 1.0, should be complete
        assert!(curriculum.is_complete());
        assert!((curriculum.stage() - 1.0).abs() < 1e-10);
    }

    #[test]
    fn test_exponential_curriculum_reset() {
        let mut curriculum = ExponentialCurriculum::new(0.3);

        // Advance several times
        for _ in 0..5 {
            curriculum.advance();
        }
        assert!(curriculum.stage() > 0.0);

        // Reset should bring back to 0
        curriculum.reset();
        assert_eq!(curriculum.stage(), 0.0);
        assert!(!curriculum.is_complete());
    }

    #[test]
    fn test_exponential_curriculum_threshold() {
        let mut curriculum = ExponentialCurriculum::new(0.3);

        // Threshold equals stage for exponential curriculum
        curriculum.advance();
        assert!((curriculum.current_threshold() - curriculum.stage()).abs() < 1e-10);
    }

    #[test]
    fn test_self_paced_curriculum_reset() {
        let mut curriculum = SelfPacedCurriculum::new(0.1, 2.0);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.05),
            ScoredSample::new(vec![2.0], 2.0, 0.5),
        ];
        curriculum.add_samples(samples);

        // Advance and change state
        curriculum.advance();
        assert!(curriculum.threshold() > 0.1);

        // Reset should restore initial threshold
        curriculum.reset();
        assert!((curriculum.threshold() - 0.1).abs() < 1e-10);
    }

    #[test]
    fn test_self_paced_curriculum_n_total() {
        let mut curriculum = SelfPacedCurriculum::new(0.5, 1.5);

        assert_eq!(curriculum.n_total(), 0);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.1),
            ScoredSample::new(vec![2.0], 2.0, 0.2),
            ScoredSample::new(vec![3.0], 3.0, 0.3),
        ];
        curriculum.add_samples(samples);

        assert_eq!(curriculum.n_total(), 3);
    }

    #[test]
    fn test_self_paced_next_batch_exhaustion() {
        let mut curriculum = SelfPacedCurriculum::new(1.0, 1.5);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.1),
            ScoredSample::new(vec![2.0], 2.0, 0.2),
        ];
        curriculum.add_samples(samples);

        // Get all samples
        let batch1 = curriculum.next_batch(10);
        assert_eq!(batch1.len(), 2);

        // Next batch should be empty (exhausted) and reset batch_idx
        let batch2 = curriculum.next_batch(10);
        assert!(batch2.is_empty());
    }

    #[test]
    fn test_self_paced_stage_with_samples() {
        let mut curriculum = SelfPacedCurriculum::new(0.15, 1.5);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.1),
            ScoredSample::new(vec![2.0], 2.0, 0.2),
            ScoredSample::new(vec![3.0], 3.0, 0.5),
            ScoredSample::new(vec![4.0], 4.0, 0.8),
        ];
        curriculum.add_samples(samples);

        // With threshold 0.15, only sample with difficulty 0.1 is eligible
        let stage = curriculum.stage();
        // stage = n_eligible / n_total = 1/4 = 0.25
        assert!((stage - 0.25).abs() < 0.01);
        assert!(!curriculum.is_complete());
    }

    #[test]
    fn test_self_paced_eligible_samples() {
        let mut curriculum = SelfPacedCurriculum::new(0.3, 1.5);

        let samples = vec![
            ScoredSample::new(vec![1.0], 1.0, 0.1),
            ScoredSample::new(vec![2.0], 2.0, 0.2),
            ScoredSample::new(vec![3.0], 3.0, 0.5),
        ];
        curriculum.add_samples(samples);

        let eligible = curriculum.eligible_samples();
        // Threshold is 0.3, so samples with difficulty 0.1 and 0.2 are eligible
        assert_eq!(eligible.len(), 2);
    }

    #[test]
    fn test_loss_difficulty_scorer_with_mean() {
        let scorer = LossDifficultyScorer::with_mean(5.0);

        // Distance from mean 5.0
        let d1 = scorer.score(&[0.0], 5.0); // 0.0 distance
        let d2 = scorer.score(&[0.0], 10.0); // 5.0 distance

        assert!((d1 - 0.0).abs() < 1e-10);
        assert!((d2 - 5.0).abs() < 1e-10);
    }

    #[test]
    fn test_loss_difficulty_scorer_fit_empty() {
        let mut scorer = LossDifficultyScorer::new();
        // fit with empty slice should not change target_mean
        scorer.fit(&[]);
        assert!((scorer.score(&[0.0], 0.0) - 0.0).abs() < 1e-10);
    }

    #[test]
    fn test_loss_difficulty_scorer_default() {
        let scorer = LossDifficultyScorer::default();
        // Default target_mean is 0.0
        let d = scorer.score(&[1.0, 2.0], 3.0);
        assert!((d - 3.0).abs() < 1e-10);
    }

    #[test]
    fn test_feature_norm_scorer_default() {
        let scorer = FeatureNormScorer::default();
        let d = scorer.score(&[3.0, 4.0], 0.0);
        assert!((d - 5.0).abs() < 0.01);
    }

    #[test]
    fn test_feature_norm_scorer_empty_features() {
        let scorer = FeatureNormScorer::new();
        let d = scorer.score(&[], 0.0);
        assert!((d - 0.0).abs() < 1e-10);
    }