Skip to content
Preprint

$\beta$-VAEs as Effective Theories: Tolerance-Dependent Dimension

Aug 2026 · 0 citations · 19 references
Computer Science

TL;DR

It is found that nonlinear interactions shift and broaden collapse onsets, so thresholds no longer coincide exactly with utilities, but the common ordering is preserved over the resolved ranks, so the spectral cutoff still acts as a utility cutoff and the effective-description logic carries through.

Abstract

In a $\beta$-VAE, increasing the regularization strength acts as a spectral cutoff by collapsing low-utility latent coordinates. In the linear Gaussian VAE, the collapse order matches the ranking of reconstruction utilities exactly, because both are set by the PCA spectrum. We ask which parts of this picture survive in fully connected nonlinear VAEs trained on WorldClim. We find that nonlinear interactions shift and broaden collapse onsets, so thresholds no longer coincide exactly with utilities. However, the common ordering is preserved over the resolved ranks, so the spectral cutoff still acts as a utility cutoff and the effective-description logic carries through. The resulting effective-dimension curves reveal a head--tail tradeoff: increasing depth concentrates utility into the first few coordinates but worsens tail fidelity.

View source

Similar papers

#machine learning Preprint Oct 2026

Drive vs. Decay: On the Training Dynamics of Joint-Embedding Predictive Architectures

Joint-Embedding Predictive Architectures (JEPAs) are prone to representation collapse, typically mitigated through empirical heuristics. We develop an early-training stability theory that unifies these heuristics. Linearising the coupled JEPA gradient flow around the trivial fixed point reveals two competing effects: a...

José Lucas De Melo Costa, S. Ahn, Fabrice Popineau et al. · 0 citations
#natural language process... Preprint Aug 2026

Beyond Polarization: The Generative Constraint of Chain-of-Thought in Pointwise Reranking

These findings suggest that, within the pointwise scoring paradigm, routing continuous relevance semantics through discrete text constrains ranking signal resolution reveals a bottleneck that is stable and difficult to overcome under current standard methods, rather than an easily resolvable training bias.

Xiaoyang Chen, Jie Liu, Hai-Jin Liang et al. · 0 citations
#machine learning Preprint Sep 2026

Structured Features Overfit Where Random Features Grok

Xu, Vardi and Safran (ICML 2026) prove that over-parameterized ridge regression over an unstructured random Gaussian feature map groks, with the delay between memorization and generalization growing as $1/\lambda$ in the weight decay. We show that on a structured feature map the same delay does not appear. For a band-l...

Chon-Fai Kam, M. Bessafi, Frédéric Cadet · 0 citations
#machine learning Preprint Oct 2026

The Identifiability and Observability of Deep Normalized Attention

We study which parameters of deep, unmasked, single-head attention are determined by its input--output function. For known positive nonconstant real-analytic normalizers, the function generically determines the effective scores and combined value map up to the signs induced by even normalizers. This proves the real-ana...

Pranav Venkata Konda · 0 citations
#machine learning Preprint Sep 2026

$\lambda$-JEPA Spectral Anti-Collapse Regularization for Self-Supervised Learning

This work introduces SACReg, a spectral anti-collapse regularizer motivated by an analysis of $\lambda$-balance, which captures the relative scale of weight matrices across layers, and proposes $\lambda$-JEPA, which improves over LeJEPA and VISReg on ImageNet-1k classification and in average linear-probe transfer perfo...

Berker Demirel, C. Dominé, Valentino Maiorca et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.