Approach to Self-Improving Memory in Local AI Agents

Memory Architecture for Persistent AI Agents
A developer on r/LocalLLaMA has shared their approach to creating AI agents that don't repeat mistakes across sessions. The core problem addressed is that every session starts from zero, with context windows resetting and corrections being lost between sessions.
Memory Implementation
The system uses markdown as the source of truth instead of a database. MEMORY.md is human-editable - delete a line in vim and the agent forgets it. SQLite and FAISS (HNSW, 768-dim) are derived caches that are rebuildable from markdown anytime. This allows users to version-control their agent's memory with git.
Episode Scoring and Rule Learning
Each execution gets scored +1/-1 and saved as an episode. On similar future tasks, relevant episodes get pulled into context. When the same error signature (SHA256 of tool name + normalized error) shows up twice within 7 days, a rule learner generates a one-line prevention rule.
Rules start at 0.40 confidence and need 0.60 to actually get injected into future prompts. Success bumps confidence +0.03, failure drops it -0.05. Rules that don't help eventually decay away.
Trust Escalation System
Instead of configuring permission levels upfront, the agent tracks approval patterns. 5 approvals at 90%+ rate = auto-promote. One revert = demote back. There's a shadow mode for auditing.
Task Decomposition and Safety
Complex goals become a DAG (Directed Acyclic Graph). Circular dependencies are caught via topological sort, failure cascades to dependents via DFS (Depth-First Search). A completion gate checks 18 requirements (R01-R18) - did the agent actually read files, write changes, verify results, stay in the workspace?
Safety features include 43 bash risk patterns, dual-pass analysis (raw + decoded), fail-closed design (Guardian crash = deny), and minimum writable depth of 3 to prevent rm -rf /.
The developer is seeking feedback on whether the confidence decay on rules feels right and whether the +0.03/-0.05 asymmetry is optimal. They're also wondering if there are better alternatives to HNSW for this scale (typically <10k episodes).
📖 Read the full source: r/LocalLLaMA
👀 See Also

E2a: Open-Source Email Gateway for AI Agents with SPF/DKIM Verification and Webhook/WebSocket Delivery
E2a is an authenticated email gateway for AI agents that verifies SPF/DKIM on inbound mail, delivers via webhook or WebSocket, and supports outbound email with human-in-the-loop approval.

A/B Test Results: oh-my-claudecode Hooks Show Minimal Impact on Claude Code Performance
A developer spent 7% of their weekly Max20 tokens testing oh-my-claudecode hooks with Claude Sonnet 4.6, finding no meaningful improvement in code quality or cost for a single-session coding task.
Using an adversarial Claude chat to catch kickoff ambiguities before they cost you
A developer added a second Claude chat whose only job is to adversarially review kickoffs for ambiguous specs and silent failures, saving an estimated $150-400 in Claude Code rework across a project phase.

Gemma Gem: On-Device AI Agent for Browser Automation via WebGPU
Gemma Gem is a Chrome extension that runs Google's Gemma 4 model (2B or 4B) entirely on-device using WebGPU, with no API keys or cloud dependencies. It provides tools to read page content, take screenshots, click elements, type text, scroll, and run JavaScript through a chat interface.