54 citations · 200 across the 55 of their papers we have counts for
9 papers · 1 filter
Regularized Stein Variational Gradient Flow
Ye He, Krishnakumar Balasubramanian, Bharath K. Sriperumbudur +1
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…
Stochastic Zeroth-order Functional Constrained Optimization: Oracle Complexity and Applications
Anthony Nguyen, Krishnakumar Balasubramanian
Functionally constrained stochastic optimization problems, where neither the objective function nor the constraint functions are analytically available, arise frequently in machine…
Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity
Xuxing Chen, Minhui Huang, Shiqian Ma +1
Bilevel optimization recently has received tremendous attention due to its great success in solving important machine learning problems like meta learning, reinforcement learning,…
Constrained Stochastic Nonconvex Optimization with State-dependent Markov Data
Abhishek Roy, Krishnakumar Balasubramanian, Saeed Ghadimi
We study stochastic optimization algorithms for constrained nonconvex stochastic optimization problems with Markovian data. In particular, we focus on the case when the transition…
Functional linear and single-index models: A unified approach via Gaussian Stein identity
Krishnakumar Balasubramanian, Hans-Georg Müller, Bharath K. Sriperumbudur
Functional linear and single-index models are core regression methods in functional data analysis and are widely used for performing regression in a wide range of applications when…
Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance
Nuri Mert Vural, Lu Yu, Krishnakumar Balasubramanian +2
We study stochastic convex optimization under infinite noise variance. Specifically, when the stochastic gradient is unbiased and has uniformly bounded -th moment, for some…
Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlo
Krishnakumar Balasubramanian, Sinho Chewi, Murat A. Erdogdu +2
For the task of sampling from a density on , where is possibly non-convex but -gradient Lipschitz, we prove that averaged Langevin Monte Ca…
A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization
Tesi Xiao, Krishnakumar Balasubramanian, Saeed Ghadimi
We propose a projection-free conditional gradient-type algorithm for smooth stochastic multi-level composition optimization, where the objective function is a nested composition of…
Heavy-tailed Sampling via Transformed Unadjusted Langevin Algorithm
Ye He, Krishnakumar Balasubramanian, Murat A. Erdogdu
We analyze the oracle complexity of sampling from polynomially decaying heavy-tailed target densities based on running the Unadjusted Langevin Algorithm on certain transformed vers…