CORTEXA
← Browse
arxivmath.PRcs.LGmath.ST2026-07-05

Boundary-layer asymptotics for Gaussian-smoothed singular measures

Nicolas Brosse, Arnak S. Dalalyan

We study the small-noise asymptotics of Euclidean heat regularizations of probability measures supported on manifolds with corners. Near a boundary or corner stratum, the relevant regime is a conical boundary layer in which the observation point approaches the stratum at the same scale as the Gaussian smoothing parameter. After rescaling this layer, the support is replaced to leading order by its inward tangent cone. We prove a two-term expansion for the heat-regularized density in this regime. The leading coefficient is the Gaussian mass of the linearized cone, weighted by the density on the support and by the adapted corner Jacobian; the first correction records the variation of the density, the Jacobian, and the quadratic geometry of the embedding. A localization argument then yields the corresponding expansion for the full heat regularization, with the nonlocal contribution exponentially small. From this density expansion we derive logarithmic asymptotics and uniform expansions for the score, the log-Hessian, and the scale derivative of the score. These formulas show how lower-dimensional support, boundary faces, corners, and curvature are encoded in the singular differential structure of small-noise Gaussian regularizations.

View free PDFSource page

Related papers

arxivmath.STcs.LGmath.PR2026-07-08

Any-Dimensional Learning by Sampling

Eitan Levin, Venkat Chandrasekaran

Many machine learning models are defined for inputs of different sizes, such as point clouds containing different numbers of points, sequences of tokens of different lengths, and graphs on different numbers of nodes. Such models are trained on finitely-many examples of necessaril…

View free PDFSource page
arxivstat.MLcs.DScs.LGmath.PRmath.STstat.CO2026-07-14

Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo

Siddharth Mitra, Vishwak Srinivasan, Xiuyuan Wang, Andre Wibisono

We show the Randomized Hamiltonian Monte Carlo (RHMC) algorithm has accelerated mixing time guarantees for sampling from log-concave probability distributions. RHMC proceeds by repeatedly simulating the continuous-time Hamiltonian dynamics for some random integration times, and r…

View free PDFSource page
arxivstat.MLcs.LGmath.PRmath.ST2026-07-15

Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

Manuel Fernandez, Yizhe Zhu

We study sparse threshold random geometric graphs generated by high-dimensional spherical or Gaussian latent vectors. Although each edge has marginal probability $p$, shared latent variables make the adjacency entries dependent. At the connectivity scale $np=Ω(\log n)$, the spher…

View free PDFSource page