PulseAugur
EN
LIVE 02:08:16
ENTITY Langevin

Langevin

PulseAugur coverage of Langevin — every cluster mentioning Langevin across labs, papers, and developer communities, ranked by signal.

Show in brief
Total · 30d
3
6 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
3
6 over 90d
TIER MIX · 90D
TOPICS
SENTIMENT · 30D

3 day(s) with sentiment data

RECENT · PAGE 1/1 · 7 TOTAL
  1. TOOL · CL_252084 ·

    New complexity bounds established for Moreau--Yosida Langevin sampling algorithm

    Researchers have developed new complexity bounds for the Moreau--Yosida unadjusted Langevin algorithm (MYULA), a method used for sampling from probability distributions. The study focuses on distributions of the form $\…

  2. TOOL · CL_245463 ·

    New Langevin-gradient method accelerates global optimization for non-convex functions

    Researchers have developed a new approach to global optimization for smooth, non-convex functions, aiming to find the absolute minimum value with a specified probability. The proposed Langevin--gradient method separates…

  3. TOOL · CL_229351 ·

    New theory quantifies convergence for Langevin-regularized SVGD

    This paper introduces a new theoretical framework for understanding Langevin-regularized Stein Variational Gradient Descent (SVGD). The research establishes quantitative convergence guarantees to the target distribution…

  4. TOOL · CL_200182 ·

    New theoretical bounds improve Langevin sampling for complex distributions

    Researchers have developed new theoretical bounds for the Moreau--Yosida unadjusted Langevin algorithm (MYULA), a method used for sampling from complex probability distributions. The study focuses on nonsmooth composite…

  5. RESEARCH · CL_180413 ·

    New research offers faster Markov chain convergence methods

    Two new research papers propose novel methods for accelerating Markov chain convergence. The first paper introduces a criterion called asymptotic equivalence with the target, offering a direct route to convergence proof…

  6. RESEARCH · CL_143317 ·

    New HMC algorithms tackle bias and accelerate sampling times · 7 sources tracked

    Researchers have developed new methods to address bias and improve efficiency in Hamiltonian Monte Carlo (HMC) algorithms. One study extends the concept of bias delocalization to unadjusted HMC and underdamped Langevin …

  7. TOOL · CL_20560 ·

    New Malliavin calculus method estimates counterfactual gradients for adaptive IRL

    Researchers have developed a novel passive algorithm for adaptive inverse reinforcement learning (IRL) that reconstructs a forward learner's loss function by observing its gradients. This new method utilizes Malliavin c…