arXiv:2511.02496v2 Announce Type: replace Abstract: We study latent geometry as an explicit component of representation quality in data-scarce learning. For an encoder (\phi), we define (Q_{\beta,\gamma}(\phi)=I(\phi(X);Y)-\beta\mathcal C(\phi)-\gamma d_{\mathrm{int}}(\phi)), combining task-relevant information with penalties for curvature and intrinsic latent dimension. Thus geometry becomes part of the bottleneck criterion, not only a post hoc diagnostic. Under smooth-manifold, loss-transfer, and estimator-concentration assumptions, we derive non-asymptotic low-label generalization bounds wh
Source: arXiv cs.LG — read the full report at the original publisher.