infotheory 1.1.1

The algorithmic information theory library.
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
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
//! AIXI Module Validation Tests
//!
//! Tests for predictors, environments, and agents.

use infotheory::aixi::agent::{Agent, AgentConfig};
use infotheory::aixi::common::{Action, ObservationKeyMode};
use infotheory::aixi::environment::{CoinFlip, CtwTest, Environment};
use infotheory::aixi::model::{CtwPredictor, Predictor, RateBackendBitPredictor, RosaPredictor};
use infotheory::{MAX_MIXTURE_NESTING, MixtureExpertSpec, MixtureKind, MixtureSpec, RateBackend};
use std::sync::Arc;

// ============================================================================
// Predictor Consistency Tests
// ============================================================================

fn test_predictor_sum_to_one(mut predictor: Box<dyn Predictor>, name: &str) {
    // Feed some history
    for &sym in &[true, false, true, true, false] {
        predictor.update(sym);
    }

    let p_true = predictor.predict_prob(true);
    let p_false = predictor.predict_prob(false);

    // Check they sum to 1.0 (binary predictor)
    let sum = p_true + p_false;
    println!("{name}: P(1)={p_true:.6}, P(0)={p_false:.6}, Sum={sum:.6}");
    assert!(
        (sum - 1.0).abs() < 1e-6,
        "{name}: Probabilities must sum to 1.0, got {p_true} + {p_false} = {sum}"
    );

    // Check range
    assert!(
        (0.0..=1.0).contains(&p_true),
        "{name}: Prob out of range: {p_true}"
    );
}

#[test]
fn ctw_probabilities_valid() {
    test_predictor_sum_to_one(Box::new(CtwPredictor::new(8)), "CTW");
}

#[test]
fn rosa_probabilities_valid() {
    test_predictor_sum_to_one(Box::new(RosaPredictor::new(8)), "ROSA");
}

fn test_predictor_revert(mut predictor: Box<dyn Predictor>, name: &str) {
    let history = [true, false, true, true, false, false, true];

    // Update all
    for &sym in &history {
        predictor.update(sym);
    }
    let prob_after_updates = predictor.predict_prob(true);

    // Revert all
    for _ in &history {
        predictor.revert();
    }

    // Should be back to initial state (approx 0.5 for uniform prior)
    let prob_reverted = predictor.predict_prob(true);

    println!("{name}: After full revert, p(1) = {prob_reverted}");
    assert!(
        (prob_reverted - 0.5).abs() < 0.1,
        "{name}: Reverted predictor should be roughly uninformed (0.5), got {prob_reverted}"
    );

    // Re-apply and check we get same result as before
    for &sym in &history {
        predictor.update(sym);
    }
    let prob_redo = predictor.predict_prob(true);
    assert!(
        (prob_redo - prob_after_updates).abs() < 1e-9,
        "{name}: Deterministic replay failed. {prob_redo} != {prob_after_updates}"
    );
}

#[test]
fn ctw_update_revert_consistency() {
    test_predictor_revert(Box::new(CtwPredictor::new(8)), "CTW");
}

#[test]
fn rosa_update_revert_consistency() {
    test_predictor_revert(Box::new(RosaPredictor::new(8)), "ROSA");
}

fn nested_generic_backend() -> RateBackend {
    let inner = MixtureSpec::new(
        MixtureKind::Bayes,
        vec![
            MixtureExpertSpec {
                name: Some("ctw".to_string()),
                log_prior: 0.0,
                max_order: -1,
                backend: RateBackend::Ctw { depth: 6 },
            },
            MixtureExpertSpec {
                name: Some("match".to_string()),
                log_prior: 0.0,
                max_order: -1,
                backend: RateBackend::Match {
                    hash_bits: 18,
                    min_len: 2,
                    max_len: 32,
                    base_mix: 0.05,
                    confidence_scale: 1.0,
                },
            },
        ],
    )
    .with_alpha(0.03);
    let outer = MixtureSpec::new(
        MixtureKind::Convex,
        vec![
            MixtureExpertSpec {
                name: Some("nested".to_string()),
                log_prior: 0.0,
                max_order: -1,
                backend: RateBackend::Mixture {
                    spec: Arc::new(inner),
                },
            },
            MixtureExpertSpec {
                name: Some("ppmd".to_string()),
                log_prior: 0.0,
                max_order: -1,
                backend: RateBackend::Ppmd {
                    order: 4,
                    memory_mb: 8,
                },
            },
        ],
    )
    .with_alpha(1.25);
    RateBackend::Mixture {
        spec: Arc::new(outer),
    }
}

fn predictor_snapshot(predictor: &mut dyn Predictor) -> (f64, f64) {
    (predictor.predict_prob(false), predictor.predict_prob(true))
}

fn assert_snapshot_eq(actual: (f64, f64), expected: (f64, f64), label: &str) {
    assert!(
        (actual.0 - expected.0).abs() < 1e-12 && (actual.1 - expected.1).abs() < 1e-12,
        "{label}: expected {:?}, got {:?}",
        expected,
        actual
    );
}

#[test]
fn rate_backend_bit_predictor_roundtrips_nested_mixtures() {
    let mut predictor =
        RateBackendBitPredictor::new(nested_generic_backend(), 8).expect("valid predictor");

    let initial = predictor_snapshot(&mut predictor);

    predictor.update(true);
    let after_update = predictor_snapshot(&mut predictor);
    predictor.revert();
    assert_snapshot_eq(
        predictor_snapshot(&mut predictor),
        initial,
        "revert after update",
    );

    predictor.update(true);
    assert_snapshot_eq(
        predictor_snapshot(&mut predictor),
        after_update,
        "redo after update",
    );

    predictor.update_history(false);
    let after_frozen = predictor_snapshot(&mut predictor);
    predictor.pop_history();
    assert_snapshot_eq(
        predictor_snapshot(&mut predictor),
        after_update,
        "pop_history after frozen update",
    );

    predictor.update_history(false);
    assert_snapshot_eq(
        predictor_snapshot(&mut predictor),
        after_frozen,
        "redo after frozen update",
    );
}

// ============================================================================
// Environment Tests
// ============================================================================

#[test]
fn ctw_test_env_is_deterministic() {
    let mut env1 = CtwTest::new();
    let mut env2 = CtwTest::new();

    for i in 0..50 {
        let action = (i % 2) as Action;
        env1.perform_action(action);
        env2.perform_action(action);

        assert_eq!(
            env1.get_observation(),
            env2.get_observation(),
            "Obs mismatch at step {i}"
        );
        assert_eq!(
            env1.get_reward(),
            env2.get_reward(),
            "Reward mismatch at step {i}"
        );
    }
}

// ============================================================================
// Agent / MCTS Tests
// ============================================================================

fn run_agent_env<T: Environment>(agent: &mut Agent, mut env: T, cycles: usize) -> f64 {
    let mut total_reward = 0.0;
    let mut obs_stream = env.drain_observations();
    let mut prev_rew = env.get_reward();
    let mut prev_act = 0;

    for _ in 0..cycles {
        agent.model_update_percept_stream(&obs_stream, prev_rew);
        let action = agent.get_planned_action(&obs_stream, prev_rew, prev_act);

        // Update model with chosen action (so model sees: ...p a p a p a...)
        agent.model_update_action_external(action);

        env.perform_action(action);

        obs_stream = env.drain_observations();
        let rew = env.get_reward();

        // Update model with observed percept stream
        agent.model_update_percept_stream(&obs_stream, rew);

        total_reward += rew as f64;
        prev_rew = rew;
        prev_act = action;

        if env.is_finished() {
            break;
        }
    }
    total_reward
}

fn generic_agent_config(rate_backend: RateBackend) -> AgentConfig {
    AgentConfig {
        algorithm: "ignored-by-rate-backend".into(),
        ct_depth: 8,
        agent_horizon: 5,
        observation_bits: 1,
        observation_stream_len: 1,
        observation_key_mode: ObservationKeyMode::FullStream,
        reward_bits: 1,
        agent_actions: 2,
        num_simulations: 60,
        exploration_exploitation_ratio: 1.4,
        discount_gamma: 1.0,
        min_reward: 0,
        max_reward: 1,
        reward_offset: 0,
        random_seed: Some(2026),
        rate_backend: Some(rate_backend),
        rate_backend_max_order: 8,
        rwkv_model_path: None,
        rwkv_method: None,
        mamba_model_path: None,
        mamba_method: None,
        rosa_max_order: Some(8),
        zpaq_method: None,
    }
}

fn mixture_backend(kind: MixtureKind) -> RateBackend {
    let experts = vec![
        MixtureExpertSpec {
            name: Some("ctw".to_string()),
            log_prior: 0.0,
            max_order: -1,
            backend: RateBackend::Ctw { depth: 8 },
        },
        MixtureExpertSpec {
            name: Some("rosa".to_string()),
            log_prior: 0.0,
            max_order: 8,
            backend: RateBackend::RosaPlus,
        },
    ];
    let alpha = match kind {
        MixtureKind::Switching => 0.05,
        MixtureKind::Convex => 1.25,
        _ => 0.03,
    };
    RateBackend::Mixture {
        spec: Arc::new(MixtureSpec::new(kind, experts).with_alpha(alpha)),
    }
}

fn deeply_nested_bayes_backend(depth: usize) -> RateBackend {
    let mut backend = RateBackend::Ctw { depth: 4 };
    for level in 0..depth {
        backend = RateBackend::Mixture {
            spec: Arc::new(MixtureSpec::new(
                MixtureKind::Bayes,
                vec![MixtureExpertSpec {
                    name: Some(format!("level-{level}")),
                    log_prior: 0.0,
                    max_order: -1,
                    backend,
                }],
            )),
        };
    }
    backend
}

#[test]
fn agent_solves_ctw_test_environment() {
    let config = AgentConfig {
        algorithm: "ctw".into(),
        ct_depth: 8,
        agent_horizon: 8, // Increased from 4
        observation_bits: 1,
        observation_stream_len: 1,
        observation_key_mode: infotheory::aixi::common::ObservationKeyMode::FullStream,
        reward_bits: 1,
        agent_actions: 2,
        num_simulations: 200, // Increased from 50
        exploration_exploitation_ratio: 2.0,
        discount_gamma: 1.0,
        min_reward: 0,
        max_reward: 1,
        reward_offset: 0,
        random_seed: Some(17),
        rate_backend: None,
        rate_backend_max_order: 20,
        rwkv_model_path: None,
        rwkv_method: None,
        mamba_model_path: None,
        mamba_method: None,
        rosa_max_order: None,
        zpaq_method: None,
    };

    let mut agent = Agent::new(config);
    let env = CtwTest::new();

    let cycles = 100;
    let total_reward = run_agent_env(&mut agent, env, cycles);

    println!(
        "Agent Total Reward on CtwTest (100 cycles): {}",
        total_reward
    );

    // Agent should learn pattern and get reasonable reward
    assert!(
        total_reward > 50.0,
        "Agent failed to learn CtwTest pattern. Reward: {total_reward}"
    );
}

#[test]
fn agent_regret_sublinear_coinflip() {
    let config = AgentConfig {
        algorithm: "ctw".into(),
        ct_depth: 4,
        agent_horizon: 4, // Increased from 2
        observation_bits: 1,
        observation_stream_len: 1,
        observation_key_mode: infotheory::aixi::common::ObservationKeyMode::FullStream,
        reward_bits: 1,
        agent_actions: 2,
        num_simulations: 100, // Increased from 20
        exploration_exploitation_ratio: 1.0,
        discount_gamma: 1.0,
        min_reward: 0,
        max_reward: 1,
        reward_offset: 0,
        random_seed: Some(23),
        rate_backend: None,
        rate_backend_max_order: 20,
        rwkv_model_path: None,
        rwkv_method: None,
        mamba_model_path: None,
        mamba_method: None,
        rosa_max_order: None,
        zpaq_method: None,
    };

    let mut agent = Agent::new(config);
    let env = CoinFlip::new(0.8);

    let cycles = 500;
    let total_reward = run_agent_env(&mut agent, env, cycles);

    let expected_optimal = 0.8 * cycles as f64;
    let regret = expected_optimal - total_reward;
    let regret_per_step = regret / cycles as f64;

    println!(
        "CoinFlip(0.8): Reward={total_reward}, Opt={expected_optimal}, Regret/step={regret_per_step:.4}"
    );

    // Regret should be reasonable (< 0.25 per step)
    assert!(regret_per_step < 0.25, "Regret too high: {regret_per_step}");
}

#[test]
fn agent_seeded_policy_is_reproducible_on_deterministic_env() {
    let config = AgentConfig {
        algorithm: "ctw".into(),
        ct_depth: 8,
        agent_horizon: 6,
        observation_bits: 1,
        observation_stream_len: 1,
        observation_key_mode: infotheory::aixi::common::ObservationKeyMode::FullStream,
        reward_bits: 1,
        agent_actions: 2,
        num_simulations: 80,
        exploration_exploitation_ratio: 1.4,
        discount_gamma: 1.0,
        min_reward: 0,
        max_reward: 1,
        reward_offset: 0,
        random_seed: Some(12345),
        rate_backend: None,
        rate_backend_max_order: 20,
        rwkv_model_path: None,
        rwkv_method: None,
        mamba_model_path: None,
        mamba_method: None,
        rosa_max_order: None,
        zpaq_method: None,
    };

    let mut a = Agent::new(config.clone());
    let mut b = Agent::new(config);
    let mut env_a = CtwTest::new();
    let mut env_b = CtwTest::new();

    let mut obs_a = env_a.drain_observations();
    let mut obs_b = env_b.drain_observations();
    let mut rew_a = env_a.get_reward();
    let mut rew_b = env_b.get_reward();
    let mut prev_a = 0u64;
    let mut prev_b = 0u64;

    for step in 0..64usize {
        assert_eq!(obs_a, obs_b, "observation mismatch at step {step}");
        assert_eq!(rew_a, rew_b, "reward mismatch at step {step}");

        a.model_update_percept_stream(&obs_a, rew_a);
        b.model_update_percept_stream(&obs_b, rew_b);

        let act_a = a.get_planned_action(&obs_a, rew_a, prev_a);
        let act_b = b.get_planned_action(&obs_b, rew_b, prev_b);
        assert_eq!(act_a, act_b, "action mismatch at step {step}");

        a.model_update_action_external(act_a);
        b.model_update_action_external(act_b);

        env_a.perform_action(act_a);
        env_b.perform_action(act_b);
        obs_a = env_a.drain_observations();
        obs_b = env_b.drain_observations();
        rew_a = env_a.get_reward();
        rew_b = env_b.get_reward();
        prev_a = act_a;
        prev_b = act_b;
    }
}

#[test]
fn agent_config_allows_unknown_algorithm_when_rate_backend_overrides() {
    let cfg = generic_agent_config(RateBackend::Ppmd {
        order: 4,
        memory_mb: 8,
    });
    assert!(cfg.validate().is_ok());
    let mut agent = Agent::try_new(cfg).expect("rate_backend override should be valid");
    let action = agent.get_planned_action(&[0], 0, 0);
    assert!(action < 2);
}

#[test]
fn agent_config_allows_algorithm_zpaq_when_rate_backend_overrides() {
    let mut cfg = generic_agent_config(RateBackend::Ctw { depth: 8 });
    cfg.algorithm = "zpaq".to_string();
    cfg.zpaq_method = Some("1".to_string());
    assert!(cfg.validate().is_ok());
    let mut agent = Agent::try_new(cfg).expect("rate_backend override should bypass legacy zpaq");
    let action = agent.get_planned_action(&[0], 0, 0);
    assert!(action < 2);
}

#[test]
fn agent_config_rejects_zpaq_rate_backend_in_strict_mode() {
    let cfg = generic_agent_config(RateBackend::Mixture {
        spec: Arc::new(MixtureSpec::new(
            MixtureKind::Bayes,
            vec![MixtureExpertSpec {
                name: Some("bad-zpaq".to_string()),
                log_prior: 0.0,
                max_order: -1,
                backend: RateBackend::Zpaq {
                    method: "1".to_string(),
                },
            }],
        )),
    });
    let err = cfg
        .validate()
        .expect_err("zpaq-backed generic MC-AIXI should be rejected");
    assert!(err.contains("A Monte-Carlo AIXI Approximation"));
    assert!(err.contains("zpaq"));
}

#[test]
fn agent_config_rejects_invalid_programmatic_mixture_rate_backend() {
    let cfg = generic_agent_config(RateBackend::Mixture {
        spec: Arc::new(MixtureSpec::new(MixtureKind::Bayes, vec![])),
    });
    let err = cfg
        .validate()
        .expect_err("empty mixture backend should be rejected");
    assert!(err.contains("invalid rate_backend"));
    assert!(err.contains("must include at least one expert"));
}

#[test]
fn agent_config_rejects_programmatic_mixture_nesting_overflow() {
    let cfg = generic_agent_config(deeply_nested_bayes_backend(MAX_MIXTURE_NESTING + 1));
    let err = cfg
        .validate()
        .expect_err("overly deep nested mixture should be rejected");
    assert!(err.contains("invalid rate_backend"));
    assert!(err.contains("nesting too deep"));
}

#[test]
fn agent_with_generic_mixture_backends_smoke_runs() {
    for (kind, label) in [
        (MixtureKind::Bayes, "bayes"),
        (MixtureKind::Switching, "switching"),
        (MixtureKind::Convex, "convex"),
    ] {
        let mut agent =
            Agent::try_new(generic_agent_config(mixture_backend(kind))).expect("valid mixture");
        let total_reward = run_agent_env(&mut agent, CtwTest::new(), 48);
        assert!(
            total_reward > 16.0,
            "{label} mixture backend reward too low on CtwTest: {total_reward}"
        );
    }
}