paper-with-me

Papers

Not All LLM-Generated Data Are Equal: Rethinking Data Weighting in Text Classification

2024-10-28 · Hsun-Yu Kuo, Yin-Hsiang Liao, Yu-Chieh Chao, Wei-Yun Ma, Pu-Jen Cheng

Synthetic data augmentation via large language models (LLMs) allows researchers to leverage additional training data, thus enhancing the performance of downstream tasks, especially when real-world data is scarce. However, the generated data can deviate from the real-world data, and this misalignment can bring deficient outcomes while applying the trained model to applications. Therefore, we proposed efficient weighted-loss approaches to align synthetic data with real-world distribution by emphasizing high-quality and diversified data generated by LLMs with using merely a little real-world data. We empirically assessed the effectiveness of our method on multiple text classification tasks, and the results showed leveraging our approaches on a BERT-level model robustly outperformed standard cross-entropy and other data weighting approaches, providing potential solutions to effectively leveraging synthetic data from any suitable data generator for model training.

📄 PDF Abstract BibTeX arXiv:2410.21526

Code (0)

등록된 구현이 없습니다.

Tasks

AllData Augmentationtext-classificationText Classification

Methods 이 논문이 사용한 방법론

ALIGN In the ALIGN method, visual and language representations are jointly trained from noisy image alt-text data. The image and text encoders are learned via contrastive loss…

Similar Papers 제목 키워드 기반

Rethinking Loss Reweighting for Imbalance Learning as an Inverse Problem: A Neural Collapse Point of View

2026-05-11 · Jinping Wang, Zixin Tong, Zhiwu Xie, Zhiqiang Gao arxiv

Loss reweighting is a widely used strategy for long-tailed classification, but existing reweighting strategies often rely on heuristics and rarely define a well-specified target. Inspired by Neural Collapse (NC), the ide…

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers

2024-01-19 · Jiongzhi Zheng, Zhuo Chen, Chu-min Li, Kun He

MaxSAT is an optimization version of the famous NP-complete Satisfiability problem (SAT). Algorithms for MaxSAT mainly include complete solvers and local search incomplete solvers. In many complete solvers, once a better…

Rethinking Data Curation in LLM Training: Online Reweighting Offers Better Generalization than Offline Methods

2026-04-19 · Wanru Zhao, Yihong Chen, Yuzhi Tang, Wentao Ma 외 arxiv

Data curation is a critical yet under-explored area in large language model (LLM) training. Existing methods, such as data selection and mixing, operate in an offline paradigm, detaching themselves from training. This se…

From 2D to 3D terrain-following area coverage path planning

2026-01-02 · Mogens Plessen arxiv

An algorithm for 3D terrain-following area coverage path planning is presented. Multiple adjacent paths are generated that are (i) locally apart from each other by a distance equal to the working width of a machinery, wh…

An Optimal Weighting Function for the Savitzky-Golay Filter

2021-11-23 · Paul W. Oxby

The Savitzky-Golay FIR digital filter is based on a least-squares polynomial fit to a hypothetical sample of equally spaced data. This gives the filter the ability to preserve moments of features like peaks in the input.…