fugue-evo 0.2.0

Evolutionary computation for Rust: classical EC algorithms plus evolutionary inference - evolutionary algorithms as probabilistic programs (tempered SMC in trace space, built on fugue-ppl)
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
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
//! Real-valued vector genome
//!
//! This module provides a fixed-length real-valued vector genome type
//! with Fugue trace integration for probabilistic operations.

#[cfg(feature = "ppl")]
use fugue::{addr, ChoiceValue, Trace};
use rand::Rng;
use serde::{Deserialize, Serialize};

use crate::error::GenomeError;
use crate::genome::bounds::MultiBounds;
use crate::genome::traits::{EvolutionaryGenome, RealValuedGenome};

/// Fixed-length real-valued vector genome
///
/// This genome type represents continuous optimization problems where
/// solutions are vectors of real numbers.
#[derive(Clone, Debug, PartialEq, Serialize, Deserialize)]
pub struct RealVector {
    /// The genes (values) of this genome
    genes: Vec<f64>,
}

impl RealVector {
    /// Create a new real vector with the given genes
    pub fn new(genes: Vec<f64>) -> Self {
        Self { genes }
    }

    /// Create a zero-filled vector of the given dimension
    pub fn zeros(dimension: usize) -> Self {
        Self {
            genes: vec![0.0; dimension],
        }
    }

    /// Create a vector filled with a constant value
    pub fn filled(dimension: usize, value: f64) -> Self {
        Self {
            genes: vec![value; dimension],
        }
    }

    /// Create from an iterator
    pub fn collect_from<I: IntoIterator<Item = f64>>(iter: I) -> Self {
        Self {
            genes: iter.into_iter().collect(),
        }
    }

    /// Get the underlying vector
    pub fn into_inner(self) -> Vec<f64> {
        self.genes
    }

    /// Get a reference to the genes
    pub fn as_vec(&self) -> &Vec<f64> {
        &self.genes
    }

    /// Calculate Euclidean norm
    pub fn norm(&self) -> f64 {
        self.genes.iter().map(|x| x * x).sum::<f64>().sqrt()
    }

    /// Calculate squared Euclidean norm
    pub fn norm_squared(&self) -> f64 {
        self.genes.iter().map(|x| x * x).sum::<f64>()
    }

    /// Element-wise addition
    pub fn add(&self, other: &Self) -> Result<Self, GenomeError> {
        if self.genes.len() != other.genes.len() {
            return Err(GenomeError::DimensionMismatch {
                expected: self.genes.len(),
                actual: other.genes.len(),
            });
        }
        Ok(Self {
            genes: self
                .genes
                .iter()
                .zip(other.genes.iter())
                .map(|(a, b)| a + b)
                .collect(),
        })
    }

    /// Element-wise subtraction
    pub fn sub(&self, other: &Self) -> Result<Self, GenomeError> {
        if self.genes.len() != other.genes.len() {
            return Err(GenomeError::DimensionMismatch {
                expected: self.genes.len(),
                actual: other.genes.len(),
            });
        }
        Ok(Self {
            genes: self
                .genes
                .iter()
                .zip(other.genes.iter())
                .map(|(a, b)| a - b)
                .collect(),
        })
    }

    /// Scalar multiplication
    pub fn scale(&self, scalar: f64) -> Self {
        Self {
            genes: self.genes.iter().map(|x| x * scalar).collect(),
        }
    }
}

impl EvolutionaryGenome for RealVector {
    type Allele = f64;
    type Phenotype = Vec<f64>;

    fn decode(&self) -> Self::Phenotype {
        self.genes.clone()
    }

    fn dimension(&self) -> usize {
        self.genes.len()
    }

    fn generate<R: Rng>(rng: &mut R, bounds: &MultiBounds) -> Self {
        let genes = bounds
            .bounds
            .iter()
            .map(|b| rng.gen_range(b.min..=b.max))
            .collect();
        Self { genes }
    }

    fn as_slice(&self) -> Option<&[f64]> {
        Some(&self.genes)
    }

    fn as_mut_slice(&mut self) -> Option<&mut [f64]> {
        Some(&mut self.genes)
    }

    fn distance(&self, other: &Self) -> f64 {
        self.try_distance(other).unwrap_or_else(|e| {
            panic!("RealVector::distance: {e}; use try_distance for a fallible comparison")
        })
    }

    fn try_distance(&self, other: &Self) -> Result<f64, GenomeError> {
        if self.genes.len() != other.genes.len() {
            return Err(GenomeError::DimensionMismatch {
                expected: self.genes.len(),
                actual: other.genes.len(),
            });
        }
        Ok(self
            .genes
            .iter()
            .zip(other.genes.iter())
            .map(|(a, b)| (a - b).powi(2))
            .sum::<f64>()
            .sqrt())
    }
}

#[cfg(feature = "ppl")]
impl crate::genome::trace_genome::TraceGenome for RealVector {
    /// Convert RealVector to Fugue trace.
    ///
    /// Each gene is stored at address "gene#i" where i is the index.
    fn to_trace(&self) -> Trace {
        let mut trace = Trace::default();
        for (i, &gene) in self.genes.iter().enumerate() {
            trace.insert_choice(addr!("gene", i), ChoiceValue::F64(gene), 0.0);
        }
        trace
    }

    /// Reconstruct RealVector from Fugue trace.
    ///
    /// Reads genes from addresses "gene#0", "gene#1", ... until no more are
    /// found. A *missing* address terminates the scan (normal end of the
    /// sequence), but an address that is *present with the wrong value type*
    /// is a corrupt trace and yields [`GenomeError::TypeMismatch`] rather than
    /// silently truncating the genome.
    fn from_trace(trace: &Trace) -> Result<Self, GenomeError> {
        let mut genes = Vec::new();
        let mut i = 0;
        loop {
            match trace.choices.get(&addr!("gene", i)) {
                // Address absent: end of the gene sequence.
                None => break,
                Some(choice) => match choice.value.as_f64() {
                    Some(val) => {
                        genes.push(val);
                        i += 1;
                    }
                    // Address present but not an f64: corrupt trace.
                    None => {
                        return Err(GenomeError::TypeMismatch {
                            address: format!("gene#{i}"),
                            expected: "f64".to_string(),
                            actual: choice.value.type_name().to_string(),
                        });
                    }
                },
            }
        }
        if genes.is_empty() {
            return Err(GenomeError::InvalidStructure(
                "No genes found in trace".to_string(),
            ));
        }
        Ok(Self { genes })
    }
}

impl RealValuedGenome for RealVector {
    fn genes(&self) -> &[f64] {
        &self.genes
    }

    fn genes_mut(&mut self) -> &mut [f64] {
        &mut self.genes
    }

    fn from_genes(genes: Vec<f64>) -> Result<Self, GenomeError> {
        Ok(Self { genes })
    }
}

impl std::ops::Index<usize> for RealVector {
    type Output = f64;

    fn index(&self, index: usize) -> &Self::Output {
        &self.genes[index]
    }
}

impl std::ops::IndexMut<usize> for RealVector {
    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
        &mut self.genes[index]
    }
}

impl From<Vec<f64>> for RealVector {
    fn from(genes: Vec<f64>) -> Self {
        Self { genes }
    }
}

impl From<RealVector> for Vec<f64> {
    fn from(genome: RealVector) -> Self {
        genome.genes
    }
}

impl<const N: usize> From<[f64; N]> for RealVector {
    fn from(arr: [f64; N]) -> Self {
        Self {
            genes: arr.to_vec(),
        }
    }
}

impl IntoIterator for RealVector {
    type Item = f64;
    type IntoIter = std::vec::IntoIter<f64>;

    fn into_iter(self) -> Self::IntoIter {
        self.genes.into_iter()
    }
}

impl<'a> IntoIterator for &'a RealVector {
    type Item = &'a f64;
    type IntoIter = std::slice::Iter<'a, f64>;

    fn into_iter(self) -> Self::IntoIter {
        self.genes.iter()
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use approx::assert_relative_eq;
    #[cfg(feature = "ppl")]
    use fugue::addr;

    #[test]
    fn test_real_vector_new() {
        let v = RealVector::new(vec![1.0, 2.0, 3.0]);
        assert_eq!(v.dimension(), 3);
        assert_eq!(v.genes(), &[1.0, 2.0, 3.0]);
    }

    #[test]
    fn test_real_vector_zeros() {
        let v = RealVector::zeros(5);
        assert_eq!(v.dimension(), 5);
        assert!(v.genes().iter().all(|&x| x == 0.0));
    }

    #[test]
    fn test_real_vector_filled() {
        let v = RealVector::filled(3, 42.0);
        assert_eq!(v.genes(), &[42.0, 42.0, 42.0]);
    }

    #[test]
    fn test_real_vector_from_array() {
        let v: RealVector = [1.0, 2.0, 3.0].into();
        assert_eq!(v.genes(), &[1.0, 2.0, 3.0]);
    }

    #[test]
    fn test_real_vector_decode() {
        let v = RealVector::new(vec![1.0, 2.0, 3.0]);
        let phenotype = v.decode();
        assert_eq!(phenotype, vec![1.0, 2.0, 3.0]);
    }

    #[test]
    fn test_real_vector_generate() {
        let mut rng = rand::thread_rng();
        let bounds = MultiBounds::symmetric(5.0, 10);
        let v = RealVector::generate(&mut rng, &bounds);

        assert_eq!(v.dimension(), 10);
        for gene in v.genes() {
            assert!(*gene >= -5.0 && *gene <= 5.0);
        }
    }

    #[test]
    fn test_real_vector_norm() {
        let v = RealVector::new(vec![3.0, 4.0]);
        assert_relative_eq!(v.norm(), 5.0);
        assert_relative_eq!(v.norm_squared(), 25.0);
    }

    #[test]
    fn test_real_vector_distance() {
        let v1 = RealVector::new(vec![0.0, 0.0]);
        let v2 = RealVector::new(vec![3.0, 4.0]);
        assert_relative_eq!(v1.distance(&v2), 5.0);
    }

    #[test]
    fn test_real_vector_add() {
        let v1 = RealVector::new(vec![1.0, 2.0, 3.0]);
        let v2 = RealVector::new(vec![4.0, 5.0, 6.0]);
        let sum = v1.add(&v2).unwrap();
        assert_eq!(sum.genes(), &[5.0, 7.0, 9.0]);
    }

    #[test]
    fn test_real_vector_add_dimension_mismatch() {
        let v1 = RealVector::new(vec![1.0, 2.0]);
        let v2 = RealVector::new(vec![1.0, 2.0, 3.0]);
        let result = v1.add(&v2);
        assert!(result.is_err());
        assert!(matches!(
            result.unwrap_err(),
            GenomeError::DimensionMismatch {
                expected: 2,
                actual: 3
            }
        ));
    }

    #[test]
    fn test_real_vector_sub() {
        let v1 = RealVector::new(vec![5.0, 7.0, 9.0]);
        let v2 = RealVector::new(vec![1.0, 2.0, 3.0]);
        let diff = v1.sub(&v2).unwrap();
        assert_eq!(diff.genes(), &[4.0, 5.0, 6.0]);
    }

    #[test]
    fn test_real_vector_scale() {
        let v = RealVector::new(vec![1.0, 2.0, 3.0]);
        let scaled = v.scale(2.0);
        assert_eq!(scaled.genes(), &[2.0, 4.0, 6.0]);
    }

    #[test]
    fn test_real_vector_indexing() {
        let mut v = RealVector::new(vec![1.0, 2.0, 3.0]);
        assert_eq!(v[0], 1.0);
        assert_eq!(v[1], 2.0);
        assert_eq!(v[2], 3.0);

        v[1] = 42.0;
        assert_eq!(v[1], 42.0);
    }

    #[test]
    fn test_real_vector_apply_bounds() {
        let mut v = RealVector::new(vec![-10.0, 0.0, 10.0]);
        let bounds = MultiBounds::symmetric(5.0, 3);
        v.apply_bounds(&bounds);
        assert_eq!(v.genes(), &[-5.0, 0.0, 5.0]);
    }

    #[test]
    fn test_real_vector_iteration() {
        let v = RealVector::new(vec![1.0, 2.0, 3.0]);
        let sum: f64 = v.into_iter().sum();
        assert_relative_eq!(sum, 6.0);
    }

    #[test]
    fn test_real_vector_into_inner() {
        let v = RealVector::new(vec![1.0, 2.0, 3.0]);
        let inner: Vec<f64> = v.into_inner();
        assert_eq!(inner, vec![1.0, 2.0, 3.0]);
    }

    #[test]
    fn test_real_vector_serialization() {
        let v = RealVector::new(vec![1.0, 2.0, 3.0]);
        let serialized = serde_json::to_string(&v).unwrap();
        let deserialized: RealVector = serde_json::from_str(&serialized).unwrap();
        assert_eq!(v, deserialized);
    }

    #[test]
    #[cfg(feature = "ppl")]
    fn test_real_vector_to_trace() {
        use crate::genome::trace_genome::TraceGenome;
        let v = RealVector::new(vec![1.5, 2.5, 3.5]);
        let trace = v.to_trace();

        assert_eq!(trace.get_f64(&addr!("gene", 0)), Some(1.5));
        assert_eq!(trace.get_f64(&addr!("gene", 1)), Some(2.5));
        assert_eq!(trace.get_f64(&addr!("gene", 2)), Some(3.5));
        assert_eq!(trace.get_f64(&addr!("gene", 3)), None);
    }

    #[test]
    #[cfg(feature = "ppl")]
    fn test_real_vector_from_trace() {
        use crate::genome::trace_genome::TraceGenome;
        let mut trace = Trace::default();
        trace.insert_choice(addr!("gene", 0), ChoiceValue::F64(1.0), 0.0);
        trace.insert_choice(addr!("gene", 1), ChoiceValue::F64(2.0), 0.0);
        trace.insert_choice(addr!("gene", 2), ChoiceValue::F64(3.0), 0.0);

        let v = RealVector::from_trace(&trace).unwrap();
        assert_eq!(v.genes(), &[1.0, 2.0, 3.0]);
    }

    #[test]
    #[cfg(feature = "ppl")]
    fn test_real_vector_trace_roundtrip() {
        use crate::genome::trace_genome::TraceGenome;
        let original = RealVector::new(vec![1.0, 2.0, 3.0, 4.0, 5.0]);
        let trace = original.to_trace();
        let recovered = RealVector::from_trace(&trace).unwrap();
        assert_eq!(original, recovered);
    }

    #[test]
    #[cfg(feature = "ppl")]
    fn test_real_vector_from_trace_empty() {
        use crate::genome::trace_genome::TraceGenome;
        let trace = Trace::default();
        let result = RealVector::from_trace(&trace);
        assert!(result.is_err());
    }

    #[test]
    fn test_real_vector_try_distance_dimension_mismatch() {
        // regression: EV-20 — distance previously truncated via zip and reported
        // 0.0 for vectors of different length, hiding an enormous extra component.
        let v1 = RealVector::new(vec![0.0, 0.0]);
        let v2 = RealVector::new(vec![0.0, 0.0, 1_000_000.0]);
        let result = v1.try_distance(&v2);
        assert!(matches!(
            result,
            Err(GenomeError::DimensionMismatch {
                expected: 2,
                actual: 3
            })
        ));
    }

    #[test]
    #[should_panic(expected = "Dimension mismatch")]
    fn test_real_vector_distance_dimension_mismatch_panics() {
        // regression: EV-20 — the infallible distance() must loudly reject a
        // length mismatch instead of silently returning 0.0.
        let v1 = RealVector::new(vec![0.0, 0.0]);
        let v2 = RealVector::new(vec![0.0, 0.0, 1_000_000.0]);
        let _ = v1.distance(&v2);
    }

    #[test]
    #[cfg(feature = "ppl")]
    fn test_real_vector_from_trace_type_mismatch() {
        // regression: EV-59 — a present-but-wrong-typed choice mid-sequence must
        // raise TypeMismatch, not be treated as "end of genes" and truncate.
        use crate::genome::trace_genome::TraceGenome;
        let mut trace = Trace::default();
        trace.insert_choice(addr!("gene", 0), ChoiceValue::F64(1.0), 0.0);
        trace.insert_choice(addr!("gene", 1), ChoiceValue::Bool(true), 0.0); // wrong type
        trace.insert_choice(addr!("gene", 2), ChoiceValue::F64(3.0), 0.0);

        let result = RealVector::from_trace(&trace);
        match result {
            Err(GenomeError::TypeMismatch {
                address,
                expected,
                actual,
            }) => {
                assert_eq!(address, "gene#1");
                assert_eq!(expected, "f64");
                assert_eq!(actual, "bool");
            }
            other => panic!("expected TypeMismatch, got {other:?}"),
        }
    }

    #[test]
    #[cfg(feature = "ppl")]
    fn test_real_vector_from_trace_missing_stops_cleanly() {
        // A genuinely absent address terminates the scan (not an error).
        use crate::genome::trace_genome::TraceGenome;
        let mut trace = Trace::default();
        trace.insert_choice(addr!("gene", 0), ChoiceValue::F64(1.0), 0.0);
        trace.insert_choice(addr!("gene", 1), ChoiceValue::F64(2.0), 0.0);
        let v = RealVector::from_trace(&trace).unwrap();
        assert_eq!(v.genes(), &[1.0, 2.0]);
    }
}