Prayaag Venkat

13 papers A* 4A 1B 1Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2023 A conf
Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random Matrices.
ITCS
Prayaag Venkat
2023 A* conf
Near-optimal fitting of ellipsoids to random points.
COLT
Aaron Potechin, Paxton M. Turner, Prayaag Venkat, Alexander S. Wein
2023 A* conf
Privately Estimating a Gaussian: Efficient, Robust, and Optimal.
STOC
Daniel Alabi, Pravesh K. Kothari, Pranay Tankala, Prayaag Venkat, Fred Zhang
2022 J jnl
Efficient algorithms for certifying lower bounds on the discrepancy of random matrices.
CoRR
Prayaag Venkat
2022 J jnl
Privately Estimating a Gaussian: Efficient, Robust and Optimal.
CoRR
Daniel Alabi, Pravesh K. Kothari, Pranay Tankala, Prayaag Venkat, Fred Zhang
2021 A* conf
Optimal Regularization can Mitigate Double Descent.
ICLR
Preetum Nakkiran, Prayaag Venkat, Sham M. Kakade, Tengyu Ma
2020 A* conf
A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates.
COLT
Zhixian Lei, Kyle Luh, Prayaag Venkat, Fred Zhang
2020 J jnl
Optimal Regularization Can Mitigate Double Descent.
CoRR
Preetum Nakkiran, Prayaag Venkat, Sham M. Kakade, Tengyu Ma
2019 J jnl
A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates.
CoRR
Zhixian Lei, Kyle Luh, Prayaag Venkat, Fred Zhang
2019 J jnl
Select and permute: An improved online framework for scheduling to minimize weighted completion time.
Theor. Comput. Sci.
Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat
2018 B conf
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time.
LATIN
Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat
2017 J jnl
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time.
CoRR
Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat
2014 — conf
A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets.
CCCG
Prayaag Venkat, David M. Mount