arXiv:2511. 23347v2 Announce Type: replace Abstract: An associative memory (AM) enables cue-response recall, and it has recently been recognized as a key mechanism underlying modern neural architectures such as Transformers.
As memories accumulate across tasks and sessions, the performance of long-term LLM agents depends jointly on query-specific retrieval and continual memory refinement. However, existing methods typically optimize either memory access, through iterative query refinement or adaptive retrieval policies, or memory evolution such as structural update.
arXiv:2607. 13591v1 Announce Type: cross Abstract: Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks.
The paper introduces Batched SGD, a variant that groups online samples into epochs and performs a single update per epoch using a low‑variance gradient estimate. This batching approach allows a straightforward high‑probability analysis without restrictive assumptions or auxiliary sequences, yielding near‑optimal rates for both strongly convex and non‑convex objectives under standard smoothness and sub‑Gaussian noise conditions. The authors also extend the method to federated learning, providing the first high‑probability guarantees with logarithmic communication complexity, linear speedup in the number of agents, and robustness to data heterogeneity.
Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks. Yet nearly all existing approaches, from graph-structured memories to reflective insight stores, access memory through fixed, hand-designed heuristics.
arXiv:2603. 27803v2 Announce Type: replace Abstract: We provide a distributed online algorithm for multi-agent submodular maximization under communication delays.
arXiv:2608. 09565v1 Announce Type: cross Abstract: Optimization theory is a widely used tool for intelligent decision-making.
The paper introduces Gated-Memory Routing, a method for efficient collaboration in multi‑agent large language model systems. It uses a learned execution memory with write and retrieval gates to keep only non‑redundant reasoning steps, and an adaptive halting controller to stop execution when enough evidence is gathered. Experiments on five reasoning and code‑generation benchmarks show the approach achieves higher accuracy and reduces inference cost by 31.9% compared to the strongest baseline.
arXiv:2609.17193v1 Announce Type: new Abstract: Large language model (LLM)-powered agentic AI services increasingly demand low-latency inference, motivating the deployment of LLMs across distributed...
arXiv:2607. 01665v1 Announce Type: new Abstract: Decentralized online convex optimization (D-OCO) is a popular framework for distributed applications with streaming data.
MemoryArena is a new evaluation gym that benchmarks agent memory in interdependent multi‑session tasks. Unlike prior benchmarks that test memorization or single‑session action in isolation, MemoryArena requires agents to acquire memory while interacting with the environment and then use that memory to guide future decisions across a range of tasks such as web navigation, planning, information search, and formal reasoning. The benchmark reveals that agents excelling on existing long‑context memory tests perform poorly here, highlighting a gap in current memory evaluation methods.
arXiv:2608. 06563v1 Announce Type: new Abstract: Machine learning and optimization have advanced together, with practical demands motivating new theory and theoretical breakthroughs enabling new applications.
The paper investigates routing games where travelers choose routes based on remembered or surfaced alternatives rather than a fixed set of actions. It introduces a tractable design theory for endogenous recall, linking a finite‑memory micro model—where each traveler updates a memory state via a logit rule and policies like LRU—to a stationary salience model that assigns route‑specific weights. The authors prove existence and uniqueness of a Forgetful Wardrop Equilibrium, develop algorithms for network design under budget constraints, and identify a Recall Braess Paradox where better recall can worsen equilibrium delay.