Skip to main content
Search

# Admission Gate

2 related articles

Subscribe to updates
  1. arXiv

    Confining self-evolution to the runtime harness behind one admission gate: 144 of 7,449 candidates admitted with no harmful change, while the same loops without the gate admitted 309 harmful changes

    The work argues that self-evolution of LLM agents should be confined to the runtime harness—instruction text, tool-call logic and typed primitive composition—while weights stay fixed, and gives a dual-loop engine in which a local loop edits one primitive and a global loop replaces primitives from a typed library, both submitting to one admission gate; on a synthetic regulatory-shift benchmark (three families of re-interpretation, three severities, 10 seeds per cell) the gate admitted 144 of 7,449 candidates with none worsening error on held-out history, whereas replacing the gate with the check an unbounded system applies—fewer errors visible in recent traces—let the same loops admit 309 harmful changes and left missed flags above 10% in 49 of 90 runs.

  2. arXiv

    Gated Memory places an admission gate before extraction, gaining +2.6% relative accuracy on LoCoMo-10 with identical retrieval and generation

    The work proposes Gated Memory, a formation layer interposed between conversation and storage: an utterance-level admission gate evaluates candidate facts before extraction, and admitted facts undergo entity scope classification and conditional enrichment, with only the current exchange treated as a fact source and prior turns used read-only for reference resolution. On LoCoMo-10, changing only what enters the memory store while holding retrieval, generation, and evaluation fixed yields a +2.6% overall relative gain in LLM-judge accuracy, with Single-Hop +4.4%, Open Domain +3.3%, Temporal +1.7%, and a 4.2% Multi-Hop regression.

You’re all caught up