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

Trend · papers per month

3569104138 · Jun 202019922001200920172026
48 results for high-throughput sequencing

DeepCoDA provides personalized interpretability for complex health data.

problem Interpreting complex health data, especially compositional data, is challenging.
method DeepCoDA framework for high-dimensional compositional data, personalized interpretability through patient-specific weights.
result DeepCoDA maintains state-of-the-art performance and provides coherent, personalized interpretations.

The study compares different scRNA sequencing methods using a high-dimensional dataset.

problem To identify unique characteristics of different scRNA sequencing methods.
method Quantitative comparison through clustering analysis of a high-dimensional dataset.
result Identifies unique characteristics associated with different scRNA sequencing methods.

Recent advances in high-throughput cDNA sequencing (RNA-Seq) technology have revolutionized transcriptome studies. A major motivation for RNA-Seq is to map the structure of expressed transcripts at nucleotide resolution. With accurate computational tools for transcript reconstruction, this technology may also become us…

2013-09-20abs ↗pdf ↗

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.

With the wealth of high-throughput sequencing data generated by recent large-scale consortia, predictive gene expression modelling has become an important tool for integrative analysis of transcriptomic and epigenetic data. However, sequencing data-sets are characteristically large, and previously modelling frameworks …

2015-07-21abs ↗pdf ↗

Understanding functional organization of genetic information is a major challenge in modern biology. Following the initial publication of the human genome sequence in 2001, advances in high-throughput measurement technologies and efficient sharing of research material through community databases have opened up new view…

2011-02-27abs ↗pdf ↗

This paper uses bandit theory and Thompson Sampling to optimize protein sequences.

problem Optimizing protein sequences using machine learning and directed evolution.
method Proposes a Thompson Sampling-guided Directed Evolution (TS-DE) framework.
result TS-DE achieves a nearly optimal Bayesian regret of order ildeO(d2MT) ilde O(d^{2}\sqrt{MT}).

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 ↗

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.

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.

High-speed model accurately simulates neuromorphic devices.

problem Accurately modeling stochastic synapses in large-scale neuromorphic systems.
method Generative vector autoregressive model based on resistive memory cell data.
result Fast, high-throughput model reproduces synaptic parameters and correlations.

Hi-RES framework extracts medical relations from articles and EHRs.

problem Manual annotation bottleneck in relation extraction.
method Labeling sentences, creating improved negative samples, using pretrained language models, and combining EHR embeddings.
result Significant accuracy increases in relation extraction, up to 0.998 for disorder-location relations.

High-throughput 3D control training system achieves 100,000 FPS.

problem Lack of efficient, single-machine reinforcement learning systems.
method Sample Factory combines asynchronous sampling and off-policy correction.
result Achieves 100,000 FPS on 3D control problems without sacrificing sample efficiency.

Many applications, such as text modelling, high-throughput sequencing, and recommender systems, require analysing sparse, high-dimensional, and overdispersed discrete (count-valued or binary) data. Although probabilistic matrix factorisation and linear/nonlinear latent factor models have enjoyed great success in modell…

2019-05-02abs ↗pdf ↗

This paper evaluates quantization techniques for deep learning inference.

problem Reducing the size and improving inference of deep neural networks.
method Review and empirical evaluation of quantization parameters for various neural network models.
result 8-bit quantization maintains accuracy within 1% of floating-point models.

Machine learning methods have shown promise in predicting molecular properties, and given sufficient training data machine learning approaches can enable rapid high-throughput virtual screening of large libraries of compounds. Graph-based neural network architectures have emerged in recent years as the most successful …

2018-07-26abs ↗pdf ↗

New method optimizes Gaussian process allocation for BO.

problem Existing methods for inducing point allocation in BO hinder performance.
method Proposes a new allocation strategy using quality-diversity decomposition.
result Demonstrates improved BO performance through local high-fidelity modeling.

New method classifies reticulocytes from red blood cells without labels.

problem Classifying reticulocytes from mature red blood cells without fluorescent labels.
method Unsupervised machine learning on morpho-rheological markers.
result Promising results in classifying reticulocytes from mature red blood cells.

Establishes a link between heat diffusion and manifold distances in data.

problem No theoretical link between diffusion-based manifold learning and geodesic distances.
method Formulates heat geodesic embeddings based on Riemannian geometry.
result Method outperforms state-of-the-art in preserving manifold distances and cluster structure.

PIMA autoencoders discover shared features in multimodal scientific data.

problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.

scICML integrates multi-omics data from single cells using co-clustering.

problem High noise and sparsity in multi-omics data from single cells.
method Information-theoretic co-clustering-based multi-view learning.
result Improves clustering performance and provides biological insights.

Dynamic Vocabulary Pruning stabilizes LLM training by removing low-probability tokens.

problem Training Large Language Models (LLMs) with Reinforcement Learning (RL) causes numerical divergence between inference and training.
method Dynamic Vocabulary Pruning (DVP) constrains the RL objective to a safe vocabulary that excludes low-probability tokens.
result DVP stabilizes training by reducing systematic bias introduced by the extreme tail of the token distribution.

We introduce a new, high-throughput, synchronous, distributed, data-parallel, stochastic-gradient-descent learning algorithm. This algorithm uses amortized inference in a compute-cluster-specific, deep, generative, dynamical model to perform joint posterior predictive inference of the mini-batch gradient computation ti…

2018-03-12abs ↗pdf ↗

We present the OpenAI Remote Rendering Backend (ORRB), a system that allows fast and customizable rendering of robotics environments. It is based on the Unity3d game engine and interfaces with the MuJoCo physics simulation library. ORRB was designed with visual domain randomization in mind. It is optimized for cloud de…

2019-06-26abs ↗pdf ↗

An important problem in forensic analyses is identifying the provenance of materials at a crime scene, such as biological material on a piece of clothing. This procedure, known as geolocation, is conventionally guided by expert knowledge of the biological evidence and therefore tends to be application-specific, labor-i…

2019-05-28abs ↗pdf ↗

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 ↗

Learning the structure of dependencies among multiple random variables is a problem of considerable theoretical and practical interest. Within the context of Bayesian Networks, a practical and surprisingly successful solution to this learning problem is achieved by adopting score-functions optimisation schema, augmente…

2017-06-07abs ↗pdf ↗

Determining the localization of specific protein in human cells is important for understanding cellular functions and biological processes of underlying diseases. Among imaging techniques, high-throughput fluorescence microscopy imaging is an efficient biotechnology to stain the protein of interest in a cell. In this w…

2019-01-27abs ↗pdf ↗

Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the case that the weight determining the acceptance probability itself is fluctuati…

2016-12-19abs ↗pdf ↗