ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1911.02074
  4. Cited By
Computational Separations between Sampling and Optimization

Computational Separations between Sampling and Optimization

5 November 2019
Kunal Talwar
ArXivPDFHTML

Papers citing "Computational Separations between Sampling and Optimization"

3 / 3 papers shown
Title
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
163
1,928
0
07 Sep 2019
Sampling Can Be Faster Than Optimization
Sampling Can Be Faster Than Optimization
Yian Ma
Yuansi Chen
Chi Jin
Nicolas Flammarion
Michael I. Jordan
65
184
0
20 Nov 2018
Non-asymptotic convergence analysis for the Unadjusted Langevin
  Algorithm
Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm
Alain Durmus
Eric Moulines
64
412
0
17 Jul 2015
1