惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

U
Unit 42
博客园 - 司徒正美
V
Visual Studio Blog
博客园 - 【当耐特】
T
Tailwind CSS Blog
美团技术团队
博客园 - 叶小钗
Jina AI
Jina AI
宝玉的分享
宝玉的分享
IT之家
IT之家
Hugging Face - Blog
Hugging Face - Blog
雷峰网
雷峰网
Stack Overflow Blog
Stack Overflow Blog
博客园_首页
人人都是产品经理
人人都是产品经理
T
The Blog of Author Tim Ferriss
P
Proofpoint News Feed
Microsoft Security Blog
Microsoft Security Blog
Y
Y Combinator Blog
GbyAI
GbyAI
大猫的无限游戏
大猫的无限游戏
Martin Fowler
Martin Fowler
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
腾讯CDC

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
The Laplace asymptotic expansion in high dimensions
Anya Katsevich · 2024-06-18 · via math.ST updates on arXiv.org

We prove that the classical Laplace asymptotic expansion (AE) of $\int_{\mathbb R^d} g(x)e^{-nu(x)}dx$, $n\gg1$ extends to the high-dimensional regime in which $d$ may grow large with $n$. More specifically, we use new techniques suitable to high-$d$ to derive an AE which formally coincides with the classical one because the terms are the same, but which now has a new small parameter. Namely under classical assumptions on $z$ and $g$ and additional bounds on the growth of $\|\nabla^kz\|$ and $\|\nabla^kg\|$ with $d$, we show the new small parameter is $d^2/n$, in the sense that $|\text{Rem}_L|\leq C_L(d^2/n)^L$ for each $L=1,2,3,\dots$, where $\text{Rem}_L$ is the $L$th order remainder. As an example, we show that the derivative bounds are satisfied with high probability for a random function $z$ arising in a standard statistical model. We also show that if the derivative bounds are relaxed, then we still obtain a valid AE in powers of a "larger" small parameter. To prove these results, we derive a very general nonasymptotic bound on $\text{Rem}_L$ which is explicit in its dependence on $g,z,d,n$. The bound holds with nearly no apriori restrictions on the magnitude of the derivative norms. We show the bound is tight for each $L$ by proving a matching lower bound for a quartic $z$ and $g\equiv1$. When $d,z,g$ are fixed and $n\to\infty$, our bound shows that $\text{Rem}_L=O(n^{-L})$. Thus our work subsumes the classical theory of the Laplace expansion, and significantly extends it into the high-$d$ regime. This broadened applicability of the expansion is extremely useful for the many modern applications requiring the computation of high-$d$ Laplace integrals. In settings where the expansion is already in use, our precise and explicit error bound is valuable both for numerical estimates and theoretical analysis, especially near the boundary of applicability of the expansion.