Ellad B. Tadmor

dblp:61/9758 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
6since 2021 · last 2025
0000-0003-3311-6299ORCID · verified

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

Artificial intelligence and machine learning · 4 · 4 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 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 · 85% Bioinformatics and computational biology · 15%
Artificial intelligence
3 papers
Generative modeling · 91% Transfer learning and domain adaptation · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › generative model › continuous-time generative model
stochastic interpolants
0.912025
Open Materials Generation with Stochastic Interpolants · ICML 2025
Computational science and engineering › materials science
crystal structure prediction
0.912025
All that structure matches does not glitter · NeurIPS 2025
Computational science and engineering › materials science
materials discovery
0.912025
Open Materials Generation with Stochastic Interpolants · ICML 2025
Computational science and engineering
materials science
0.912025
All that structure matches does not glitter · NeurIPS 2025
Computational science and engineering › model simulation
atomistic simulation
0.612022
Injecting Domain Knowledge from Empirical Interatomic Potentials to Neural Networks for Predicting Material Properties · NeurIPS 2022
Bioinformatics and computational biology
molecular property prediction
0.612022
Injecting Domain Knowledge from Empirical Interatomic Potentials to Neural Networks for Predicting Material Properties · NeurIPS 2022
Machine learning › Generative modeling
diffusion model
0.312025
Open Materials Generation with Stochastic Interpolants · ICML 2025
Machine learning › Generative modeling
flow matching
0.312025
Open Materials Generation with Stochastic Interpolants · ICML 2025
Machine learning › Generative modeling
generative model evaluation
0.312025
All that structure matches does not glitter · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation › pre-training and adaptation
pre-training and fine-tuning
0.212022
Injecting Domain Knowledge from Empirical Interatomic Potentials to Neural Networks for Predicting Material Properties · NeurIPS 2022

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

polymorph-aware data splitting · 1.7match rate metric correction · 1.7equivariant graph neural network · 1.7discrete flow matching · 1.7deduplication · 1.7weakly supervised learning · 1.1transfer learning · 1.1empirical interatomic potentials · 1.1
YearPublicationVenuePosition
2025 Open Materials Generation with Stochastic Interpolants
abstract
The discovery of new materials is essential for enabling technological advancements. Computational approaches for predicting novel materials must effectively learn the manifold of stable crystal structures within an infinite design space. We introduce Open Materials Generation (OMatG), a unifying framework for the generative design and discovery of inorganic crystalline materials. OMatG employs stochastic interpolants (SI) to bridge an arbitrary base distribution to the target distribution of inorganic crystals via a broad class of tunable stochastic processes, encompassing both diffusion models and flow matching as special cases. In this work, we adapt the SI framework by integrating an equivariant graph representation of crystal structures and extending it to account for periodic boundary conditions in unit cell representations. Additionally, we couple the SI flow over spatial coordinates and lattice vectors with discrete flow matching for atomic species. We benchmark OMatG’s performance on two tasks: Crystal Structure Prediction (CSP) for specified compositions, and de novo generation (DNG) aimed at discovering stable, novel, and unique structures. In our ground-up implementation of OMatG, we refine and extend both CSP and DNG metrics compared to previous works. OMatG establishes a new state of the art in generative modeling for materials discovery, outperforming purely flow-based and diffusion-based implementations. These results underscore the importance of designing flexible deep learning frameworks to accelerate progress in materials science. The OMatG code is available at https://github.com/FERMat-ML/OMatG.
Philipp Höllmer, Thomas Egg, Maya M. Martirossyan, Eric Fuemmeler, Zeren Shui, Pawan Prakash, Adrian E. Roitberg, George Karypis, Mark K. Transtrum, Richard G. Hennig, Ellad B. Tadmor, Stefano Martiniani
ICML13
2025 All that structure matches does not glitter
abstract
Generative models for materials, especially inorganic crystals, hold potential to transform the theoretical prediction of novel compounds and structures. Advancement in this field depends critically on robust benchmarks and minimal, information-rich datasets that enable meaningful model evaluation. This paper critically examines common datasets and reported metrics for a crystal structure prediction task—generating the most likely structures given the chemical composition of a material. We focus on three key issues: First, materials datasets should contain unique crystal structures; for example, we show that the widely-utilized carbon-24 dataset only contains $\approx 40$% unique structures. Second, materials datasets should not be split randomly if polymorphs of many different compositions are numerous—which we find to be the case for the perov-5 and MP-20 datasets. Third, benchmarks can mislead if used uncritically, e.g., reporting a match rate metric without considering the structural variety exhibited by identical building blocks. To address these oft-overlooked issues, we introduce several fixes. We provide revised versions of the carbon-24 dataset: one with duplicates removed, one deduplicated and split by number of atoms $N$, one with enantiomorphs, and two containing only identical structures but with different unit cells. We also propose new splits for datasets with polymorphs, ensuring that polymorphs are grouped within each split subset, setting a more sensible standard for benchmarking model performance. Finally, we present METRe and cRMSE, new model evaluation metrics that can correct existing issues with the match rate metric.
Maya M. Martirossyan, Thomas Egg, Philipp Höllmer, George Karypis, Mark K. Transtrum, Adrian E. Roitberg, Richard G. Hennig, Ellad B. Tadmor, Stefano Martiniani
NeurIPS9
2023 Active Planar Mass Distribution Estimation with Robotic Manipulation
abstract
In this work, we present a method to estimate the planar mass distribution of a rigid object through robotic interactions and force/torque feedback. This is a challenging problem because of the complexity of modeling physical dynamics and the action dependencies across the model parameters. We propose a sequential estimation strategy combined with a set of robot action selection rules based on the analytical formulation of a discrete-time dynamics model. To evaluate the performance of our approach, we also manufactured re-configurable block objects that allow us to modify the object mass distribution while having access to the ground truth values. We compare our approach against multiple baselines and show that it can estimate the mass distribution with around 10% error, while the baselines have errors ranging from 18% to 68%.
Jiacheng Yuan, Changhyun Choi, Ellad B. Tadmor, Volkan Isler
IROS3
2022 HPC Extensions to the OpenKIM Processing Pipeline
abstract
The Open Knowledgebase of Interatomic Models (OpenKIM) is an NSF Science Gateway that archives fully functional computer implementations of interatomic models (potentials and force fields) and simulation codes that use them to compute material properties. Interatomic models are coupled with compatible simulation codes and executed in a fully automated manner by the OpenKIM processing pipeline, a cloud-based computation platform. The pipeline as previously introduced in the literature was insufficient to support the large volume and scale of computations that have become necessary within the materials science community. Accordingly, we present extensions made to the pipeline that allow it to utilize High-Performance Computing (HPC) resources in an efficient and performant fashion.
Daniel S. Karls, Steven M. Clark, Brendon A. Waters, Ryan S. Elliott, Ellad B. Tadmor
e-Science5
2022 Extending OpenKIM with an Uncertainty Quantification Toolkit for Molecular Modeling
Yonatan Kurniawan, Cody L. Petrie, Mark K. Transtrum, Ellad B. Tadmor, Ryan S. Elliott, Daniel S. Karls, Mingjian Wen
e-Science4
2022 Injecting Domain Knowledge from Empirical Interatomic Potentials to Neural Networks for Predicting Material Properties
abstract
For decades, atomistic modeling has played a crucial role in predicting the behavior of materials in numerous fields ranging from nanotechnology to drug discovery. The most accurate methods in this domain are rooted in first-principles quantum mechanical calculations such as density functional theory (DFT). Because these methods have remained computationally prohibitive, practitioners have traditionally focused on defining physically motivated closed-form expressions known as empirical interatomic potentials (EIPs) that approximately model the interactions between atoms in materials. In recent years, neural network (NN)-based potentials trained on quantum mechanical (DFT-labeled) data have emerged as a more accurate alternative to conventional EIPs. However, the generalizability of these models relies heavily on the amount of labeled training data, which is often still insufficient to generate models suitable for general-purpose applications. In this paper, we propose two generic strategies that take advantage of unlabeled training instances to inject domain knowledge from conventional EIPs to NNs in order to increase their generalizability. The first strategy, based on weakly supervised learning, trains an auxiliary classifier on EIPs and selects the best-performing EIP to generate energies to supplement the ground-truth DFT energies in training the NN. The second strategy, based on transfer learning, first pretrains the NN on a large set of easily obtainable EIP energies, and then fine-tunes it on ground-truth DFT energies. Experimental results on three benchmark datasets demonstrate that the first strategy improves baseline NN performance by 5% to 51% while the second improves baseline performance by up to 55%. Combining them further boosts performance.
Zeren Shui, Daniel S. Karls, Mingjian Wen, Ilia A. Nikiforov, Ellad B. Tadmor, George Karypis
NeurIPS5