The Flow has not summarised this story yet — read it at arXiv Statistics ML.
The paper introduces a new simultaneous pointwise majorization framework for Banach‑valued stochastic processes that possess finite‑metric mixed‑tail increments. By assuming an anchored process satisfies a tail bound involving multiple pseudo‑metrics and orders, the authors derive a high‑probability envelope that holds uniformly over the index set, with terms expressed through integrals of log‑covering numbers and distance functions. This result generalizes single‑metric sub‑Weibull bounds and, in the Gaussian case, improves existing pointwise upper bounds by removing extraneous logarithmic factors.
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.
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.
arXiv:2608. 09870v1 Announce Type: cross Abstract: Uniform stability is a classical tool for controlling the generalization error of a learning algorithm.
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.
arXiv:2609.15170v1 Announce Type: new Abstract: We study stochastic linear contextual bandits with arbitrary action menus that may depend on the fixed parameter and the interaction history. We establ...