arXiv:2609.01576v1 Announce Type: cross
Abstract: Classical chaining controls an indexed stochastic process through a single worst-case bound, which can obscure substantial variation across the index...
By Haichen Hu, David Simchi-Levi
arXiv:2607. 16384v1 Announce Type: new Abstract: For stochastic gradient descent (SGD) with a constant stepsize $\alpha$, the invariant law of the iterates, centered at a minimizer, describes the behavior of the algorithm over long time horizons.
By Jingyi Zhang, Cheng Mao, Debankur Mukherjee
arXiv:2608. 13467v1 Announce Type: new Abstract: We study the Moreau--Yosida unadjusted Langevin algorithm (MYULA) for the nonsmooth composite target \[ \pi(dx)\propto \exp\{-f(x)-g(x)\}\,dx, \qquad x\in\mathbb R^d, \] where \(f\) is \(m\)-strongly convex with \(L_f\)-Lipschitz gradient and \(g\) is convex and \(G\)-Lipschitz.
By Yuchen Xin, Zhihua Zhang
arXiv:2608. 09870v1 Announce Type: cross Abstract: Uniform stability is a classical tool for controlling the generalization error of a learning algorithm.
By Thanh Nguyen-Cung, Binh T. Nguyen
arXiv:2610.00793v1 Announce Type: new
Abstract: We consider the estimation of drift, diffusion, and noise covariance from discrete observations of stochastic differential equations driven by Gaussian...
By J. H. Ramirez-Gonzalez
The paper studies the spectral gap of a projected count kernel τP_n derived from an irreducible reversible Markov kernel P on an m‑state space. It establishes bounds on the optimal normalized comparison constant c_m^* = inf nGap( τP_n)/Gap(P), showing 1/(1080m) ≤ c_m^* ≤ q_{m-2} where q_{r+1}=q_r(1-q_r) and q_0=1/4. The authors prove that q_{m-2}=(m+log m+O(1))^{-1}, implying c_m^*=Θ(m^{-1}) and that the reciprocal optimal comparison cost C_m^{opt} grows linearly with m; exact values are given for the two‑state case.
By Yanjin Xiang, Zhihua Zhang
arXiv:2610.27022v1 Announce Type: cross
Abstract: We study Gaussian kernel approximation and regularized logistic classification on a connected compact smooth embedded manifold $X\subset\mathbb R^d$...
By Guanhang Lei, Lei Shi, Xiaoming Yuan
arXiv:2609. 12594v1 Announce Type: new Abstract: We study the classical Moreau--Yosida unadjusted Langevin algorithm (MYULA) for $\pi(\,\mathrm{d} x)\propto e^{-f(x)-g(x)}\,\mathrm{d} x$, where $f\in C^2(\mathbb{R}^d)$ is $m$-strongly convex with $L_f$-Lipschitz gradient and $g:\mathbb{R}^d\to\mathbb{R}$ is convex and globally $G$-Lipschitz.
By Yuchen Xin, Zhihua Zhang
arXiv:2605. 12461v2 Announce Type: replace-cross Abstract: We propose an algorithm to sample from composite log-concave distributions over $\mathbb{R}^d$, i.
By Linghai Liu, Sinho Chewi
arXiv:2609. 18577v1 Announce Type: new Abstract: We consider the problem of estimating the trace of an implicit matrix $\mathbf{A} \in \mathbb{R}^{d^p\times d^p}$ that can only be accessed through matrix-vector products queries.
By Mohammad Azhar Khan, Rameshwar Pratap, Amit Sharma
arXiv:2609. 11837v1 Announce Type: cross Abstract: We study the nonlocal continuity equation \[ \partial_t\mu_b =\operatorname{div}\!
By Andrea Agazzi, Giuseppe Bruno, Federico Pasqualotto, Philippe Rigollet
arXiv:2609.09480v1 Announce Type: cross
Abstract: We develop Gaussian approximation bounds in higher-order Wasserstein distance $W_p$, $p\geq2$, for sums of multivariate martingale differences genera...
By Yixuan Zhang, Qiaomin Xie