Dhruv Rohatgi

According to our database, Dhruv Rohatgi authored at least 19 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps.

Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi

CoRR, 2024

2023

Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles.

Noah Golowich, Ankur Moitra, Dhruv Rohatgi

CoRR, 2023

Planning and Learning in Partially Observable Systems via Filter Stability.

Noah Golowich, Ankur Moitra, Dhruv Rohatgi

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Provable benefits of score matching.

Chirag Pabbaraju, Dhruv Rohatgi, Anish Prasad Sevekari, Holden Lee, Ankur Moitra, Andrej Risteski

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Feature Adaptation for Sparse Linear Regression.

Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Provably Auditing Ordinary Least Squares in Low Dimensions.

Ankur Moitra, Dhruv Rohatgi

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs.

Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi

CoRR, 2022

Planning in Observable POMDPs in Quasipolynomial Time.

Noah Golowich, Ankur Moitra, Dhruv Rohatgi

CoRR, 2022

Robust Generalized Method of Moments: A Finite Sample Viewpoint.

Dhruv Rohatgi, Vasilis Syrgkanis

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs.

Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning in Observable POMDPs, without Computationally Intractable Oracles.

Noah Golowich, Ankur Moitra, Dhruv Rohatgi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Regarding Two Conjectures on Clique and Biclique Partitions.

Dhruv Rohatgi, John C. Urschel, Jake Wellens

Electron. J. Comb., 2021

On the Power of Preconditioning in Sparse Linear Regression.

Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Near-Optimal Bounds for Online Caching with Machine Learned Advice.

Dhruv Rohatgi

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Constant-Expansion Suffices for Compressed Sensing with Generative Priors.

Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Truncated Linear Regression in High Dimensions.

Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Off-Diagonal Ordered Ramsey Numbers of Matchings.

Dhruv Rohatgi

Electron. J. Comb., 2019

Conditional Hardness of Earth Mover Distance.

Dhruv Rohatgi

Proceedings of the Approximation, 2019

2018

Sliding window order statistics in sublinear space.

Dhruv Rohatgi

CoRR, 2018