A multiverse-consensus pipeline for reproducible feature selection in untargeted LC-MS metabolomics

• URL: http://arxiv.org/abs/2607.17345v1
• Date: Sun, 19 Jul 2026 17:14:17 GMT
• Title: A multiverse-consensus pipeline for reproducible feature selection in untargeted LC-MS metabolomics
• Abstract summary: Untargeted LC-MS metabolomics requires a long chain of preprocessing decisions.<n>We adapt multiverse analysis to untargeted metabolomics feature selection.
• Score: 1.452875650827562
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Background: Untargeted LC-MS metabolomics requires a long chain of preprocessing decisions, each with several equally defensible options. Analysts typically commit to one pipeline and report the resulting feature shortlist. How strongly that shortlist depends on choices that were never varied stays invisible. Results: We adapt multiverse analysis to untargeted metabolomics feature selection. We present an auditable, configuration-driven pipeline that (i) applies a ten-stage quality-control filter cascade in which every feature's fate is logged, and (ii) runs the downstream analysis as a multiverse over four contrasting preprocessing philosophies, each combined with four feature-ranking methods under bootstrap stability selection and label-permutation testing. Only features recurring across paths enter a tiered consensus. On a demonstration dataset of five breast-cancer cell lines (30,370 detected features), the four single pipelines individually returned shortlists of 4-20 features whose pairwise agreement was as low as Jaccard = 0.05. The multiverse consensus retained 15 features (>=2/4 paths), of which one recurred across all four, although two paths (sharing normalization and drift-correction methods) dominate the consensus. A pipeline-wide label-permutation test found no false discoveries in 50 null permutations. Conclusions: Reporting only preprocessing-robust features, with a complete kept/dropped audit trail, converts hidden analytical degrees of freedom into an explicit, inspectable output. We discuss scope and limitations, including single-batch design and the need for independent validation.

Related papers

• Threshold Choice, Not Sample Size, Bounds Trustless Verification of Nondeterministic Compound AI Workflows [0.0]
  Compound AI pipelines chain LLM calls, retrievers, and tools are nondeterministic.<n>We give a protocol covering all three: it commits digests of each stage's inputs, outputs, and context.<n>On a synthetic HotpotQA pipeline a calibrated fixed threshold accepts 44 of 45 honest reproductions and rejects 104 of 105 divergent pairs.
  arXiv  Detail & Related papers  (2026-09-07T22:10:54Z)
• Disagree to Explore, Agree to Commit: Routing-Guided Test-Time Scaling for Software Agents [60.650808962786364]
  We study whether native MoE router traces can guide steering and selection without an external judge or selection-time test execution.<n>Our analysis shows that routing provides a robust behavioral role signal; token-granular readouts and decision-matched comparison sets turn it into effective control.<n>We evaluate on SWE-bench Verified using open-weight sparse MoE agents across scales and reasoning-effort settings.
  arXiv  Detail & Related papers  (2026-08-23T03:07:03Z)
• Quantifying the Sources of Instability in LLM-Based Stance Analysis of Public Discourse [4.093009863847175]
  Two distinct sources of instability can arise when preprocessing pipelines produce different outputs from the same input.<n>Using 256 YouTube interviews across 41 public figures from five domains, we compare two speaker-diarization pipelines and two measurement methods.<n>We find that preprocessing pipeline sensitivity is concentrated in speakers with limited video samples.
  arXiv  Detail & Related papers  (2026-07-12T17:15:36Z)
• Dynamic Bidirectional Pattern Memory: A Production-Scale Empirical Characterisation of Inference-Time Gating in Clinical NLP [0.0]
  We study inference-time pattern-memory gating in a production-scale clinical natural language processing (NLP) pipeline.<n>The pipeline pairs a generator (Llama-3.3 70B) proposing extractions with a verifier (MMed-Llama-3.1 70B) accepting or rejecting them.
  arXiv  Detail & Related papers  (2026-07-01T12:34:30Z)
• CRAFTIIF: Cross-Resolution Analytic Four-Type Interpretable Isolation Forest for Multivariate Time Series Anomaly Detection [0.0]
  CRAFTIIF (Cross-Resolution Analytic Four-Type Interpretable Isolation Forest) is a fully unsupervised framework targeting all four types without dataset-specific tuning.<n>An adaptive Otsu/MAD threshold calibrates detection automatically across anomaly rates from 0.1% to 69.2%.<n> evaluated on all 19 datasets of the mTSBench benchmark.
  arXiv  Detail & Related papers  (2026-06-11T15:36:14Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• Pairwise matrices for sparse autoencoders: single-feature inspection mislabels causal axes [2.741152471987327]
  Standard sparse-autoencoder protocol labels each feature from its top-activating contexts and validates by single-feature steering.<n>We propose the pairwise matrix protocol, co-varying steering coefficient with joint condition, and report three findings the standard one-corner protocol misses on Qwen3-1.7B-Instruct, replicated on Gemma-2-2B-it.<n>All three findings reproduce on Gemma with model-specific damage signatures; the matched-geometry control is CI-separated by 10x.
  arXiv  Detail & Related papers  (2026-05-04T21:11:21Z)
• DeepShapeMatchingKit: Accelerated Functional Map Solver and Shape Matching Pipelines Revisited [48.627686484608525]
  We find that standard functional map implementations solve k independent linear systems serially, which is a computational bottleneck at higher spectral resolution.<n>We propose a vectorized reformulation that solves all systems in a single kernel call, achieving up to a 33x speedup.<n>We present an open-source, DeepShapeMatchingKit, that incorporates these improvements and standardizes training, evaluation, and data pipelines for common deep shape matching methods.
  arXiv  Detail & Related papers  (2026-04-11T23:15:07Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• Semi-DETR: Semi-Supervised Object Detection with Detection Transformers [105.45018934087076]
  We analyze the DETR-based framework on semi-supervised object detection (SSOD) We present Semi-DETR, the first transformer-based end-to-end semi-supervised object detector. Our method outperforms all state-of-the-art methods by clear margins.
  arXiv  Detail & Related papers  (2023-07-16T16:32:14Z)
• MFNet: Multi-filter Directive Network for Weakly Supervised Salient Object Detection [104.0177412274975]
  Weakly supervised salient object detection (WSOD) targets to train a CNNs-based saliency network using only low-cost annotations. Existing WSOD methods take various techniques to pursue single "high-quality" pseudo label from low-cost annotations and then develop their saliency networks. We introduce a new multiple-pseudo-label framework to integrate more comprehensive and accurate saliency cues from multiple labels.
  arXiv  Detail & Related papers  (2021-12-03T06:12:42Z)
• Infinite Feature Selection: A Graph-based Feature Filtering Approach [78.63188057505012]
  We propose a filtering feature selection framework that considers subsets of features as paths in a graph. Going to infinite allows to constrain the computational complexity of the selection process. We show that Inf-FS behaves better in almost any situation, that is, when the number of features to keep are fixed a priori.
  arXiv  Detail & Related papers  (2020-06-15T07:20:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.