<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://ruisun33.github.io/</id><title>The Thinking Notes</title><subtitle></subtitle> <updated>2026-07-07T01:12:46+00:00</updated> <author> <name>R S</name> <uri>https://ruisun33.github.io/</uri> </author><link rel="self" type="application/atom+xml" href="https://ruisun33.github.io/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://ruisun33.github.io/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2026 R S </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Trace-Bench</title><link href="https://ruisun33.github.io/posts/trace-bench/" rel="alternate" type="text/html" title="Trace-Bench" /><published>2025-02-25T00:00:00+00:00</published> <updated>2026-02-27T06:41:41+00:00</updated> <id>https://ruisun33.github.io/posts/trace-bench/</id> <content type="text/html" src="https://ruisun33.github.io/posts/trace-bench/" /> <author> <name>R S</name> </author> <category term="Projects" /> <summary>A benchmark and RL training substrate for evaluating causal diagnostic reasoning in AI agents TL;DR Ad-Agentic-Bench is a benchmark of 6,000 synthetic episodes that evaluates an AI agent’s ability to perform root cause analysis through iterative exploration using Python tools with SQL support. Each episode embeds a known causal intervention inside realistic, high-dimensional time-series data...</summary> </entry> <entry><title>The Geometry of Learnable Reward</title><link href="https://ruisun33.github.io/posts/geometry-of-learnable-reward/" rel="alternate" type="text/html" title="The Geometry of Learnable Reward" /><published>2025-02-25T00:00:00+00:00</published> <updated>2026-02-27T06:34:21+00:00</updated> <id>https://ruisun33.github.io/posts/geometry-of-learnable-reward/</id> <content type="text/html" src="https://ruisun33.github.io/posts/geometry-of-learnable-reward/" /> <author> <name>R S</name> </author> <category term="Thoughts" /> <summary>A Framework for Understanding RL with Verifiable Signals 1. The Fundamental Object: Mapping Complexity RL with verifiable rewards asks a model to learn a function: [f: \mathcal{S} \rightarrow \mathcal{A}] where $\mathcal{S}$ is the space of problem states and $\mathcal{A}$ is the space of verifiable answers. But this framing is deceptively simple. The real object being learned is not this...</summary> </entry> <entry><title>Dynamic Context Management</title><link href="https://ruisun33.github.io/posts/dynamic-context-control/" rel="alternate" type="text/html" title="Dynamic Context Management" /><published>2025-02-24T00:00:00+00:00</published> <updated>2026-02-27T06:41:41+00:00</updated> <id>https://ruisun33.github.io/posts/dynamic-context-control/</id> <content type="text/html" src="https://ruisun33.github.io/posts/dynamic-context-control/" /> <author> <name>R S</name> </author> <category term="Projects" /> <summary>Adaptive context management for LLMs via Primal-Dual Thompson Sampling TL;DR LLMs have finite context windows, and current methods for deciding what to keep (recency truncation, summarization) are static heuristics that ignore task structure and system constraints. We reframe context management as a constrained resource allocation problem and propose Primal-Dual Thompson Sampling (PD-TS) — a...</summary> </entry> <entry><title>Ad Arena</title><link href="https://ruisun33.github.io/posts/ad-arena/" rel="alternate" type="text/html" title="Ad Arena" /><published>2025-02-23T00:00:00+00:00</published> <updated>2026-02-27T06:41:41+00:00</updated> <id>https://ruisun33.github.io/posts/ad-arena/</id> <content type="text/html" src="https://ruisun33.github.io/posts/ad-arena/" /> <author> <name>R S</name> </author> <category term="Projects" /> <summary>A simulation environment and LLM benchmark for search advertising bidding strategies TL;DR Ad Arena provides a simulation environment for search advertising auctions, extended into a public LLM benchmark with a web leaderboard. It pits language models against baseline bidding strategies in realistic scenarios, measuring not just final performance but how quickly agents learn to optimize over...</summary> </entry> </feed>
