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

Trend · papers per month

65130194259 · Jun 202019922001200920182026
48 results for Mass Spectrometry Imaging

Deep Relevance Regularization improves neural network performance in tumor typing.

problem Confounding factors hinder neural network performance in multi-laboratory imaging mass spectrometry data.
method Introduces Deep Relevance Regularization to restrict neural network focus.
result Deep Relevance Regularization robustifies neural networks and improves interpretability.

Motivation: Tumor classification using Imaging Mass Spectrometry (IMS) data has a high potential for future applications in pathology. Due to the complexity and size of the data, automated feature extraction and classification steps are required to fully process the data. Deep learning offers an approach to learn featu…

2017-05-02abs ↗pdf ↗

New method recovers relative rates in spatial compositional data from IMS.

problem Challenges in analyzing spatial data from IMS due to competitive sampling.
method Hierarchical Variational Graph Fused Lasso using heavy-tailed graphical lasso prior and automatic differentiation variational inference.
result Our method outperforms state-of-the-practice point estimate methodologies in IMS and has superior posterior coverage.

New framework distinguishes lung cancer subtypes using MALDI mass spectrometry.

problem Distinguishing between adenocarcinoma and squamous cell carcinoma subtypes in lung cancer.
method Supervised topological data analysis on MALDI mass spectrometry imaging data.
result The proposed framework successfully classifies lung cancer subtypes with competitive results.

We study a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a \emph{variable} and (pseudo)-\emph{random} pulsing rate is used which allows for traces from different pulses to overlap. This modification requires little alteration to the currently employed hardware. However, it requi…

2012-12-18abs ↗pdf ↗

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 ↗

DeepNovoV2 improves de novo peptide sequencing from mass spectrometry data.

problem De novo peptide sequencing from mass spectrometry data for personalized cancer vaccines.
method DeepNovoV2 combines T-Net and recurrent neural networks for end-to-end training and prediction.
result DeepNovoV2 achieves 13.01-23.95\% higher accuracy than previous methods.

Neural networks predict substructures from mass spectra to identify chemical threats.

problem Identifying unknown chemical threats from mass spectra and formulas.
method Data-driven approach using neural networks to rank and match substructures.
result Substructure classifiers achieve over 90% micro F1-score and correctly identify structures in 88-71% of cases.

Paper presents a method for identifying isotope envelopes in MALDI-ToF data.

problem Deisotoping of isotopic peaks in MALDI-ToF molecular imaging data.
method Uses Mamdani-Assilan fuzzy system and spatial maps of molecular distribution to identify isotope envelopes.
result Proposed method detects overlapping envelopes and analyzes large data sets.

Improved protein identification in mass spectrometry data.

problem Expanding peptide scoring capabilities in tandem mass spectrometry.
method Deriving concave emission distributions for dynamic Bayesian networks.
result Efficiently learned scoring function outperforms state-of-the-art.

Random small feature subsets outperform FS in diverse datasets.

problem The significance of selected features in high-dimensional datasets is questionable.
method Analysis of 28 diverse datasets (microarray, RNA-Seq, etc.).
result Any arbitrary set of features performs as well as or better than selected features across datasets.

ForestDSH hashes improve nearest neighbor search in high-dimensional data.

problem High-dimensional classification and nearest neighbor search.
method Distribution-sensitive hashing using a forest of decision trees.
result ForestDSH hashes outperform LSH and state-of-the-art methods in speed and accuracy.

Selective prediction framework reduces errors in molecular structure identification from MS/MS.

problem High-stakes applications require reliable molecular structure identification from MS/MS data.
method Selective prediction framework using risk-coverage tradeoff and uncertainty quantification.
result First-order confidence measures and retrieval-level aleatoric uncertainty achieve strong risk-coverage tradeoffs.

Machine learning detects subhalos in lensed images with high accuracy and low false positives.

problem Detecting substructure in strongly lensed images.
method Developed a neural network for image segmentation to locate and mass estimate subhalos.
result The network can detect subhalos with masses m108.5Mm\gtrsim 10^{8.5} M_{\odot} and measure the subhalo mass function.

New scalable algorithm for non-negative linear regression with entropy-regularized OT loss.

problem Generalizing task-specific linear models to broader applications.
method Sinkhorn-like scaling iterations for convex penalty and datafit terms.
result Simple multiplicative updates for various penalty and datafit terms.

SML improves pancreatic mass diagnosis accuracy using CT images.

problem Improving accuracy in pancreatic mass screening using CT imaging.
method Spectral machine learning method trained on 30,000 images, choosing fundamental images based on eigenvectors and removing irrelevant pixels.
result Achieved 94.6% test accuracy in diagnosing 113 patients.

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 ↗

Deep learning reduces noise in weak lensing mass maps using GANs.

problem Noise reduction in weak lensing mass maps.
method Generative adversarial networks (GANs) applied to Subaru Hyper Suprime-Cam data.
result GANs successfully reproduce non-Gaussian information in denoised maps, showing stronger cosmological dependence.

Let B be a fiber bundle with compact fiber F over a compact Riemannian n-manifold M. There is a natural Riemannian metric on the total space B consistent with the metric on M. With respect to that metric, the volume of a rectifiable section s:M--> B is the mass of the image s(M) as a rectifiable n-current in B. Theorem…

2004-03-28abs ↗pdf ↗

New method calibrates classifier probabilities with guaranteed coverage.

problem Inaccurate probability estimates by classifiers in high-risk applications.
method Adaptive temperature scaling algorithm for conformal prediction.
result Improves calibration error measures and standard metrics across various tasks.

Method generates joint posterior samples of source and foreground mass distributions for gravitational lensing.

problem Challenging inference problem for high-resolution, high signal-to-noise ratio gravitational lensing.
method Combines diffusion-based generative modeling and recurrent inference machines.
result Can model realistic gravitational lensing simulations down to the noise level.

We use an idea of Wang and Yau to give a new definition of quasi-local mass for a topological sphere in an initial date set. The new definition modifies Brown-York's definition by using certain spinor norm as lapse function. And it requires mean curvature of the topological sphere satisfies apparent horizon conditions,…

2006-03-02abs ↗pdf ↗

New method generates adversarial examples using Wasserstein distance.

problem Creating robust classifiers against image manipulations.
method Developed a procedure to project onto Wasserstein ball using modified Sinkhorn iteration.
result Successfully attacked image classification models with 3% accuracy within a 10% pixel mass movement.

New method converts and optimizes sampling schedules for generative models.

problem Optimizing sampling schedules for generative models like flows and diffusions.
method Unified framework for stochastic interpolants, including point mass schedules.
result Demonstrated efficient generation of images with fewer steps.

Neural networks can predict BMI from faces, and can be fooled into wrong predictions.

problem Vulnerability of BMI prediction models to adversarial attacks.
method Test-time adversarial attacks on neural networks trained to infer BMI from facial images.
result Neural networks can be tricked into predicting incorrect BMI values, posing a risk of insurance fraud.

OLCS-Ranker improves peptide identification accuracy and speed on hard datasets.

problem Efficiently identifying peptides from MS/MS data, especially on hard datasets with many false positives.
method Cost-sensitive online learning model and iterative online learning algorithm.
result OLCS-Ranker outperforms existing methods in accuracy and speed on large datasets.

We improve image perturbation defenses using a better-defined Wasserstein threat model.

problem Real-world image perturbations are not pixel-independent, unlike p\ell_p threat models.
method We rectify flaws in the Wasserstein threat model and explore stronger attacks and defenses.
result Current Wasserstein-robust models are ineffective against real-world perturbations.