Predictable Swarm Scaling
Under suitable conditions, we can use simulation to roughly estimate the best structure for an agent swarm and its scaling law.
Wenhao Chai is a second-year Ph.D. student in Computer Science at Princeton University, advised by Professor Karthik Narasimhan, and a student researcher at Google DeepMind. He received his master's degree from the University of Washington and his bachelor's from Zhejiang University.
He has interned at Pika Labs, where he worked with Professor Christopher D. Manning, and at Microsoft Research Asia.
He leads MovieChat, one of the first large multimodal models and benchmarks for hour-long video understanding with a memory mechanism. He co-leads LiveCodeBench Pro, a benchmark that Google and Meta report in their evaluations of Gemini and Muse Spark. He has organized workshops and competitions at CVPR 2024, CVPR 2025, and CVPR 2026. His work has been featured in MIT Technology Review. Sequoia China and MIT Technology Review China named him to AI25, their list of AI innovators under 25.
He is currently working on Recursive Self-Improvement (RSI).
Under suitable conditions, we can use simulation to roughly estimate the best structure for an agent swarm and its scaling law.
Open models score well on AutomationBench; the scoring rule, unsound string-matching guardrails included, decides much of the ranking, and eighteen of its string guardrails fail runs a task owner would accept.
Looping DiT-B/4 under the MeanFlow one-step objective: at equal compute the looped model holds no advantage, and extra denoising steps pay off more than extra loops.
Undergraduate and master's students: if you want to talk about research ideas, career plans, or life in AI/ML, book a slot. I set aside at least 30 minutes every week for these meetings, and I encourage students from underrepresented groups to reach out. Open times are on my calendar.