← Search

Vishwak Srinivasan

5 accepted papers

2026

Near-Optimal Private Linear Regression via Iterative Hessian Mixing

ICML 2026spotlight

We study differentially private ordinary least squares (DP-OLS) with bounded data $(X,Y)$ via sketching-based mechanisms. While Gaussian sketching approaches have been explored for DP-OLS \citep{sheffet2017differentially}, they are typically viewed as less competitive than the Adaptive Sufficient St…

Cited by 0SourceScholar
2025

The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches

NeurIPS 2025poster

Gaussian sketching, which consists of pre-multiplying the data with a random Gaussian matrix, is a widely used technique in data science and machine learning. Beyond computational benefits, this operation also provides differential privacy guarantees due to its inherent randomness. In this work, we…

Cited by 0SourcecodeScholar
2021

Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity

ICML 2021spotlight

Reinforcement learning (RL) is empirically successful in complex nonlinear Markov decision processes (MDPs) with continuous state spaces. By contrast, the majority of theoretical RL literature requires the MDP to satisfy some form of linear structure, in order to guarantee sample efficient RL. Such…

Cited by 11SourcePDFScholar
2021

Subseasonal climate prediction in the western US using Bayesian spatial models

UAI 2021poster

Subseasonal climate forecasting is the task of predicting climate variables, such as temperature and precipitation, in a two-week to two-month time horizon. The primary predictors for such prediction problem are spatio-temporal satellite and ground measurements of a variety of climate variables in t…

Cited by 10SourcePDFScholar
2020

On Learning Ising Models under Huber's Contamination Model

NeurIPS 2020poster

We study the problem of learning Ising models in a setting where some of the samples from the underlying distribution can be arbitrarily corrupted. In such a setup, we aim to design statistically optimal estimators in a high-dimensional scaling in which the number of nodes p, the number of edges k…

Cited by 23SourcePDFScholar