activity
20172026
most citedStructured Bayesian Pruning via Log-Normal Multiplicative Noise

131 citations · 179 across the 26 of their papers we have counts for

collaborators
Showing cs.LGShow all

19 papers · 1 filter

cs.LG2026

On the Selectivity of Generative Models in Structure-Based Drug Design

Ella Miray Rajaonson, Jungyoon Lee, William Chau +5

Designing small-molecule drugs that selectively bind to a target protein while avoiding unintended interactions with other proteins is essential for reducing side effects that cont…

cs.LG2026

A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots

Vincent Guan, Lazar Atanackovic, Kirill Neklyudov

The population dynamics of molecules, cells, and organisms are governed by a number of unknown forces. In the last decade, population dynamics have predominantly been modeled with…

cs.LG2026★ 1 cited

General Multimodal Protein Design Enables DNA-Encoding of Chemistry

Jarrid Rector-Brooks, Théophile Lambert, Marta Skreta +15

Evolution is an extraordinary engine for enzymatic diversity, yet the chemistry it has explored remains a narrow slice of what DNA can encode. Deep generative models can design new…

cs.LG2026

Discrete Feynman-Kac Correctors

Mohsin Hasan, Viktor Ohanesian, Artem Gazizov +5

Discrete diffusion models have recently emerged as a promising alternative to the autoregressive approach for generating discrete sequences. Sample generation via gradual denoising…

cs.LG2025★ 1 cited

Amortized Sampling with Transferable Normalizing Flows

Charlie B. Tan, Majdi Hassan, Leon Klein +5

Efficient equilibrium sampling of molecular conformations remains a core challenge in computational chemistry and statistical inference. Classical approaches such as molecular dyna…

cs.LG2025

Self-Refining Training for Amortized Density Functional Theory

Majdi Hassan, Cristian Gabellini, Hatem Helal +2

Density Functional Theory (DFT) allows for predicting all the chemical and physical properties of molecular systems from first principles by finding an approximate solution to the…

cs.LG2025

Progressive Inference-Time Annealing of Diffusion Models for Sampling from Boltzmann Densities

Tara Akhound-Sadegh, Jungyoon Lee, Avishek Joey Bose +7

Sampling efficiently from a target unnormalized probability density remains a core challenge, with relevance across countless high-impact scientific applications. A promising appro…

cs.LG2025★ 1 cited

Feynman-Kac Correctors in Diffusion: Annealing, Guidance, and Product of Experts

Marta Skreta, Tara Akhound-Sadegh, Viktor Ohanesian +6

While score-based generative models are the model of choice across diverse domains, there are limited tools available for controlling inference-time behavior in a principled manner…

cs.LG2024

The Superposition of Diffusion Models Using the Itô Density Estimator

Marta Skreta, Lazar Atanackovic, Avishek Joey Bose +2

The Cambrian explosion of easily accessible pre-trained diffusion models suggests a demand for methods that combine multiple different pre-trained diffusion models without incurrin…

cs.LG2024★ 2 cited

Doob's Lagrangian: A Sample-Efficient Variational Approach to Transition Path Sampling

Yuanqi Du, Michael Plainer, Rob Brekelmans +5

Rare event sampling in dynamical systems is a fundamental problem arising in the natural sciences, which poses significant computational challenges due to an exponentially large sp…

cs.LG2024★ 1 cited

Meta Flow Matching: Integrating Vector Fields on the Wasserstein Manifold

Lazar Atanackovic, Xi Zhang, Brandon Amos +5

Numerous biological and physical processes can be modeled as systems of interacting entities evolving continuously over time, e.g. the dynamics of communicating cells or physical p…

cs.LG2024

Diffusion Models as Constrained Samplers for Optimization with Unknown Constraints

Lingkai Kong, Yuanqi Du, Wenhao Mu +8

Addressing real-world optimization problems becomes particularly challenging when analytic objective functions or constraints are unavailable. While numerous studies have addressed…

cs.LG2023

Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFAC

Wu Lin, Felix Dangel, Runa Eschenhagen +4

Second-order methods such as KFAC can be useful for neural net training. However, they are often memory-inefficient since their preconditioning Kronecker factors are dense, and num…

cs.LG2023★ 4 cited

A Computational Framework for Solving Wasserstein Lagrangian Flows

Kirill Neklyudov, Rob Brekelmans, Alexander Tong +3

The dynamical formulation of the optimal transport can be extended through various choices of the underlying geometry (kinetic energy), and the regularization of density paths (pot…

cs.LG2022★ 1 cited

Action Matching: Learning Stochastic Dynamics from Samples

Kirill Neklyudov, Rob Brekelmans, Daniel Severo +1

Learning the continuous dynamics of a system from snapshots of its temporal marginals is a problem which appears throughout natural sciences and machine learning, including in quan…

cs.LG2021

Particle Dynamics for Learning EBMs

Kirill Neklyudov, Priyank Jaini, Max Welling

Energy-based modeling is a promising approach to unsupervised learning, which yields many downstream applications from a single model. The main difficulty in learning energy-based…

cs.LG2020

Orbital MCMC

Kirill Neklyudov, Max Welling

Markov Chain Monte Carlo (MCMC) algorithms ubiquitously employ complex deterministic transformations to generate proposal points that are then filtered by the Metropolis-Hastings-G…

cs.LG2020★ 1 cited

Involutive MCMC: a Unifying Framework

Kirill Neklyudov, Max Welling, Evgenii Egorov +1

Markov Chain Monte Carlo (MCMC) is a computational approach to fundamental problems such as inference, integration, optimization, and simulation. The field has developed a broad sp…

cs.LG2019

MaxEntropy Pursuit Variational Inference

Evgenii Egorov, Kirill Neklydov, Ruslan Kostoev +1

One of the core problems in variational inference is a choice of approximate posterior distribution. It is crucial to trade-off between efficient inference with simple families as…