Daily AI-powered curation from arXiv and Hugging Face Daily Papers. Last updated May 14, 2026 · 23:01 UTC.
**1. MAP: A Map-then-Act Paradigm for Long-Horizon Interactive Agent Reasoning** - Core Contribution: Proposes a "map-then-act" paradigm where agents build environmental cognitive maps before execution, solving the "epistemic bottleneck" problem where current stepwise planning agents learn through trial-and-error during execution. - Why Recommend: Directly addresses a core pain point in agent architecture design - agents repeatedly trial-and-error because they lack environmental understanding. MAP's plug-and-play framework can integrate with existing agent systems. On ARC-AGI-3, it enables frontier models to go from near-zero to 22/25 game environment success rate. **2. FlowCompile: An Optimizing Compiler for Structured LLM Workflows** - Core Contribution: Treats structured LLM workflow (multi sub-agent DAG) optimization as a compilation problem rather than a routing problem. Pre-deployment compile-time design space exploration generates reusable configuration sets achieving up to 6.4x speedup. - Why Recommend: If you're building multi-agent orchestration systems, you've faced the combinatorial explosion of "which model, what budget, how to structure." FlowCompile's compiler-inspired approach is novel - a one-time global optimization that produces accuracy-latency Pareto fronts. Great reference for teams building MCP/A2A architectures. **3. MemReread: Enhancing Agentic Long-Context Reasoning via Memory-Guided Rereading** - Core Contribution: Addresses the "memorize-while-reading" evidence loss problem by triggering question decomposition and rereading when final memory is insufficient, supporting non-linear reasoning while maintaining linear time complexity. - Why Recommend: Context management is a key bottleneck for agent deployment. MemReread's "streaming read + reread when needed" strategy is practical, especially for agents processing very long documents. RL-based dynamic control of reread passes avoids the efficiency issues of fixed strategies. **4. HAGE: Harnessing Agentic Memory via RL-Driven Weighted Graph Evolution** - Core Contribution: Proposes a weighted multi-relational memory framework reconceptualizing retrieval as sequential, query-conditioned graph traversal, using RL to jointly optimize routing behavior and edge representations. - Why Recommend: Traditional agent memory systems use flat vector search or fixed binary relation graphs with limited expressiveness. HAGE's trainable weighted edges + query-conditioned routing is an elegant design that provides practical inspiration for building complex agent memory systems.