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

推荐订阅源

博客园 - 司徒正美
T
The Blog of Author Tim Ferriss
F
Fortinet All Blogs
Martin Fowler
Martin Fowler
罗磊的独立博客
The GitHub Blog
The GitHub Blog
L
LangChain Blog
A
About on SuperTechFans
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
D
DataBreaches.Net
宝玉的分享
宝玉的分享
U
Unit 42
阮一峰的网络日志
阮一峰的网络日志
Last Week in AI
Last Week in AI
N
Netflix TechBlog - Medium
The Cloudflare Blog
Microsoft Azure Blog
Microsoft Azure Blog
H
Help Net Security
美团技术团队
大猫的无限游戏
大猫的无限游戏
雷峰网
雷峰网
爱范儿
爱范儿
酷 壳 – CoolShell
酷 壳 – CoolShell
MongoDB | Blog
MongoDB | Blog

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
Invariance principle for the Gaussian Multiplicative Chao...
Mriganka Basu Roy Chowdhury, Shirshendu Ganguly · 2025-02-25 · via math.ST updates on arXiv.org

Gaussian multiplicative chaos (GMC) is a canonical random fractal measure obtained by exponentiating log-correlated Gaussian processes, first constructed in the seminal work of Kahane (1985). Since then it has served as an important building block in constructions of quantum field theories and Liouville quantum gravity. However, in many natural settings, non-Gaussian log-correlated processes arise. In this paper, we investigate the universality of GMC through an invariance principle. We consider the model of a random Fourier series, a process known to be log-correlated. While the Gaussian Fourier series has been a classical object of study, recently, the non-Gaussian counterpart was investigated and the associated multiplicative chaos constructed by Junnila in 2016. We show that the Gaussian and non-Gaussian variables can be coupled so that the associated chaos measures are almost surely mutually absolutely continuous throughout the entire sub-critical regime. This solves the main open problem from Kim and Kriechbaum (2024) who had earlier established such a result for a part of the regime. The main ingredient is a new high dimensional CLT for a sum of independent (but not i.i.d.) random vectors belonging to rank one subspaces with error bounds involving the isotropic properties of the covariance matrix of the sum, which we expect will find other applications. The proof relies on a path-wise analysis of Skorokhod embeddings as well as a perturbative result about square roots of positive semi-definite matrices which, surprisingly, appears to be new.