EDBT 2026 Demo / reviewers in the wild / expert
Joseph Kleinhenz
dblp:349/4448
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 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.
| Artificial intelligence
3 papers |
Generative modeling · 86% Robot navigation and mapping · 10% 3D vision · 4% | |
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 100% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
1.5 | 2 | 2025 | Unified all-atom molecule generation with neural fields · NeurIPS 2025 3D molecule generation by denoising voxel grids · NeurIPS 2023 |
Machine learning › Generative modeling › diffusion model
score-based generative model |
1.5 | 2 | 2025 | Unified all-atom molecule generation with neural fields · NeurIPS 2025 3D molecule generation by denoising voxel grids · NeurIPS 2023 |
Bioinformatics and computational biology › molecular informatics › cheminformatics
molecule generation |
1.1 | 2 | 2025 | Unified all-atom molecule generation with neural fields · NeurIPS 2025 3D molecule generation by denoising voxel grids · NeurIPS 2023 |
Bioinformatics and computational biology › drug discovery › drug design
structure-based drug design |
0.9 | 1 | 2025 | Unified all-atom molecule generation with neural fields · NeurIPS 2025 |
Machine learning › Generative modeling › generative model
discrete generative model |
0.8 | 1 | 2024 | Protein Discovery with Discrete Walk-Jump Sampling · ICLR 2024 |
Machine learning › Generative modeling
energy-based model |
0.8 | 1 | 2024 | Protein Discovery with Discrete Walk-Jump Sampling · ICLR 2024 |
Bioinformatics and computational biology
protein design |
0.8 | 1 | 2024 | Protein Discovery with Discrete Walk-Jump Sampling · ICLR 2024 |
Machine learning › Generative modeling › molecular generation
3d molecule generation |
0.7 | 1 | 2023 | 3D molecule generation by denoising voxel grids · NeurIPS 2023 |
Machine learning › Generative modeling › score matching
denoising score matching |
0.7 | 1 | 2023 | 3D molecule generation by denoising voxel grids · NeurIPS 2023 |
Robotics › Robot navigation and mapping › robot mapping › map representation
voxel map |
0.7 | 1 | 2023 | 3D molecule generation by denoising voxel grids · NeurIPS 2023 |
Computer vision › 3D vision › implicit neural representation
neural field |
0.3 | 1 | 2025 | Unified all-atom molecule generation with neural fields · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
Langevin MCMC · 2.8score-based generative model · 1.7neural field · 1.7score-based model · 1.5denoising · 1.5contrastive divergence · 1.5neural empirical bayes · 1.3denoising neural network · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | JAMUN: Bridging Smoothed Molecular Dynamics and Score-Based Learning for Conformational Ensemble GenerationabstractConformational ensembles of protein structures are immensely important both for understanding protein function and drug discovery in novel modalities such as cryptic pockets. Current techniques for sampling ensembles such as molecular dynamics (MD) are computationally inefficient, while many recent machine learning methods do not transfer to systems outside their training data. We propose JAMUN which performs MD in a smoothed, noised space of all-atom 3D conformations of molecules by utilizing the framework of walk-jump sampling. JAMUN enables ensemble generation for small peptides at rates of an order of magnitude faster than traditional molecular dynamics. The physical priors in JAMUN enables transferability to systems outside of its training data, even to peptides that are longer than those originally trained on. Our model, code and weights are available at https://github.com/prescient-design/jamun. Ameya Daigavane, Bodhi P. Vani, Darcy Davidson, Saeed Saremi, Joshua A. Rackers, Joseph Kleinhenz |
NeurIPS | 6 |
| 2025 | Unified all-atom molecule generation with neural fieldsabstractGenerative models for structure-based drug design are often limited to a specific modality, restricting their broader applicability. To address this challenge, we introduce FuncBind, a framework based on computer vision to generate target-conditioned, all-atom molecules across atomic systems. FuncBind uses neural fields to represent molecules as continuous atomic densities and employs score-based generative models with modern architectures adapted from the computer vision literature. This modality-agnostic representation allows a single unified model to be trained on diverse atomic systems, from small to large molecules, and handle variable atom/residue counts, including non-canonical amino acids. FuncBind achieves competitive in silico performance in generating small molecules, macrocyclic peptides, and antibody complementarity-determining region loops, conditioned on target structures. FuncBind also generated in vitro novel antibody binders via de novo redesign of the complementarity-determining region H3 loop of two chosen co-crystal structures. As a final contribution, we introduce a new dataset and benchmark for structure-conditioned macrocyclic peptide generation. Matthieu Kirchmeyer, Pedro O. Pinheiro, Emma Willett, Karolis Martinkus, Joseph Kleinhenz, Emily K. Makowski, Andrew M. Watkins, Vladimir Gligorijevic, Richard Bonneau, Saeed Saremi |
NeurIPS | 5 |
| 2024 | Protein Discovery with Discrete Walk-Jump SamplingabstractWe resolve difficulties in training and sampling from a discrete generative model by learning a smoothed energy function, sampling from the smoothed data manifold with Langevin Markov chain Monte Carlo (MCMC), and projecting back to the true data manifold with one-step denoising. Our $\textit{Discrete Walk-Jump Sampling}$ formalism combines the contrastive divergence training of an energy-based model and improved sample quality of a score-based model, while simplifying training and sampling by requiring only a single noise level. We evaluate the robustness of our approach on generative modeling of antibody proteins and introduce the $\textit{distributional conformity score}$ to benchmark protein generative models. By optimizing and sampling from our models for the proposed distributional conformity score, 97-100\% of generated samples are successfully expressed and purified and 70\% of functional designs show equal or improved binding affinity compared to known functional antibodies on the first attempt in a single round of laboratory experiments. We also report the first demonstration of long-run fast-mixing MCMC chains where diverse antibody protein classes are visited in a single MCMC chain. Nathan C. Frey, Daniel Berenberg, Karina Zadorozhny, Joseph Kleinhenz, Julien Lafrance-Vanasse, Isidro Hötzel, Yan Wu 0027, Stephen Ra, Richard Bonneau, Kyunghyun Cho, Andreas Loukas, Vladimir Gligorijevic, Saeed Saremi |
ICLR | 4 |
| 2023 | 3D molecule generation by denoising voxel gridsabstractWe propose a new score-based approach to generate 3D molecules represented as atomic densities on regular grids.
First, we train a denoising neural network that learns to map from a smooth distribution of noisy molecules to the distribution of real molecules.
Then, we follow the _neural empirical Bayes_ framework [Saremi and Hyvarinen, 2019] and generate molecules in two steps: (i) sample noisy density grids from a smooth distribution via underdamped Langevin Markov chain Monte Carlo, and (ii) recover the "clean" molecule by denoising the noisy grid with a single step.
Our method, _VoxMol_, generates molecules in a fundamentally different way than the current state of the art (ie, diffusion models applied to atom point clouds). It differs in terms of the data representation, the noise model, the network architecture and the generative modeling algorithm.
Our experiments show that VoxMol captures the distribution of drug-like molecules better than state of the art, while being faster to generate samples. Pedro O. Pinheiro, Joshua A. Rackers, Joseph Kleinhenz, Michael Maser, Omar Mahmood, Andrew M. Watkins, Stephen Ra, Vishnu Sresht, Saeed Saremi |
NeurIPS | 3 |