We study distributionally robust PAC learning for the $0$--$1$-loss, where adversarial perturbations of the data distribution are constrained by a Cressie--Read divergence of order $k>1$ and radius $ρ\geq 0$. For hypothesis classes with VC dimension $d$, we establish realizable and agnostic sample-complexity bounds tight up to constant and logarithmic factors, respectively; ordinary empirical risk minimization attains both rates up to logarithmic factors.
arXiv:2608. 04686v1 Announce Type: new Abstract: We study distributionally robust PAC learning for the $0$--$1$-loss, where adversarial perturbations of the data distribution are constrained by a Cressie--Read divergence of order $k>1$ and radius $\rho\geq 0$.
By Elad Aigner-Horev, Daniel Rosenberg, Roi Weiss
arXiv:2610. 12358v1 Announce Type: cross Abstract: We study Gaussian regression under squared population $L_2$ loss in a known $m$-dimensional subspace of degree-at-most-$k$ functions on the $d$-dimensional Boolean cube.
By Thomas Weinberger
arXiv:2607. 19510v1 Announce Type: new Abstract: Modern LLM deployments use a number of implementation choices and inference optimizations (e.
By Eric Price, Kevin Tian, Zhiyang Xun, Yusong Zhu
arXiv:2004. 05813v3 Announce Type: replace-cross Abstract: Suppose that we are given independent, identically distributed random samples $x_1,\cdots,x_n$ from a mixture at most $k$ many $d$-dimensional spherical Gaussian distributions $\mu_1,\cdots,\mu_{k_0}$ of identical and known variance $\sigma^2$ in each coordinate, such that the minimum $\ell^2$ distance between two distinct centers $y_l$ and $y_j$ is greater than $2\Delta\sigma \min\{\sqrt{d},\sqrt k\}$, where $\Delta>C_0$, and $C_0$ is a sufficiently large universal constant.
By Somnath Chakraborty, Hariharan Narayanan
arXiv:2410. 23212v3 Announce Type: replace-cross Abstract: In graph-based data analysis, $k$-nearest neighbor ($k$NN) graphs are widely used due to their adaptivity to local data densities.
By Xiuyuan Cheng, Yixuan Tan, Nan Wu
arXiv:2607. 29245v1 Announce Type: cross Abstract: We study the expected improvement (EI) policy for minimizing a deterministic objective function $f$ on a nonempty compact set $\mathcal X \subset\mathbb R^d$.
By Emmanuel Vazquez, S\'ebastien Petit
arXiv:2606. 06384v2 Announce Type: replace-cross Abstract: The sub-Gaussian parameter (also called the variance proxy) of a mean-zero random variable $X$ is defined as $\xi^2_\star = \sup_{\lambda \in \mathbb{R}} L(\lambda)$ where $L(\lambda) = \frac{2}{\lambda^2} \log \mathbb{E} e^{\lambda X}$ is a weighted cumulant generating function.
By Jason Liu, Min Xu, Jinchuan Xing
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.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
arXiv:2409. 08469v4 Announce Type: replace-cross Abstract: We provide finite-particle convergence rates for the Stein Variational Gradient Descent (SVGD) algorithm in the Kernelized Stein Discrepancy ($\mathsf{KSD}$) and Wasserstein-2 metrics.
By Sayan Banerjee, Krishnakumar Balasubramanian, Promit Ghosal
arXiv:2509. 08726v3 Announce Type: replace-cross Abstract: This paper focuses on the decentralized stochastic optimization problem $f(\mathbf{x})=\frac{1}{m}\sum_{i=1}^m f_i(\mathbf{x})$ over a connected network of $n$ agents, where each local function has the form of $f_i(\mathbf{x}) = {\mathbb E}\left[F(\mathbf{x};{\boldsymbol \xi}_i)\right]$ which satisfies the $(L_0,L_1)$-smooth condition but possibly nonconvex and each random variable ${\boldsymbol \xi}_i$ follows distribution ${\mathcal D}_i$.
By Luo Luo, Xue Cui, Tingkai Jia, Cheng Chen