AI Group @ucsantabarbara. Profs. @xwang_lk, @YuhengBu, Xifeng Yan, @WilliamWangNLP, @CodeTerminator. Account run by Student Social Committee.

Santa Barbara, CA
Joined July 2021
Congratulations to Prof. @xwang_lk on receiving three new research awards totaling over $180K! ๐ŸŽ‰ Proud to celebrate this achievement and the growing impact of AI research at UCSB! ๐Ÿš€ #UCSBAI #AgenticAI
Congrats to CS Prof. @xwang_lk on his 3 new awards ($180K+) to advance practical, efficient & proactive AI agents! ๐Ÿ† โœจ ๐Ÿ”น 3rd consecutive @Cisco Research Award ๐Ÿ”น UCSB IEE Software Impact Grant ๐Ÿ”น UCSB Academic Senate Grant #UCSB #AI #MachineLearning #CiscoResearch #AgenticAI
6
310
๐ŸŒ๐Ÿ”Ž Can AI agents find bugs in 3D worlds by exploring them? Introducing WorldAuditBench, a new benchmark for evaluating whether AI agents can explore interactive 3D environments, discover hidden bugs, and reason about what went wrong. ๐Ÿš€ ๐ŸŒ Project: ucsb-nlp-chang.github.io/Worโ€ฆ
How well can AI agents find bugs in virtual 3D worlds? ๐Ÿ” Introducing WorldAuditBench, a benchmark for auditing interactive 3D worlds with static and interactive anomalies, such as invisible walls, floating chairs, and objects inconsistent with the surrounding scene. Across 213 tasks in 13 environments, the strongest agent we evaluated achieves just 42.3% success, compared with 83.4% for humans. Finding these anomalies requires agents to explore, interact, and collect visual evidence to show whatโ€™s wrong. Hereโ€™s what we test and what we found ๐Ÿงต
3
2
11
825
Happy to see GEA on this list! Looking forward to more exciting work from the team! ๐Ÿš€
The top 5 #COLM2026 papers with visual explainers or videos, ranked by community likes: 1. Capability provenance: tracing which Dolma3 tokens taught OLMo3-7B each skill, using gradient-based data attribution. @GlennMatlin x.com/GlennMatlin/status/209โ€ฆ 2. GEA: agents that evolve as a group, sharing experience and learned artifacts across the population. 71.0% SWE-bench Verified. @WengZhaoti39773 x.com/WengZhaoti39773/statusโ€ฆ 3. SEAR: 7 LLMs, including text-only ones, controlling real robot hands across 335 tasks. @BangzhengL x.com/BangzhengL/status/2107โ€ฆ 4. ICL via activation subspaces: one attention head that matters across five in-context-learning task families. @xyVickyHu x.com/xyVickyHu/status/21024โ€ฆ 5. I-DLM: Introspective Diffusion Language Models, an oral spotlight. @Chenfeng_X x.com/Chenfeng_X/status/2107โ€ฆ The animation/ visual explanation reaches more than the abstract does. Did I miss any paper?
2
451
๐Ÿ† Huge congratulations to @WengZhaoti39773 and our UCSB students on winning the ๐—ข๐˜‚๐˜๐˜€๐˜๐—ฎ๐—ป๐—ฑ๐—ถ๐—ป๐—ด ๐—ฃ๐—ฎ๐—ฝ๐—ฒ๐—ฟ ๐—”๐˜„๐—ฎ๐—ฟ๐—ฑ at the COLM 2026 Lifelong Agent Workshop for our ๐—š๐—ฟ๐—ผ๐˜‚๐—ฝ-๐—˜๐˜ƒ๐—ผ๐—น๐˜ƒ๐—ถ๐—ป๐—ด ๐—”๐—ด๐—ฒ๐—ป๐˜๐˜€ paper! This is Zhaotianโ€™s ๐˜ƒ๐—ฒ๐—ฟ๐˜† ๐—ณ๐—ถ๐—ฟ๐˜€๐˜ ๐—ฝ๐—ฟ๐—ผ๐—ท๐—ฒ๐—ฐ๐˜ in our group; what an incredible achievement! ๐—–๐—ผ๐—น๐—น๐—ฒ๐—ฐ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฒ๐˜ƒ๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ถ๐˜€ ๐—ท๐˜‚๐˜€๐˜ ๐˜๐—ต๐—ฒ ๐—ฏ๐—ฒ๐—ด๐—ถ๐—ป๐—ป๐—ถ๐—ป๐—ด!
๐Ÿ† Honored that Group-Evolving Agents won the Outstanding Paper Award at the Lifelong Agents Workshop @ #COLM2026! Agents that evolve as a group, sharing experience, keep improving open-endedly ๐Ÿงฌ๐Ÿค– Grateful to my wonderful coauthors and @xwang_lk ! Had a great time at #COLM2026 ๐Ÿ“„ arxiv.org/abs/2602.04837 ๐Ÿ’ป github.com/UCSB-AI/GEA
1
3
2
43
2,889
๐ŸŽ‰ Outstanding Paper Award! @WengZhaoti39773 @xwang_lk Proud to share that โ€œGroup-Evolving Agentsโ€ received the ๐Ž๐ฎ๐ญ๐ฌ๐ญ๐š๐ง๐๐ข๐ง๐  ๐๐š๐ฉ๐ž๐ซ ๐€๐ฐ๐š๐ซ๐ at the Lifelong Agents Workshop @ #COLM2026 ๐Ÿ† Worth all the hard work, and well deserved! Canโ€™t wait to see whatโ€™s next!
๐Ÿ† Honored that Group-Evolving Agents won the Outstanding Paper Award at the Lifelong Agents Workshop @ #COLM2026! Agents that evolve as a group, sharing experience, keep improving open-endedly ๐Ÿงฌ๐Ÿค– Grateful to my wonderful coauthors and @xwang_lk ! Had a great time at #COLM2026 ๐Ÿ“„ arxiv.org/abs/2602.04837 ๐Ÿ’ป github.com/UCSB-AI/GEA
5
467
๐ŸŒŸ Congrats to @AlfonAmayuelas and @xwang_lk! UCSBโ€™s paper Sampling Is Not Curiosity: Why LLM Agents Should Investigate has been selected as a ๐’๐ฉ๐จ๐ญ๐ฅ๐ข๐ ๐ก๐ญ at NeurIPS 2026 โœจ Solid work, and looking forward to seeing more from the team!
We got a Spotlight Position Paper at NeurIPS 2026! What a week full of events. And I got to author this paper with some of the best minds in AI. The paper will be available at the end of this month! Stay tuned
1
4
444
We got a Spotlight Position Paper at NeurIPS 2026! What a week full of events. And I got to author this paper with some of the best minds in AI. The paper will be available at the end of this month! Stay tuned
๐๐ž๐ฎ๐ซ๐ˆ๐๐’ 2026 ๐’๐ฉ๐จ๐ญ๐ฅ๐ข๐ ๐ก๐ญ! Huge congrats to @AlfonAmayuelas on our position paper "Sampling Is Not Curiosity: Why LLM Agents Should Investigate" being selected as ๐จ๐ง๐ž ๐จ๐Ÿ ๐ญ๐ก๐ž ๐จ๐ง๐ฅ๐ฒ 11 ๐ฉ๐š๐ฉ๐ž๐ซ๐ฌ ๐š๐ฌ ๐’๐ฉ๐จ๐ญ๐ฅ๐ข๐ ๐ก๐ญ! Paper coming soon!
4
1
3
23
1,786
๐ŸŽค I will be giving an Oral Presentation today! @ Lifelong Agent Workshop ยท Fri Oct 9, 11:45 AMโ€“12:00 PM ยท Continental Ballroom 6 โœจ Group-Evolving Agents: Open-Ended Self-Improvement via Experience Sharing GEA treats a group of agents, not an individual, as the unit of evolution. Agents share experience as they self-improve, outperforming prior state-of-the-art open-ended self-improving methods and matching or exceeding top human-designed agent frameworks, all with zero human intervention.
AI agents aren't biological individuals. So why make them evolve like one? They can directly share experience and learned artifacts. Not bounded by reproduction, lineage, or genes. Meet ๐—š๐—˜๐—”, accepted to ๐—–๐—ข๐—Ÿ๐—  ๐Ÿฎ๐Ÿฌ๐Ÿฎ๐Ÿฒ ๐ŸŽ‰ ๐Ÿณ๐Ÿญ.๐Ÿฌ% SWE-bench Verified / ๐Ÿด๐Ÿด.๐Ÿฏ% Polyglot ยท zero human intervention ๐Ÿงต๐Ÿ‘‡ Most self-evolving agent systems follow a similar pattern: select a parent, refine it, produce an offspring, repeat. Evolution unfolds as a tree. It's great at generating diversity, but that diversity gets trapped. Agents explore independently, and instead of serving as stepping stones, their discoveries stay stuck in local branches. Most variants are short-lived. ๐—˜๐˜…๐—ฝ๐—น๐—ผ๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ต๐—ฎ๐—ฝ๐—ฝ๐—ฒ๐—ป๐˜€; ๐—ฟ๐—ฒ๐˜‚๐˜€๐—ฒ ๐—ฎ๐—ป๐—ฑ ๐—ฎ๐—ฐ๐—ฐ๐˜‚๐—บ๐˜‚๐—น๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ฟ๐—ฎ๐—ฟ๐—ฒ๐—น๐˜† ๐—ฑ๐—ผ. It's time to rethink the evolution of AI agents: why keep evolving them like biological individuals? AI agents aren't bound by reproduction, lineage, or genes. They can directly share trajectories, tools, workflows, and learned artifacts, aggregating complementary skills instantly. ๐—ช๐—ต๐˜† ๐—ป๐—ผ๐˜ ๐—ฟ๐—ฒ๐—ฑ๐—ฒ๐˜€๐—ถ๐—ด๐—ป ๐—ฒ๐˜ƒ๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ฎ๐—ฟ๐—ผ๐˜‚๐—ป๐—ฑ ๐˜„๐—ต๐—ฎ๐˜ ๐˜๐—ต๐—ฒ๐˜† ๐—ฐ๐—ฎ๐—ป ๐—ฎ๐—ฐ๐˜๐˜‚๐—ฎ๐—น๐—น๐˜† ๐—ฑ๐—ผ? That's GEA. GEA makes a ๐—ด๐—ฟ๐—ผ๐˜‚๐—ฝ ๐—ผ๐—ณ ๐—ฎ๐—ด๐—ฒ๐—ป๐˜๐˜€ ๐˜๐—ต๐—ฒ ๐—ณ๐˜‚๐—ป๐—ฑ๐—ฎ๐—บ๐—ฒ๐—ป๐˜๐—ฎ๐—น ๐˜‚๐—ป๐—ถ๐˜ ๐—ผ๐—ณ ๐—ฒ๐˜ƒ๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป. Each round, a parent group is selected under a Performance-Novelty criterion that balances competence with exploratory diversity. All members within the group then pool their experience, model patches, failure modes, eval logs, and solutions, into a shared pool, and the whole group jointly produces the next generation. Exploration is no longer wasted. It gets consolidated. The results show a significant improvement over prior state-of-the-art self-evolving methods, and GEA matches or surpasses top human-designed frameworks with ๐—ป๐—ผ ๐—ต๐˜‚๐—บ๐—ฎ๐—ป ๐—ถ๐—ป ๐˜๐—ต๐—ฒ ๐—น๐—ผ๐—ผ๐—ฝ. The analysis is the more interesting part. GEA's gains come from explicitly reusing diversity, not from lucky outliers: stronger performance under the same number of evolved agents, more robust to framework-level bugs (repaired in ๐Ÿญ.๐Ÿฐ iterations vs ๐Ÿฑ), and improvements that target workflows and tools rather than overfitting to one model, so they transfer consistently across GPT- and Claude-series backbones. The key to open-ended evolution is not only generating enough diversity. What matters more is whether discoveries accumulate and get reused. ๐—š๐—˜๐—” ๐—น๐—ฒ๐˜๐˜€ ๐—ฒ๐˜…๐—ฝ๐—น๐—ผ๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐˜€๐˜๐—ฎ๐—ฟ๐˜ ๐—ฐ๐—ผ๐—บ๐—ฝ๐—ผ๐˜‚๐—ป๐—ฑ๐—ถ๐—ป๐—ด. ๐Ÿ“„ arXiv: arxiv.org/abs/2602.04837 Grateful to my advisor @xwang_lk and my wonderful coauthors @anton_iades @deepaknathani11 @zhenzhangzz @XiaoSophiaPu . Interning in Palo Alto this summer. See you at COLM 2026 ๐Ÿ‘‹
1
10
634
UCSB has a large presence at COLM! Hereโ€™s our lab photo. Probably the coolest lab in the conference. Go talk to our researchers
1
5
1
42
4,208
Presenting GEA at #COLM2026 this week! ๐Ÿงฌ โœจ Group-Evolving Agents: Open-Ended Self-Improvement via Experience Sharing GEA treats a group of agents, not an individual, as the unit of evolution. Agents share experience as they self-improve, outperforming prior state-of-the-art open-ended self-improving methods and matching or exceeding top human-designed agent frameworks, all with zero human intervention. ๐Ÿ“ Poster ยท Wed Oct 7, 4:30 PM ยท Imperial Ballroom ยท #21 ๐ŸŽค Oral @ Lifelong Agent Workshop ยท Fri Oct 9, 11:45 AMโ€“12:00 PM ยท Continental Ballroom 6 My research focuses on recursive self-improvement and autoresearch. Stop by the poster to chat, or DM me to grab a coffee! โ˜• ๐Ÿ“„ arxiv.org/abs/2602.04837
AI agents aren't biological individuals. So why make them evolve like one? They can directly share experience and learned artifacts. Not bounded by reproduction, lineage, or genes. Meet ๐—š๐—˜๐—”, accepted to ๐—–๐—ข๐—Ÿ๐—  ๐Ÿฎ๐Ÿฌ๐Ÿฎ๐Ÿฒ ๐ŸŽ‰ ๐Ÿณ๐Ÿญ.๐Ÿฌ% SWE-bench Verified / ๐Ÿด๐Ÿด.๐Ÿฏ% Polyglot ยท zero human intervention ๐Ÿงต๐Ÿ‘‡ Most self-evolving agent systems follow a similar pattern: select a parent, refine it, produce an offspring, repeat. Evolution unfolds as a tree. It's great at generating diversity, but that diversity gets trapped. Agents explore independently, and instead of serving as stepping stones, their discoveries stay stuck in local branches. Most variants are short-lived. ๐—˜๐˜…๐—ฝ๐—น๐—ผ๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ต๐—ฎ๐—ฝ๐—ฝ๐—ฒ๐—ป๐˜€; ๐—ฟ๐—ฒ๐˜‚๐˜€๐—ฒ ๐—ฎ๐—ป๐—ฑ ๐—ฎ๐—ฐ๐—ฐ๐˜‚๐—บ๐˜‚๐—น๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ฟ๐—ฎ๐—ฟ๐—ฒ๐—น๐˜† ๐—ฑ๐—ผ. It's time to rethink the evolution of AI agents: why keep evolving them like biological individuals? AI agents aren't bound by reproduction, lineage, or genes. They can directly share trajectories, tools, workflows, and learned artifacts, aggregating complementary skills instantly. ๐—ช๐—ต๐˜† ๐—ป๐—ผ๐˜ ๐—ฟ๐—ฒ๐—ฑ๐—ฒ๐˜€๐—ถ๐—ด๐—ป ๐—ฒ๐˜ƒ๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ฎ๐—ฟ๐—ผ๐˜‚๐—ป๐—ฑ ๐˜„๐—ต๐—ฎ๐˜ ๐˜๐—ต๐—ฒ๐˜† ๐—ฐ๐—ฎ๐—ป ๐—ฎ๐—ฐ๐˜๐˜‚๐—ฎ๐—น๐—น๐˜† ๐—ฑ๐—ผ? That's GEA. GEA makes a ๐—ด๐—ฟ๐—ผ๐˜‚๐—ฝ ๐—ผ๐—ณ ๐—ฎ๐—ด๐—ฒ๐—ป๐˜๐˜€ ๐˜๐—ต๐—ฒ ๐—ณ๐˜‚๐—ป๐—ฑ๐—ฎ๐—บ๐—ฒ๐—ป๐˜๐—ฎ๐—น ๐˜‚๐—ป๐—ถ๐˜ ๐—ผ๐—ณ ๐—ฒ๐˜ƒ๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป. Each round, a parent group is selected under a Performance-Novelty criterion that balances competence with exploratory diversity. All members within the group then pool their experience, model patches, failure modes, eval logs, and solutions, into a shared pool, and the whole group jointly produces the next generation. Exploration is no longer wasted. It gets consolidated. The results show a significant improvement over prior state-of-the-art self-evolving methods, and GEA matches or surpasses top human-designed frameworks with ๐—ป๐—ผ ๐—ต๐˜‚๐—บ๐—ฎ๐—ป ๐—ถ๐—ป ๐˜๐—ต๐—ฒ ๐—น๐—ผ๐—ผ๐—ฝ. The analysis is the more interesting part. GEA's gains come from explicitly reusing diversity, not from lucky outliers: stronger performance under the same number of evolved agents, more robust to framework-level bugs (repaired in ๐Ÿญ.๐Ÿฐ iterations vs ๐Ÿฑ), and improvements that target workflows and tools rather than overfitting to one model, so they transfer consistently across GPT- and Claude-series backbones. The key to open-ended evolution is not only generating enough diversity. What matters more is whether discoveries accumulate and get reused. ๐—š๐—˜๐—” ๐—น๐—ฒ๐˜๐˜€ ๐—ฒ๐˜…๐—ฝ๐—น๐—ผ๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐˜€๐˜๐—ฎ๐—ฟ๐˜ ๐—ฐ๐—ผ๐—บ๐—ฝ๐—ผ๐˜‚๐—ป๐—ฑ๐—ถ๐—ป๐—ด. ๐Ÿ“„ arXiv: arxiv.org/abs/2602.04837 Grateful to my advisor @xwang_lk and my wonderful coauthors @anton_iades @deepaknathani11 @zhenzhangzz @XiaoSophiaPu . Interning in Palo Alto this summer. See you at COLM 2026 ๐Ÿ‘‹
2
11
685
Weโ€™re excited to be at @COLM 2026 with several works from our group! Come say hi, chat about the work, or grab coffee/food with us ๐Ÿ‘‹
4
1
6
867
โœจ **WorldMemArena: Evaluating Multimodal Agent Memory Through Actionโ€“World Interaction** ๐Ÿ“ Poster โ€” Fri, Continental Ballroom 4
36
โœจ **Heuresis: Search Strategies for Autonomous AI Research Agents Across Quality, Diversity and Novelty** ๐Ÿ“ Poster โ€” Fri, Continental Ballroom 9
37
โœจ **Length Value Model: Scalable Value Pretraining for Token-Level Length Modeling** ๐Ÿ“ Poster โ€” Thu, 4:30 PM, Imperial Ballroom, #42
33
โœจ **Group-Evolving Agents: Open-Ended Self-Improvement via Experience Sharing** ๐Ÿ“ Poster โ€” Wed, 4:30 PM, Imperial Ballroom, #21 ๐ŸŽค Oral โ€” Fri, 11:45 AMโ€“12:00 PM, Continental Ballroom 6
1
111
UCSB AI retweeted
1/6 ๐Ÿง  ๐—ฌ๐—ผ๐˜‚๐—ฟ ๐—”๐—œ ๐—”๐˜€๐˜€๐—ถ๐˜€๐˜๐—ฎ๐—ป๐˜ ๐—–๐—ฎ๐—ป ๐—ฅ๐—ฒ๐—บ๐—ฒ๐—บ๐—ฏ๐—ฒ๐—ฟ ๐—ช๐—ต๐—ฎ๐˜ ๐—ฌ๐—ผ๐˜‚ ๐—ฆ๐—ฎ๐—ถ๐—ฑโ€”๐—ฎ๐—ป๐—ฑ ๐—ฆ๐˜๐—ถ๐—น๐—น ๐—œ๐—ด๐—ป๐—ผ๐—ฟ๐—ฒ ๐—ช๐—ต๐—ฎ๐˜ ๐—ฌ๐—ผ๐˜‚ ๐—ช๐—ฎ๐—ป๐˜. Long-running assistants accumulate facts, preferences, and constraints across conversations. But remembering them is not enough: a response can sound fluent and relevant while still recommending exactly what the user has ruled out. We present ๐— ๐—ฒ๐—บ๐—™๐—ผ๐—น๐—ฑ: ๐—Ÿ๐—ฒ๐—ฎ๐—ฟ๐—ป๐—ถ๐—ป๐—ด ๐—–๐—ผ๐—บ๐—ฝ๐—ฎ๐—ฐ๐˜ ๐—ฆ๐—ผ๐—ณ๐˜ ๐— ๐—ฒ๐—บ๐—ผ๐—ฟ๐˜† ๐—ณ๐—ผ๐—ฟ ๐—Ÿ๐—ผ๐—ป๐—ด-๐—–๐—ผ๐—ป๐˜๐—ฒ๐˜…๐˜ ๐—ฃ๐—ฒ๐—ฟ๐˜€๐—ผ๐—ป๐—ฎ๐—น๐—ถ๐˜‡๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐˜ƒ๐—ถ๐—ฎ ๐—ข๐—ป-๐—ฃ๐—ผ๐—น๐—ถ๐—ฐ๐˜† ๐—ข๐—ฝ๐˜๐—ถ๐—บ๐—ถ๐˜‡๐—ฎ๐˜๐—ถ๐—ผ๐—ป. MemFold trains a model to use compact soft memory by learning from the answers it produces, combining task-level rewards with more detailed token-level guidance. ๐—ข๐˜‚๐—ฟ ๐—ธ๐—ฒ๐˜† ๐—ณ๐—ถ๐—ป๐—ฑ๐—ถ๐—ป๐—ด๐˜€ ๐Ÿ”ฅ: ๐ŸŽฏ ๐—๐˜‚๐—ฑ๐—ด๐—ฒ ๐—บ๐—ฒ๐—บ๐—ผ๐—ฟ๐˜† ๐—ฏ๐˜† ๐˜๐—ต๐—ฒ ๐—ฎ๐—ป๐˜€๐˜„๐—ฒ๐—ฟ๐˜€ ๐—ถ๐˜ ๐˜€๐˜‚๐—ฝ๐—ฝ๐—ผ๐—ฟ๐˜๐˜€. Reconstruction alone does not tell us whether a model will respect a userโ€™s preferences. ๐Ÿ”„ ๐—ข๐—ป๐—ฒ ๐˜€๐—ฒ๐˜ ๐—ผ๐—ณ ๐—ฟ๐—ฒ๐˜€๐—ฝ๐—ผ๐—ป๐˜€๐—ฒ๐˜€, ๐˜๐˜„๐—ผ ๐—น๐—ฒ๐—ฎ๐—ฟ๐—ป๐—ถ๐—ป๐—ด ๐˜€๐—ถ๐—ด๐—ป๐—ฎ๐—น๐˜€. GRPO rewards task outcomes, while token-level guidance provides more detailed feedback on the same generated responses. ๐Ÿ“ˆ ๐—Ÿ๐—ฎ๐—ฟ๐—ด๐—ฒ๐—ฟ ๐—ด๐—ฎ๐—ถ๐—ป๐˜€ ๐˜„๐—ถ๐˜๐—ต ๐—น๐—ผ๐—ป๐—ด๐—ฒ๐—ฟ ๐—ต๐—ถ๐˜€๐˜๐—ผ๐—ฟ๐—ถ๐—ฒ๐˜€. Across three Qwen backbones, the margin over the strongest baseline widens from PersonaMem-32K to PersonaMem-128K. ๐ŸŒ ๐—ง๐—ฟ๐—ฎ๐—ป๐˜€๐—ณ๐—ฒ๐—ฟ ๐—ฏ๐—ฒ๐˜†๐—ผ๐—ป๐—ฑ ๐˜๐—ต๐—ฒ ๐˜๐—ฟ๐—ฎ๐—ถ๐—ป๐—ถ๐—ป๐—ด ๐—ฑ๐—ฎ๐˜๐—ฎ. MemFold transfers to PrefEval and LongMemEval without target-domain training. ๐Ÿ‘‡ ๐—–๐—ต๐—ฒ๐—ฐ๐—ธ ๐—ผ๐˜‚๐˜ ๐˜๐—ต๐—ฒ ๐—ฝ๐—ฎ๐—ฝ๐—ฒ๐—ฟ, ๐—ฝ๐—ฟ๐—ผ๐—ท๐—ฒ๐—ฐ๐˜, ๐—ฎ๐—ป๐—ฑ ๐—ฐ๐—ผ๐—ฑ๐—ฒ: ๐Ÿ“„ Paper: huggingface.co/papers/2609.3โ€ฆ ๐ŸŒ Project: memfold.github.io ๐Ÿ’ป Code: github.com/Johnny221B/memfolโ€ฆ
1
6
1
23
1,406
AI agents aren't biological individuals. So why make them evolve like one? They can directly share experience and learned artifacts. Not bounded by reproduction, lineage, or genes. Meet ๐—š๐—˜๐—”, accepted to ๐—–๐—ข๐—Ÿ๐—  ๐Ÿฎ๐Ÿฌ๐Ÿฎ๐Ÿฒ ๐ŸŽ‰ ๐Ÿณ๐Ÿญ.๐Ÿฌ% SWE-bench Verified / ๐Ÿด๐Ÿด.๐Ÿฏ% Polyglot ยท zero human intervention ๐Ÿงต๐Ÿ‘‡ Most self-evolving agent systems follow a similar pattern: select a parent, refine it, produce an offspring, repeat. Evolution unfolds as a tree. It's great at generating diversity, but that diversity gets trapped. Agents explore independently, and instead of serving as stepping stones, their discoveries stay stuck in local branches. Most variants are short-lived. ๐—˜๐˜…๐—ฝ๐—น๐—ผ๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ต๐—ฎ๐—ฝ๐—ฝ๐—ฒ๐—ป๐˜€; ๐—ฟ๐—ฒ๐˜‚๐˜€๐—ฒ ๐—ฎ๐—ป๐—ฑ ๐—ฎ๐—ฐ๐—ฐ๐˜‚๐—บ๐˜‚๐—น๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ฟ๐—ฎ๐—ฟ๐—ฒ๐—น๐˜† ๐—ฑ๐—ผ. It's time to rethink the evolution of AI agents: why keep evolving them like biological individuals? AI agents aren't bound by reproduction, lineage, or genes. They can directly share trajectories, tools, workflows, and learned artifacts, aggregating complementary skills instantly. ๐—ช๐—ต๐˜† ๐—ป๐—ผ๐˜ ๐—ฟ๐—ฒ๐—ฑ๐—ฒ๐˜€๐—ถ๐—ด๐—ป ๐—ฒ๐˜ƒ๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ฎ๐—ฟ๐—ผ๐˜‚๐—ป๐—ฑ ๐˜„๐—ต๐—ฎ๐˜ ๐˜๐—ต๐—ฒ๐˜† ๐—ฐ๐—ฎ๐—ป ๐—ฎ๐—ฐ๐˜๐˜‚๐—ฎ๐—น๐—น๐˜† ๐—ฑ๐—ผ? That's GEA. GEA makes a ๐—ด๐—ฟ๐—ผ๐˜‚๐—ฝ ๐—ผ๐—ณ ๐—ฎ๐—ด๐—ฒ๐—ป๐˜๐˜€ ๐˜๐—ต๐—ฒ ๐—ณ๐˜‚๐—ป๐—ฑ๐—ฎ๐—บ๐—ฒ๐—ป๐˜๐—ฎ๐—น ๐˜‚๐—ป๐—ถ๐˜ ๐—ผ๐—ณ ๐—ฒ๐˜ƒ๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป. Each round, a parent group is selected under a Performance-Novelty criterion that balances competence with exploratory diversity. All members within the group then pool their experience, model patches, failure modes, eval logs, and solutions, into a shared pool, and the whole group jointly produces the next generation. Exploration is no longer wasted. It gets consolidated. The results show a significant improvement over prior state-of-the-art self-evolving methods, and GEA matches or surpasses top human-designed frameworks with ๐—ป๐—ผ ๐—ต๐˜‚๐—บ๐—ฎ๐—ป ๐—ถ๐—ป ๐˜๐—ต๐—ฒ ๐—น๐—ผ๐—ผ๐—ฝ. The analysis is the more interesting part. GEA's gains come from explicitly reusing diversity, not from lucky outliers: stronger performance under the same number of evolved agents, more robust to framework-level bugs (repaired in ๐Ÿญ.๐Ÿฐ iterations vs ๐Ÿฑ), and improvements that target workflows and tools rather than overfitting to one model, so they transfer consistently across GPT- and Claude-series backbones. The key to open-ended evolution is not only generating enough diversity. What matters more is whether discoveries accumulate and get reused. ๐—š๐—˜๐—” ๐—น๐—ฒ๐˜๐˜€ ๐—ฒ๐˜…๐—ฝ๐—น๐—ผ๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐˜€๐˜๐—ฎ๐—ฟ๐˜ ๐—ฐ๐—ผ๐—บ๐—ฝ๐—ผ๐˜‚๐—ป๐—ฑ๐—ถ๐—ป๐—ด. ๐Ÿ“„ arXiv: arxiv.org/abs/2602.04837 Grateful to my advisor @xwang_lk and my wonderful coauthors @anton_iades @deepaknathani11 @zhenzhangzz @XiaoSophiaPu . Interning in Palo Alto this summer. See you at COLM 2026 ๐Ÿ‘‹
5
53
8
255
23,124
UCSB being creative at @icmlconf
1
26
2,367
How well can AI research agents explore new scientific ideas? The latest paper from our lab, Heuresis, combines coding agents with search and quality-diversity algorithms. Algorithms that provide better exploration are the key to unlock new ideas. Check out this thread๐Ÿ‘‡
Key to realizing Auto Research Agents that can make novel discoveries in AI is understanding and improving their exploration capabilities. To this end, we built Heuresis, a composable framework that combines coding agents with arbitrary search algorithms within a flexible loop.
1
5
982
Key to realizing Auto Research Agents that can make novel discoveries in AI is understanding and improving their exploration capabilities. To this end, we built Heuresis, a composable framework that combines coding agents with arbitrary search algorithms within a flexible loop.
2
13
5
39
7,143