Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel S. Levine 0003

dblp:290/4726 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0001-8921-3659ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Computational science and engineering · 73% Energy systems and smart grids · 17% Bioinformatics and computational biology · 10%
Artificial intelligence
2 papers
Generative modeling · 61% Motion planning and robot control · 30% Deep learning architectures and training · 9%

Topics — the 11 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › model simulation › atomistic simulation
machine learning interatomic potential
1.722025
UMA: A Family of Universal Models for Atoms · NeurIPS 2025
Learning Smooth and Expressive Interatomic Potentials for Physical Property Prediction · ICML 2025
Machine learning › Generative modeling
diffusion model
0.912025
Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching · ICML 2025
Machine learning › Generative modeling › diffusion model
diffusion sampling
0.912025
Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching · ICML 2025
Robotics › Motion planning and robot control
stochastic optimal control
0.912025
Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching · ICML 2025
Computational science and engineering › model simulation
atomistic simulation
0.912025
UMA: A Family of Universal Models for Atoms · NeurIPS 2025
Energy systems and smart grids › sustainable energy
energy conservation
0.912025
Learning Smooth and Expressive Interatomic Potentials for Physical Property Prediction · ICML 2025
Computational science and engineering › computational chemistry
molecular simulation
0.912025
Learning Smooth and Expressive Interatomic Potentials for Physical Property Prediction · ICML 2025
Machine learning › Deep learning architectures and training
mixture of experts
0.312025
UMA: A Family of Universal Models for Atoms · NeurIPS 2025
Computational science and engineering
computational chemistry
0.312025
Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching · ICML 2025
Bioinformatics and computational biology › molecular informatics › molecular modeling
molecular conformation generation
0.312025
Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching · ICML 2025
Bioinformatics and computational biology
molecular property prediction
0.312025
UMA: A Family of Universal Models for Atoms · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

stochastic optimal control · 1.7scaling laws · 1.7adjoint matching · 1.7molecular dynamics simulation · 0.9equivariant neural network · 0.9
YearPublicationVenuePosition
2025 Learning Smooth and Expressive Interatomic Potentials for Physical Property Prediction
abstract
Machine learning interatomic potentials (MLIPs) have become increasingly effective at approximating quantum mechanical calculations at a fraction of the computational cost. However, lower errors on held out test sets do not always translate to improved results on downstream physical property prediction tasks. In this paper, we propose testing MLIPs on their practical ability to conserve energy during molecular dynamic simulations. If passed, improved correlations are found between test errors and their performance on physical property prediction tasks. We identify choices which may lead to models failing this test, and use these observations to improve upon highly-expressive models. The resulting model, eSEN, provides state-of-the-art results on a range of physical property prediction tasks, including materials stability prediction, thermal conductivity prediction, and phonon calculations.
Xiang Fu 0005, Brandon M. Wood, Luis Barroso-Luque, Daniel S. Levine 0003, Misko Dzamba, C. Lawrence Zitnick
ICML4
2025 Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching
abstract
We introduce Adjoint Sampling, a highly scalable and efficient algorithm for learning diffusion processes that sample from unnormalized densities, or energy functions. It is the first on-policy approach that allows significantly more gradient updates than the number of energy evaluations and model samples, allowing us to scale to much larger problem settings than previously explored by similar methods. Our framework is theoretically grounded in stochastic optimal control and shares the same theoretical guarantees as Adjoint Matching, being able to train without the need for corrective measures that push samples towards the target distribution. We show how to incorporate key symmetries, as well as periodic boundary conditions, for modeling molecules in both cartesian and torsional coordinates. We demonstrate the effectiveness of our approach through extensive experiments on classical energy functions, and further scale up to neural network-based energy models where we perform amortized conformer generation across many molecular systems. To encourage further research in developing highly scalable sampling methods, we plan to open source these challenging benchmarks, where successful methods can directly impact progress in computational chemistry. Code & and benchmarks provided at https://github.com/facebookresearch/adjoint_sampling.
Aaron J. Havens, Benjamin Kurt Miller, Carles Domingo-Enrich, Anuroop Sriram, Daniel S. Levine 0003, Brandon M. Wood, Brandon Amos, Brian Karrer, Xiang Fu 0005, Guan-Horng Liu, Ricky T. Q. Chen
ICML6
2025 UMA: A Family of Universal Models for Atoms
abstract
The ability to quickly and accurately compute properties from atomic simulations is critical for advancing a large number of applications in chemistry and materials science including drug discovery, energy storage, and semiconductor manufacturing. To address this need, we present a family of Universal Models for Atoms (UMA), designed to push the frontier of speed, accuracy, and generalization. UMA models are trained on half a billion unique 3D atomic structures (the largest training runs to date) by compiling data across multiple chemical domains, e.g. molecules, materials, and catalysts. We develop empirical scaling laws to help understand how to increase model capacity alongside dataset size to achieve the best accuracy. The UMA small and medium models utilize a novel architectural design we refer to as mixture of linear experts that enables increasing model capacity without sacrificing speed. For example, UMA-medium has 1.4B parameters but only $\sim$50M active parameters per atomic structure. We evaluate UMA models on a diverse set of applications across multiple domains and find that, remarkably, a single model without any fine-tuning can perform similarly or better than specialized models. We are releasing the UMA code, weights, and associated data to accelerate computational workflows and enable the community to build increasingly capable AI models.
Brandon M. Wood, Misko Dzamba, Xiang Fu 0005, Muhammed Shuaibi, Luis Barroso-Luque, Kareem Abdelmaqsoud, Vahe Gharakhanyan, John R. Kitchin, Daniel S. Levine 0003, Kyle Michel, Anuroop Sriram, Taco Cohen, Abhishek Das 0002, Sushree Jagriti Sahoo, Ammar Rizvi, Zachary W. Ulissi, C. Lawrence Zitnick
NeurIPS10