arXiv Machine Learning By Pranav Varshney

Cosine Similarity Is Not Evidence: Measuring the Noise Floor of Interpretability Transfer Under Quantization

Read the original on arXiv Machine Learning →

The paper argues that reporting scale‑invariant statistics such as cosine similarity without their noise floor is misleading when evaluating interpretability transfer from full‑precision to quantized neural networks. It derives a closed‑form expression for the expected cosine similarity based on a dimensionless parameter κ = n ho^2/d, measures the class separation ρ on real activations, and shows that a reported cosine of 0.996 between full‑precision and INT4 models cannot be interpreted as preservation without knowing the sample size n. The authors demonstrate that at INT4 the direction of the interpretability artifact rotates beyond the estimator’s own noise, while at INT8 no significant movement is detected, and they highlight that scale‑invariant metrics cannot distinguish between translation and attenuation of a transferred decision variable.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 19

Detecting and Discriminating Operator Misspecification in Hybrid PDE-Parameter Learning: a Reference-Free Instrument, with Discrimination Bounded In Sample

The paper introduces a reference‑free instrument that, from a single fit and without an oracle, can detect whether a hybrid PDE‑parameter estimator’s assumed operator is misspecified and distinguish this from mere parameter unidentifiability. In a self‑adjoint parabolic inverse problem, the proposed information‑matrix statistic correctly identifies misspecification with low false‑positive rates, while remaining silent when the design is correctly specified but non‑identifiable. The study demonstrates that conventional accuracy checks can miss significant operator errors, and it maps out the instrument’s blind spots and conditions under which its guarantees hold.

By Eric Fock
arXiv AI
Jul 1

Why Do Few-Step Text Latents Fail When Image Latents Work? Non-Commitment at Sharp Categorical Readouts

arXiv:2606. 30705v1 Announce Type: cross Abstract: Deterministic few-step generation succeeds on continuous image latents but collapses to incoherent text on continuous text latents, and we show the cause is geometric rather than a training or scaling deficiency: a smooth, regularity-limited deterministic map cannot resolve a discrete branch choice before a sharp categorical readout, so few-step failure is governed by decoder sharpness, not transport accuracy.

By Zhongyao Wang