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

11213242 · Jun 202019922001200920172026
48 results for molecular profiling

Paper develops a method to predict cancer patient survival using molecular profiles.

problem Accurately predicting cancer patient survival with complex survival-molecular profile relationships.
method Kernel Cox partially linear regression with a novel regularized garrotized kernel machine (RegGKM) method.
result The proposed method outperforms other methods in predicting survival accuracy.

BayReL learns molecular interactions across multi-omics data.

problem Inferring meaningful interactions across diverse molecular data types.
method BayReL uses Bayesian representation learning with graph models to integrate multi-omics data.
result BayReL outperforms existing methods in inferring molecular interactions.

We review some statistical many-agent models of economic and social systems inspired by microscopic molecular models and discuss their stochastic interpretation. We apply these models to wealth exchange in economics and study how the relaxation process depends on the parameters of the system, in particular on the savin…

2006-08-17abs ↗pdf ↗

Enhances diffusion-based sampling for molecular systems.

problem Inefficiency and thermodynamic mode miss in diffusion-based samplers for molecular systems.
method Introduces a sequential bias along collective variables (CVs) to encourage exploration and increase temperature in the projected space.
result Improves efficiency, mode discovery, and free energy estimation; first to demonstrate reactive sampling.

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.

This review explores the use of machine learning in discovering collective variables for biomolecular dynamics.

problem Understanding the conformational dynamics and molecular recognition in biomolecules.
method Statistical analysis of high-dimensional spatiotemporal data generated from molecular dynamics simulations.
result Machine learning algorithms can be used to discover abstract collective variables that describe biomolecular dynamics.

Unsupervised method selects genes for tumor subtype discovery.

problem High-dimensional tumor gene expression data with noisy variables and heterogeneity.
method Autoencoders for latent space learning, Multiple Kernel Learning for feature selection, clustering.
result Lower redundancy and better clustering performance compared to benchmarks.

Study identifies biomarkers for lung cancer in female non-smokers.

problem Identifying prognostic biomarkers for stage III NSCLC in non-smoking females.
method Gene expression profiling and XGBoost machine learning algorithm.
result Top biomarkers validated in literature, with AUC score of 0.835.

Study uses LLMs to create personalized treatment plans for rare gynecological tumors.

problem Suboptimal management and poor prognosis due to low incidence and heterogeneity of rare gynecological tumors.
method Developed a digital twin system using LLMs to integrate clinical and biomarker data.
result LLM-enabled digital twins efficiently model individual patient trajectories and identify potential treatment options.

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.

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.

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.

Bayesian model clusters diverse 'omics data for disease subtyping.

problem Clustering diverse 'omics datasets conflates multiple structures.
method Multi-view Bayesian mixture model with semi-supervised learning.
result Identifies distinct clusters of patients for stratified medicine.

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.

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.

Generative models accelerate molecular dynamics by four orders of magnitude.

problem Femtosecond time steps limit access to slow molecular processes.
method Deep generative modeling framework that accelerates sampling.
result Quantitative characterization of equilibrium ensembles and dynamical relaxation processes.

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.

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.

Omics-GAN uses GANs to generate synthetic multi-omics data for improved disease prediction.

problem Limited sample sizes, noise, and heterogeneity in multi-omics data reduce predictive power.
method Omics-GAN is a GAN-based framework that generates high-quality synthetic multi-omics profiles.
result Synthetic datasets consistently improved prediction accuracy compared to original omics profiles.

Framework learns surrogates for molecular dynamics across multiple time-scales.

problem Stable molecular dynamics simulations require small time-steps, but long-time-scale moments need repeated simulations.
method Implicit Transfer Operator Learning with denoising diffusion probabilistic models and SE(3) equivariant architecture.
result Models can generate self-consistent stochastic dynamics across multiple time-scales.

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 ↗

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.

Timewarp accelerates molecular dynamics by learning to simulate long timescales.

problem Efficiently simulating long timescales in molecular dynamics.
method Uses a normalizing flow to learn large time steps in Markov chain Monte Carlo.
result Generalizes to unseen small peptides, accelerating sampling.

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.

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.

Molecular dynamics simulations are an important tool for describing the evolution of a chemical system with time. However, these simulations are inherently held back either by the prohibitive cost of accurate electronic structure theory computations or the limited accuracy of classical empirical force fields. Machine l…

2018-12-18abs ↗pdf ↗

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.