cs.LGJun 12, 2026

The Geometry of Saturation: Effective Rank Predicts When Labels Stop Helping in Few-Shot Classification

Authors: Arnav Gupta

Organizations: Independent Researcher, Nepal

Abstract

Few-shot label acquisition lacks a label-free signal for when additional labels cease to improve accuracy: existing stopping criteria either require a held-out validation set (violating the few-shot premise) or rely on theoretically ungrounded heuristics, so we introduce the spectral saturation index S(K)=erank(Σ^W(K))/KS(K)=\mathrm{erank}(\hatΣ_W^{(K)})/K, the exponential spectral entropy of the pooled within-class covariance normalized by per-class support size KK, which measures the exploration rate per label and falls below a fixed threshold τ=0.02τ=0.02 once the explored spectral subspace saturates and marginal accuracy gains vanish; across 49 real tasks (binary, 5-way, 10-way) and three frozen backbones (PCA-50, CLIP ViT-B/32, DINOv2 ViT-S/14), S(K)S(K) correlates strongly with the marginal gain on doubling the support set (ρpool=0.6366ρ_{\text{pool}}=0.6366, p=2.9×1057p=2.9\times10^{-57}, cluster-bootstrap 95% CI [0.551,0.720][0.551,0.720]), a fixed τ=0.02τ=0.02 classifies stop/continue decisions with cluster-bootstrap AUC=0.787\mathrm{AUC}=0.787 (95% CI [0.713,0.860][0.713,0.860]) with high recall on meaningful gains (ΔA>1%ΔA>1\%), and a partial correlation controlling for logK\log K yields ρpartial=0.324ρ_{\text{partial}}=0.324 (p=1.65×1013p=1.65\times10^{-13}), confirming S(K)S(K) carries spectral information beyond shared KK-dependence; theory predicts this from first principles, since the population effective rank sets the saturation scale Ksaterank(ΣW)/τK_{\text{sat}}\approx\mathrm{erank}(Σ_W)/τ, τ=0.02τ=0.02 sits at the boundary between the first and second descent (Nakkiran et al., 2021), and O(1/K)O(1/K) bias in the sample effective rank explains the small-KK hump in S(K)S(K); for unregularized linear probes (C=C=\infty), practitioners should halt when S(K)<0.02S(K)<0.02 (PCA-50, hard stop) or monitor S(K)S(K) dropping from 0.30.05\sim0.3\to0.05 (foundation models, diminishing-returns signal), with computation costing 1\sim1 ms at d=50d=50.

Explore similar work

Sep 16, 2026cs.LG

How Many Labels Does Model Choice Need? Certificates and Budgets for Selective Prediction

Classifiers can make identical predictions yet require labels to compare their selective performance: confidence ranks weight the same errors differently. We quantify this requirement for the area under the generalized risk-coverage curve (AUGRC). A prelabel lower bound rules out insufficient budgets. With all labels known, a covering linear program bounds the minimum number of labels sufficient to fix the winner (the certificate size) within K1K-1 labels for KK candidates. For fixed KK, independent uniform orders and identical predictions, the prelabel bound approaches one quarter of the pool. With iid Bernoulli errors independent of the orders, every exact acquisition policy reads almost all labels asymptotically, although a two-candidate certificate needs only half. Across 108 feature-panel comparisons on nine datasets, disagreement labels settle every accuracy choice but no AUGRC choice. A 20% budget is ruled out in 96 conditions; certificates need 56-57% on average. On ten conditions with pretrained image classifiers, confidence-score choice reads 68-91% of 10,000 labels for exact selection and 50-67% with AUGRC tolerance 5×1045\times10^{-4}. An exact stopping test works with any acquisition order. Together, these results link confidence ranks to label budgets and certified model comparison.
Tetsuji Kuboyama
Sep 14, 2026cs.LG

Sharp Rates and a One-Line Correction for Spectral Representation Learning

A self-supervised encoder is trained once, frozen, and reused through lightweight probes on tasks nobody named at training time; the practitioner's question is when the off-the-shelf features are good enough and when they need fixing. Canonical correlation analysis, HGR maximal correlation, and the population optimum of the spectral contrastive loss all return the top-kk singular subspace of a cross-view dependence operator, justified by isotropy: if the task prior has no directional preference, that subspace is universally optimal. We show isotropy is the wrong hypothesis. The prior enters the transfer risk only through the task covariance Λ=E[ΔΔ]Λ=\mathbb{E}[ΔΔ^\top], and only through its compression onto the operator's leading singular directions; what matters is not whether ΛΛ is isotropic but whether its preferred directions are ordered consistently with the operator's spectrum. We prove matching two-sided rates---worst-case regret is exactly 11/κ(Λ)1-1/κ(Λ), refines to 1Ak1-A_k for an alignment coefficient AkA_k, localizes to the top-2k2k subspace, becomes second order under a spectral gap, and is improvable by no task-agnostic representation---and show why alignment is generic: incoherent preferences cancel in high dimension, and TT diverse tasks force α=O~(dx/T)α=\widetilde O(\sqrt{d_x/T}), a quantitative account of why task diversity, not symmetry, makes self-supervised features transfer. The governing statistics cost O(kdx2)O(kd_x^2), and when they signal misalignment a one-line reweighting of the positive-pair term provably restores exact optimality. The result is a diagnostic that answers the practitioner's question from a small labelled budget and refuses when the task bank cannot support the width requested; on controlled data it takes a regret of 0.860.86 down to 0.0030.003, and on a CIFAR-100 encoder it correctly predicts that no correction is needed.
Dier Tang, Jing Yee Tan, Guangyue Han
May 5, 2026cs.LG

Rethinking the Rank Threshold for LoRA Fine-Tuning

A recent landscape analysis of LoRA fine-tuning in the neural tangent kernel regime establishes a sufficient condition r(r+1)/2>KNr(r+1)/2 > KN on the LoRA rank rr for the absence of spurious local minima under squared-error loss, prescribing r12r \geq 12 on canonical few-shot RoBERTa setups. The condition is stated for general output dimension KK, so its sharpness in any particular regime, and its practical implication for the cross-entropy loss actually used in fine-tuning, are open. We give three results that together reduce the prescribed rank to r=1r = 1 for binary classification in this regime. First, replacing the symmetric Sard-form count with the non-symmetric LoRA manifold dimension yields a strictly weaker capacity requirement, r(m+n)r2>CKNr(m+n) - r^2 > C^* \cdot KN with C1.35C^* \approx 1.35 under Gaussian-iid features, satisfied at r=1r = 1 on canonical setups. Second, in the cross-entropy setting the Polyak--Łojasiewicz inequality removes the rank threshold entirely. Third, a Rademacher-complexity bound predicts rank-one variance optimality precisely when the bias term is saturated, which is the case for binary classification but not for K>2K > 2. Empirically, across four GLUE-style binary tasks, three encoder architectures, and at scale on RoBERTa-large, rank one is competitive with the existing prescription r=12r = 12; on multi-class MNLI the optimal rank shifts above one, also as predicted. The binary-regime guarantees are conditional on standard NTK assumptions; the multi-class extension is left to future work.
Juneyoung Park