mlsanityData to 14 Oct 2026

Prefer to Classify: Improving Text Classifiers via Auxiliary Preference Learning

arXiv 2306.04925 ↗First posted 8 Jun 2023cs.CL cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

The development of largely human-annotated benchmarks has driven the success of deep neural networks in various NLP tasks. To enhance the effectiveness of existing benchmarks, collecting new additional input-output pairs is often too costly and challenging, particularly considering their marginal impact on improving the current model accuracy. Instead, additional or complementary annotations on the existing input texts in the benchmarks can be preferable as an efficient way to pay the additional human cost. In this paper, we investigate task-specific preferences between pairs of input texts as a new alternative way for such auxiliary data annotation. From 'pair-wise' comparisons with respect to the task, the auxiliary preference learning enables the model to learn an additional informative training signal that cannot be captured with 'instance-wise' task labels. To this end, we propose a novel multi-task learning framework, called prefer-to-classify (P2C), which can enjoy the cooperative effect of learning both the given classification task and the auxiliary preferences. Here, we provide three different ways to collect preference signals in practice: (a) implicitly extracting from annotation records (for free, but often unavailable), (b) collecting explicitly from crowd workers (high paid), or (c) pre-trained large language models such as GPT-3 (low paid). Given existing classification NLP benchmarks, we demonstrate that the proposed auxiliary preference learning via P2C on them is effective in improving text classifiers. Our codes are publicly available.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 37 of its 59 references that are in the map. First posted on arXiv 8 Jun 2023.

Builds on

37 of 59 references.

References · 37

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2022Training language models to follow instructions with human feedbackcited by 15,971
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  6. 2017On Calibration of Modern Neural Networkscited by 4,960
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  8. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  9. 2017Deep reinforcement learning from human preferencescited by 3,912
  10. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  11. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  12. 2020Learning to summarize from human feedbackcited by 2,588
25 more
  1. 2019Fine-Tuning Language Models from Human Preferencescited by 2,150
  2. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,998
  3. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  4. 2019When Does Label Smoothing Help?cited by 988
  5. 2018Neural Network Acceptability Judgmentscited by 958
  6. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
  7. 2019Adversarial NLI: A New Benchmark for Natural Language Understandingcited by 807
  8. 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 803
  9. 2018Annotation Artifacts in Natural Language Inference Datacited by 671
  10. 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 464
  11. 2021Dynabench: Rethinking Benchmarking in NLPcited by 459
  12. 2019Learning the Difference that Makes a Difference with Counterfactually-Augmented Datacited by 439
  13. 2021Dealing with Disagreements: Looking Beyond the Majority Vote in Subjective Annotationscited by 314
  14. 2021PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-trainingcited by 302
  15. 2021Ensemble deep learning: A reviewcited by 284
  16. 2020Long-tailed Recognition by Routing Diverse Distribution-Aware Expertscited by 271
  17. 2020What Can We Learn from Collective Human Opinions on Natural Language Inference Data?cited by 153
  18. 2020Regularizing Class-wise Predictions via Self-knowledge Distillationcited by 144
  19. 2013A Computational Approach to Politeness with Application to Social Factorscited by 106
  20. 2021Agreeing to Disagree: Annotating Offensive Language Datasets with Annotators' Disagreementcited by 72
  21. 2020Active Preference-Based Gaussian Process Regression for Reward Learningcited by 71
  22. 2020DynaSent: A Dynamic Benchmark for Sentiment Analysiscited by 63
  23. 2021Mind Your Outliers! Investigating the Negative Impact of Outliers on Active Learning for Visual Question Answeringcited by 62
  24. 2020ANLIzing the Adversarial Natural Language Inference Datasetcited by 36
  25. 2020Rank over Class: The Untapped Potential of Ranking in Natural Language Processingcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Annotation-Efficient Language Model Alignment via Diverse and Representative Response Texts
  2. 2025The Delta Learning Hypothesis: Preference Tuning on Weak Data can Yield Strong Gains
  3. 2023LLM-augmented Preference Learning from Natural Language
  4. 2025Users as Annotators: LLM Preference Learning from Comparison Mode
  5. 2024Spread Preference Annotation: Direct Preference Judgment for Efficient LLM Alignment
  6. 2024Comparing Specialised Small and General Large Language Models on Text Classification: 100 Labelled Samples to Achieve Break-Even Performance
  7. 2024Hybrid Preferences: Learning to Route Instances for Human vs. AI Feedback
  8. 2025Semi-Supervised Preference Optimization with Limited Feedback