<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Value-Functions on Dylan Ler</title><link>http://dylanler.github.io/tags/value-functions/</link><description>Recent content in Value-Functions on Dylan Ler</description><generator>Hugo -- 0.133.0</generator><language>en-us</language><lastBuildDate>Fri, 02 Oct 2026 02:30:00 -0700</lastBuildDate><atom:link href="http://dylanler.github.io/tags/value-functions/index.xml" rel="self" type="application/rss+xml"/><item><title>Proactive agents via oscillating memory value</title><link>http://dylanler.github.io/posts/proactive-memory-value/</link><pubDate>Fri, 02 Oct 2026 02:30:00 -0700</pubDate><guid>http://dylanler.github.io/posts/proactive-memory-value/</guid><description>Reactive agents wait for you. Calendar apps fire on fixed clocks. This note proposes a middle path: give every memory an attached value function \(V_i(t)\). A clock tick recomputes values. When a memory&amp;rsquo;s value crosses a threshold — with hysteresis so it does not chatter — the agent may send you a short proactive message.
The distinctive piece is an oscillatory revival term on top of ordinary exponential decay. Dormant but still-important memories periodically become candidates again (&amp;ldquo;I&amp;rsquo;ve been meaning to bring this up&amp;rdquo;), without requiring a user query and without nagging every hour.</description></item></channel></rss>