SEED: Targeted Data Selection by Weighted Independent Set
Not on the map. Why?
Abstract (arXiv)
Data selection seeks to identify a compact yet informative subset from large-scale training corpora, balancing sample quality against collection diversity. We formulate this problem as a Weighted Independent Set (WIS) on a similarity graph, where nodes represent data samples weighted by influence, and edges connect semantically redundant pairs. This formulation naturally yields subsets that are simultaneously high-quality and diverse. However, two challenges arise in practice: naive node weights fail to distinguish informative signals from gradient noise, and edge construction under heterogeneous domain distributions produces structurally imbalanced graphs that bias selection toward sparse regions. To address these issues, we introduce two principled refinements from a unified graph perspective: (1) textitnode value calibration that restricts influence estimation to the bilateral salient subspace to ground node importance in task-relevant signals rather than surface-level statistics; (2) textitlocal scale normalization that adapts edge thresholds to local neighborhood density, mitigating graph imbalance induced by cross-domain distribution shifts. Together, these components yield a robust and scalable data selection pipeline dubbed SEED. We further construct textttHoneybee-Remake-SEED-200K, a compact multimodal dataset curated by SEED. Extensive experiments show that SEED consistently outperforms state-of-the-art methods on instruction tuning, visual instruction tuning, and semantic segmentation across diverse model families.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 54 of its 71 references that are in the map. First posted on arXiv 15 May 2026.
Builds on
54 of 71 references.
References · 54
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2025Qwen3 Technical Reportcited by 8,820
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2023Segment Anythingcited by 8,234
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
- 2025Qwen3-VL Technical Reportcited by 2,793
38 more
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,161
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2023MME: A Comprehensive Evaluation Benchmark for Multimodal Large Language Modelscited by 1,652
- 2023MathVista: Evaluating Mathematical Reasoning of Foundation Models in Visual Contextscited by 1,614
- 2016Playing for Data: Ground Truth from Computer Gamescited by 818
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 739
- 2023OpenAssistant Conversations -- Democratizing Large Language Model Alignmentcited by 721
- 2024Phi-4 Technical Reportcited by 711
- 2024DeepSeek LLM: Scaling Open-Source Language Models with Longtermismcited by 642
- 2024MathVerse: Does Your Multi-modal LLM Truly See the Diagrams in Visual Math Problems?cited by 586
- 2023HallusionBench: An Advanced Diagnostic Suite for Entangled Language Hallucination and Visual Illusion in Large Vision-Language Modelscited by 583
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 580
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 532
- 2020TyDi QA: A Benchmark for Information-Seeking Question Answering in Typologically Diverse Languagescited by 488
- 2024VLMEvalKit: An Open-Source Toolkit for Evaluating Large Multi-Modality Modelscited by 455
- 2024SparseVLM: Visual Token Sparsification for Efficient Vision-Language Model Inferencecited by 391
- 2025Seed1.5-VL Technical Reportcited by 373
- 2023What Makes Good Data for Alignment? A Comprehensive Study of Automatic Data Selection in Instruction Tuningcited by 364
- 2023Data Selection for Language Models via Importance Resamplingcited by 329
- 2023SemDeDup: Data-efficient learning at web-scale through semantic deduplicationcited by 303
- 2024A Survey on Data Selection for Language Modelscited by 236
- 2024CharXiv: Charting Gaps in Realistic Chart Understanding in Multimodal LLMscited by 234
- 2024DsDm: Model-Aware Dataset Selection with Datamodelscited by 105
- 2019Investigating Prior Knowledge for Challenging Chinese Machine Reading Comprehensioncited by 81
- 2023D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruningcited by 69
- 2021Improving Deep Learning Interpretability by Saliency Guided Trainingcited by 68
- 2025SimpleVQA: Multimodal Factuality Evaluation for Multimodal Large Language Modelscited by 66
- 2024TSDS: Data Selection for Task-Specific Model Finetuningcited by 28
- 2025Improving Influence-based Instruction Tuning Data Selection for Balanced Learning of Diverse Capabilitiescited by 23
- 2024Unveiling the Tapestry of Consistency in Large Vision-Language Modelscited by 22
- 2025D3: Diversity, Difficulty, and Dependability-Aware Data Selection for Sample-Efficient LLM Instruction Tuningcited by 21
- 2025TimeSearch-R: Adaptive Temporal Search for Long-Form Video Understanding via Self-Verification Reinforcement Learningcited by 20
- 2023Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sourcescited by 16
- 2025Data Pruning by Information Maximizationcited by 15
- 2025HoneyBee: Data Recipes for Vision-Language Reasonerscited by 13
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.