How can we train models to perform well on hard test data when hard training data is by definition difficult to label correctly? This question has been termed the scalable oversight problem and has drawn increasing attention as language models have continually improved. In this paper, we present the surprising conclusion that current pretrained language models often generalize relatively well from easy to hard data, even performing as well as oracle models finetuned on hard data. We demonstrate this kind of easy-to-hard generalization using simple finetuning methods like in-context learning, linear classifier heads, and QLoRA for seven different measures of datapoint hardness, including six empirically diverse human hardness measures (like grade level) and one model-based measure (loss-based). Furthermore, we show that even if one cares most about model performance on hard data, it can be better to collect easy data rather than hard data for finetuning, since hard data is generally noisier and costlier to collect. Our experiments use open models up to 70b in size and four publicly available question-answering datasets with questions ranging in difficulty from 3rd grade science questions to college level STEM questions and general-knowledge trivia. We conclude that easy-to-hard generalization in LMs is surprisingly strong for the tasks studied. Our code is available at: https://github.com/allenai/easy-to-hard-generalization
RIMO: An Easy-to-Evaluate, Hard-to-Solve Olympiad Benchmark for Advanced Mathematical Reasoning
Artificial Intelligence Thrust, Information Hub, Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China(人工智能 thrust,信息中心,香港科学与技术大学(广州),广州,中国)
Fast on the Easy, Deep on the Hard: Efficient Reasoning via Powered Length Penalty
Artificial Intelligence Innovation and Incubation Institute, Fudan University(复旦大学人工智能创新与孵化院);School of Data Science, Fudan University(复旦大学数据科学学院);Shanghai Academy of Artificial Intelligence for Science(上海人工智能科学研究院)
AI "News" Content Farms Are Easy to Make and Hard to Detect: A Case Study in Italian
Istituto di Scienza e Tecnologia dell’Informazione “A. Faedo”(A. Faedo信息科学与技术研究所);IT University of Copenhagen(哥本哈根信息技术大学);Istituto di Linguistica Computazionale “Antonio Zampolli”(Antonio Zampolli计算语言学研究所)
Easy-to-Hard Generalization: Scalable Alignment Beyond Human Supervision
Carnegie Mellon University(卡内基梅隆大学);Peking University(北京大学);MIT-IBM Watson AI Lab(麻省理工学院-IBM沃森人工智能实验室);University of Cambridge(剑桥大学);Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);UMass Amherst(马萨诸塞大学阿默斯特分校)
Advancing Machine-Generated Text Detection from an Easy to Hard Supervision Perspective
Department of Computer Science, Hong Kong Baptist University, Hong Kong, China(香港 Baptist 大学计算机科学系);School of Computer Science, University of Science and Technology of China, Hefei, China(中国科学技术大学计算机科学学院)
Reducibility among NP-Hard graph problems and boundary classes
Computer Science Department, Habib University, Karachi, Pakistan(哈比大学计算机科学系);Computer Science Department, Institute of Business Administration, Karachi, Pakistan(商学院计算机科学系)