Hanze Li
Author directory2026
Can Generalist Agents Automate Data Curation?
Feiyang Kang | Hanze Li | Adam Nguyen | Mahavir Dabas | Jiaqi W. Ma | Frederic Sala | Dawn Song | Ruoxi Jia
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Feiyang Kang | Hanze Li | Adam Nguyen | Mahavir Dabas | Jiaqi W. Ma | Frederic Sala | Dawn Song | Ruoxi Jia
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Curating training data is among the most consequential yet labor-intensive parts of modern AI development: practitioners iteratively propose, implement, evaluate, and revise data policies against noisy benchmark feedback. We ask whether generalist coding agents can automate this data-curation loop. We introduce *Curation-Bench*, an agent-centric benchmark that fixes the model, training recipe, and evaluation suite while giving agents command-line access to inspect data, implement policies, submit them to a fixed training/evaluation pipeline, and revise. In a vision-language instruction-tuning instantiation, out-of-the-box agents reach strong published data-selection baselines within ten iterations. However, trajectory analysis reveals a persistent execution–research gap: agents mainly tune local policy variants rather than explore new policy families, even when given strategy guides and paper references. Scaffolds requiring each iteration to cite, instantiate, and adapt a prior method shift agents toward method-guided exploration. The scaffolded agent autonomously composes—without human design input—a data-selection policy that outperforms strong published baselines at one-tenth their data budget. Overall, current agents can run the curation loop, but reliable data research requires scaffolded method adaptation, not open-ended prompting alone. Code and benchmark are open-sourced.
2025
Open-World Planning via Lifted Regression with LLM-Inferred Affordances for Embodied Agents
Xiaotian Liu | Ali Pesaranghader | Hanze Li | Punyaphat Sukcharoenchaikul | Jaehong Kim | Tanmana Sadhu | Hyejeong Jeon | Scott Sanner
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xiaotian Liu | Ali Pesaranghader | Hanze Li | Punyaphat Sukcharoenchaikul | Jaehong Kim | Tanmana Sadhu | Hyejeong Jeon | Scott Sanner
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Open-world planning with incomplete knowledge is crucial for real-world embodied AI tasks. Despite that, existing LLM-based planners struggle with long chains of sequential reasoning, while symbolic planners face combinatorial explosion of states and actions for complex domains due to reliance on grounding. To address these deficiencies, we introduce LLM-Regress, an open-world planning approach integrating lifted regression with LLM-generated affordances. LLM-Regress generates sound and complete plans in a compact lifted form, avoiding exhaustive enumeration of irrelevant states and actions. Additionally, it makes efficient use of LLMs to infer goal-related objects and affordances without the need to predefine all possible objects and affordances. We conduct extensive experiments on three benchmarks and show that LLM-Regress significantly outperforms state-of-the-art LLM planners and a grounded planner using LLM-generated affordances.