CORTEXA
← Browse
arxivcs.LGmath.ST2026-07-18

Honest Physical-Support Inference after Latent Dictionary Learning: Collision Singularities and Minimax Resolution

Guan-Ju Peng

Sparse-support uncertainty is usually quantified by treating the dictionary as known, an assumption that can produce overconfident, label-dependent conclusions when the dictionary is learned from latent sparse mixtures. Near collisions of coherent atoms, a test signal may identify the active physical group even though the training data cannot distinguish the physical rays within it. We develop inference for active physical rays, unit atoms modulo sign, after latent dictionary learning. In a fixed-dimensional Gaussian train-test experiment, we retain all dictionaries compatible with a robust training-moment region, profile the test representation over them, and project surviving configurations onto a permutation-invariant support space. The resulting confidence correspondence can report cross-sheet inconclusiveness, group resolution with child ambiguity, or fine-support resolution. We characterize both its statistical cost and decision-theoretic benefit. Residual block orientation first affects the latent training density at cubic order, yielding information of order $s^6$, where $s$ is the within-block collision scale. The correspondence provides high-probability-over-training conditional test coverage, with resolution governed separately by parent detectability, test-time support separation, and learned-dictionary orientation. In the resolved fixed-shell regime, its projective Hausdorff diameter contracts at the minimax-optimal rate $s \wedge (\sqrt{N}s^2)^{-1}$, up to constants. A restricted-task theorem further determines when coefficient asymmetry allows test replication to supplement training information and when calibration uncertainty remains irreducible. The framework thus yields honest, resolution-adaptive support statements and guides the allocation of training versus test measurements.

View free PDFSource page

Related papers

arxivmath.STcs.LGstat.MEstat.ML2026-07-31

Differentially Private Nonparametric Modal Learning with Applications to Regression and Clustering

Arkajyoti Bhattacharjee, Arnab Auddy

Density modes provide a localized and interpretable summary of multimodal distributions, but their estimation under rigorous differential privacy constraints remains largely unexplored. We study differentially private recovery of density modes for multivariate distributions under…

View free PDFSource page
arxivcs.LGmath.STstat.ML2026-07-24

Beyond Negative-Ridge Endpoints: Mixed-Sign Spectral Regularization via Negative-Shifted Gradient Descent

Peng Zhao

In overparameterized linear regression, many weak spectral directions act like a ridge penalty on the signal-bearing spectrum; negative ridge is the natural correction, pushing filters above one. The stable negative-ridge endpoint, however, is structurally limited: its pole must…

View free PDFSource page
arxivstat.MLcs.LGmath.NAmath.ST2026-07-31

Simple-regret rates and minimax optimality of fixed-prior expected improvement in Matérn and squared-exponential RKHSs

Emmanuel Vazquez, Sébastien Petit

We study the expected improvement (EI) policy for minimizing a deterministic objective function $f$ on a nonempty compact set $\mathcal X \subset\mathbb R^d$. We assume that $f$ belongs to the RKHS $\mathcal H_k$ of a continuous positive-semidefinite kernel $k$ on $\mathcal X$. F…

View free PDFSource page
arxivcs.LGphysics.comp-ph2026-07-24

Latent PDE mapping for efficient physics-informed learning across geometries with limited data

Ingvild Askim Adde, Mary M. Maleckar, Gabriel Balaban

In this study, we introduce latent PDE mapping, a broadly applicable physics-informed learning technique designed to enable efficient geometric generalization with sparse training data. Latent PDE mapping pulls back geometry-specific PDE residuals and boundary conditions to a pre…

View free PDFSource page
arxivcs.LGastro-ph.COastro-ph.GAhep-exhep-phstat.ML2026-07-23

An Introduction to Bayesian and Frequentist Simulation-Based Inference with Machine Learning

Maximilian Dax, Theo Heimel, Gilles Louppe

Simulation-based inference (SBI) with machine learning is an increasingly important tool for solving inverse problems in science and engineering, including parameter inference and the inversion of detector effects. We provide an overview of the Bayesian and frequentist statistica…

View free PDFSource page