default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDhruv Rohatgi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps. COLT 2024: 2840-2886- [c13]Noah Golowich
, Ankur Moitra, Dhruv Rohatgi:
Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles. STOC 2024: 183-193 - [i18]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps. CoRR abs/2402.15409 (2024) - [i17]Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning. CoRR abs/2404.03774 (2024) - [i16]Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
On Learning Parities with Dependent Noise. CoRR abs/2404.11325 (2024) - [i15]Noah Golowich, Elad Hazan, Zhou Lu, Dhruv Rohatgi, Y. Jennifer Sun:
Online Control in Population Dynamics. CoRR abs/2406.01799 (2024) - 2023
- [c12]Ankur Moitra, Dhruv Rohatgi:
Provably Auditing Ordinary Least Squares in Low Dimensions. ICLR 2023 - [c11]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Feature Adaptation for Sparse Linear Regression. NeurIPS 2023 - [c10]Chirag Pabbaraju, Dhruv Rohatgi, Anish Prasad Sevekari, Holden Lee, Ankur Moitra, Andrej Risteski:
Provable benefits of score matching. NeurIPS 2023 - [c9]Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
Planning and Learning in Partially Observable Systems via Filter Stability. STOC 2023: 349-362 - [i14]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Feature Adaptation for Sparse Linear Regression. CoRR abs/2305.16892 (2023) - [i13]Chirag Pabbaraju, Dhruv Rohatgi, Anish Prasad Sevekari, Holden Lee, Ankur Moitra, Andrej Risteski:
Provable benefits of score matching. CoRR abs/2306.01993 (2023) - [i12]Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles. CoRR abs/2309.09457 (2023) - 2022
- [c8]Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
Learning in Observable POMDPs, without Computationally Intractable Oracles. NeurIPS 2022 - [c7]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs. NeurIPS 2022 - [c6]Dhruv Rohatgi, Vasilis Syrgkanis:
Robust Generalized Method of Moments: A Finite Sample Viewpoint. NeurIPS 2022 - [i11]Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
Planning in Observable POMDPs in Quasipolynomial Time. CoRR abs/2201.04735 (2022) - [i10]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs. CoRR abs/2203.02824 (2022) - [i9]Ankur Moitra, Dhruv Rohatgi:
Provably Auditing Ordinary Least Squares in Low Dimensions. CoRR abs/2205.14284 (2022) - [i8]Noah Golowich, Ankur Moitra, Dhruv Rohatgi:
Learning in Observable POMDPs, without Computationally Intractable Oracles. CoRR abs/2206.03446 (2022) - 2021
- [j2]Dhruv Rohatgi, John C. Urschel, Jake Wellens:
Regarding Two Conjectures on Clique and Biclique Partitions. Electron. J. Comb. 28(4) (2021) - [c5]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
On the Power of Preconditioning in Sparse Linear Regression. FOCS 2021: 550-561 - [i7]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
On the Power of Preconditioning in Sparse Linear Regression. CoRR abs/2106.09207 (2021) - [i6]Dhruv Rohatgi, Vasilis Syrgkanis:
Robust Generalized Method of Moments: A Finite Sample Viewpoint. CoRR abs/2110.03070 (2021) - 2020
- [c4]Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis:
Truncated Linear Regression in High Dimensions. NeurIPS 2020 - [c3]Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis:
Constant-Expansion Suffices for Compressed Sensing with Generative Priors. NeurIPS 2020 - [c2]Dhruv Rohatgi:
Near-Optimal Bounds for Online Caching with Machine Learned Advice. SODA 2020: 1834-1845 - [i5]Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis:
Constant-Expansion Suffices for Compressed Sensing with Generative Priors. CoRR abs/2006.04237 (2020) - [i4]Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis:
Truncated Linear Regression in High Dimensions. CoRR abs/2007.14539 (2020)
2010 – 2019
- 2019
- [j1]Dhruv Rohatgi:
Off-Diagonal Ordered Ramsey Numbers of Matchings. Electron. J. Comb. 26(2): 2 (2019) - [c1]Dhruv Rohatgi:
Conditional Hardness of Earth Mover Distance. APPROX-RANDOM 2019: 12:1-12:17 - [i3]Dhruv Rohatgi:
Conditional Hardness of Earth Mover Distance. CoRR abs/1909.11068 (2019) - [i2]Dhruv Rohatgi:
Near-Optimal Bounds for Online Caching with Machine Learned Advice. CoRR abs/1910.12172 (2019) - 2018
- [i1]Dhruv Rohatgi:
Sliding window order statistics in sublinear space. CoRR abs/1807.04400 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
