activity
20232026
most citedQEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning

3 citations · 9 across the 18 of their papers we have counts for

collaborators
Showing 2024 · cs.CLShow all

5 papers · 2 filters

cs.CL2024

:Revealing the Decisive Effect of Instruction Diversity on Generalization

Dylan Zhang, Justin Wang, Francois Charton

Understanding and accurately following instructions is critical for large language models (LLMs) to be effective across diverse tasks. In this work, we rigorously examine the key f…

cs.CL2024★ 1 cited

: Improving Code LMs with Execution-Guided On-Policy Preference Learning Driven By Synthetic Test Cases

Dylan Zhang, Shizhe Diao, Xueyan Zou +1

Preference learning provides a promising solution to address the limitations of supervised fine-tuning (SFT) for code language models, where the model is not explicitly trained to…

cs.CL2024

From Symbolic Tasks to Code Generation: Diversification Yields Better Task Performers

Dylan Zhang, Justin Wang, Francois Charton

Instruction tuning -- tuning large language models on instruction-output pairs -- is a promising technique for making models better adapted to the real world. Yet, the key factors…

cs.CL2024★ 1 cited

Instruction Diversity Drives Generalization To Unseen Tasks

Dylan Zhang, Justin Wang, Francois Charton

Instruction tuning -- fine-tuning a large language model (LLM) on pairs of instructions and desired outcomes -- is an approach that enables pre-trained language models to perform r…

cs.CL2024

Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursion

Dylan Zhang, Curt Tigges, Zory Zhang +3

This paper investigates the ability of transformer-based models to learn structural recursion from examples. Recursion is a universal concept in both natural and formal languages.…