{"id":43075,"date":"2025-12-16T20:11:08","date_gmt":"2025-12-17T01:11:08","guid":{"rendered":"https:\/\/www.bu.edu\/cise\/?page_id=43075"},"modified":"2026-01-05T22:24:32","modified_gmt":"2026-01-06T03:24:32","slug":"cise-seminar-jonathan-weare-new-york-university","status":"publish","type":"page","link":"https:\/\/www.bu.edu\/cise\/cise-seminar-jonathan-weare-new-york-university\/","title":{"rendered":"CISE Seminar: Jonathan Weare, Courant Institute of Mathematical Sciences"},"content":{"rendered":"<p>Date: January 23, 2026<br \/>\nTime: 3:00pm \u2013 4:00pm<br \/>\nLocation: 665 Commonwealth Ave., CDS 1101<\/p>\n<h4><strong><img loading=\"lazy\" src=\"\/cise\/files\/2026\/01\/0-636x636.jpeg\" alt=\"\" width=\"230\" height=\"230\" class=\" wp-image-43106 alignleft\" srcset=\"https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-636x636.jpeg 636w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-1024x1024.jpeg 1024w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-150x150.jpeg 150w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-768x767.jpeg 768w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-1536x1534.jpeg 1536w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-550x550.jpeg 550w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-710x710.jpeg 710w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-300x300.jpeg 300w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-600x600.jpeg 600w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0-100x100.jpeg 100w, https:\/\/www.bu.edu\/cise\/files\/2026\/01\/0.jpeg 1562w\" sizes=\"(max-width: 230px) 100vw, 230px\" \/>Jonathan Weare<\/strong><br \/>\n<strong>Professor of Mathematics<\/strong><br \/>\n<strong>Courant Institute of Mathematical Sciences\u00a0<\/strong><\/h4>\n<p><em><strong>Convergence of Unadjusted Langevin and HMC in High Dimensions: Delocalization of Bias<\/strong><\/em><\/p>\n<p><span>The unadjusted Langevin algorithm is commonly used to sample probability distributions in extremely high-dimensional settings. However, existing analyses of the algorithm for strongly log-concave distributions suggest that, as the dimension d of the problem increases, the number of iterations required to ensure convergence within a desired error in the W2 metric scales in proportion to d or its square root. In this paper, we argue that, despite this poor scaling of the W2 error for the full set of variables, the behavior for a small number of variables can be significantly better: a number of iterations proportional to K, up to logarithmic terms in d, often suffices for the algorithm to converge to within a desired W2 error for all K-marginals. We refer to this effect as delocalization of bias. We show that the delocalization effect does not hold universally and prove its validity for Gaussian distributions and strongly log-concave distributions with certain sparse interactions. Our analysis relies on a novel W2,\u2113\u221e metric to measure convergence. A key technical challenge we address is the lack of a one-step contraction property in this metric. Our results cover both the underdamped and overdamped Langevin schemes as well as an unadjusted version of the popular Hybrid (or Hamiltonian) Monte Carlo algorithm.<\/span><\/p>\n<p><span><strong>Jonathan Weare<\/strong> is a professor of mathematics in the Courant Institute of Mathematical Sciences at New York University. Previously he was an associate professor in the statistics department and in the James Franck Institute at the University of Chicago and, before that, an assistant professor in the mathematics department there. Before moving to Chicago, Weare was a Courant Instructor of mathematics at NYU and a PhD student in mathematics at the University of California at Berkeley.<\/span><\/p>\n<p><strong>Faculty Host: <\/strong>Konstantinos Spiliopoulos<br \/>\n<strong>Student Host: <\/strong>Chae Woo Lim<span><\/span><span><\/span><\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Date: January 23, 2026 Time: 3:00pm \u2013 4:00pm Location: 665 Commonwealth Ave., CDS 1101 Jonathan Weare Professor of Mathematics Courant Institute of Mathematical Sciences\u00a0 Convergence of Unadjusted Langevin and HMC in High Dimensions: Delocalization of Bias The unadjusted Langevin algorithm is commonly used to sample probability distributions in extremely high-dimensional settings. However, existing analyses of [&hellip;]<\/p>\n","protected":false},"author":25166,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-templates\/no-sidebars.php","meta":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages\/43075"}],"collection":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/users\/25166"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/comments?post=43075"}],"version-history":[{"count":5,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages\/43075\/revisions"}],"predecessor-version":[{"id":43107,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages\/43075\/revisions\/43107"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/media?parent=43075"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}