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

5111621 · Apr 202019922001200920182026
48 results for high-throughput screening

New neural network models predict molecular properties without 3D geometry, speeding up high-throughput screening.

problem Predicting molecular properties for large, complex molecules without computationally expensive 3D geometry.
method Message-passing neural networks trained with and without 3D structural information.
result Message-passing neural networks achieve similar accuracy to state-of-the-art methods without 3D geometry.

High throughput screening of compounds (chemicals) is an essential part of drug discovery [7], involving thousands to millions of compounds, with the purpose of identifying candidate hits. Most statistical tools, including the industry standard B-score method, work on individual compound plates and do not exploit cross…

2017-09-28abs ↗pdf ↗

KANEL combines models for early hit enrichment in virtual screening.

problem Assessing model accuracy in chemical bioactivity predictions.
method Ensemble workflow using Kolmogorov-Arnold Networks (KANs) and other models.
result Improves early hit enrichment metrics like PPV@N.

Modern bio-technologies have produced a vast amount of high-throughput data with the number of predictors far greater than the sample size. In order to identify more novel biomarkers and understand biological mechanisms, it is vital to detect signals weakly associated with outcomes among ultrahigh-dimensional predictor…

2018-05-17abs ↗pdf ↗

Paper proposes a deep Gaussian process for predicting formation energy of inorganic compounds.

problem High computational cost of quantum chemistry calculations for material design.
method Develops a deep Gaussian process emulator for quantum calculations using a novel molecular descriptor.
result Demonstrates that the approach can be implemented using a small dataset for prediction of formation energy.

We characterize and study variable importance (VIMP) and pairwise variable associations in binary regression trees. A key component involves the node mean squared error for a quantity we refer to as a maximal subtree. The theory naturally extends from single trees to ensembles of trees and applies to methods like rando…

2007-11-15abs ↗pdf ↗

Deep learning uses ROC cost functions to improve virtual screening accuracy.

problem Challenges in training deep learning models for virtual screening, especially class imbalance and lack of ground truth labels.
method Proposes using ROC cost functions to optimize deep learning models for virtual screening, introduces new training schemes and cost functions.
result Demonstrates improved performance of ROC-based approaches on PubChem datasets.

Paper develops efficient nonmyopic active search methods for drug and materials discovery.

problem Efficiently identifying many members of a class in high-throughput screening.
method Bayesian decision framework, nonmyopic approximations, efficient computation.
result Proposed policy outperforms sequential and batch settings in drug and materials discovery.

ChemCPA predicts cellular responses to novel drugs using transfer learning.

problem Scaling high-throughput screens to measure cellular responses for many drugs is costly and challenging.
method ChemCPA, a new encoder-decoder architecture combined with transfer learning.
result Training on existing bulk RNA HTS datasets improves generalization performance, reducing the need for extensive single-cell screens.

Develops a scalable model for drug combination prediction in cancer.

problem Accurate prediction of drug combinations for cancer treatment.
method Permutation invariant multi-output Gaussian Processes with variational approximation and deep generative model.
result Model efficiently borrows information across drug combinations and provides uncertainty quantification.

Study improves peptide design efficiency using active and meta-learning.

problem Designing novel functional peptides is inefficient due to low throughput and lack of data.
method Investigated active learning and meta-learning for optimizing peptide design experiments.
result Meta-learning improved average accuracy, but neither method outperformed random choice.

A new method selects inducing points to optimize high-throughput Bayesian optimisation.

problem Current inducing point selection methods sacrifice high-fidelity modeling of promising regions.
method Information-theoretic criterion to select inducing points maximizing global and maximum value uncertainties.
result Surrogate models support high-precision high-throughput Bayesian optimisation.

Enhances high-throughput imaging of microtubule networks, improving clarity and consistency.

problem Fluorescence noise obscures microtubule structures in high-throughput imaging.
method CycleGAN learning to enhance low-resolution images of microtubule networks.
result CycleGAN effectively identifies microtubules with high accuracy (0.93+ AUC-ROC).

Study improves materials discovery for high-entropy alloys using sparse linear models.

problem Inefficient materials discovery due to combinatorial explosion in alloy compositions.
method Sparse mixed linear modeling with anchor-based guidance for feature selection and prediction.
result Developed a method that balances predictive performance and interpretability for materials discovery.

Automatically computes reference ranges for UK Biobank cardiac data.

problem Improving healthcare by discovering patterns in large-scale population data.
method Fully automatic pipeline for 3D cardiac MR image analysis.
result Statistically significant agreement between manual and automatic indexes.

This paper treats the problem of screening for variables with high correlations in high dimensional data in which there can be many fewer samples than variables. We focus on threshold-based correlation screening methods for three related applications: screening for variables with large correlations within a single trea…

2011-02-06abs ↗pdf ↗

New AI platform screens portfolios for desirable firms and news.

problem Optimizing portfolio selection with AI.
method Two LLM agents screen for firm fundamentals and news sentiment. Agents deliberate to generate buy/sell signals. High-dimensional estimation determines optimal weights.
result Screened portfolio's Sharpe ratio consistently estimates target, superior to baseline and conventional approaches.

A new screening method for high-dimensional data reduces computational cost.

problem Challenges in variable selection for ultrahigh-dimensional linear regression.
method Ordering absolute sample ridge partial correlations to screen variables.
result The method provides sure screening property without strong assumptions.

Deep filtering improves robustness of models from noisy, sparse data.

problem Challenges in understanding microscopic interactions from noisy, sparse, and biased data.
method Statistical approach based on deep filtering of nonlinear feature networks.
result Physicochemical models are more robust, transparent, and generalize better.

We study safe screening for metric learning. Distance metric learning can optimize a metric over a set of triplets, each one of which is defined by a pair of same class instances and an instance in a different class. However, the number of possible triplets is quite huge even for a small dataset. Our safe triplet scree…

2018-02-12abs ↗pdf ↗

In this paper we develop the notion of screen isoparametric hypersurface for null hypersurfaces of Robertson-Walker spacetimes. Using this formalism we derive Cartan identities for the screen principal curvatures of null screen hypersurfaces in Lorentzian space forms and provide a local characterization of such hypersu…

2017-11-21abs ↗pdf ↗

CoinTossX is a low-latency, open-source matching engine for financial trading.

problem Efficiently matching orders in financial markets with low latency and high throughput.
method Developed in Java, orders submitted via UDP SBE, low-latency message transport (Aeron Media Driver). Separates order generation and matching.
result Demonstrated low-latency, high-throughput performance in various deployment scenarios.

Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because…

2014-10-25abs ↗pdf ↗

Efficiently allocate budgets for LLM-assisted virtual screening to reduce costs.

problem Reducing the cost of evaluating alternatives in large-scale screening tasks.
method Propose a top-mm greedy evaluation mechanism and the EFG-mm algorithm for efficient budget allocation.
result Prove that EFG-mm is both sample-optimal and consistent in large-scale virtual screening.