← Search

Krishnakumar Balasubramanian

7 accepted papers

2026

Statistical-Computational Trade-offs for Recursive Adaptive Partitioning Estimators

ICML 2026poster

Models based on recursive adaptive partitioning such as decision trees and their ensembles are popular for high-dimensional regression as they can potentially avoid the curse of dimensionality. Because empirical risk minimization (ERM) is computationally infeasible, these models are typically traine…

Cited by 0SourceScholar
2023

A one-sample decentralized proximal algorithm for non-convex stochastic composite optimization

UAI 2023poster

We focus on decentralized stochastic non-convex optimization, where $n$ agents work together to optimize a composite objective function which is a sum of a smooth term and a non-smooth convex term. To solve this problem, we propose two single-time scale algorithms: \texttt{Prox-DASA} and \texttt{Pro…

2020

Escaping Saddle-Point Faster under Interpolation-like Conditions

NeurIPS 2020poster

In this paper, we show that under over-parametrization several standard stochastic optimization algorithms escape saddle-points and converge to local-minimizers much faster. One of the fundamental aspects of over-parametrized models is that they are capable of interpolating the training data. We sho…

Cited by 9SourcePDFScholar
2020

On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method

NeurIPS 2020poster

The randomized midpoint method, proposed by (Shen and Lee, 2019), has emerged as an optimal discretization procedure for simulating the continuous time underdamped Langevin diffusion. In this paper, we analyze several probabilistic properties of the randomized midpoint discretization method, conside…

Cited by 38SourcePDFScholar
2018

Zeroth-order (Non)-Convex Stochastic Optimization via Conditional Gradient and Gradient Updates

NeurIPS 2018poster

In this paper, we propose and analyze zeroth-order stochastic approximation algorithms for nonconvex and convex optimization. Specifically, we propose generalizations of the conditional gradient algorithm achieving rates similar to the standard stochastic gradient algorithm using only zeroth-order i…

Cited by 123SourcePDFScholar
2017

Estimating High-dimensional Non-Gaussian Multiple Index Models via Stein’s Lemma

NeurIPS 2017poster

We consider estimating the parametric components of semiparametric multi-index models in high dimensions. To bypass the requirements of Gaussianity or elliptical symmetry of covariates in existing methods, we propose to leverage a second-order Stein’s method with score function-based corrections. We…

Cited by 23SourcePDFScholar
2017

High-dimensional Non-Gaussian Single Index Models via Thresholded Score Function Estimation

ICML 2017poster

We consider estimating the parametric component of single index models in high dimensions. Compared with existing work, we do not require the covariate to be normally distributed. Utilizing Stein’s Lemma, we propose estimators based on the score function of the covariate. Moreover, to handle score f…

Cited by 61SourcePDFScholar