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

Trend · papers per month

6121824 · Feb 202019922001200920172026
48 results for Molecular Substructures

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.

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 ↗

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.

Generative model learns to create molecules with multiple properties using interpretable substructures.

problem Creating molecules with multiple chemical properties is challenging.
method Compose molecules from substructures identified as responsible for each property, using graph generative models.
result Significant improvements in accuracy, diversity, and novelty of generated compounds over state-of-the-art baselines.

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 ↗

Graph neural networks struggle with counting certain substructures in graphs.

problem Detecting and counting specific substructures in graphs.
method Study of graph neural networks' ability to count attributed graph substructures.
result Graph neural networks like MPNNs, 2-WL, and 2-IGNs have limitations in counting certain substructures.

Graph Substructure Networks (GSN) improves GNN expressivity by counting subgraph isomorphisms.

problem Limited expressivity of GNNs in detecting and counting graph substructures.
method Topologically-aware message passing scheme based on substructure encoding.
result GSN is strictly more expressive than the Weisfeiler-Leman (WL) test and can disambiguate even hard graph isomorphism instances.

Searching new molecules in areas like drug discovery often starts from the core structures of candidate molecules to optimize the properties of interest. The way as such has called for a strategy of designing molecules retaining a particular scaffold as a substructure. On this account, our present work proposes a scaff…

2019-05-31abs ↗pdf ↗

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.

STNN-DDI predicts drug interactions using substructure-aware neural networks.

problem Predicting drug-drug interactions (DDIs) to avoid side effects in poly-drug treatments.
method Designing a novel Substructure-ware Tensor Neural Network (STNN-DDI) that learns a 3-D tensor of substructure-substructure interactions.
result Significant improvement in AUC, AUPR, Accuracy, and Precision compared to state-of-the-art models.

Molecule optimization is about generating molecule YY with more desirable properties based on an input molecule XX. The state-of-the-art approaches partition the molecules into a large set of substructures SS and grow the new molecule structure by iteratively predicting which substructure from SS to add. However, s…

2019-11-23abs ↗pdf ↗

DHGAK aligns substructures for better graph kernel performance.

problem Limited performance of traditional graph kernels due to missing substructure similarities.
method Hierarchically aligns relational substructures in deep embedding space, assigning same feature maps in RKHS.
result DHGAK outperforms state-of-the-art graph kernels on various benchmarks.

We analyze geometrical structures necessary to represent bulk and surface interactions of standard and substructural nature in complex bodies. Our attention is mainly focused on the influence of diffuse interfaces on sharp discontinuity surfaces. In analyzing this phenomenon, we prove the covariance of surface balances…

2004-06-18abs ↗pdf ↗

In a previous article, we defined a very flexible notion of suborbifold and characterized those suborbifolds which can arise as the images of orbifold embeddings. In particular, suborbifolds are images of orbifold embeddings precisely when they are saturated and split. This article addresses the problem of orbifold str…

2016-06-19abs ↗pdf ↗

Framework tackles OOD challenges in molecule property prediction by modeling environments.

problem Challenges in modeling OOD samples for molecule property prediction.
method Soft causal learning framework incorporating chemistry theories and cross-attention mechanisms.
result Demonstrates well generalization ability on seven datasets.

AutoGraph uses transformers to efficiently generate graphs as sequences.

problem Efficiently generating large, sparse graphs without expensive node features.
method Flattening graphs into sequences and using decoder-only transformers.
result AutoGraph achieves state-of-the-art performance on synthetic and molecular benchmarks.

Geo2DR learns graph representations using substructure patterns.

problem Learning distributed representations of graphs efficiently.
method Unsupervised learning with discrete substructure patterns and neural language models.
result Geo2DR achieves high reproducibility and interoperability in graph classification.

SFP prunes ID features to improve OOD generalization without domain data.

problem Improving out-of-distribution (OOD) generalization in biased models.
method Spurious Feature-targeted model Pruning (SFP) framework.
result SFP achieves optimal OOD generalization by pruning ID features.

An important question that discrete approaches to quantum gravity must address is how continuum features of spacetime can be recovered from the discrete substructure. Here, we examine this question within the causal set approach to quantum gravity, where the substructure replacing the spacetime continuum is a locally f…

2006-04-28abs ↗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.

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.

New method uses contrastively trained GNNs for more reliable graph model evaluation.

problem Need effective methods to evaluate Graph Generative Models.
method Use representations from contrastively trained Graph Neural Networks (GNNs) for evaluation.
result Contrastively trained GNNs provide more reliable evaluation metrics than traditional or GNN-based approaches.

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.

We introduce the notion of left (and right) quasi-Loday algebroids and a "universal space" for them, called a left (right) omni-Loday algebroid, in such a way that Lie algebroids, omni-Lie algebras and omni-Loday algebroids are particular substructures.

2010-05-25abs ↗pdf ↗

Properties of data are frequently seen to vary depending on the sampled situations, which usually changes along a time evolution or owing to environmental effects. One way to analyze such data is to find invariances, or representative features kept constant over changes. The aim of this paper is to identify one such fe…

2012-03-01abs ↗pdf ↗

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.

Deep generative model for healthcare data identifies coherent substructures and mutational clusters.

problem Analytical challenges in healthcare data, including sparsity, missingness, and small sample sizes.
method Proposes a deep generative Bayesian model with collapsed Gibbs sampling for multinomial count data.
result Identifies coherent substructures and biologically meaningful mutational clusters in cancer data.

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.

Most graph kernels are an instance of the class of R\mathcal{R}-Convolution kernels, which measure the similarity of objects by comparing their substructures. Despite their empirical success, most graph kernels use a naive aggregation of the final set of substructures, usually a sum or average, thereby potentially dis…

2019-06-04abs ↗pdf ↗