arXiv AI By Yangze Liu, Xiao-Long Yin, Zhongyi Han

Useful to Whom? The Easy-versus-Coverage Boundary Moves with the Learner

Read the original on arXiv AI →

The study investigates whether the usefulness of training samples depends on the data itself or on the learner. By fixing selected subsets and varying the learner, the authors show that the crossover point—where easy samples give way to coverage samples—shifts with changes in model width, input resolution, and architecture. This indicates that the boundary between easy and coverage samples is learner‑dependent rather than data‑dependent.

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 AI.

arXiv AI
Oct 2

Useful to Whom? Sample Value Is Defined Only Relative to the Learner

The paper investigates how the usefulness of training samples, as determined by coreset selection, depends on the learner rather than just the data. Experiments on ImageNet-100 and ImageNet-1k show that changing model width, input grid, stride, and architecture (e.g., ResNet vs. ViT) shifts the crossover point where different selection criteria (easy-first vs. geometric coverage) become optimal. These findings demonstrate that the relative value of a fixed subset of samples varies with the target learner’s capacity and structure, and that selection strategies must be tuned to the specific model they will train.

By Yangze Liu, Xiao-Long Yin, Zhongyi Han
arXiv Computer Vision
1d ago

Expanding the Quality-Coverage Frontier with Competitive Flow Matching

The paper introduces a winner‑take‑all training strategy for flow‑matching generators that injects a random low‑dimensional conditioning code to create multiple candidate velocity predictions. By applying the loss only to the best‑matching candidate, the method allows distinct modes to shape separate predictions, mitigating the quality‑coverage tradeoff inherent in traditional flow matching. The approach also enables a new auxiliary conditioning‑scaling guidance, and demonstrates significant improvements on ImageNet‑256, reducing Fréchet Distance scores by more than 70% on both SiT and RAEv2 testbeds.

By Wenxuan Peng, Richard Zhang, Haitian Zheng, Jaskirat Singh, Tsai-Shien Chen, Eli Shechtman, Bharath Hariharan, Hadar Averbuch-Elor, Zongze Wu
arXiv Machine Learning
Sep 22

Are Coreset Selection Methods Worth Their Cost?

The paper evaluates coreset selection methods by incorporating both selection and training time into a unified wall‑clock budget, using a standardized benchmark across four datasets and multiple selectors. Across numerous budget anchors, simple random or full‑data training consistently outperforms sophisticated selectors, and selection costs are dominated by a full‑dataset scan that cannot be amortized. The study also identifies when subset reuse can justify selection and reports several correctness fixes in a popular codebase.

By Yangze Liu, Zhongyi Han
arXiv Computer Vision
Sep 18

Distance to Class Prototypes: Active Learning for Object Detection

The paper introduces a new active learning signal for object detection that relies on a supervised contrastive term added to the training objective. This term shapes an embedding space where distance reflects class membership, allowing an unlabeled detection to be scored by its distance from the predicted category’s region weighted by confidence—all from a single forward pass of one network. Experiments on PASCAL VOC and MS‑COCO show that this criterion outperforms the standard posterior and remains competitive with ensemble‑based methods while incurring only a modest 8.3% increase in parameters.

By Licheng Zhang, Zheng Gong
arXiv Computer Vision
Aug 24

When does fusing hand-crafted knowledge with learned representations pay? A cost-normalized benchmark of stacking, substitution, and interference

arXiv:2608.21098v1 Announce Type: new Abstract: Fusing prior knowledge with data-driven learning is attractive where data is scarce, yet no controlled account says when it helps, is redundant, or har...

By Ahmad AlMughrabi, Albert Clop, Benjamin Busam, Ricardo Marques, Petia Radeva