2026-08-15T19:13:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9903 2024-03-06T10:45:04Z ddc:004 open_access

Continuous Algorithms (Invited Paper) Vempala, Santosh Algorithms While the design of algorithms is traditionally a discrete endeavour, in recent years many advances have come from continuous perspectives. Typically, a continuous process, deterministic or randomized, is designed and shown to have desirable properties, such as approaching an optimal solution or a target distribution, and an algorithm is derived from this by appropriate discretization. We will discuss examples of this for optimization (gradient descent, interior-point method) and sampling (Brownian motion, Hamiltonian Monte Carlo), with applications to learning. In some interesting and rather general settings, the current fastest methods have been obtained via this approach. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Santosh Vempala 2018 Is Part Of LIPIcs, Volume 122, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2018.4 urn:nbn:de:0030-drops-99037 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.4 eng https://creativecommons.org/licenses/by/3.0/legalcode