Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,932 papers · 148 categories

Trend · papers per month

6121723 · Feb 202019922001200920172026
48 results for molecular wavefunctions

Unified machine learning predicts molecular wavefunctions efficiently.

problem Lack of explicit electronic structure in machine learning models for chemistry.
method Deep neural network for quantum mechanical wavefunction prediction.
result Efficient prediction of molecular wavefunctions with full electronic structure access.

New model predicts molecular wavefunctions and densities with unprecedented accuracy.

problem Challenging task of predicting wavefunctions due to molecular rotations.
method Introduces SE(3)-equivariant operations for deep learning.
result Achieves speedups and error reductions over ab initio methods.

New dataset abla2 abla^2DFT for drug-like molecules benchmarks neural network potentials.

problem Lack of large, diverse datasets for training neural network potentials in quantum chemistry.
method Developed a new dataset abla2 abla^2DFT containing energies, forces, and molecular properties for drug-like molecules.
result First dataset with relaxation trajectories for drug-like molecules.

Deep neural network predicts molecular wave functions in minimal basis.

problem Improving accuracy and efficiency in quantum chemistry calculations.
method Adapted SchNet for Orbitals (SchNOrb) model in quasi-atomic minimal basis.
result Model accurately predicts molecular orbital energies and wavefunctions for large molecules.

Enhanced VMC methods improve neural wavefunction training.

problem Efficiently training neural wavefunctions in VMC to converge to energy minimum.
method Rayleigh-Gauss-Newton (RGN) optimization and parallel tempering sampling.
result RGN method achieves superlinear convergence with reduced computational cost.

A new model designs molecular latent vectors for drug discovery.

problem Designing effective molecular descriptors from molecular structures.
method Proposes a denoising diffusion probabilistic model (DDPM) for variational autoencoding molecular graphs.
result Demonstrates superior prediction performance and robustness compared to existing approaches.

MoFlow generates chemically valid molecular graphs from latent representations.

problem Generating chemically valid molecular graphs from latent representations is challenging.
method MoFlow uses a flow-based approach with Glow for bond generation and a novel graph conditional flow for atom generation, ensuring chemical validity and efficiency.
result MoFlow achieves state-of-the-art performance in molecular graph generation and optimization.

Study compares GNNs and classical molecular featurisations for molecular property and cliff prediction.

problem Comparing GNNs and classical featurisations for molecular property and cliff prediction.
method Systematic exploration and comparison of PDVs, ECFPs, and GNNs; introduction of substructure pooling.
result Sort & Slice outperforms hash-based folding in ECFP vectorization.

Novel RL approach for molecular design using quantum mechanics.

problem Existing RL methods for molecular design are limited in scope and reward function.
method Formulation in Cartesian coordinates, direct use of quantum mechanics for reward function, translation and rotation invariant state-action space.
result Agent efficiently learns to solve molecular design tasks from scratch.

Graph neural networks improve molecular property prediction.

problem Efficiently predicting molecular properties with high accuracy and scalability.
method Gated Graph Recursive Neural Networks (GGNN) with skip connections.
result GGNN achieves state-of-the-art performance on molecular property prediction benchmarks.

Generative model learns molecular geometry from graph representations.

problem Generating equilibrium states for molecular systems is computationally expensive.
method Probabilistic model based on Euclidean distance geometry.
result Generative model achieves state-of-the-art accuracy in molecular conformation generation.

AniDS improves molecular force field modeling by learning anisotropic noise.

problem Molecular force field modeling suffers from oversimplified assumptions about atomic motions.
method AniDS introduces anisotropic noise generation for better modeling of directional and structural variability.
result AniDS outperforms existing methods on benchmarks, achieving significant improvements in force prediction accuracy.

Machine learning models simulate molecular spectra and reactions in solvents.

problem Accurate simulation of molecular spectra and reactions in solvent environments.
method Introduced FieldSchNet, a deep neural network for modeling molecular interactions with external fields.
result Demonstrated significant lowering of Claisen rearrangement reaction activation barrier using FieldSchNet.

LaPool improves molecular graph representation learning by capturing interaction importance.

problem Lack of efficient intermediate pooling steps in GNNs leads to poor molecular substructure representation.
method LaPool is a novel, data-driven, and interpretable hierarchical graph pooling method that considers node features and graph structure.
result LaPool outperforms recent GNNs on molecular graph prediction and understanding tasks.

Framework for training-free guidance in discrete diffusion models for molecular generation.

problem No equivalent training-free guidance methods for discrete diffusion models.
method Framework using guidance functions for discrete data.
result Demonstrated utility on molecular graph generation tasks.

GraphNVP generates molecular graphs efficiently and reversibly.

problem Generating valid molecular graphs with desired properties.
method Decomposes graph generation into adjacency tensor and node attributes, using reversible flows.
result Efficiently generates valid molecular graphs with minimal duplicates and latent space for property generation.

Generative models accelerate molecular dynamics by four orders of magnitude.

problem Femtosecond time steps limit access to slow molecular processes.
method Deep generative modeling framework that accelerates sampling.
result Quantitative characterization of equilibrium ensembles and dynamical relaxation processes.

FlowMO uses Gaussian Processes for molecular property prediction with uncertainty.

problem Predicting molecular properties with uncertainty for small datasets.
method Gaussian Processes implemented in FlowMO, built on GPflow and RDKit.
result Comparable predictive performance to deep learning but superior uncertainty calibration.

Framework learns surrogates for molecular dynamics across multiple time-scales.

problem Stable molecular dynamics simulations require small time-steps, but long-time-scale moments need repeated simulations.
method Implicit Transfer Operator Learning with denoising diffusion probabilistic models and SE(3) equivariant architecture.
result Models can generate self-consistent stochastic dynamics across multiple time-scales.

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-d…

2016-03-02abs ↗pdf ↗

Researchers use active subspaces to quantify uncertainty in deep generative models for molecular design.

problem Uncertainty quantification in deep generative models for molecular design due to high parameter space.
method Leveraging active subspaces to approximate posterior distribution over low-dimensional parameters.
result The proposed UQ scheme effectively estimates epistemic uncertainty in high-dimensional parameter space without altering model architecture.

Timewarp accelerates molecular dynamics by learning to simulate long timescales.

problem Efficiently simulating long timescales in molecular dynamics.
method Uses a normalizing flow to learn large time steps in Markov chain Monte Carlo.
result Generalizes to unseen small peptides, accelerating sampling.

GAGA accelerates 3D molecular generation by replacing long trajectories with Gaussian approximations.

problem High computational cost of long generative trajectories in 3D molecular generation.
method GAGA identifies a characteristic step where molecular data becomes sufficiently Gaussian, replacing the trajectory with a Gaussian approximation.
result Significant improvement in both generation quality and computational efficiency.

Graph Polish optimizes molecular structures by minimizing changes and maximizing preservation.

problem Error-prone traditional molecular optimization methods.
method Graph Polish transforms optimization into a polishing task, focusing on optimization centers and minimizing changes.
result Significant advantage over state-of-the-art methods on multiple optimization tasks.

Molecular dynamics simulations are an important tool for describing the evolution of a chemical system with time. However, these simulations are inherently held back either by the prohibitive cost of accurate electronic structure theory computations or the limited accuracy of classical empirical force fields. Machine l…

2018-12-18abs ↗pdf ↗

ASGN uses active semi-supervised learning to predict molecular properties efficiently.

problem Predicting molecular properties with scarce labeled data and high computational cost.
method ASGN combines a teacher-student framework with active learning to handle joint representation and property learning.
result ASGN achieves remarkable performance in property prediction on public datasets.

We seek to automate the design of molecules based on specific chemical properties. In computational terms, this task involves continuous embedding and generation of molecular graphs. Our primary contribution is the direct realization of molecular graphs, a task previously approached by generating linear SMILES strings …

2018-02-12abs ↗pdf ↗

We construct from first principles the operator 'A-hat' that annihilates the partition functions (or wavefunctions) of three-dimensional Chern-Simons theory with gauge groups SU(2), SL(2,R), or SL(2,C) on a knot complement M. The operator 'A-hat' is a quantization of the knot complement's classical A-polynomial A(l,m).…

2011-02-23abs ↗pdf ↗

XIMP improves molecular property prediction by integrating multiple graph representations.

problem Graph neural networks struggle in data-scarce regimes and fail to surpass traditional methods.
method Cross-graph inter-message passing with multiple graph abstractions.
result XIMP outperforms state-of-the-art baselines across diverse molecular property tasks.

PAGTN improves molecular property prediction by leveraging longer-range graph dependencies.

problem Local aggregation in GCNs misses higher-order graph properties.
method PAGTN uses path features and global attention layers to capture longer-range dependencies.
result PAGTN outperforms GCNs on various molecular property prediction datasets.

RC flow learns molecular kinetics in low dimensions.

problem Discovering interpretable low-dimensional models of molecular kinetics.
method Normalizing flow for coordinate transformation and Brownian dynamics for kinetics approximation.
result Tractable and trainable model of reduced kinetics in continuous time and space.

This paper reviews deep learning and knowledge-based methods for molecular design.

problem Optimizing molecular properties for scientific advances and process performance.
method Survey of deep learning and knowledge-based methods for molecular design.
result Deep learning models show promise in overcoming computational challenges.

SMILES Transformer learns molecular fingerprints for drug discovery.

problem Poor performance of rule-based molecular fingerprints in shallow prediction models or small datasets.
method Unsupervised pre-training of a sequence-to-sequence language model on a corpus of SMILES.
result SMILES Transformer outperformed existing methods in small-data settings.