gam-sae 0.3.150

//! #2101 birth-locus guards: localize WHERE the born decoder dies in the real
//! ordered Beta--Bernoulli regime — the K=1 birth SUB-FIT (`fit_single_atom_response_in_place`,
//! penalty-on-scale-B) vs the JOINT BACKFIT (gate-dependent deflation).
//! Reproduces red-tree's disjoint 6-circle ordered_beta_bernoulli recovery (n=80, p=16,
//! distinct amps 1.0..0.55, noise 0.05, structured_whitening OFF) and records
//! the last-born atom's ‖B‖ at every SAC progress event via the callback (no
//! driver edit). Run with `-- --nocapture` to read the trajectory.
//!
//! These started life as pure `eprintln!` diagnostic probes, but an
//! assertion-less `#[test]` trips the workspace-root `build.rs`
//! `scan_for_useless_tests` ban and aborts the whole build (cargo build/test,
//! `--release`, and the `gamfit` wheel — gam#2110). They are now genuine
//! pass/fail guards: on top of the trajectory dump each asserts the
//! well-formedness invariants of the fragile birth path that #2101 studies —
//! the fit runs end to end without erroring, the progress callback actually
//! fires, and every decoder norm on the trajectory stays FINITE (no NaN/Inf
//! leaking out of the arrow–Schur K=1 solve). These invariants hold regardless
//! of the #2101 rank-collapse outcome, so the guards stay green while #2101 is
//! open yet still fail loudly on a divergence/NaN regression in this exact code
//! path; the printed trajectory remains available for the #2101 investigation.

use crate::manifold::{
    AssignmentMode, PeriodicHarmonicEvaluator, SaeAssignment, SaeAtomBasisKind, SaeBasisEvaluator,
    SaeManifoldAtom, SaeManifoldRho, SaeManifoldTerm, StagewiseConfig, StagewiseProgress,
    fit_stagewise,
};
use gam_terms::latent::LatentManifold;
use ndarray::{Array1, Array2};
use std::cell::{Cell, RefCell};
use std::sync::Arc;

fn lcg(s: &mut u64) -> f64 {
    *s = s
        .wrapping_mul(6364136223846793005)
        .wrapping_add(1442695040888963407);
    ((*s >> 11) as f64) / ((1u64 << 53) as f64)
}
fn lcg_normal(s: &mut u64) -> f64 {
    let u1 = lcg(s).max(1e-12);
    let u2 = lcg(s);
    (-2.0 * u1.ln()).sqrt() * (std::f64::consts::TAU * u2).cos()
}

#[test]
fn probe_2101_birth_locus_disjoint_6circle_ordered_beta_bernoulli() {
    let n = 80usize;
    let p = 16usize;
    let ncirc = 6usize;
    // distinct amps 1.0..0.55 (mirror driver.gen); disjoint AXIS-ALIGNED frames:
    // circle c lives on output dims (2c, 2c+1). Same difficulty class as red-tree's
    // random-orthonormal disjoint frames for the born-decoder mechanism.
    let amps: Vec<f64> = (0..ncirc)
        .map(|c| 1.0 - 0.45 * (c as f64) / ((ncirc - 1) as f64))
        .collect();
    let mut s = 0x2101_D150_0000_0001u64;
    let theta: Vec<Vec<f64>> = (0..n)
        .map(|_| {
            (0..ncirc)
                .map(|_| std::f64::consts::TAU * lcg(&mut s))
                .collect()
        })
        .collect();
    let mut x = Array2::<f64>::zeros((n, p));
    for i in 0..n {
        for c in 0..ncirc {
            x[[i, 2 * c]] += amps[c] * theta[i][c].cos();
            x[[i, 2 * c + 1]] += amps[c] * theta[i][c].sin();
        }
        for j in 0..p {
            x[[i, j]] += 0.05 * lcg_normal(&mut s);
        }
    }

    // K=1 ordered_beta_bernoulli seed: one circle atom on dims (0,1), coordinate ALIGNED to circle-0's
    // TRUE phase so the incumbent fully absorbs its own circle (else it under-fits
    // and the leftover blends into the birth — fit-robustness's decomposition
    // finding; the real pipeline pca-seeds this alignment).
    let evaluator = Arc::new(PeriodicHarmonicEvaluator::new(3).unwrap());
    let coords = Array2::<f64>::from_shape_fn((n, 1), |(r, _)| theta[r][0] / std::f64::consts::TAU);
    let (phi, jet) = evaluator.evaluate(coords.view()).unwrap();
    let mut decoder = Array2::<f64>::zeros((3, p));
    decoder[[1, 0]] = 1.0;
    decoder[[2, 1]] = 1.0;
    let atom = SaeManifoldAtom::new_with_provided_function_gram(
        "seed".to_string(),
        SaeAtomBasisKind::Periodic,
        1,
        phi,
        jet,
        decoder,
        Array2::<f64>::eye(3),
    )
    .unwrap()
    .with_basis_second_jet(evaluator.clone());
    let logits = Array2::<f64>::from_elem((n, 1), 3.0);
    let assignment = SaeAssignment::from_blocks_with_mode_and_manifolds(
        logits,
        vec![coords],
        vec![LatentManifold::Circle { period: 1.0 }],
        AssignmentMode::ordered_beta_bernoulli(0.7, 1.0, false),
    )
    .unwrap();
    let mut seed_term = SaeManifoldTerm::new(vec![atom], assignment).unwrap();
    seed_term.set_guards_enabled(false);
    let mut rho = SaeManifoldRho::new(0.0, 0.0, vec![Array1::<f64>::zeros(1)]);
    let config = StagewiseConfig {
        inner_max_iter: 40,
        learning_rate: 1.0,
        ridge_ext_coord: 1e-6,
        ridge_beta: 1e-6,
        max_births: 8,
        max_backfit_sweeps: 6,
        min_effect_ev: 0.0,
        max_factor_rank: 8,
        structured_whitening: false,
    };
    // Fit the K=1 seed before entering stagewise (mirrors the pipeline's seed fit).
    seed_term
        .run_joint_fit_arrow_schur(
            x.view(),
            &mut rho,
            None,
            config.inner_max_iter,
            config.learning_rate,
            config.ridge_ext_coord,
            config.ridge_beta,
        )
        .expect("seed K=1 fit");
    // The seed fit must preserve the single seeded atom (K=1 in, K=1 out).
    assert_eq!(
        seed_term.k_atoms(),
        1,
        "seed K=1 fit changed the atom count before stagewise entry"
    );

    let log: RefCell<Vec<String>> = RefCell::new(Vec::new());
    // Guard invariants observed through the progress callback: the callback
    // must actually fire, and every decoder norm we read off the trajectory
    // must be finite (a NaN/Inf here is a divergence in the arrow–Schur birth
    // solve — the exact failure mode #2101 is localizing).
    let events = Cell::new(0usize);
    let all_born_finite = Cell::new(true);
    let (final_k, births_accepted) = {
        let mut cb = |pg: StagewiseProgress<'_>| -> Result<(), String> {
            events.set(events.get() + 1);
            let k = pg.k_atoms;
            let (born_norm, rows, top2, pr) = if k >= 1 {
                let d = &pg.term.atoms[k - 1].decoder_coefficients;
                let bn = d.iter().map(|v| v * v).sum::<f64>().sqrt();
                let rn: Vec<f64> = (0..d.nrows())
                    .map(|r| d.row(r).iter().map(|v| v * v).sum::<f64>().sqrt())
                    .collect();
                // Per-output-column HARMONIC energy e_j = cos_row_j² + sin_row_j².
                // top2 = fraction of harmonic energy on the 2 strongest columns
                // (~1.0 = clean 2-column circle; lower = blended). pr = participation
                // ratio (Σe)²/Σe² ≈ effective column count (~2 clean, ~4+ blended).
                let ncols = d.ncols();
                let mut ecol: Vec<f64> = (0..ncols)
                    .map(|j| {
                        if d.nrows() >= 3 {
                            d[[1, j]] * d[[1, j]] + d[[2, j]] * d[[2, j]]
                        } else {
                            0.0
                        }
                    })
                    .collect();
                let tot: f64 = ecol.iter().sum();
                let sumsq: f64 = ecol.iter().map(|e| e * e).sum();
                let pr = if sumsq > 0.0 { tot * tot / sumsq } else { 0.0 };
                ecol.sort_by(|a, b| b.total_cmp(a));
                let top2 = if tot > 0.0 {
                    (ecol.first().copied().unwrap_or(0.0) + ecol.get(1).copied().unwrap_or(0.0))
                        / tot
                } else {
                    0.0
                };
                (bn, rn, top2, pr)
            } else {
                (0.0, vec![], 0.0, 0.0)
            };
            if !born_norm.is_finite() || rows.iter().any(|v| !v.is_finite()) {
                all_born_finite.set(false);
            }
            log.borrow_mut().push(format!(
                "{:?} round={} sweep={} k={} born|B|={:.3e} rows={:?} top2col={:.2} PR={:.2} ev={:?} penalized_quasi_laplace_after={:?}",
                pg.event,
                pg.birth_round,
                pg.backfit_sweep,
                k,
                born_norm,
                rows.iter().map(|v| (v * 1000.0).round() / 1000.0).collect::<Vec<_>>(),
                top2,
                pr,
                pg.ev.map(|e| (e * 10000.0).round() / 10000.0),
                pg.joint_penalized_quasi_laplace_after.map(|r| (r * 100.0).round() / 100.0),
            ));
            Ok(())
        };
        let res = fit_stagewise(
            seed_term,
            rho,
            x.view(),
            None,
            None,
            &config,
            Some(&mut cb),
            None,
        )
        .expect("stagewise disjoint-6-circle ordered_beta_bernoulli fit");
        let k = res.term.k_atoms();
        let births = res.report.births_accepted;
        log.borrow_mut()
            .push(format!("FINAL: k={k} births={births}"));
        (k, births)
    };
    eprintln!(
        "\n==== #2101 BIRTH LOCUS TRAJECTORY (disjoint 6-circle ordered_beta_bernoulli) ===="
    );
    for line in log.borrow().iter() {
        eprintln!("{line}");
    }
    eprintln!("==== END #2101 PROBE ====\n");

    // Well-formedness guards on the birth path (finiteness/shape only; NOT a
    // claim about #2101's rank-collapse recovery, which is still open).
    assert!(
        events.get() > 0,
        "stagewise progress callback never fired — the birth loop did not run"
    );
    assert!(
        all_born_finite.get(),
        "born decoder ‖B‖ went non-finite on the trajectory (arrow–Schur birth solve diverged)"
    );
    assert!(
        final_k >= 1,
        "stagewise fit dropped every atom (k_atoms=0) — the seed circle was lost"
    );
    assert!(
        births_accepted <= config.max_births,
        "births_accepted={births_accepted} exceeds the configured max_births={}",
        config.max_births
    );
}

/// #2101 UNIFICATION guard (decides one-fix-vs-two): does the K=1 fit DESTROY a
/// PROPERLY-SEEDED rank-2 circle? Seed a K=1 atom as a perfect circle (cos→e0,
/// sin→e1, coordinate = the TRUE phase) on a single-circle target, run the same
/// K=1 driver the birth sub-fit uses, and read the cos/sin decoder-row norms
/// before/after. If cos/sin SURVIVE ⇒ the fit is fine and #2101 is purely the
/// DC-SEED (seed cos/sin, my lane, SEPARATE from #5). If cos/sin COLLAPSE ⇒ the
/// fit/criterion crushes circles (the ‖B‖→0 / harmonic-row reward — UNIFIED with
/// fit-robustness's #5). Runs both ordered_beta_bernoulli and softmax gate modes.
///
/// The eprintln! trajectory is the diagnostic; the asserts are the guard. We do
/// NOT assert survival (that is the open #2101 question) — only the invariants
/// that must hold either way: the perfect-circle seed really has harmonic norm
/// √2 before the fit, the K=1 solve returns without error, the atom count is
/// preserved, and every post-fit decoder row is finite. A NaN/Inf or an atom
/// vanishing would be a genuine regression in the fragile arrow–Schur path.
#[test]
fn probe_2101_proper_circle_seed_survival() {
    let n = 80usize;
    let p = 16usize;
    let mut s = 0x2101_C15C_0000_0007u64;
    // Single circle on dims (0,1), amp 1, independent phase, noise 0.05.
    let theta: Vec<f64> = (0..n)
        .map(|_| std::f64::consts::TAU * lcg(&mut s))
        .collect();
    let mut x = Array2::<f64>::zeros((n, p));
    for i in 0..n {
        x[[i, 0]] += theta[i].cos();
        x[[i, 1]] += theta[i].sin();
        for j in 0..p {
            x[[i, j]] += 0.05 * lcg_normal(&mut s);
        }
    }
    // The PeriodicHarmonicEvaluator maps coord t∈[0,1) to angle 2πt; seed the
    // coordinate at the true phase so the circle is perfectly aligned.
    let evaluator = Arc::new(PeriodicHarmonicEvaluator::new(3).unwrap());
    let coords = Array2::<f64>::from_shape_fn((n, 1), |(r, _)| theta[r] / std::f64::consts::TAU);
    let (phi, jet) = evaluator.evaluate(coords.view()).unwrap();

    let mut modes_checked = 0usize;
    for (mode_name, logit) in [
        ("ordered_beta_bernoulli", 3.0f64),
        ("ordered_beta_bernoulli", -4.0),
        ("softmax", 3.0),
        ("softmax", -4.0),
    ] {
        let mode = if mode_name == "ordered_beta_bernoulli" {
            AssignmentMode::ordered_beta_bernoulli(0.7, 1.0, false)
        } else {
            AssignmentMode::softmax(1.0)
        };
        // Perfect circle decoder: DC=0, cos-row→e0, sin-row→e1.
        let mut decoder = Array2::<f64>::zeros((3, p));
        decoder[[1, 0]] = 1.0;
        decoder[[2, 1]] = 1.0;
        let atom = SaeManifoldAtom::new_with_provided_function_gram(
            "circle".to_string(),
            SaeAtomBasisKind::Periodic,
            1,
            phi.clone(),
            jet.clone(),
            decoder,
            Array2::<f64>::eye(3),
        )
        .unwrap()
        .with_basis_second_jet(evaluator.clone());
        let logits = Array2::<f64>::from_elem((n, 1), logit);
        let assignment = SaeAssignment::from_blocks_with_mode_and_manifolds(
            logits,
            vec![coords.clone()],
            vec![LatentManifold::Circle { period: 1.0 }],
            mode,
        )
        .unwrap();
        let mut term = SaeManifoldTerm::new(vec![atom], assignment).unwrap();
        term.set_guards_enabled(false);
        let mut rho = SaeManifoldRho::new(0.0, 0.0, vec![Array1::<f64>::zeros(1)]);
        let rows_before: Vec<f64> = {
            let d = &term.atoms[0].decoder_coefficients;
            (0..d.nrows())
                .map(|r| d.row(r).iter().map(|v| v * v).sum::<f64>().sqrt())
                .collect()
        };
        term.run_joint_fit_arrow_schur(x.view(), &mut rho, None, 60, 1.0, 1e-6, 1e-6)
            .expect("K=1 circle fit");
        let rows_after: Vec<f64> = {
            let d = &term.atoms[0].decoder_coefficients;
            (0..d.nrows())
                .map(|r| d.row(r).iter().map(|v| v * v).sum::<f64>().sqrt())
                .collect()
        };
        let harm_before = (rows_before[1].powi(2) + rows_before[2].powi(2)).sqrt();
        let harm_after = (rows_after[1].powi(2) + rows_after[2].powi(2)).sqrt();
        eprintln!(
            "\n==== #2101 PROPER-CIRCLE-SEED SURVIVAL ({mode_name}, logit={logit}) ====\n  rows before = {:?}\n  rows after  = {:?}\n  harmonic ‖(cos,sin)‖: before={:.4} after={:.4}  (SURVIVES if after stays ~before; COLLAPSE if after≈0)",
            rows_before
                .iter()
                .map(|v| (v * 1000.0).round() / 1000.0)
                .collect::<Vec<_>>(),
            rows_after
                .iter()
                .map(|v| (v * 1000.0).round() / 1000.0)
                .collect::<Vec<_>>(),
            harm_before,
            harm_after,
        );

        // Invariant guards (mode-independent, #2101-outcome-independent):
        // the perfect-circle seed is exactly cos→e0, sin→e1, so its harmonic
        // norm before any fitting is √2.
        assert!(
            (harm_before - std::f64::consts::SQRT_2).abs() < 1e-9,
            "seed harmonic norm should be √2 for a perfect cos→e0/sin→e1 circle, got {harm_before}"
        );
        // The K=1 solve must keep the single atom and emit a finite decoder —
        // a vanished atom or a NaN/Inf row is a hard regression in the birth
        // path regardless of whether the circle rank-collapses (#2101).
        assert_eq!(
            term.atoms.len(),
            1,
            "K=1 circle fit ({mode_name}, logit={logit}) changed the atom count"
        );
        assert!(
            rows_after.iter().all(|v| v.is_finite()),
            "post-fit decoder rows non-finite ({mode_name}, logit={logit}): {rows_after:?}"
        );
        assert!(
            harm_after.is_finite(),
            "post-fit harmonic norm non-finite ({mode_name}, logit={logit})"
        );
        modes_checked += 1;
    }
    eprintln!("==== END #2101 SURVIVAL PROBE ====\n");
    assert_eq!(
        modes_checked, 4,
        "expected all four gate/logit modes to run"
    );
}