Boundary Mass in Feature Space as a Label-Budget Diagnostic for Representations

Siming Zhang, Zhehui Shen, Shijie Chen, Yansen Yu, Hang YuarXiv 2026 · arXiv

When transferring a pre-trained model to a new task, we often ask: "Is this representation good?" Standard metrics like LogME or NCE give us a global "yes" or "no." But a more practical question for engineers is: "How many labels will I actually need to buy to make this work?"

This paper from researchers at Shanghai University introduces effective boundary complexity ($\psi_{eff}$), a diagnostic tool that looks at the "local burden" of a representation. Instead of measuring global alignment, it counts how much data mass is trapped in the ambiguous region near the decision boundary—the exact place where scarce labels are most expensive.

TL;DR

The authors propose "effective boundary complexity," a metric that measures data density near a decision boundary to predict the label budget required for downstream tasks. They prove a "pushforward law" showing that only geometric changes perpendicular to the boundary affect label demand, providing a precise tool for selecting the best pre-trained backbones when labels are scarce.

What Problem Does This Paper Address?

In few-shot or low-label learning, the difficulty of a task is often determined by the "ambiguity" of the examples. If a pre-trained model (a "backbone") clusters classes far apart, you only need a few labels to find the dividing line. If the classes overlap or sit densely near the boundary, you need many more labels to resolve the uncertainty.

Existing transferability scores are great at shortlisting candidates, but they often fail to distinguish between two backbones that have similar global accuracy but different "label demands." This paper fills that gap by providing a local geometric measurement of the feature space.

Operational label-budget evaluation: comparing two backbones for a Cat vs. Dog task. Backbone A has fewer samples near the boundary, leading to a lower label budget.

Methods

The core contribution is the definition of effective boundary complexity ($\psi_{eff}$). It measures the probability mass in a thin "tube" around the learned decision boundary, normalized by class balance to ensure that minority classes aren't unfairly penalized.

The Pushforward Law

The authors derive a mathematical "Pushforward Law" to explain how feature transformations affect this mass. They prove that under a smooth map, changes in data density and tangential stretching (stretching along the boundary) actually cancel each other out at first order.

The only factor that truly matters is boundary-normal stretch or compression. If you stretch the features in a direction perpendicular to the boundary, you effectively "thin out" the boundary tube, making the task easier for a low-label learner.

Figure 2: Boundary mass and the pushforward mechanism. A boundary tube measures probability mass near the learned decision boundary. Under a smooth feature map T, the pushed density and tangential surface Jacobian cancel, leaving the inverse-transpose normal factor ∥DT(x)−⊤n(x)∥in the transformed boundary mass. Boundary-normal changes affect the first-order tube coefficient; tangent-only changes preserve it.

Practical Estimators

To make this usable, the authors provide:

  1. A hard-tube estimator: Simply counts held-out features within a certain distance ($\epsilon$) of the boundary.
  2. A Gaussian-kernel estimator ($D_{ker}$): A more robust version used for backbone ranking.
  3. A differentiable surrogate: A smooth version of the metric that can be added to a loss function to actively "push" data away from the boundary during training.

Datasets

The researchers validated their theory across several settings:

  • Synthetic 2D distributions: Used to verify the mathematical "Pushforward Law" with high precision.
  • CIFAR-100 & Tiny-ImageNet: Used for real-world frozen feature evaluation and multiclass experiments.
  • ImageNet-1k: Used as the source for pre-trained backbones (ResNet-50, ViT-B/16, etc.).

Key Insights and Ideas

  • Tangent vs. Normal: The most striking insight is that stretching data along the boundary doesn't help. You must increase separation across the boundary. This was empirically confirmed: normal expansion significantly lowered the label budget, while tangent expansion had almost zero effect.
  • The "Tie-Breaker" Diagnostic: Boundary mass is most useful as a "second-stage" diagnostic. When two backbones have nearly identical global transferability scores, the one with the lower $\psi_{eff}$ will almost always require fewer labels to reach the same target accuracy.
  • Label Budget Correlation: The metric shows high correlations (0.779–0.830) with the actual realized label budgets across different active learning sampling policies (Random, Uncertainty, and Hybrid).

Key Results

  • Mathematical Accuracy: In synthetic tests, the measured boundary mass matched the theoretical prediction across 74 different transformations with a median relative error of only 0.38%.
  • Label Efficiency: In experiments on real features, normal expansion reduced the mean label budget by 1.54 samples per class (spc), while tangent controls changed it by a negligible +0.02 spc.
  • Backbone Selection: Using $\psi_{eff}$ to choose between "near-tied" backbones reduced selection "regret" (the extra labels wasted by picking the wrong model) by nearly half in some scenarios.
  • Controllability: Using the differentiable surrogate as a regularizer reduced boundary complexity by 16–36% while maintaining the same top-1 accuracy.
Figure 3: Finite-sample validation of the pushforward law. Predicted and measured boundary mass agree across controlled transformations; the orientation sweep shows the boundary-normal factor ∥DT −⊤n∥directly. Across 74 transformations, median relative error is 0.38% and mean relative error is 0.50%.

Limitations and Future Work

  • Smoothness Assumptions: The theoretical proofs rely on the representation maps and boundaries being smooth ($C^1$ or $C^2$). While it works well in practice on ReLU networks (which are piecewise linear), the theory for "kinked" boundaries is handled as a supplementary extension.
  • Linear Probes: The current work focuses heavily on linear probes. While the authors suggest the logic applies to non-linear heads, the primary empirical evidence is in the linear regime.
  • Computational Cost: While calculating the metric on cached features is very fast, the initial "fitting" of a probe to define the boundary is still required.

This work provides a solid geometric foundation for understanding why some representations are "easier" to learn than others, offering a practical way to triage models before committing to expensive human labeling.

Summary updated

Abstract

Low-label transfer is often decided by a practical question: after a representation looks useful, how many labels are still needed to learn the downstream boundary? Transferability and probe-quality scores characterize global alignment, likelihood, margins, and calibration. Boundary-near target mass complements these diagnostics by measuring the ambiguous regions where scarce labels are most costly. We propose effective boundary complexity, a label-budget diagnostic for frozen representations and linear probes. It measures mass in a thin strip around the learned boundary and normalizes it by class balance, so dense ambiguous regions and predicted-class imbalance are both counted. We prove that, under a smooth representation map, density change and tangential surface change cancel at first order, leaving boundary-normal stretch or compression as the governing factor. This yields a cached-feature estimator that fits a probe on one split and counts independent held-out features near its boundary. Experiments support the diagnostic at three levels. Controlled transformations match the predicted law across 74 maps with 0.38% median relative error. On real frozen features, normal-direction changes move both measured boundary mass and label demand, while tangent controls preserve the first-order coefficient. A differentiable surrogate reduces measured complexity by 16-36% at matched top-1 utility. Finally, CIFAR-100 and Tiny-ImageNet experiments support boundary mass as a second-stage diagnostic for near-tied representations. Five-way experiments show strong OvR-interface backbone-ranking agreement (Spearman 0.872), while acquisition experiments show high correlations between initial boundary mass and realized label budgets across three sampling policies (0.779-0.830). Code is available at https://github.com/qqaqq-code/boundary_mass.
BibTeX
@misc{zhang2026boundary,
  author = {Siming Zhang and Zhehui Shen and Shijie Chen and Yansen Yu and Hang Yu},
  title = {{Boundary Mass in Feature Space as a Label-Budget Diagnostic for Representations}},
  year = {2026},
  eprint = {2611.11525},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.11525},
}
Figure