๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

cv usk
@cv_usk
AI / Software Research Notes AI Agent, LLMOps, MLOps, Software Architecture ๆŠ•็จฟใฏๅ€‹ไบบใฎๆ„่ฆ‹ใงใ™ใ€‚
๊ฐ€์ž… May 2026
285 ํŒ”๋กœ์ž‰ ์ค‘    455 ํŒฌ
TL;DR: Re-evaluating an agent against a benchmark every time it self-improves gets expensive fast. SelfSearch instead learns purely from records of its own prior self-modification attempts, cutting search cost by more than half while still improving performance. Title: SelfSearch: Reward-Free Search for Self-Improving Agents URL: Points ๐Ÿง  Agents read "episode records" of prior self-modification attempts โ€” reasoning traces, tool use, success/failure โ€” and improve themselves with no downstream evaluation needed during search ๐Ÿ”€ Two parallel lineages evolve under "capability" and "adaptive" search directions, sharing discoveries while developing separately ๐Ÿ“Š On Terminal-Bench 2.1, GPT rose from 43.8% to 55.1% and DeepSeek from 65.2% to 73.0% ๐Ÿ’ฐ Search cost drops 49.0โ€“53.2% versus evaluation-guided baselines; with DeepSeek V4 Flash it reaches 82.0% on Terminal-Bench 2.1 for just $4.03 in search cost, matching the strongest baseline โšก On SWE-bench Multilingual, it gains +5.0 points in success while cutting execution cost 38.5% ๐Ÿ” Agents evolved on GPT-5.6 Sol transfer effectively to DeepSeek V4 Flash with no code changes, still beating the baseline Removing the evaluation-cost bottleneck from the self-improvement loop feels like a genuinely practical design for running this in production. #AIAgents# #SelfImprovement#
๋” ๋ณด๊ธฐ