TL;DR The paper studies how tool-augmented LLM agents can deanonymize authors of anonymized text using stylometry—raising practical risks for whistleblowers, journalists, and researchers relying on pseudonymity. What this is about The authors introduce a stylometry-assisted agent approach (SALA) that combines quantitative stylometric features (lexical/syntactic/readability/semantic signals) with LLM reasoning to narrow down likely authors, and they…
LLM
Parallel Coding Agents with tmux and Markdown Specs
TL;DR A practical, production-tested way to run multiple AI coding agents in parallel: use tmux to split “PM / Planner / Worker” roles, and use a lightweight Markdown “Feature Design (FD)” spec as the handoff artifact so agents don’t step on each other. What this is about Manuel Schipper describes a workflow for managing 4–8…
WebMCP Is Available for Early Preview
Draft TL;DR Chrome’s WebMCP is an early proposal to make websites “agent-ready” by letting publishers expose structured actions (tools) that AI agents can invoke—rather than relying on brittle DOM clicking and scraping. What this is about Today’s web agents succeed or fail based on UI guesswork: finding the right button, filling the right field, surviving…
llmfit: pick LLMs that actually fit your machine (RAM/CPU/GPU)
Draft TL;DR llmfit is a Rust TUI/CLI that inspects your hardware (RAM/CPU/GPU/VRAM) and ranks LLMs by whether they’ll realistically run well—saving you from downloading huge models only to discover they’re unusable. What this is about Local inference is attractive (cost control, privacy, latency), but it’s easy to misjudge whether a model will run on your…
MCP Is Dead. Long Live the CLI.
Draft TL;DR A contrarian take: instead of adopting MCP everywhere, treat the CLI as the universal tool interface for agents—it’s debuggable, composable, and already “native” to how LLMs learned to operate. What this is about The post argues MCP adds a new layer of complexity (servers, lifecycle, transport logs, auth wrappers) for many tasks that…
RF-Agent: Automated Reward Function Design via Language Agent Tree Search
Draft TL;DR RF-Agent treats reward-function design as a search problem: an LLM proposes reward code, runs RL training to score it, and uses Monte Carlo Tree Search (MCTS) to decide what to try next. The key idea is to reuse the entire history of attempts and feedback—rather than sampling one-off reward candidates. What this is…
Hierarchy-of-Groups Policy Optimization for Long-Horizon Agentic Tasks
Draft TL;DR HGPO is a training tweak for long-horizon LLM agents: it fixes a subtle bias in stepwise group-based RL by ensuring steps are compared under consistent historical context. It does this by building a hierarchy of groups that share increasing amounts of history, then combining their advantage estimates. What this is about Group-based RL…