arXiv Machine Learning August 3, 2026 By Zardad Khan, Amjad Ali, Najd Adeed, Saeed Aldahmani

POSSE-kNN: Pathwise Out-of-Bag Selected Subspace Ensembles for Binary Classification

Read the original on arXiv Machine Learning →

arXiv:2211. 11278v3 Announce Type: replace-cross Abstract: Nearest neighbour classification is attractive for tabular data, but its performance can deteriorate when a fixed query centred neighbourhood does not follow the local class geometry.

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.

benchmarks

arXiv AI

Jul 15

Exact and Certified Data Shapley for Weighted k-Nearest-Neighbor Regression and Soft-Label Prediction

arXiv:2607. 11956v1 Announce Type: cross Abstract: Data Shapley is the standard principled answer to which training points are worth what, and its k-nearest-neighbor (KNN) specialization is the version deployed in practice: the exact estimator shipped by toolkits such as pyDVL and OpenDataVal.

By Zongye Lyu

safety

arXiv Machine Learning

Sep 10

A budget-dependent crossover between coverage- and response-based training-set selection for machine-learned interatomic potentials

arXiv:2609.05877v1 Announce Type: new Abstract: Selecting compact training sets for machine-learned interatomic potentials requires deciding whether to preserve structural diversity or target configu...

By Jia Bi, Alin-Marin Elena

rag

arXiv AI

Jun 30

Self-Organized Conformal Prediction: Reducing Regional Coverage Gaps with Unsupervised Group Discovery

arXiv:2606. 29403v1 Announce Type: cross Abstract: Conformal prediction guarantees marginal coverage, but pooled calibration averages over heterogeneous regions and can mask regional undercoverage in safety-critical subgroups.

By Louis Berthier, Ahmed Shokry, Maxime Moreaud, Guillaume Ramelet, Aymeric Dieuleveut

rag benchmarks safety

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.

By Samir Orujov

arXiv Machine Learning

Jul 24

ADABORD: a novel AdaBoost approach for ordinal classification

arXiv:2607. 21003v1 Announce Type: new Abstract: Ordinal Classification (OC) deals with classification tasks where the classes follow a natural order.

By Rafael Ayll\'on-Gavil\'an, Francisco Jos\'e Mart\'inez-Estudillo, David Guijo-Rubio, C\'esar Herv\'as-Mart\'inez, Pedro A. Guti\'errez

benchmarks

arXiv Machine Learning

Jun 2

Decision-Path Patterns as Tree Reliability Signals: Path-based Adaptive Weighting for Random Forest Classification

arXiv:2605. 20716v5 Announce Type: replace Abstract: Random forests construct each tree with a different, randomised representation of the feature space.

By Youngjoon Park

benchmarks safety

One email a morning, machine-written

Related stories

Exact and Certified Data Shapley for Weighted k-Nearest-Neighbor Regression and Soft-Label Prediction

A budget-dependent crossover between coverage- and response-based training-set selection for machine-learned interatomic potentials

Self-Organized Conformal Prediction: Reducing Regional Coverage Gaps with Unsupervised Group Discovery

Ensembles of Exactly Solved Subsamples for Clusterwise Regression: Trimming Without a Trimming Level

ADABORD: a novel AdaBoost approach for ordinal classification

Decision-Path Patterns as Tree Reliability Signals: Path-based Adaptive Weighting for Random Forest Classification