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

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for 3D molecular graphs

DECAF optimizes molecular graphs for ensemble properties, improving drug design accuracy.

problem Designing molecules with ensemble properties rather than single conformations.
method DECAF uses Boltzmann-expected design with decoupled annealing flows to optimize molecular graphs.
result DECAF optimizes molecular graphs to shift ensemble properties towards targets, improving accuracy over single-conformer methods.

VecMol generates 3D molecules as continuous vector fields, overcoming modality and geometry constraints.

problem Challenges in generating 3D molecules, especially in drug discovery and materials science.
method VecMol reimagines molecular representation by modeling 3D molecules as continuous vector fields over Euclidean space, parameterized by a neural field and generated using a latent diffusion model.
result Vector-field-based representations show promise for 3D molecular generation, validated on benchmarks.

GCDM generates valid large 3D molecules and optimizes existing molecules.

problem Lack of geometric properties in 3D molecule generation models.
method Introduces Geometry-Complete Diffusion Model (GCDM) using equivariant GNNs.
result Significantly outperforms existing models in 3D molecule generation and optimization.

HLTF generates chemically valid 3D molecules with improved topology control.

problem Generating chemically valid 3D molecules is challenging due to bond topology errors.
method HLTF uses a latent multi-scale plan for global context and a constraint-aware sampler to suppress topology-driven failures.
result HLTF achieves high validity and uniqueness on QM9 and GEOM-DRUGS datasets.

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.

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.

New method generates molecular conformations efficiently.

problem Generating accurate molecular conformations efficiently.
method Variational approximation of rotatable bond torsion angles as a mixture of von Mises distributions.
result VonMisesNet generates conformations orders of magnitude faster than existing methods.

Machine learning methods have shown promise in predicting molecular properties, and given sufficient training data machine learning approaches can enable rapid high-throughput virtual screening of large libraries of compounds. Graph-based neural network architectures have emerged in recent years as the most successful …

2018-07-26abs ↗pdf ↗

Generative neural network designs novel 3D molecules with specified properties.

problem Designing molecules with desired properties in chemistry.
method Conditional generative neural network for 3D molecular structures.
result Demonstrated utility in generating novel molecules with specified motifs or composition.

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.

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 ↗

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.

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 present RL-VAE, a graph-to-graph variational autoencoder that uses reinforcement learning to decode molecular graphs from latent embeddings. Methods have been described previously for graph-to-graph autoencoding, but these approaches require sophisticated decoders that increase the complexity of training and evaluat…

2019-04-18abs ↗pdf ↗

Tiered latent representations and latent spaces for molecular graphs provide a simple but effective way to explicitly represent and utilize groups (e.g., functional groups), which consist of the atom (node) tier, the group tier and the molecule (graph) tier. They can be learned using the tiered graph autoencoder archit…

2019-08-22abs ↗pdf ↗

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 ↗

A new neural network model for molecular graphs that learns efficiently and accurately.

problem Learning on molecular graphs with cycles and complex structures.
method Hierarchical inter-message passing using raw graph and junction tree representations.
result The model outperforms classical GNNs in detecting cycles and is efficient to train.

E-NFs generate molecules and their positions while preserving Euclidean symmetries.

problem Generating molecules with their positions while preserving Euclidean symmetries.
method Integrating E(n) graph neural networks into a differential equation to create an invertible equivariant function.
result E-NFs significantly outperform baselines and existing methods in log-likelihood for particle systems and molecules.

Constructing of molecular structural models from Cryo-Electron Microscopy (Cryo-EM) density volumes is the critical last step of structure determination by Cryo-EM technologies. Methods have evolved from manual construction by structural biologists to perform 6D translation-rotation searching, which is extremely comput…

2019-01-03abs ↗pdf ↗

Advanced GNNs improve molecular generation models.

problem Generating complete graphs with multiple nodes and edges based on labels.
method Replaced standard GNNs with more expressive GNNs in autoregressive and one-shot generation models.
result Advanced GNNs can improve performance of graph generative models, but expressiveness is not a necessity.

MolHF generates complex molecules with hierarchical flow-based model.

problem Designing novel molecular structures with desired properties.
method MolHF is a hierarchical normalizing flow model that generates molecular graphs in a coarse-to-fine manner.
result MolHF achieves state-of-the-art performance in random generation and property optimization.

We propose GraphNVP, the first invertible, normalizing flow-based molecular graph generation model. We decompose the generation of a graph into two steps: generation of (i) an adjacency tensor and (ii) node attributes. This decomposition yields the exact likelihood maximization on graph-structured data, combined with t…

2019-05-28abs ↗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.

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 ↗

Study compares atom representations in graph neural networks for molecular properties.

problem Incorrect attribution of results in molecular property prediction due to varying atom features.
method Evaluated multiple atom representations on free energy, solubility, and metabolic stability predictions.
result Different atom representations can lead to varying predictive performance in graph neural networks.

SchNetPack 2.0 enhances atomistic machine learning with improved neural networks.

problem Improving atomistic machine learning methods and applications.
method Improved data pipeline, equivariant neural networks, PyTorch implementation, PyTorch Lightning, Hydra configuration framework.
result Easy extension and complex training tasks support.

HiGraphDTI learns drug and target representations from molecular graphs to predict DTIs.

problem Inaccurate drug-target interaction prediction due to insufficient chemical information extraction.
method Hierarchical graph representation learning to extract chemical information from atoms, motifs, and molecules.
result HiGraphDTI outperforms state-of-the-art methods in DTI prediction and interaction interpretation.

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.

The problem of accelerating drug discovery relies heavily on automatic tools to optimize precursor molecules to afford them with better biochemical properties. Our work in this paper substantially extends prior state-of-the-art on graph-to-graph translation methods for molecular optimization. In particular, we realize …

2019-06-11abs ↗pdf ↗

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.

A new graph model HMG and neural network HMGNN improve molecule property predictions.

problem Predicting quantum mechanical properties of molecules with limited consideration of many-body interactions.
method Introducing heterogeneous molecular graphs (HMG) and building HMGNN on neural message passing scheme.
result HMGNN achieves state-of-the-art performance in 9 out of 12 tasks on the QM9 dataset.

RNN operators solve Newton's equations with large timesteps for molecular dynamics.

problem Solving Newton's equations of motion with large timesteps for molecular dynamics simulations.
method Recurrent Neural Networks (RNN) operators to solve Newton's equations using past trajectory data.
result Significant speedup in molecular dynamics simulations with timesteps up to 4000 times larger.

GemNet improves molecular predictions by overcoming graph neural network limitations.

problem Graph neural networks struggle with distinguishing certain types of molecular graphs.
method Discretized geometric message passing neural network (GemNet) with spherical representations.
result GemNet outperforms previous models on molecular datasets by 34-20%.