arXiv Machine Learning By Martin V. Vejling, Shashi Raj Pandey, Christophe A. N. Biscio, Petar Popovski

Conformal Data Contamination Tests for In-distribution Data Acquisition

Read the original on arXiv Machine Learning →

The paper introduces a distribution‑free framework for assessing the quality of external data before acquisition. By applying novel conformal two‑sample tests, it identifies data agents whose data exceed a contamination threshold, enabling selective data acquisition for personalized machine learning. The approach guarantees finite‑sample false discovery rate control and demonstrates robustness across various collaborative learning scenarios.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 20

Online Conformal Anomaly Detection with Prediction-Powered Data Acquisition

Online Conformal Anomaly Detection with Prediction-Powered Data Acquisition introduces C-PP-COAD, a framework that uses synthetic calibration data to reduce reliance on real-world calibration while maintaining assumption-free false discovery rate control. The method wraps any anomaly detection algorithm, converting its scores into conformal p-values for online testing. Experiments on synthetic and real datasets—including thyroid dysfunction, O‑RAN conflict, 5G intrusion, and UE throughput degradation—show that C-PP-COAD preserves FDR guarantees while significantly cutting the need for real calibration data.

By Amirmohammad Farzaneh, Osvaldo Simeone
arXiv Machine Learning
Oct 12

From Imbalance to Evidence: Deep Nonparametric Testing for Complex Data under Severe Sample Imbalance

The paper introduces EIAD-C2ST, a deep classifier two-sample test designed for highly imbalanced data, particularly complex non-Euclidean structures like graphs. It reframes sample imbalance as a source of repeated testing evidence rather than a nuisance, tailoring classifiers to data structure and offering a scalable representation‑amortized strategy for expensive deep models. The authors provide theoretical guarantees on asymptotic size and power consistency, and demonstrate empirical improvements through simulations and a blockchain forensics application.

By Guanhao Zhou, Xiufan Yu