Bharath K. Sriperumbudur

Bharath K. Sriperumbudur

Auto-generated profile, based on publicly available information

Bharath K. Sriperumbudur

Department of Statistics, Pennsylvania State University, University Park, UK

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 June 2017 in Foundations and Trends in Machine Learning
Verified
Journal Article
Closed access
PDF file
KMKrikamol Muandet
Krikamol Muandet
KFKenji Fukumizu
Kenji Fukumizu
BSBharath Sriperumbudur
Bharath Sriperumbudur
BSBernhard Schölkopf
Bernhard Schölkopf
A Hilbert space embedding of a distribution—in short, a kernel mean embedding—has recently emerged as a powerful tool for machine learning and statistical inference. The basic idea behind this framework is to map distributions into a reproducing kernel Hilbert space (RKHS) in which the whole arsenal of kernel methods can be extended to probability measures. It can be viewed as a generalization of the original “feature map” common to support vector machines (SVMs) and other kernel methods. In addition to the classical applications of kernel methods, the kernel mean embedding has found novel applications in fields ranging from probabilistic modeling to statistical inference, causal discovery, and deep learning. This survey aims to give a comprehensive review of existing work and recent advances in this research area, and to discuss challenging issues and open problems that could potentially lead to new research directions. The survey begins with a brief introduction to the RKHS and positive definite kernels which forms the backbone of this survey, followed by a thorough discussion of the Hilbert space embedding of marginal distributions, theoretical guarantees, and a review of its applications. The embedding of distributions enables us to apply RKHS methods to probability measures which prompts a wide range of applications such as kernel two-sample testing, independent testing, and learning on distributional data. Next, we discuss the Hilbert space embedding for conditional distributions, give theoretical insights, and review some applications. The conditional mean embedding enables us to perform sum, product, and Bayes' rules—which are ubiquitous in graphical model, probabilistic inference, and reinforcement learning— in a non-parametric way using this new representation of distributions. We then discuss relationships between this framework and other related areas. Lastly, we give some suggestions on future research directions.

7 January 2019 in Foundations of Computational Mathematics
Verified
Journal Article
Open access
PDF file
MKMotonobu Kanagawa
Motonobu Kanagawa
BSBharath K. Sriperumbudur
Bharath K. Sriperumbudur
KFKenji Fukumizu
Kenji Fukumizu
This paper presents convergence analysis of kernel-based quadrature rules in misspecified settings, focusing on deterministic quadrature in Sobolev spaces. In particular, we deal with misspecified settings where a test integrand is less smooth than a Sobolev RKHS based on which a quadrature rule is constructed. We provide convergence guarantees based on two different assumptions on a quadrature rule: one on quadrature weights and the other on design points. More precisely, we show that convergence rates can be derived (i) if the sum of absolute weights remains constant (or does not increase quickly), or (ii) if the minimum distance between design points does not decrease very quickly. As a consequence of the latter result, we derive a rate of convergence for Bayesian quadrature in misspecified settings. We reveal a condition on design points to make Bayesian quadrature robust to misspecification, and show that, under this condition, it may adaptively achieve the optimal rate of convergence in the Sobolev space of a lesser order (i.e., of the unknown smoothness of a test integrand), under a slightly stronger regularity condition on the integrand.

17 July 2024 in Foundations of Computational Mathematics
Verified
Journal Article
Open access
PDF file
YHYe He
Ye He
KBKrishnakumar Balasubramanian
Krishnakumar Balasubramanian
BSBharath K. Sriperumbudur
Bharath K. Sriperumbudur
JLJianfeng Lu
Jianfeng Lu
The stein variational gradient descent (SVGD) algorithm is a deterministic particle method for sampling. However, a mean-field analysis reveals that the gradient flow corresponding to the SVGD algorithm (i.e., the Stein Variational Gradient Flow) only provides a constant-order approximation to the Wasserstein gradient flow corresponding to the KL-divergence minimization. In this work, we propose the Regularized Stein Variational Gradient Flow, which interpolates between the Stein Variational Gradient Flow and the Wasserstein gradient flow. We establish various theoretical properties of the Regularized Stein Variational Gradient Flow (and its time-discretization) including convergence to equilibrium, existence and uniqueness of weak solutions, and stability of the solutions. We provide preliminary numerical evidence of the improved performance offered by the regularization.

1 January 2025 in Foundations of Data Science
Verified
Journal Article
Closed access
PDF file
SVSiddharth Vishwanath
Siddharth Vishwanath
KFKenji Fukumizu
Kenji Fukumizu
SKSatoshi Kuriki
Satoshi Kuriki
BSBharath K. Sriperumbudur
Bharath K. Sriperumbudur
Topological data analysis has emerged as a powerful tool for extracting the metric, geometric and topological features underlying the data as a multi-resolution summary statistic, and has found applications in several areas where data arises from complex sources. In this paper, we examine the use of topological summary statistics through the lens of statistical inference. We investigate necessary and sufficient conditions under which valid statistical inference is possible using topological summary statistics. Additionally, we provide examples of models that demonstrate invariance with respect to topological summaries.

1 January 2023 in Electronic Journal of Statistics
Verified
Journal Article
Open access
PDF file
MRMatthew Reimherr
Matthew Reimherr
BSBharath Sriperumbudur
Bharath Sriperumbudur
HKHyun Bin Kang
Hyun Bin Kang
In this work we consider the problem of estimating function-on-scalar regression models when the functions are observed over multi-dimensional or manifold domains and with potentially multivariate output. We establish the minimax rates of convergence and present an estimator based on reproducing kernel Hilbert spaces that achieves the minimax rate. To better interpret the derived rates, we extend well-known links between RKHS and Sobolev spaces to the case where the domain is a compact Riemannian manifold. This is accomplished using an interesting connection to Weyl’s Law from partial differential equations. We conclude with a numerical study and an application to 3D facial imaging.

8 July 2025 in Foundations of Computational Mathematics
Verified
Journal Article
Closed access
PDF file
ZZZhengxin Zhang
Zhengxin Zhang
ZGZiv Goldfeld
Ziv Goldfeld
KGKristjan Greenewald
Kristjan Greenewald
YMYoussef Mroueh
Youssef Mroueh
BSBharath K. Sriperumbudur
Bharath K. Sriperumbudur