A Counterexample to the Tang Zhang Schatten Norm Conjecture and Sharp Positive Results

arXiv:2608.15558 2026 Optimizer 1 ideas extracted · analyzed Sep 1, 2026

What the math gives to ML

The paper studies a dimension-free inequality for aggregating matrix summands, comparing the Schatten norm of a signed sum with the Schatten norm of the sum of positive operators |A_k|. The transferable asset is a principled budget for merging rank-one or low-rank parameter updates while accounting for noncommutative alignment and cancellation, rather than clipping each update independently. This suggests a stability mechanism for LoRA, adapter merging, and rank-one optimizer updates. The counterexample at p=3/2 is also practically useful: the closed-form constant should be used only in the proven p>=2 regime, with lower-p settings treated as empirical heuristics.

Ideas from this paper

Unverified 2026

Schatten-budgeted low-rank update aggregation

Replace ordinary Frobenius-norm clipping when merging rank-one LoRA or adapter updates with a Schatten-budget computed from the positive operators |A_k|. For p>=2, the paper's sharp rank-one inequality bounds the norm of the merged update, including interactions between updates that are missed by independent per-update clipping.

Useful6/10
Difficulty4/10
Novelty8/10
Paper: A Counterexample to the Tang Zhang Schatten Norm Conjecture and Sharp Positive Results arXiv:2608.15558