Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The Complexity of Making the Gradient Small in Stochastic Convex Optimization

D. Foster, A. Sekhari, O. Shamir, N. Srebro, K. Sridharan, and B. Woodworth. (2019)cite arxiv:1902.04686.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ayush Joshi

Ayush Goyal

Tsermaa Tsend-Ayush

Other publications of authors with the same name

On the Complexity of Adversarial Decision Making.D. Foster, A. Rakhlin, A. Sekhari, and K. Sridharan. NeurIPS, (2022)Ticketed Learning-Unlearning Schemes.B. Ghazi, P. Kamath, R. Kumar, P. Manurangsi, A. Sekhari, and C. Zhang. COLT, volume 195 of Proceedings of Machine Learning Research, page 5110-5139. PMLR, (2023)The Complexity of Making the Gradient Small in Stochastic Convex OptimizationD. Foster, A. Sekhari, O. Shamir, N. Srebro, K. Sridharan, and B. Woodworth. (2019)cite arxiv:1902.04686.When is Agnostic Reinforcement Learning Statistically Tractable?Z. Jia, G. Li, A. Rakhlin, A. Sekhari, and N. Srebro. CoRR, (2023)Offline Reinforcement Learning: Role of State Aggregation and Trajectory Data.Z. Jia, A. Rakhlin, A. Sekhari, and C. Wei. CoRR, (2024)Machine Unlearning Fails to Remove Data Poisoning Attacks.M. Pawelczyk, J. Di, Y. Lu, G. Kamath, A. Sekhari, and S. Neel. CoRR, (2024)Uniform Convergence of Gradients for Non-Convex Learning and Optimization.D. Foster, A. Sekhari, and K. Sridharan. NeurIPS, page 8759-8770. (2018)Guarantees for Epsilon-Greedy Reinforcement Learning with Function Approximation.C. Dann, Y. Mansour, M. Mohri, A. Sekhari, and K. Sridharan. ICML, volume 162 of Proceedings of Machine Learning Research, page 4666-4689. PMLR, (2022)Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings.M. Uehara, A. Sekhari, J. Lee, N. Kallus, and W. Sun. ICML, volume 202 of Proceedings of Machine Learning Research, page 34615-34641. PMLR, (2023)Offline Data Enhanced On-Policy Policy Gradient with Provable Guarantees.Y. Zhou, A. Sekhari, Y. Song, and W. Sun. ICLR, OpenReview.net, (2024)

BibSonomy

Disambiguation of "Sekhari, Ayush"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The Complexity of Making the Gradient Small in Stochastic Convex Optimization

Please choose a person to relate this publication to

Ayush Joshi

Ayush Goyal

Tsermaa Tsend-Ayush

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Sekhari, Ayush"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML The Complexity of Making the Gradient Small in Stochastic Convex Optimization

Please choose a person to relate this publication to

Ayush Joshi

Ayush Goyal

Tsermaa Tsend-Ayush

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The Complexity of Making the Gradient Small in Stochastic Convex Optimization