English
Related papers

Related papers: Nystr\"om Kernel Stein Discrepancy

200 papers

In the setting of nonparametric regression, we propose and study a combination of stochastic gradient methods with Nystr\"om subsampling, allowing multiple passes over the data and mini-batches. Generalization error bounds for the studied…

Machine Learning · Statistics 2017-10-24 Junhong Lin , Lorenzo Rosasco

We propose a novel kernel-based two-sample test that leverages the spectral decomposition of the maximum mean discrepancy (MMD) statistic to identify and utilize well-estimated directional components in reproducing kernel Hilbert space…

Methodology · Statistics 2025-08-21 Rui Cui , Yuhao Li , Xiaojun Song

Conventional seismic techniques for detecting the subsurface geologic features are challenged by limited data coverage, computational inefficiency, and subjective human factors. We developed a novel data-driven geological feature detection…

Machine Learning · Computer Science 2018-09-26 Youzuo Lin , Shusen Wang , Jayaraman Thiagarajan , George Guthrie , David Coblentz

An important feature of kernel mean embeddings (KME) is that the rate of convergence of the empirical KME to the true distribution KME can be bounded independently of the dimension of the space, properties of the distribution and smoothness…

Statistics Theory · Mathematics 2025-04-17 Geoffrey Wolfer , Pierre Alquier

Biclustering algorithms partition data and covariates simultaneously, providing new insights in several domains, such as analyzing gene expression to discover new biological functions. This paper develops a new model-free biclustering…

Methodology · Statistics 2022-08-09 Marcos Matabuena , J. C Vidal , Oscar Hernan Madrid Padilla , Dino Sejdinovic

Negative distance kernels $K(x,y) := - \|x-y\|$ were used in the definition of maximum mean discrepancies (MMDs) in statistics and lead to favorable numerical results in various applications. In particular, so-called slicing techniques for…

Machine Learning · Statistics 2025-10-23 Nicolaj Rux , Michael Quellmalz , Gabriele Steidl

This paper proposes a novel parameter selection strategy for kernel-based gradient descent (KGD) algorithms, integrating bias-variance analysis with the splitting method. We introduce the concept of empirical effective dimension to quantify…

Machine Learning · Statistics 2026-03-05 Xiaotong Liu , Yunwen Lei , Xiangyu Chang , Shao-Bo Lin

Kernel ridge regression (KRR) is a standard method for performing non-parametric regression over reproducing kernel Hilbert spaces. Given $n$ samples, the time and space complexity of computing the KRR estimate scale as $\mathcal{O}(n^3)$…

Machine Learning · Statistics 2015-01-27 Yun Yang , Mert Pilanci , Martin J. Wainwright

Stein variational gradient descent (SVGD) is a kernel-based and non-parametric particle method for sampling from a target distribution, such as in Bayesian inference and other machine learning tasks. Different from other particle methods,…

Optimization and Control · Mathematics 2025-10-02 Viktor Stein , Wuchen Li

We establish existence of Stein kernels for probability measures on $\mathbb{R}^d$ satisfying a Poincar\'e inequality, and obtain bounds on the Stein discrepancy of such measures. Applications to quantitative central limit theorems are…

Probability · Mathematics 2018-03-09 Thomas A. Courtade , Max Fathi , Ashwin Pananjady

We develop two approaches for analyzing the approximation error bound for the Nystr\"{o}m method, one based on the concentration inequality of integral operator, and one based on the compressive sensing theory. We show that the…

Machine Learning · Computer Science 2015-09-28 Rong Jin , Tianbao Yang , Mehrdad Mahdavi , Yu-Feng Li , Zhi-Hua Zhou

We develop a multidimensional Stein methodology for non-degenerate self-decomposable random vectors in $\mathbb{R}^d$ having finite first moment. Building on previous univariate findings, we solve an integro-partial differential Stein…

Probability · Mathematics 2019-04-08 Benjamin Arras , Christian Houdré

We establish optimal convergence rates for a decomposition-based scalable approach to kernel ridge regression. The method is simple to describe: it randomly partitions a dataset of size N into m subsets of equal size, computes an…

Statistics Theory · Mathematics 2014-05-01 Yuchen Zhang , John C. Duchi , Martin J. Wainwright

Kernel-based K-means clustering has gained popularity due to its simplicity and the power of its implicit non-linear representation of the data. A dominant concern is the memory requirement since memory scales as the square of the number of…

Machine Learning · Statistics 2016-12-05 Farhad Pourkamali-Anaraki , Stephen Becker

A common challenge in nonparametric inference is its high computational complexity when data volume is large. In this paper, we develop computationally efficient nonparametric testing by employing a random projection strategy. In the…

Statistics Theory · Mathematics 2018-02-20 Meimei Liu , Zuofeng Shang , Guang Cheng

We propose a method for nonparametric density estimation that exhibits robustness to contamination of the training sample. This method achieves robustness by combining a traditional kernel density estimator (KDE) with ideas from classical…

Machine Learning · Statistics 2011-09-07 JooSeuk Kim , Clayton D. Scott

This contribution presents substantial computational advancements to compare measures even with varying masses. Specifically, we utilize the nonequispaced fast Fourier transform to accelerate the radial kernel convolution in unbalanced…

Optimization and Control · Mathematics 2024-05-15 Rajmadan Lakshmanan , Alois Pichler

We introduce higher-order Stein kernels relative to the standard Gaussian measure, which generalize the usual Stein kernels by involving higher-order derivatives of test functions. We relate the associated discrepancies to various metrics…

Probability · Mathematics 2018-12-07 Max Fathi

Kernel-based optimal transport (OT) estimators offer an alternative, functional estimation procedure to address OT problems from samples. Recent works suggest that these estimators are more statistically efficient than plug-in (linear…

Machine Learning · Computer Science 2024-02-01 Tianyi Lin , Marco Cuturi , Michael I. Jordan

In this paper we revisit the kernel density estimation problem: given a kernel $K(x, y)$ and a dataset of $n$ points in high dimensional Euclidean space, prepare a data structure that can quickly output, given a query $q$, a…

Data Structures and Algorithms · Computer Science 2020-11-16 Moses Charikar , Michael Kapralov , Navid Nouri , Paris Siminelakis
‹ Prev 1 4 5 6 7 8 10 Next ›