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,742 papers · 148 categories

Trend · papers per month

50100149199 · Jun 202019922001200920172026
48 results for Molecular Transformer

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.

Much of the recent work on learning molecular representations has been based on Graph Convolution Networks (GCN). These models rely on local aggregation operations and can therefore miss higher-order graph properties. To remedy this, we propose Path-Augmented Graph Transformer Networks (PAGTN) that are explicitly built…

2019-05-29abs ↗pdf ↗

A2I Transformer predicts atom energies from coordinates, avoiding heavy featurization.

problem Efficiently predicting atom energies from molecular coordinates with minimal featurization.
method End-to-end model using self-attention, permutation-equivariant.
result Stable predictions with significantly smaller errors than molecular dynamics simulations.

G2Gs transforms target molecules into reactants without templates, improving accuracy.

problem Predicting retrosynthesis from target molecules efficiently and accurately.
method Transforming target molecular graphs into reactant graphs via variational graph translation.
result G2Gs achieves top-1 accuracy close to state-of-the-art template-based methods.

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.

There is an increasing demand for computing the relevant structures, equilibria and long-timescale kinetics of biomolecular processes, such as protein-drug binding, from high-throughput molecular dynamics simulations. Current methods employ transformation of simulated coordinates into structural features, dimension red…

2017-10-16abs ↗pdf ↗

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.

We introduce multiscale invariant dictionaries to estimate quantum chemical energies of organic molecules, from training databases. Molecular energies are invariant to isometric atomic displacements, and are Lipschitz continuous to molecular deformations. Similarly to density functional theory (DFT), the molecule is re…

2016-05-16abs ↗pdf ↗

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.

We introduce the Hierarchically Interacting Particle Neural Network (HIP-NN) to model molecular properties from datasets of quantum calculations. Inspired by a many-body expansion, HIP-NN decomposes properties, such as energy, as a sum over hierarchical terms. These terms are generated from a neural network--a composit…

2017-09-29abs ↗pdf ↗

We present an approach to make molecular optimization more efficient. We infer a hypergraph replacement grammar from the ChEMBL database, count the frequencies of particular rules being used to expand particular nonterminals in other rules, and use these as conditional priors for the policy model. Simulating random mol…

2019-06-05abs ↗pdf ↗

CW Networks leverage cell complexes to enhance GNNs, achieving state-of-the-art results on molecular datasets.

problem Graph Neural Networks struggle with long-range interactions and lack principled ways to model higher-order structures.
method CW Networks use cell complexes to decouple computational and input graph structures, enabling flexible hierarchical message passing.
result CW Networks achieve state-of-the-art results on molecular datasets.

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.

Simple linear models outperform complex BO methods in high dimensions.

problem Overcoming the curse of dimensionality in Bayesian optimization.
method Bayesian linear regression with linear kernels, applied to high-dimensional search spaces.
result Simple linear models match or outperform state-of-the-art BO methods in high-dimensional tasks.

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.

GraphDETR detects subgraphs in large graphs using deep learning.

problem Detecting subgraphs in large graphs efficiently and accurately.
method Formulates subgraph detection as a set prediction problem using GraphDETR, a deep learning framework.
result GraphDETR can detect diverse patterns in large graphs, achieving strong performance on molecular functional group detection.

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.

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.

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.

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.