△ Mechanism confirmed, baseline not beaten 2026

Unexplained Topology Distillation

Implementation & benchmark of arXiv:2608.24549 — Persistent Cross Entropy

Usefulness6/10
Difficulty7/10
Novelty7/10

Source paper: Persistent Cross Entropy arXiv:2608.24549 ⓘ · analyzed Aug 29, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Add a directional persistent cross-entropy loss between teacher and student activation persistence diagrams. The loss assigns high probability to teacher topological events that the student reproduces, while accumulating the probability of unmatched teacher events in an explicit unexplained-event mass. This penalizes missing teacher structure without requiring teacher and student diagrams to have the same number of points.

Formulas

$$H(p_X,p_Y)=-\sum_{u\in D_X}p_X(u)\log p_Y(u)$$
$$H(p_X,p_X^Y)=-\sum_{u\in D_X}p_X(u)\log p_X^Y(u)$$
$$s(u,v)=\exp\!\left(-\frac{\|u-v\|_2^2}{2\sigma^2}\right),\quad a_i=\max_{1\le j\le n_S}s(u_i,v_j),\quad p_T^S(u_i)=p_T(u_i)a_i$$
$$\mathcal L_{\mathrm{PCE}}(T\to S)=-\sum_{i=1}^{n_T}p_T(u_i)\log\bigl(p_T(u_i)a_i+\varepsilon\bigr),\quad p_T^S(\partial)=1-\sum_{i=1}^{n_T}p_T(u_i)a_i$$

Mathematical statement

The paper starts from the ordinary cross-entropy expression $H(p_X,p_Y)=-\sum_{u\in D_X}p_X(u)\log p_Y(u)$, which is invalid when $p_X$ and $p_Y$ are defined on different persistence diagrams $D_X$ and $D_Y$. It instead constructs an induced probability $p_X^Y$ on $D_X\cup\{\partial\}$, where $\partial$ denotes an unexplained event, and evaluates $H(p_X,p_X^Y)=-\sum_{u\in D_X}p_X(u)\log p_X^Y(u)$. For an implementable neural adaptation, let $D_T=\{u_i\}_{i=1}^{n_T}$ and $D_S=\{v_j\}_{j=1}^{n_S}$ be teacher and student persistence diagrams, let $w_T(u_i)\ge 0$ be teacher persistence weights, and define $p_T(u_i)=w_T(u_i)/(\sum_k w_T(u_k)+\varepsilon)$. Let $s(u_i,v_j)\in[0,1]$ be a similarity kernel between diagram points, for example $s(u,v)=\exp(-\|u-v\|_2^2/(2\sigma^2))$. Define the explanation score $a_i=\max_j s(u_i,v_j)$. The induced student-explained probability is $p_T^S(u_i)=p_T(u_i)a_i$, while $p_T^S(\partial)=1-\sum_i p_T^S(u_i)$. Because $0\le a_i\le1$, this is a valid probability measure. The directional PCE loss is $\mathcal L_{\mathrm{PCE}}(T\to S)=-\sum_i p_T(u_i)\log(p_T(u_i)a_i+\varepsilon)$. Its excess over teacher entropy is $\mathcal L_{\mathrm{PCE}}-H(p_T)=-\sum_i p_T(u_i)\log(a_i+\varepsilon)$, which directly penalizes unexplained teacher events. The paper identifies the unexplained mass $p_T^S(\partial)$ with the total variation distance between the induced measure and the original teacher measure under this construction.

Implementation notes

1. Integration point: choose one or more intermediate feature tensors from a teacher and student, for example the spatial activation map after each residual block. For each channel, sample a small 2D or 3D cubical filtration from activation values and compute a persistence diagram containing birth-death points $u=(b,d)$; use persistence $d-b$ as the raw event weight. To keep the first prototype cheap, compute diagrams only for a random subset of batch examples and channels, or use a differentiable persistence implementation with gradients through point coordinates. 2. Pseudocode: given teacher features $F_T$ and student features $F_S$, construct diagrams $D_T,D_S$; set $w_i=\max(d_i-b_i,0)$ and $p_i=w_i/(\sum_k w_k+\varepsilon)$; for every teacher point compute $a_i=\max_j\exp(-\|u_i-v_j\|_2^2/(2\sigma^2))$; compute $L_{PCE}=-\sum_i p_i\log(p_i a_i+\varepsilon)$; optimize $L=L_{task}+\lambda(L_{PCE}-H(p_T))$. Stop gradients through the teacher diagram. 3. Computed from the paper’s mathematics: the event-space mismatch handling, induced probability, unexplained mass, and directional cross-entropy. Estimated empirically: persistence diagrams, the bandwidth $\sigma$, the teacher weights, and the coefficient $\lambda$. Estimate $\sigma$ as the median pairwise distance between teacher and student diagram points in the first training epoch, then optionally learn a positive per-layer bandwidth. Replace the nondifferentiable max with a temperature-controlled soft maximum, $a_i=\tau\log\sum_j\exp(s(u_i,v_j)/\tau)$ followed by clipping to $[0,1]$, if gradient stability is poor. 4. First experiment: distill a ResNet-50 teacher into a ResNet-18 student on CIFAR-100 or ImageNet-100, comparing ordinary logits plus feature-MSE distillation against the same setup with $L_{PCE}$ at one middle feature layer. Sweep $\lambda\in\{0.01,0.1,1\}$ and retain only diagrams with persistence above a small threshold. Measure top-1 accuracy, calibration, and accuracy under reduced-data training. A successful signal is higher student accuracy at equal training FLOPs, especially when the student has substantially fewer channels, together with decreasing teacher unexplained mass $p_T^S(\partial)$ and lower validation loss. An ablation should verify that reversing the direction to $S\to T$ or replacing PCE with a symmetric diagram distance removes or weakens the gain.

Verification

Mechanism confirmed, baseline not beaten

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Confirmed ✓

Stage 2 · Practical benchmark result: Inconclusive

Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works

Stage 1 — Mechanism check agent confidence 6/10

Built a compact directional PCE prototype for unequal-size persistence diagrams, including teacher persistence weighting, Gaussian explanation scores, induced unexplained-event mass, and optimization against a Chamfer control. The probability validity check passed and the excess identity error was 1.8e-7. In the main run unexplained mass fell from 0.488 to 0.147 with PCE versus 0.271 with Chamfer; across three additional starts PCE was better in two of three, giving a modest but promising signal rather than definitive evidence.

Agent confidence
6/10
Baseline
Chamfer control: main final unexplained mass 0.2712, excess 0.3548; repeated-start mean unexplained mass 0.2085
Idea
Directional PCE: main final unexplained mass 0.1471, excess 0.1772; repeated-start mean unexplained mass 0.1609; probability validity true; excess identity absolute error 1.79e-7

Limitations: This is a toy diagram-point optimization, not a CNN distillation experiment: no cubical-complex persistence computation, real activation tensors, classification task, differentiable persistence backend, bandwidth sweep, FLOP/accuracy measurement, calibration analysis, or reverse-direction ablation was tested. The control is a symmetric Chamfer diagram matching objective, and the repeated-start advantage was not universal.

How to run: python3 pce_experiment.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.24549)

Ahead of the baseline (−2.2%) but not statistically significant (p=0.1876, wins 5 / 8 paired seeds).

Benchmark
Vision (image classification)
Model
cnn_small
Paired seeds
8
Baseline mean
0.8244
Idea mean
0.8062
Effect (Δ)
-0.0181 (−2.2%; negative = idea better)
Wins
5 / 8 paired seeds
p-value
0.1876 (permutation test, 20 000 shuffles)
Smallest detectable effect
±3.6%
Mechanism
Confirmed ✓
Practical effect
Inconclusive
Baseline tuning
swept over 3 configs
Limitations:

Only the registered vision track was tested, using 400 training examples, 200 test examples, and 5 epochs. The persistence computation is a differentiable activation-range surrogate rather than a full cubical-complex persistence backend. No reverse-direction ablation, bandwidth sweep beyond fixed sigma, calibration metric, augmentation, or larger-scale CNN experiment was run.

How to run: python3 stage2_bench.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Stage 2 — Benchmark latest Failed ✗

Agent confidence: 9/10

Implemented and ran the full registered vision benchmark with directional PCE versus feature-MSE using the shared cnn_small architecture. PCE improved mean test error from 0.824375 to 0.806250, but the paired permutation test was not significant (p=0.1876), so the idea does not meet the benchmark win criterion. The trained-model mechanism signature was confirmed because unexplained mass was lower for PCE than baseline.

Baseline
Mean test error 0.824375, std 0.046060; best baseline sweep config lr=0.003, coef=0.1.
Idea
Mean test error 0.806250, std 0.030285; delta=-0.018125; 5/8 paired wins; p=0.1876; unexplained mass mean 0.021785 versus baseline 0.120660.

Benchmark result

Ahead of the baseline (−2.2%) but not statistically significant (p=0.1876, wins 5 / 8 paired seeds).

Benchmark
Vision (image classification)
Model
cnn_small
Paired seeds
8
Baseline mean
0.8244
Idea mean
0.8062
Effect (Δ)
-0.0181 (−2.2%; negative = idea better)
Wins
5 / 8 paired seeds
p-value
0.1876 (permutation test, 20 000 shuffles)
Smallest detectable effect
±3.6%
Mechanism
Confirmed ✓
Practical effect
Inconclusive
Baseline tuning
swept over 3 configs
Limitations:

Only the registered vision track was tested, using 400 training examples, 200 test examples, and 5 epochs. The persistence computation is a differentiable activation-range surrogate rather than a full cubical-complex persistence backend. No reverse-direction ablation, bandwidth sweep beyond fixed sigma, calibration metric, augmentation, or larger-scale CNN experiment was run.

How to run: python3 stage2_bench.py

Artifacts

Implementation overview ⬇ Download all as ZIP 6 files · code, reports and structured results