Stochastic Approximation from First Principles
A 22-part series on why noisy iterative updates can converge, from error recursions and step-size conditions to the Robbins–Monro conditions and Dvoretzky's theorem.
AI systems, optimization, and transportation simulation
I am a Ph.D. candidate at Purdue University building reliable AI systems for decisions under uncertainty, from graph-enhanced LLM agents to stochastic optimization and simulation models for transportation systems.
Field notes and photosSelected Work
Focus
Beyond Research
Outside research, I like visiting national parks, making pixel art, playing RTS games, mostly Age of Empires IV, and maintaining my Obsidian knowledge system.
Browse photosRecent
A 22-part series on why noisy iterative updates can converge, from error recursions and step-size conditions to the Robbins–Monro conditions and Dvoretzky's theorem.
An 11-part series on designing LLM decision systems whose information, tools, actions, memory, and evaluation can be validated and traced.
A sidewalk delivery robot simulator that connects OpenStreetMap walk graphs, pedestrian-aware routing costs, dynamic request release, solver-visible snapshots, and replayable visualization artifacts.
Treating a generative model like a database reveals its missing schema: data must be decomposed into operational units. A Tetris example shows how decomposition granularity sets the model’s inductive bias, compositional freedom, and cost.
People do not simply apply different rules to identical inputs. Attention, experience, and representation shape the inputs themselves. Science makes maps shared and testable, but those maps remain bounded by instruments, scale, and domain.
We transform historical reviewer corrections into retrievable Evidence-Action-Factor-Decision graphs, then use them to ground recommendations for new seller appeals. The deployed system achieved 96.3% cumulative alignment with human experts in production.