paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
AD

Alvin Deng

COLM 2026×2数据与预训练检索与知识评测与基准效率与系统
新星分贡献者
39
一作贡献0
核心/参与10
方向广度8
合作网络9
0 一作 · 2 篇 · COLM 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

2
作者位次 #7/11COLM 2026Poster· Poster Session 1· Imperial Ballroom· #37

Capability Provenance in Language Models: A Case Study in Social Reasoning

Glenn Matlin · Chandreyi Chakraborty · Saehee Eom · Mika Okamoto · Rayan Castilla · Louis Jaburi · Alvin Deng · Taywon Min · Lucia Quirke · Stella Biderman · Mark Riedl

We map which pretraining-corpus regions support social vs. STEM reasoning in OLMo3-7B by aggregating training-data attribution over WebOrganizer topic×format bins, and validate the map with influence-targeted unlearning that beats random controls.

摘要

We use training-data attribution as an interpretable tool for capability discovery, mapping which regions of the pretraining corpus support social reasoning versus STEM reasoning in OLMo3-7B. Training-data attribution measures how strongly each training document influences a model's predictions on a benchmark, but document-level scores are too noisy to identify which corpus regions support which capabilities. We compute gradient-based attribution (TrackStar via Bergson) over a working set drawn from the de-duplicated Dolma3 mix, aggregate influence across WebOrganizer's 24-format $\times$ 24-topic taxonomy (576 bins), and contrast benchmark pairs in a $2{\times}2$ design that varies domain (social vs. STEM) and capability type (reasoning vs. knowledge): SocialIQA and MMLU Social Sciences against ARC-Challenge and MMLU STEM. Social and STEM reasoning draw on qualitatively distinct corpus regions, and the contrast is sharper at the reasoning level than at the knowledge level. Targeted machine unlearning provides partial causal validation: forgetting high-attribution topics (e.g., Literature for SocialIQA) degrades the aligned benchmark more than within-topic random baselines. We open-source all code, data artifacts, influence scores, and checkpoints at https://github.com/HCAI-Lab-GT/capabilibara and https://huggingface.co/HCAI-Lab-GT.

评测与基准数据与预训练检索与知识training data attributionsocial reasoninginfluence functionspretraining corpusOpenReview 项目页
作者位次 #10/34COLM 2026Poster· Poster Session 5· Franciscan C· #96

The Finetuner’s Fallacy: When to Pretrain with Your Finetuning Data

Christina Baek · Ricardo Pio Monti · David J. Schwab · Amro Abbas · Rishabh Adiga · Cody Blakeney · Maximilian Böther · Paul Burstein · Aldo Gael Carranza · Alvin Deng · Parth Doshi · Vineeth Dorna · Alex Fang · Tony Jiang · Siddharth Joshi · Brett W. Larsen · Jason Chan Lee · Katherine L. Mentzer · Luke Merrick · Haakon Mongstad · Fan Pan · Anshuman Suri · Darren Teh · Jason Telanoff · Jack Urbanek · Zhengping Wang · Josh Wills · Haoli Yin · Aditi Raghunathan · J Zico Kolter · Bogdan Gaza · Ari S. Morcos · Matthew L Leavitt · Pratyush Maini

Repeating domain-specific datasets 10–50× starting from pretraining leads to substantially better downstream performance, in some cases outperforming larger models.

摘要

Real-world model deployments demand strong performance on narrow domains where data is often scarce. Typically, practitioners finetune models to specialize them, but this risks overfitting to the domain and forgetting general knowledge. We study a simple strategy, specialized pretraining (SPT), where a small domain dataset, typically reserved for finetuning, is repeated starting from pretraining as a fraction of the total tokens. Across three specialized domains (ChemPile, MusicPile, and ProofPile), SPT improves domain performance and preserves general capabilities after finetuning compared to standard pretraining. In our experiments, SPT reduces the pretraining tokens needed to reach a given domain performance by up to 1.75x. These gains grow when the target domain is underrepresented in the pretraining corpus: on domains far from web text, a 1B SPT model outperforms a 3B standard pretrained model. Beyond these empirical gains, we derive overfitting scaling laws to guide practitioners in selecting the optimal domain-data repetition for a given pretraining compute budget. Our observations reveal the finetuner's fallacy: while finetuning may appear to be the cheapest path to domain adaptation, introducing specialized domain data during pretraining stretches its utility. SPT yields better specialized domain performance (via reduced overfitting across repeated exposures) and better general domain performance (via reduced forgetting during finetuning), ultimately achieving stronger results with fewer parameters and less total compute when amortized over inference. To get the most out of domain data, incorporate it as early in training as possible.

数据与预训练效率与系统检索与知识pretrainingscaling lawsdataOpenReview

常见合作者