Filter-then-Weight: Online Data Selection and Reweighting for LLM Fine-Tuning
Fangxin Wang, Peyman Baghershahi, Langzhou He, Henry Peng Zou, Sourav Medya, Philip S. Yu

TL;DR
This paper introduces an optimizer-aware online data selection and reweighting method for fine-tuning large language models, improving convergence and performance by considering optimizer states and data interactions.
Contribution
It proposes a novel Filter-then-Weight algorithm that dynamically filters and reweights data during online LLM fine-tuning, accounting for optimizer geometry and data redundancy.
Findings
Consistently improves convergence over existing methods.
Enhances downstream task performance under the same data budget.
Efficiently handles long-context data with optimized computations.
Abstract
Gradient-based data selection offers a principled framework for estimating sample utility in large language model (LLM) fine-tuning, but existing methods are mostly designed for offline settings. They are therefore less suited to online fine-tuning, where data arrives sequentially, sample utility is step-dependent, and the effective update geometry is shaped by adaptive optimizers. We propose an optimizer-aware framework for gradient-based online data selection and reweighting in LLM fine-tuning. Our key idea is to view online selection not as static sample ranking, but as shaping the next target-oriented update under the current optimizer state. We formulate this as an optimizer-aware update-matching problem, establish its connection to second-order target utility, and show why subset-level construction must account for interactions and redundancy among selected samples. Based on this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
