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

Trend · papers per month

1223 · Jan 201919922001200920172026
48 results for Proteomics

Novel method identifies proteomic risk markers for Alzheimer disease.

problem Lack of comprehensive proteomic risk markers for Alzheimer disease diagnosis.
method Deep belief network-based feature selection method using proteomic and clinical data.
result Identified an optimal subset of proteins achieving 90% accuracy in Alzheimer disease diagnosis.

Background: High-throughput proteomics techniques, such as mass spectrometry (MS)-based approaches, produce very high-dimensional data-sets. In a clinical setting one is often interested in how mass spectra differ between patients of different classes, for example spectra from healthy patients vs. spectra from patients…

2015-06-11abs ↗pdf ↗

We introduce Graph-Sparse Logistic Regression, a new algorithm for classification for the case in which the support should be sparse but connected on a graph. We val- idate this algorithm against synthetic data and benchmark it against L1-regularized Logistic Regression. We then explore our technique in the bioinformat…

2017-12-15abs ↗pdf ↗

A novel GPDA method for high-dimensional functional data.

problem Classification and feature selection challenges in high-dimensional, non-stationary functional data.
method Unified two-layer non-stationary Gaussian process with Ising prior for variable selection and classification.
result Demonstrated superior performance on simulated and proteomics datasets.

New method improves robustness of double robust estimators under complete misspecification.

problem Improper performance of double robust estimators when all nuisance functions are misspecified.
method DR+ACC, an adaptive correction clipping method.
result DR+ACC ensures bounded error and maintains semiparametric efficiency.

In the Pioneer 100 (P100) Wellness Project (Price and others, 2017), multiple types of data are collected on a single set of healthy participants at multiple timepoints in order to characterize and optimize wellness. One way to do this is to identify clusters, or subgroups, among the participants, and then to tailor pe…

2019-01-12abs ↗pdf ↗

BSFP method reveals latent patterns in multi-omic data for predicting lung function in HIV-associated OLD.

problem Limited understanding of multi-omic molecular phenomena and clinical outcomes in obstructive lung disease.
method Bayesian Simultaneous Factorization and Prediction (BSFP) method for multi-omic data, accommodating imputation and full posterior inference.
result BSFP reveals distinct clusters of patients with OLD and multi-omic patterns related to lung function decline.

Sparse neural networks visualize paired transcriptomic and electrophysiological data.

problem Efficiently analyzing and visualizing paired multivariate neuroscientific data.
method Sparse deep neural networks with a two-dimensional bottleneck and group lasso penalty.
result Biologically interpretable two-dimensional visualizations of paired data.

In systems biology, it is common to measure biochemical entities at different levels of the same biological system. One of the central problems for the data fusion of such data sets is the heterogeneity of the data. This thesis discusses two types of heterogeneity. The first one is the type of data, such as metabolomic…

2019-08-23abs ↗pdf ↗

A new hybrid federated learning algorithm for combining clinical and omics data.

problem Combining clinical and omics data in federated learning settings.
method Reformulated Kernel Regularized Least Squares algorithm for hybrid federated learning.
result Validation of two variants of the hybrid algorithm on well-established datasets.

Undirected graphical models, or Markov networks, are a popular class of statistical models, used in a wide variety of applications. Popular instances of this class include Gaussian graphical models and Ising models. In many settings, however, it might not be clear which subclass of graphical models to use, particularly…

2013-01-17abs ↗pdf ↗

Unified framework for robust causal directionality in quantum systems under MNAR observation.

problem Determining causal directionality in quantum systems under MNAR observation.
method Integrates CVAE-based latent constraints, MNAR-aware selection models, GEE-stabilized regression, penalized empirical likelihood, and Bayesian optimization.
result Achieves lower bias and variance, near-nominal coverage, and superior quantum-specific diagnostics.

Ensemble models provide more accurate feature importance estimates than single models.

problem Inaccurate variable importance estimates due to model instability and stochasticity.
method Theoretical analysis and validation on benchmarks and real data.
result Ensembling at the model level reduces excess risk and provides more accurate variable-importance estimates.

Accurately predicting drug responses to cancer is an important problem hindering oncologists' efforts to find the most effective drugs to treat cancer, which is a core goal in precision medicine. The scientific community has focused on improving this prediction based on genomic, epigenomic, and proteomic datasets measu…

2016-12-02abs ↗pdf ↗

Active inference uses machine learning to prioritize data labeling for more efficient statistical inference.

problem Efficiently collecting data points for statistical inference with limited labels.
method A machine learning-assisted approach that identifies uncertain data points for labeling.
result Achieves the same level of accuracy with fewer samples, resulting in smaller confidence intervals and more powerful p-values.

Study of Bayes optimal learning in high-dimensional linear regression with network side information.

problem Bayes optimal learning in high-dimensional linear regression with network side information.
method Introduce a Reg-Graph model and an iterative AMP algorithm for Bayes optimality under general conditions.
result Characterization of the limiting mutual information between latent signal and data observed.

"Mixed Data" comprising a large number of heterogeneous variables (e.g. count, binary, continuous, skewed continuous, among other data types) are prevalent in varied areas such as genomics and proteomics, imaging genetics, national security, social networking, and Internet advertising. There have been limited efforts a…

2014-11-02abs ↗pdf ↗

In this paper, we study the challenge of feature selection based on a relatively small collection of sample pairs {(xi,yi)}1im\{(x_i, y_i)\}_{1 \leq i \leq m}. The observations yiRy_i \in \mathbb{R} are thereby supposed to follow a noisy single-index model, depending on a certain set of signal variables. A major difficulty is tha…

2016-08-31abs ↗pdf ↗

OPAL optimizes labeling strategy for precise inference from uncertain models.

problem Inference from uncertain machine learning models is brittle.
method OPAL learns a smooth policy to adaptively label data points based on model uncertainty.
result OPAL yields estimators with the lowest variance and achieves nominal coverage in finite samples.

A transfer learning method builds high-dimensional models using disparate datasets.

problem Building comprehensive prediction models with small sample sizes and limited features.
method Transfer learning approach using external data to build a reduced model and apply calibration equations.
result Proposes a penalized generalized method of moment framework for inference and one-step estimation.

Proposes improved classification via transfer learning with regularized linear discriminant analysis.

problem High dimensionality and small sample sizes lead to poor classification performance.
method Regularized random-effects linear discriminant analysis, combining ridge estimates from target and source models.
result Explicit derivation of asymptotic weights and classification error rates in high-dimensional settings.

The problem of learning the structure of a high dimensional graphical model from data has received considerable attention in recent years. In many applications such as sensor networks and proteomics it is often expensive to obtain samples from all the variables involved simultaneously. For instance, this might involve …

2016-02-01abs ↗pdf ↗

CARVE validates clustering results using resampling and stability analysis.

problem Inconsistent and unreliable clustering results due to algorithm, preprocessing, and kk sensitivity.
method CARVE uses resampling-based validation and stability analysis to evaluate multiple clustering algorithms and hyperparameters.
result CARVE consistently recovers near-optimal clusterings and finer biological structure.

iDeepViewLearn combines deep learning and feature selection for multiview learning.

problem Learning nonlinear relationships in data from multiple complementary views.
method Combines deep learning flexibility with statistical feature selection using deep neural networks and graph Laplacian regularization.
result Identifies genes and CpG sites that differentiate between breast cancer survivors and non-survivors.

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.

A new method for combining multiple data views in supervised learning.

problem Combining multiple data views in supervised learning, especially in biology and medicine.
method Cooperative learning combines squared error loss with an agreement penalty to encourage predictions from different data views to agree.
result Cooperative learning achieves higher predictive accuracy on simulated and real multiomics data.

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.

New algorithm improves on EM for streaming data, outperforming existing methods.

problem Processing high-volume, streaming data efficiently.
method Incremental stochastic Majorization-Minimization (MM) algorithm.
result The algorithm converges to a stationary point with vanishing gradient.

Unified framework for SGMoE resolves estimation and selection issues.

problem Non-identifiability, coupled differential relations, and tight coupling in softmax-Gated models.
method Unified statistical framework with Voronoi-type loss functions and dendrograms of mixing measures.
result Consistent selection of the number of experts without model sweeps, optimal parameter rates under overfitting.