Skip to content Skip to main menu
WhartonLogo for The Wharton School
  • Faculty
  • Youth Program
  • Undergrad
  • MBA
  • EMBA
  • PhD
  • Exec Ed
  • Wharton Online
  • Alumni
  • Knowledge at Wharton
Search Wharton
Wharton Faculty Platform
Menu
  • Research and Publications
  • All Faculty
  • Departments

Resolving the mixing time of the Langevin Algorithm to its stationary distribution for log-concave sampling

October 22, 2023   | Jason Altschuler

Post navigation

← List now or Later? An equilibrium analysis of advance-booking platforms
A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networks →
Back To Top
Additional Links
    Wharton Faculty Platform
    • Research and Publications
    • All Faculty
    • Departments
  • Programs
  • Undergraduate
  • MBA
  • EMBA
  • Doctorate
  • Executive Education
  • Wharton Online
  • Locations
  • Philadelphia
  • San Francisco
  • Beijing
  • The Power of Wharton
  • Global Influence
  • Analytics
  • Entrepreneurship & Innovation
  • Featured
  • Give to Wharton
  • Alumni
  • Knowledge@Wharton
  • Recruiters & Corporations
  • Wharton
  • Faculty
  • About Us
  • Research Centers
  • Departments
  • Resources
  • Contact Us
  • News
  • Faculty & Staff
The University of Pennsylvania
    Support Wharton
    ©2025 The Wharton School,  The University of Pennsylvania  |  Wharton Faculty Platform  |  Privacy Policy  |  Report Accessibility Issues and Get Help