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

cv usk
@cv_usk
AI / Software Research Notes AI Agent, LLMOps, MLOps, Software Architecture ๆŠ•็จฟใฏๅ€‹ไบบใฎๆ„่ฆ‹ใงใ™ใ€‚
๊ฐ€์ž… May 2026
280 ํŒ”๋กœ์ž‰ ์ค‘    413 ํŒฌ
๐Ÿ”„ TL;DR: A search index that diagnoses its own weaknesses, rewrites its keys, and validates the changes โ€” all without any human in the loop. It beats existing methods by a wide margin on BRIGHT. Title: Self-Evolving Search Index URL: Points ๐Ÿฉบ Builds co-retrieval profiles from search results to self-diagnose whether documents are well distinguished, with no human annotation needed โœ๏ธ Selectively revises key sets only for flagged documents, autonomously deciding up to 10 keys per document โœ… Self-validates proposals on faithfulness, specificity, and separation, keeping only keys that pass ๐Ÿ” A Query Simulator proactively probes uncovered demand with synthetic queries ๐Ÿ“ˆ Hits 22.8 average nDCG@10 on BRIGHT, +9.2% over RL-Index and +40-57% over the base index ๐Ÿค– For search agents, answer accuracy jumps +77.87% while search calls drop -16.80% The idea of making index optimization itself self-evolving, not just the model or the agent, is what makes this interesting. #InformationRetrieval# #LLMAgents#
๋” ๋ณด๊ธฐ