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
//! Delta computation for comparing pipeline outputs against ground truth.
//!
//! Supports multiple metrics: mean/std difference, cosine similarity,
//! KL divergence, and Wasserstein distance.

use super::GroundTruth;

/// Statistical divergence metrics for comparison.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Metric {
    /// Mean squared error
    MeanSquaredError,
    /// Cosine similarity between vectors
    CosineSimilarity,
    /// Kullback-Leibler divergence for probability distributions
    KLDivergence,
    /// Wasserstein (Earth Mover's) distance
    WassersteinDistance,
    /// L2 norm of difference
    L2Norm,
}

/// Delta represents the divergence between computed output and ground truth.
#[derive(Debug, Clone)]
#[allow(clippy::struct_field_names)]
pub struct Delta {
    /// Absolute difference in mean
    mean_delta: f32,
    /// Absolute difference in standard deviation
    std_delta: f32,
    /// Percent divergence (combined metric)
    percent: f32,
    /// Whether the sign of the mean is flipped
    sign_flipped: bool,
    /// Cosine similarity (if computed)
    cosine: Option<f32>,
    /// KL divergence (if computed)
    kl_div: Option<f32>,
}

impl Delta {
    /// Compute delta between two ground truth statistics.
    #[must_use]
    pub fn compute(our: &GroundTruth, gt: &GroundTruth) -> Self {
        let mean_delta = (our.mean() - gt.mean()).abs();
        let std_delta = (our.std() - gt.std()).abs();

        // Use std as reference since mean can be near zero
        let ref_val = gt.std().abs().max(0.001);
        let percent = ((mean_delta + std_delta) / ref_val) * 100.0;

        // Sign flip detection
        let sign_flipped = our.mean().signum() != gt.mean().signum()
            && our.mean().abs() > 0.01
            && gt.mean().abs() > 0.01;

        // Compute cosine similarity if both have data
        let cosine = match (our.data(), gt.data()) {
            (Some(a), Some(b)) if !a.is_empty() && !b.is_empty() => {
                Some(Self::cosine_similarity(a, b))
            }
            _ => None,
        };

        Self {
            mean_delta,
            std_delta,
            percent,
            sign_flipped,
            cosine,
            kl_div: None,
        }
    }

    /// Create a delta from a simple percent value (for testing).
    #[must_use]
    pub fn from_percent(percent: f32) -> Self {
        Self {
            mean_delta: 0.0,
            std_delta: 0.0,
            percent,
            sign_flipped: false,
            cosine: None,
            kl_div: None,
        }
    }

    /// Create a delta from mean and std differences (for testing).
    #[must_use]
    pub fn from_stats(mean_delta: f32, std_delta: f32) -> Self {
        let percent = (mean_delta + std_delta) * 100.0;
        Self {
            mean_delta,
            std_delta,
            percent,
            sign_flipped: false,
            cosine: None,
            kl_div: None,
        }
    }

    /// Get the absolute difference in mean.
    #[must_use]
    pub fn mean_delta(&self) -> f32 {
        self.mean_delta
    }

    /// Get the absolute difference in standard deviation.
    #[must_use]
    pub fn std_delta(&self) -> f32 {
        self.std_delta
    }

    /// Get the percent divergence.
    #[must_use]
    pub fn percent(&self) -> f32 {
        self.percent
    }

    /// Check if there's a sign flip between our value and ground truth.
    #[must_use]
    pub fn is_sign_flipped(&self) -> bool {
        self.sign_flipped
    }

    /// Get cosine similarity if computed.
    #[must_use]
    pub fn cosine(&self) -> Option<f32> {
        self.cosine
    }

    /// Get KL divergence if computed.
    #[must_use]
    pub fn kl_divergence_value(&self) -> Option<f32> {
        self.kl_div
    }

    /// Compute cosine similarity between two vectors.
    ///
    /// Returns a value in [-1, 1]:
    /// - 1.0: identical direction
    /// - 0.0: orthogonal
    /// - -1.0: opposite direction
    ///
    /// ONE PATH: Delegates to `nn::functional::cosine_similarity_slice` (UCBD §4).
    #[must_use]
    pub fn cosine_similarity(a: &[f32], b: &[f32]) -> f32 {
        crate::nn::functional::cosine_similarity_slice(a, b)
    }

    /// Compute KL divergence D(P || Q).
    ///
    /// P and Q must be probability distributions (sum to 1, non-negative).
    /// Returns bits of information lost when using Q to approximate P.
    #[must_use]
    pub fn kl_divergence(p: &[f32], q: &[f32]) -> f32 {
        if p.len() != q.len() || p.is_empty() {
            return f32::INFINITY;
        }

        let epsilon = 1e-10;
        let mut kl = 0.0;

        for (pi, qi) in p.iter().zip(q.iter()) {
            if *pi > epsilon {
                let qi_safe = qi.max(epsilon);
                kl += pi * (pi / qi_safe).ln();
            }
        }

        kl
    }

    /// Compute 1-D Wasserstein distance (Earth Mover's Distance).
    ///
    /// For sorted 1-D distributions, this is the sum of absolute differences
    /// of the cumulative distribution functions.
    #[must_use]
    pub fn wasserstein_1d(a: &[f32], b: &[f32]) -> f32 {
        if a.is_empty() || b.is_empty() {
            return 0.0;
        }

        // Sort both arrays
        let mut a_sorted: Vec<f32> = a.to_vec();
        let mut b_sorted: Vec<f32> = b.to_vec();
        a_sorted.sort_by(|x, y| x.partial_cmp(y).unwrap_or(std::cmp::Ordering::Equal));
        b_sorted.sort_by(|x, y| x.partial_cmp(y).unwrap_or(std::cmp::Ordering::Equal));

        // Resample to same length if needed (simple linear interpolation)
        let n = a_sorted.len().max(b_sorted.len());
        let a_resampled = Self::resample(&a_sorted, n);
        let b_resampled = Self::resample(&b_sorted, n);

        // Compute EMD as sum of absolute differences
        a_resampled
            .iter()
            .zip(b_resampled.iter())
            .map(|(x, y)| (x - y).abs())
            .sum::<f32>()
            / n as f32
    }

    /// Resample an array to a target length.
    fn resample(data: &[f32], target_len: usize) -> Vec<f32> {
        if data.len() == target_len {
            return data.to_vec();
        }

        let mut result = Vec::with_capacity(target_len);
        for i in 0..target_len {
            let t = i as f32 / (target_len - 1) as f32;
            let idx = t * (data.len() - 1) as f32;
            let low = idx.floor() as usize;
            let high = (low + 1).min(data.len() - 1);
            let frac = idx - low as f32;
            result.push(data[low] * (1.0 - frac) + data[high] * frac);
        }
        result
    }

    /// Compute all metrics and return the delta with full information.
    #[must_use]
    pub fn compute_all(our: &GroundTruth, gt: &GroundTruth) -> Self {
        let mut delta = Self::compute(our, gt);

        // Compute KL divergence if both have probability-like data
        if let (Some(our_data), Some(gt_data)) = (our.data(), gt.data()) {
            // Normalize to probability distributions
            let our_sum: f32 = our_data.iter().map(|x| x.abs()).sum();
            let gt_sum: f32 = gt_data.iter().map(|x| x.abs()).sum();

            if our_sum > 1e-10 && gt_sum > 1e-10 {
                let p: Vec<f32> = our_data.iter().map(|x| x.abs() / our_sum).collect();
                let q: Vec<f32> = gt_data.iter().map(|x| x.abs() / gt_sum).collect();
                delta.kl_div = Some(Self::kl_divergence(&p, &q));
            }
        }

        delta
    }
}

impl Default for Delta {
    fn default() -> Self {
        Self::from_percent(0.0)
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_cosine_identical() {
        let a = vec![1.0, 2.0, 3.0];
        let b = vec![1.0, 2.0, 3.0];
        let cos = Delta::cosine_similarity(&a, &b);
        assert!((cos - 1.0).abs() < 1e-6);
    }

    #[test]
    fn test_cosine_opposite() {
        let a = vec![1.0, 2.0, 3.0];
        let b = vec![-1.0, -2.0, -3.0];
        let cos = Delta::cosine_similarity(&a, &b);
        assert!((cos - (-1.0)).abs() < 1e-6);
    }

    #[test]
    fn test_cosine_orthogonal() {
        let a = vec![1.0, 0.0];
        let b = vec![0.0, 1.0];
        let cos = Delta::cosine_similarity(&a, &b);
        assert!(cos.abs() < 1e-6);
    }

    #[test]
    fn test_kl_identical() {
        let p = vec![0.25, 0.25, 0.25, 0.25];
        let q = vec![0.25, 0.25, 0.25, 0.25];
        let kl = Delta::kl_divergence(&p, &q);
        assert!(kl.abs() < 1e-6);
    }

    #[test]
    fn test_kl_different() {
        let p = vec![0.9, 0.1];
        let q = vec![0.5, 0.5];
        let kl = Delta::kl_divergence(&p, &q);
        assert!(kl > 0.0);
    }

    #[test]
    fn test_wasserstein_identical() {
        let a = vec![1.0, 2.0, 3.0];
        let b = vec![1.0, 2.0, 3.0];
        let w = Delta::wasserstein_1d(&a, &b);
        assert!(w < 1e-6);
    }

    #[test]
    fn test_wasserstein_shifted() {
        let a = vec![0.0, 1.0, 2.0];
        let b = vec![1.0, 2.0, 3.0];
        let w = Delta::wasserstein_1d(&a, &b);
        assert!((w - 1.0).abs() < 1e-6);
    }

    #[test]
    fn test_delta_compute_with_data() {
        let our = GroundTruth::from_slice(&[1.0, 2.0, 3.0]);
        let gt = GroundTruth::from_slice(&[1.0, 2.0, 3.0]);
        let delta = Delta::compute(&our, &gt);
        assert!(delta.cosine().is_some());
        assert!((delta.cosine().unwrap() - 1.0).abs() < 1e-6);
    }

    #[test]
    fn test_delta_compute_sign_flip() {
        let our = GroundTruth::from_stats(0.5, 1.0);
        let gt = GroundTruth::from_stats(-0.5, 1.0);
        let delta = Delta::compute(&our, &gt);
        assert!(delta.is_sign_flipped());
    }

    #[test]
    fn test_delta_compute_no_sign_flip() {
        let our = GroundTruth::from_stats(0.5, 1.0);
        let gt = GroundTruth::from_stats(0.6, 1.0);
        let delta = Delta::compute(&our, &gt);
        assert!(!delta.is_sign_flipped());
    }

    #[test]
    fn test_delta_from_percent() {
        let delta = Delta::from_percent(42.5);
        assert!((delta.percent() - 42.5).abs() < 1e-6);
        assert!((delta.mean_delta() - 0.0).abs() < 1e-6);
        assert!((delta.std_delta() - 0.0).abs() < 1e-6);
    }

    #[test]
    fn test_delta_from_stats() {
        let delta = Delta::from_stats(0.1, 0.2);
        assert!((delta.mean_delta() - 0.1).abs() < 1e-5);
        assert!((delta.std_delta() - 0.2).abs() < 1e-5);
        // percent = (0.1 + 0.2) * 100 = 30
        assert!((delta.percent() - 30.0).abs() < 1e-4);
    }

    #[test]
    fn test_delta_default() {
        let delta = Delta::default();
        assert!((delta.percent() - 0.0).abs() < 1e-6);
    }

    #[test]
    fn test_delta_kl_divergence_value() {
        let delta = Delta::from_percent(5.0);
        assert!(delta.kl_divergence_value().is_none());
    }

    #[test]
    fn test_delta_compute_all_with_kl() {
        let our = GroundTruth::from_slice(&[0.1, 0.2, 0.3, 0.4]);
        let gt = GroundTruth::from_slice(&[0.1, 0.2, 0.3, 0.4]);
        let delta = Delta::compute_all(&our, &gt);
        assert!(delta.kl_divergence_value().is_some());
        // KL divergence of identical distributions should be ~0
        assert!(delta.kl_divergence_value().unwrap().abs() < 1e-6);
    }

    #[test]
    fn test_cosine_empty() {
        let cos = Delta::cosine_similarity(&[], &[]);
        assert!((cos - 0.0).abs() < 1e-6);
    }

    #[test]
    fn test_cosine_different_lengths() {
        let a = vec![1.0, 2.0];
        let b = vec![1.0, 2.0, 3.0];
        let cos = Delta::cosine_similarity(&a, &b);
        assert!((cos - 0.0).abs() < 1e-6);
    }

    #[test]
    fn test_cosine_zero_norm() {
        let a = vec![0.0, 0.0, 0.0];
        let b = vec![1.0, 2.0, 3.0];
        let cos = Delta::cosine_similarity(&a, &b);
        assert!((cos - 0.0).abs() < 1e-6);
    }

    #[test]
    fn test_kl_empty() {
        let kl = Delta::kl_divergence(&[], &[]);
        assert!(kl.is_infinite());
    }

    #[test]
    fn test_kl_different_lengths() {
        let p = vec![0.5, 0.5];
        let q = vec![0.33, 0.33, 0.34];
        let kl = Delta::kl_divergence(&p, &q);
        assert!(kl.is_infinite());
    }

    #[test]
    fn test_wasserstein_empty() {
        let w = Delta::wasserstein_1d(&[], &[1.0]);
        assert!((w - 0.0).abs() < 1e-6);
    }

    #[test]
    fn test_wasserstein_different_lengths() {
        let a = vec![1.0, 2.0];
        let b = vec![1.0, 2.0, 3.0, 4.0];
        let w = Delta::wasserstein_1d(&a, &b);
        assert!(w.is_finite());
    }
}