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

15314661 · May 202619922001200920172026
48 results for Reaction Pathway Discovery

CRNN discovers chemical reaction pathways from data.

problem Challenging to infer reaction pathways for complex systems.
method Neural network approach that satisfies fundamental physics laws.
result CRNN autonomously discovers reaction pathways from species concentration data.

Computer-assisted synthesis planning aims to help chemists find better reaction pathways faster. Finding viable and short pathways from sugar molecules to value-added chemicals can be modeled as a retrosynthesis planning problem with a catalyst allowed. This is a crucial step in efficient biomass conversion. The tradit…

2019-11-10abs ↗pdf ↗

MEGAN models chemical reactions as graph edits, improving synthesis planning.

problem Generating and predicting chemical reactions under constraints.
method End-to-end encoder-decoder neural model inspired by arrow pushing formalism.
result State-of-the-art accuracy in standard benchmarks for retrosynthesis prediction.

PKB framework boosts genomic data analysis by integrating pathway knowledge.

problem Boosting discovery power and connecting new findings with biological mechanisms in genomic data.
method Pathway-based Kernel Boosting (PKB) framework integrating clinical and pathway information for prediction of various outcomes.
result PKB substantially outperforms other methods in predicting drug response and cancer survival.

A new method uses LLMs to discover causal pathways that affect fairness in machine learning.

problem Discovering fairness-relevant causal pathways in the presence of noise and confounding.
method Hybrid LLM-guided causal discovery framework combining active learning and dynamic scoring.
result LLM-guided methods, including the proposed active, dynamically scored variant, outperform baselines in recovering fairness-relevant structure under noisy conditions.

In this work, we developed a network inference method from incomplete data ("PathInf") , as massive and non-uniformly distributed missing values is a common challenge in practical problems. PathInf is a two-stages inference model. In the first stage, it applies a data summarization model based on maximum likelihood to …

2018-10-01abs ↗pdf ↗

The paper proposes a method to predict the performance of data-driven algorithms using surrogate models.

problem Improving the performance prediction of data-driven knowledge discovery algorithms.
method Surrogate-assisted performance prediction using evolutionary modeling of clinical pathways.
result The proposed approach provides interpretable prediction of algorithm performance and quality.

Paper relaxes faithfulness assumption for causal discovery using interventions.

problem Violation of faithfulness assumption in natural systems leads to incorrect causal structure identification.
method Use intervention-immediacy faithfulness assumption to identify causal structures with hard interventions.
result Interventions contain information about causal structure that can identify causal structures when faithfulness is violated.

Hopfield networks improve reaction template prediction for few/zero-shot scenarios.

problem Predicting reaction templates for new molecules in CASP.
method Adapted Hopfield networks to associate reaction templates, molecules, and structural information.
result Significantly improved performance for templates with few or zero training examples.

Automated digital twin discovery from biological data improves drug discovery and personalized medicine.

problem Developing reliable digital twins from noisy, incomplete biological data.
method Symbolic and sparse regression, Bayesian frameworks, deep learning, and large language models.
result Sparse regression generally outperforms symbolic regression, especially with Bayesian frameworks.

ASD algorithm maximizes model estimates by adaptively labeling points.

problem Maximizing model estimates through adaptive labeling of points in a sequential decision-making problem.
method Formulated a general information-directed sampling (IDS) algorithm with theoretical guarantees for linear, graph, and low-rank models.
result IDS algorithm outperforms in both simulation and real-data experiments for discovering chemical reaction conditions.

engGNN combines external and generated graphs to improve disease classification and biomarker discovery.

problem Challenges in integrating omics data due to high dimensionality and small sample sizes.
method Dual-graph framework that integrates external biological networks with data-driven generated graphs.
result engGNN outperforms state-of-the-art methods in disease classification and biomarker discovery.

DeepSIBA predicts biological effects of chemical structures using graph neural networks.

problem Predicting biological effects of chemical structures for drug discovery.
method Siamese Graph Convolutional Neural Networks for structure-biological effect mapping.
result Highly accurate predictions of biological effects for structurally dissimilar compounds.

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.

BioBO optimizes gene perturbation design using Bayesian optimization with biological priors.

problem Efficient design of genomic perturbation experiments in drug discovery.
method Integrates Bayesian optimization with multimodal gene embeddings and enrichment analysis.
result Improves labeling efficiency by 25-40% and identifies top-performing perturbations more effectively.

M-CaStLe discovers causal structures in multivariate space-time data.

problem Challenges in causal graph discovery for high-dimensional gridded data.
method Generalizes CaStLe to multivariate analyses, using local embeddings and pooling spatial replicates.
result More accurately recovers multivariate causal structure and identifies physical dynamics.

Paper uses machine learning to identify key pathways for c-di-GMP in bacterial genomes.

problem Understanding pathways essential for c-di-GMP in bacterial cellulose production.
method Applied Lasso and Random Forests for feature selection and modeling gene count data.
result Bacterial chemotaxis is identified as the most essential pathway for c-di-GMP encoding domains.

We use the formalism of Geometrothermodynamics to describe chemical reactions in the context of equilibrium thermodynamics. Any chemical reaction in a closed system is shown to be described by a geodesic in a 22-dimensional manifold that can be interpreted as the equilibrium space of the reaction. We first show this i…

2013-01-02abs ↗pdf ↗

We categorise coherent band (aka nullification) pathways between knots and 2-component links. Additionally, we characterise the minimal coherent band pathways (with intermediates) between any two knots or 2-component links with small crossing number. We demonstrate these band surgeries for knots and links with small cr…

2014-08-08abs ↗pdf ↗

Upper bound on CRN reaction rates derived using information geometry.

problem Challenging task of deriving an upper bound on reaction rates of nonlinear, discrete CRNs.
method Information geometric approach using natural gradient.
result Validated through numerical simulations, demonstrating faster convergence in specific CRNs.

Novel deep learning method predicts reaction coordinates and future MD trajectories.

problem Identifying optimal reaction coordinates for chemical reactions.
method Regularized Sparse Autoencoder (RSE) for discovering reaction coordinates and predicting MD trajectory evolution.
result RSE helps in choosing a small but important set of reaction coordinates.

Chemical reactions can be described as the stepwise redistribution of electrons in molecules. As such, reactions are often depicted using `arrow-pushing' diagrams which show this movement as a sequence of arrows. We propose an electron path prediction model (ELECTRO) to learn these sequences directly from raw reaction …

2018-05-23abs ↗pdf ↗

METRO predicts reactions using minimal templates, reducing computational overhead and achieving state-of-the-art results.

problem Predicting possible reaction substrates for complex molecules from simpler precursors.
method METRO (Molecule-Edit Templates for RetrOsynthesis) uses minimal templates to predict reactions efficiently and accurately.
result METRO achieves state-of-the-art results on standard benchmarks, reducing computational overhead.

Chemical networks outperform spiking neural networks in classification tasks.

problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.

Bayesian inference for biochemical reaction networks using jump-diffusion approximations.

problem Estimating hidden quantities in poorly characterized biochemical processes.
method Developed a Bayesian inference algorithm based on Markov chain Monte Carlo and sequential Monte Carlo methods.
result Numerical evaluation of the algorithm for a partially observed multi-scale birth-death process.

Motivated by an important insight from neural science, we propose a new framework for understanding the success of the recently proposed "maxout" networks. The framework is based on encoding information on sparse pathways and recognizing the correct pathway at inference time. Elaborating further on this insight, we pro…

2013-11-18abs ↗pdf ↗

We generalize the reaction-diffusion model A + B -> 0 in order to study the impact of an excess of A (or B) at the reaction front. We provide an exact solution of the model, which shows that linear response breaks down: the average displacement of the reaction front grows as the square-root of the imbalance. We argue t…

2014-03-14abs ↗pdf ↗

The prediction of organic reaction outcomes is a fundamental problem in computational chemistry. Since a reaction may involve hundreds of atoms, fully exploring the space of possible transformations is intractable. The current solution utilizes reaction templates to limit the space, but it suffers from coverage and eff…

2017-09-13abs ↗pdf ↗

SWA selects important features from large data sets, controlling false discovery rate.

problem Feature selection in large regression data, especially scaling to big data and matching target FDR.
method Subsampling Winner algorithm using subsampling and scoring features.
result SWA controls actual FDR better than benchmark procedures and randomForest.