Trimmed One-Sided Observable Domination
Implementation & benchmark of arXiv:2608.12749 — Extensions of One-Sided Box Geometry and Pyramid Invariants to gd-Sets and qm-Spaces
Source paper: Extensions of One-Sided Box Geometry and Pyramid Invariants to gd-Sets and qm-Spaces arXiv:2608.12749 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Add an asymmetric distillation loss that requires target or teacher observables to be approximable by source or student observables on only a 1-epsilon mass subset of a coupling. Unlike symmetric feature alignment, the student is penalized only for failing to reproduce target functions on well-matched mass, making the objective robust to outliers, label noise, and partial domain mismatch. The inner minimization allows each target observable to select its best source probe rather than forcing a fixed coordinate-to-coordinate correspondence.
Formulas
Mathematical statement
The paper defines approximate domination Y preceq_epsilon X when there exist a coupling pi in T(mu_X,mu_Y) and a closed relation S subset X times Y with pi(S) at least 1-epsilon such that 2 sup over g in the closure of F_Y, inf over f in the closure of F_X, and sup over (x,y) in S of |g(y)-f(x)| is at most epsilon. Here X is the student representation space with probability measure mu_X, Y is the teacher or target representation space with measure mu_Y, pi is a joint coupling whose marginals are mu_X and mu_Y, S is the retained high-mass set of matched pairs, and F_X and F_Y are families of scalar observables. The one-sided distance is Box_preceq(Y,X) = inf{epsilon >= 0 : Y preceq_epsilon X}. The construction is asymmetric: every target observable g only needs one best source observable f, and errors are measured uniformly on S. A finite neural adaptation replaces the supremum over function families by a maximum over K target probes and the infimum by a minimum over M student probes, while replacing the hard relation S by a coupling mask containing at least 1-epsilon probability mass.
Implementation notes
Integrate this as an auxiliary loss during teacher-student distillation or cross-domain fine-tuning. Let h_theta(x_i) be the student embedding for source minibatch examples x_i, and let y_j be teacher embeddings or target-domain examples. Construct a minibatch cost C_ij = ||W h_theta(x_i) - y_j|| squared divided by tau, then compute an entropic Sinkhorn coupling pi_ij with uniform marginals. Retain a mask S containing the lowest-cost pairs whose total coupling mass is at least 1-epsilon. Use K frozen teacher scalar probes g_k(y) and M trainable student probes f_m(h_theta(x)), such as linear probes or small two-layer MLPs. For every teacher probe k, compute the maximum absolute error over retained pairs for each student probe m, select the minimum over m, and then take the maximum over k. This implements the finite version of the paper's supremum-infimum-supremum expression. Use log-sum-exp for the outer maximum and softmin for the inner minimum during early training, then optionally switch to hard selections. Recompute the coupling and mask each minibatch. Stop gradients through hard top-mass selection, or use a differentiable mask q_ij = sigmoid((r-C_ij)/eta), with threshold r chosen so the weighted mass is 1-epsilon. The paper supplies the one-sided direction, retained mass, and nested max-min error; Sinkhorn temperature, probe architecture, and soft masking are engineering approximations. First test on CIFAR-10 or an Office-31 domain-adaptation split using a ResNet-18 student and a larger frozen teacher. Compare standard MSE distillation, symmetric CORAL or MMD alignment, and this loss with epsilon in {0, 0.05, 0.2}. Measure target accuracy, worst-group accuracy, sensitivity to injected outlier pairs, and gradient variance. Success means higher target accuracy and less degradation under 10 to 20 percent mismatched or corrupted pairs at comparable FLOPs.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.