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.

Luca A. Thiede

dblp:281/8148 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none

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
2 papers
Computational science and engineering · 60% Bioinformatics and computational biology · 40%
Artificial intelligence
2 papers
Optimization for machine learning · 87% Generative modeling · 13%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
gradient flow
0.712023
Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schrödinger Equation · NeurIPS 2023
Machine learning › Optimization for machine learning › gradient flow
wasserstein gradient flow
0.712023
Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schrödinger Equation · NeurIPS 2023
Computational science and engineering
computational chemistry
0.712023
Tartarus: A Benchmarking Platform for Realistic And Practical Inverse Molecular Design · NeurIPS 2023
Computational science and engineering › materials informatics
inverse molecular design
0.712023
Tartarus: A Benchmarking Platform for Realistic And Practical Inverse Molecular Design · NeurIPS 2023
Bioinformatics and computational biology › molecular informatics
molecular design
0.712023
Tartarus: A Benchmarking Platform for Realistic And Practical Inverse Molecular Design · NeurIPS 2023
Bioinformatics and computational biology › drug discovery
molecular optimization
0.712023
Tartarus: A Benchmarking Platform for Realistic And Practical Inverse Molecular Design · NeurIPS 2023
Computational science and engineering › computational chemistry
quantum chemistry
0.712023
Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schrödinger Equation · NeurIPS 2023
Machine learning › Generative modeling
molecular generation
0.212023
Tartarus: A Benchmarking Platform for Realistic And Practical Inverse Molecular Design · NeurIPS 2023

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

reinforcement learning · 1.3physical simulation · 1.3natural gradient · 1.3generative model · 1.3fisher-rao metric · 1.3
YearPublicationVenuePosition
2025 ELECTRA: A Cartesian Network for 3D Charge Density Prediction with Floating Orbitals
abstract
We present the Electronic Tensor Reconstruction Algorithm (ELECTRA) - an equivariant model for predicting electronic charge densities using floating orbitals. Floating orbitals are a long-standing concept in the quantum chemistry community that promises more compact and accurate representations by placing orbitals freely in space, as opposed to centering all orbitals at the position of atoms. Finding the ideal placement of these orbitals requires extensive domain knowledge, though, which thus far has prevented widespread adoption. We solve this in a data-driven manner by training a Cartesian tensor network to predict the orbital positions along with orbital coefficients. This is made possible through a symmetry-breaking mechanism that is used to learn position displacements with lower symmetry than the input molecule while preserving the rotation equivariance of the charge density itself. Inspired by recent successes of Gaussian Splatting in representing densities in space, we are using Gaussian orbitals and predicting their weights and covariance matrices. Our method achieves a state-of-the-art balance between computational efficiency and predictive accuracy on established benchmarks. Furthermore, ELECTRA is able to lower the compute time required to arrive at converged DFT solutions - initializing calculations using our predicted densities yields an average 50.72 % reduction in self-consistent field (SCF) iterations on unseen molecules.
Jonas Elsborg, Luca A. Thiede, Alán Aspuru-Guzik, Tejs Vegge, Arghya Bhowmik
NeurIPS2
2023 Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schrödinger Equation
abstract
Solving the quantum many-body Schrödinger equation is a fundamental and challenging problem in the fields of quantum physics, quantum chemistry, and material sciences. One of the common computational approaches to this problem is Quantum Variational Monte Carlo (QVMC), in which ground-state solutions are obtained by minimizing the energy of the system within a restricted family of parameterized wave functions. Deep learning methods partially address the limitations of traditional QVMC by representing a rich family of wave functions in terms of neural networks. However, the optimization objective in QVMC remains notoriously hard to minimize and requires second-order optimization methods such as natural gradient. In this paper, we first reformulate energy functional minimization in the space of Born distributions corresponding to particle-permutation (anti-)symmetric wave functions, rather than the space of wave functions. We then interpret QVMC as the Fisher--Rao gradient flow in this distributional space, followed by a projection step onto the variational manifold. This perspective provides us with a principled framework to derive new QMC algorithms, by endowing the distributional space with better metrics, and following the projected gradient flow induced by those metrics. More specifically, we propose "Wasserstein Quantum Monte Carlo" (WQMC), which uses the gradient flow induced by the Wasserstein metric, rather than the Fisher--Rao metric, and corresponds to *transporting* the probability mass, rather than *teleporting* it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
Kirill Neklyudov, Jannes Nys, Luca A. Thiede, Juan Carrasquilla, Max Welling, Alireza Makhzani
NeurIPS3
2023 Tartarus: A Benchmarking Platform for Realistic And Practical Inverse Molecular Design
abstract
The efficient exploration of chemical space to design molecules with intended properties enables the accelerated discovery of drugs, materials, and catalysts, and is one of the most important outstanding challenges in chemistry. Encouraged by the recent surge in computer power and artificial intelligence development, many algorithms have been developed to tackle this problem. However, despite the emergence of many new approaches in recent years, comparatively little progress has been made in developing realistic benchmarks that reflect the complexity of molecular design for real-world applications. In this work, we develop a set of practical benchmark tasks relying on physical simulation of molecular systems mimicking real-life molecular design problems for materials, drugs, and chemical reactions. Additionally, we demonstrate the utility and ease of use of our new benchmark set by demonstrating how to compare the performance of several well-established families of algorithms. Overall, we believe that our benchmark suite will help move the field towards more realistic molecular design benchmarks, and move the development of inverse molecular design algorithms closer to the practice of designing molecules that solve existing problems in both academia and industry alike.
AkshatKumar Nigam, Robert Pollice, Gary Tom, Kjell Jorner, John Willes, Luca A. Thiede, Anshul Kundaje, Alán Aspuru-Guzik
NeurIPS6