arXiv Statistics ML
Group recovery after trimming, and level-free flagging, in robust clusterwise regression
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Statistics ML
6d ago
Ensembles of Exactly Solved Subsamples for Clusterwise Regression: Trimming Without a Trimming Level
The paper proposes an ensemble method for clusterwise regression that uses exact solutions on many small random subsamples. Each subsample is solved to global optimality, extended to the full data via nearest-surface assignment, and the resulting partitions are combined by voting or selection. The method achieves high accuracy even with up to 20% gross outliers and can estimate the trimming level without prior knowledge, outperforming traditional trimmed alternation in worst‑case scenarios.
arXiv Machine Learning
Aug 24
The Exceedance Design Effect: Effective Sample Size for Thresholds under Clustering
arXiv:2608.21262v1 Announce Type: cross Abstract: Many machine-learning systems set a threshold at a quantile of a calibration set: conformal predictors that promise 90% coverage by drawing their cut...
arXiv Machine Learning
Jul 10
Who Gets Missed in the Tail? Thresholded Subgroup Underdiagnosis in Long-Tailed Chest X-ray Classification
arXiv:2607. 07717v1 Announce Type: new Abstract: In chest X-ray (CXR) classification, acceptable ranking performance can still leave rare-positive patients below threshold, especially within subgroups.
arXiv AI
Aug 10
Zero Gap Is Not Restoration: Stratified Per-Question Probability Evaluation and Step-wise Mitigation of Benchmark Contamination
arXiv:2608. 07341v1 Announce Type: cross Abstract: Test data from public benchmarks inevitably leaks into pretraining corpora, inflating evaluation scores once memorized.
arXiv Machine Learning
Jun 29
RANSAC Scoring Done Right
arXiv:2606. 27385v1 Announce Type: new Abstract: The most widely used RANSAC variants score candidate models by counting inliers or summing per-point scores that saturate beyond a residual threshold.
arXiv Machine Learning
Aug 27
Resolving Multi-Modal Regression by Difference-Quotient-Based Clustering:Fast Coarse Conditional-Label Assignment
The paper introduces Difference‑Quotient Clustering (DQC) to address mean‑collapse in multimodal regression. DQC partitions data by minimizing intra‑cluster output‑vs‑input discrepancy, assigning each sample to the cluster with the lowest maximum contradiction ratio. The resulting cluster labels train a logits generator and conditional network, achieving lower minimum squared error on synthetic benchmarks compared to random labeling and mean‑collapse baselines.