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.

169,051 papers · 148 categories

Trend · papers per month

76152227303 · Jun 202019922001200920182026
48 results for 3D molecular graph

3DGCN predicts molecular properties and biochemical activities using 3D molecular graph.

problem Predicting molecular properties and biochemical activities from 3D molecular graphs.
method Unified graph convolution with learning operations to handle spatial information, distinguishing 3D rotations.
result Significantly higher performance on various molecular tasks compared to other deep-learning models.

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.

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.

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 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.

New method reconstructs moving parts of proteins in cryo-EM.

problem Reconstructing non-rigid molecules with moving parts in cryo-EM.
method Graph Laplacian construction from multiple projection images, followed by spectral volume expansion.
result High-resolution visualization of molecular dynamics using spectral volumes.

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.

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.

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 ↗

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.

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.

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.

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.

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.

Enhances drug discovery by optimizing molecular structures.

problem Accelerate drug discovery through better optimization of precursor molecules.
method Integrates substructure components with atom-level encoding in a fully autoregressive graph decoder.
result Significantly outperforms previous state-of-the-art baselines on molecular optimization tasks.

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.

A new flow-based model for molecular graphs achieves better performance with fewer parameters.

problem Generating molecular graphs efficiently and accurately.
method Graph residual flow (GRF) based on residual flows for molecular graphs, with invertibility conditions derived.
result The GRF model achieves comparable performance to existing models with significantly fewer parameters.

Graph neural networks outperform fixed molecular descriptors in property prediction.

problem Comparing graph neural networks to fixed molecular descriptors for property prediction.
method Benchmarked graph convolutional neural networks on public and proprietary datasets.
result Graph convolutional model consistently matches or outperforms existing models on both public and proprietary datasets.

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.

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.

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.

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.