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

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for molecular property optimization

ChemBO optimizes small organic molecules for synthesis and desired properties.

problem Designing and optimizing new organic molecules for specific properties.
method Bayesian optimization framework that considers synthesizability constraints.
result ChemBO generates synthesizable candidates efficiently and effectively.

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.

The study addresses biases in evaluating molecular optimization methods and proposes methods to reduce these biases.

problem Biases in in silico evaluation of molecular optimization methods.
method Discussion and empirical investigation of bias reduction methods for predictor misspecification and sample reuse.
result Empirical investigation of bias reduction methods for predictor misspecification and sample reuse.

POEM predicts drug properties without tuning, outperforming other methods.

problem Predicting drug properties from molecular structures efficiently.
method POEM combines multiple molecular representations without hyperparameter tuning.
result POEM outperforms industry-standard methods across 17 tasks.

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.

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.

All SMILES VAE learns molecule latent representations from SMILES strings.

problem Non-unique SMILES strings and high computational cost of graph convolutions hinder VAEs for molecular property optimization.
method Stacked recurrent neural networks encode multiple SMILES strings, pooling hidden representations, and attentional pooling builds a final latent representation.
result All SMILES VAE significantly surpasses state-of-the-art in molecular property optimization tasks.

GraphAF generates chemically valid molecules efficiently and accurately.

problem Generating chemically valid molecular structures while optimizing chemical properties.
method Flow-based autoregressive model combining autoregressive and flow-based approaches.
result GraphAF generates 68% chemically valid molecules without chemical knowledge rules and 100% with rules, achieving state-of-the-art performance.

Enhances molecular design models by fine-tuning uncertainty-guided VAEs.

problem Fine-tuning pre-trained generative models for specific molecular property optimization.
method Uncertainty-guided fine-tuning of variational autoencoders in an active learning setting.
result Uncertainty-guided fine-tuning improves model performance across multiple molecular properties.

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.

MolecularRNN generates realistic molecules with desired properties.

problem Designing new molecules with specific properties.
method Graph recurrent generative model with likelihood pretraining and policy gradient tuning.
result Significant distribution shift to desired ranges for lipophilicity, drug-likeness, and melting point.

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

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.

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.

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 ↗

DESMILES uses deep learning to improve drug discovery by optimizing molecule properties.

problem Improving the efficiency and accuracy of drug discovery through better molecular design.
method DESMILES is a deep neural network model that optimizes molecular properties for drug discovery.
result DESMILES achieved a 77% lower failure rate in modifying molecules to inhibit the dopamine receptor D2 compared to state-of-the-art models.

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.

New algorithm improves model generalization in structured biomedical domains.

problem Improving model generalization in structured biomedical domains.
method Proposes a new regret minimization (RGM) algorithm and its structured extension for better performance in diverse environments.
result Significantly outperforms previous state-of-the-art baselines on molecular property prediction, protein homology, and stability prediction.

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.

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.

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.

PG-EVIKAL refines molecular property predictions using neighbor fusion and evidential neural networks.

problem Improving molecular property predictions using test-time neighbor fusion.
method Adapting evidential neural networks to refine predictions by re-ranking structurally similar neighbors.
result PG-EVIKAL reduces RMSE on 14 out of 16 molecular datasets, improving calibration and sequential refinement.

Automates GNN design for molecular property prediction.

problem Designing and tuning GNN architectures for molecular property prediction is labor-intensive.
method Developed a NAS approach to automatically discover high-performing GNN architectures for MPNNs.
result Automatically discovered MPNNs outperform manually designed GNNs in molecular property prediction.

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.

Gradient GA uses gradient information to improve molecular design.

problem Random walk exploration limits genetic algorithms' quality and speed in molecular design.
method Gradient GA incorporates gradient information from the objective function into genetic algorithms, using a differentiable neural network and Discrete Langevin Proposal.
result Significantly improves convergence speed and solution quality over traditional genetic algorithms.

Cormorant learns molecular properties via rotationally covariant neural networks.

problem Learning molecular potential energy surfaces and properties.
method Rotationally covariant neural network architecture with tensor products and Clebsch-Gordan decomposition.
result Significantly outperforms competing algorithms in learning molecular Potential Energy Surfaces.

Rotationally equivariant convolutions improve molecular property prediction.

problem Predicting molecular properties using graph neural networks.
method Ablation study with rotationally equivariant and invariant convolutions on QM9 data set.
result Rotationally equivariant layers decrease test error by an average of 23%.

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.

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.

Deep generative models have been praised for their ability to learn smooth latent representation of images, text, and audio, which can then be used to generate new, plausible data. However, current generative models are unable to work with molecular graphs due to their unique characteristics-their underlying structure …

2018-02-14abs ↗pdf ↗

New task aligns molecular structure with gene expression changes.

problem Modeling the relationship between chemical structure and gene expression changes.
method Developed a cross-modal small molecule retrieval task and a coordinated deep learning approach to align chemical structure and gene expression profiles.
result Demonstrated the feasibility of the new task and highlighted the limitations of current data and systems.

Modof-pipe optimizes molecules by modifying a single site, outperforming state-of-the-art methods.

problem Improving drug candidates' properties through chemical modification.
method Deep generative model Modof over molecular graphs for molecule optimization.
result Modof-pipe achieves significant improvements in octanol-water partition coefficient and molecule similarity constraints.

Improved molecular property prediction using WL embedding in GNNs.

problem Limited performance of GNNs in predicting molecular properties.
method Explored Weisfeiler-Lehman (WL) embedding to replace GNN layers, enhancing representability and performance.
result WL embedding consistently improves GNN performance across multiple datasets.