Vol. I · No. 70SUN, JUN 28, 2026
Archive

The Archive

Search the full wire by company, model, lab, or keyword. Every story we have ever aggregated.

Handoffs are becoming a first-class pattern in Claude workflows. Here is how I have been thinking about them.

Long Claude sessions still break on context decay. Handoffs are the simple fix: compress what matters, start a fresh agent, keep going. Matt Pocock's new `handoff` skill ([repo](https://github.com/mattpocock/skills/blob/main/skills/productivity/handoff/SKILL.md)) does this in one command. It compacts the conversation into a document, points at existing artifacts instead of restating them, and the next agent picks up from it. It also chains between threads: `/grill-with-docs -> /handoff -> /prototype -> /handoff back`. I built handoffs into [APM](https://github.com/sdi2200262/agenti...

··

OpenAI And Anthropic Are Testing Two Very Different AI Business Models

As it stands now, OpenAI's business model does not close. Will they be able to turn things around before the IPO? Will the market tolerate deep losses? Anthropic seems to be showing the way forward, dominating the enterprise market and with a more prudent capacity strategy. I posted the same article (but with a different body text) in the OpenAI community, and the views seem to be more optimistic there. What do you think?

··

Roundtables: Can AI Learn to Understand the World?

Listen to the session or watch below AI companies want to build systems that understand the external world and overcome the limitations of LLMs. Recent developments have brought world models to the forefront of the AI discussion. Watch a conversation with editor in chief Mat Honan, senior AI editor Will Douglas Heaven, and AI reporter…

·

In desperate times, graduates find hope in humiliating tech CEOs

University graduates are booing and heckling corporate executives who praise AI during their commencement ceremonies, and the only people who seem to be genuinely surprised by this are the executives themselves. In a procession of viral videos, 2026 commencement speakers like former Google CEO Eric Schmidt face loud and sustained jeers from students after praising AI and describing the technology as both inevitable and mandatory. The videos have clearly struck a chord among young people entering a bleak job market in an increasingly unstable world. "They deserve everything they're getting," P...

·

Yes GPT Image 2.0 can do this

You can actually make full manhwa story now. Characters stay same across panels, faces and feelings look right, and background also keep good. So far I make more than 20 pages, but I cannot upload all here, so I publish it in [https://www.vixal.art/en/explore/the-last-demon-king-s-son](https://www.vixal.art/en/explore/the-last-demon-king-s-son) I will keep working and try to finish

··

Datasette Agent

Simon Willison releases Datasette Agent, a conversational AI assistant for querying structured data with chart generation capabilities.

·

Scaling creativity in the age of AI

Storytelling is core to humanity’s DNA, stemming from our impulse to express ideals, warnings, hopes, and experiences. Technology has always been woven through the medium and the distribution: from early humans’ innovation of natural pigments and charcoals for cave paintings to literal representation by the camera. The landscape of storytelling continues to shift under our…

·

Automating and Optimizing Financial Signal Discovery with Multi-Agent Systems

In quantitative finance, researchers build algorithms to trade assets, derivatives, and other financial instruments. A key part of that work is finding signals:... In quantitative finance, researchers build algorithms to trade assets, derivatives, and other financial instruments. A key part of that work is finding signals: patterns in messy market data that may help predict future returns. These signals can come from price and volume data, economic indicators, fundamentals, or alternative sources like news sentiment. For years… Source

·

Tokenisation via Convex Relaxations

Tokenisation is an integral part of the current NLP pipeline. Current tokenisation algorithms such as BPE and Unigram are greedy algorithms -- they make locally optimal decisions without considering the resulting vocabulary as a whole. We instead formulate tokeniser construction as a linear program and solve it using convex optimisation tools, yielding a new algorithm we call ConvexTok. We find ConvexTok consistently improves intrinsic tokenisation metrics and the bits-per-byte (BpB) achieved by language models; it also improves downstream task performance, but less consistently. Furthermore,...

·

Integrable Elasticity via Neural Demand Potentials

We propose the Integrable Context-Dependent Demand Network (ICDN), a demand-first neural model for multiproduct retail demand. The model learns log-demand as a smooth, context-conditioned function of log-prices, allowing elasticities to be derived exactly from the learned demand surface. On the Dominick's beer dataset, ICDN improves out-of-sample generalization over a directed log-log benchmark and yields more stable, economically plausible elasticity estimates, especially for weakly identified cross-price effects.

·

Vector Policy Optimization: Training for Diversity Improves Test-Time Search

Language models must now generalize out of the box to novel environments and work inside inference-scaling search procedures, such as AlphaEvolve, that select rollouts with a variety of task-specific reward functions. Unfortunately, the standard paradigm of LLM post-training optimizes a pre-specified scalar reward, often leading current LLMs to produce low-entropy response distributions and thus to struggle at displaying the diversity that inference-time search will require. We propose Vector Policy Optimization (VPO), an RL algorithm that explicitly trains policies to anticipate diverse down...

·

Remember to be Curious: Episodic Context and Persistent Worlds for 3D Exploration

Exploration is a prerequisite for learning useful behaviors in sparse-reward, long-horizon tasks, particularly within 3D environments. Curiosity-driven reinforcement learning addresses this via intrinsic rewards derived from the mismatch between the agent's predictive model of the world and reality. However, translating this intrinsic motivation to complex, photorealistic environments remains difficult, as agents can become trapped in local loops and receive fresh rewards for revisiting forgotten states. In this work, we demonstrate that this failure stems from a lack of spatial persistence a...

·

The Matching Principle: A Geometric Theory of Loss Functions for Nuisance-Robust Representation Learning

Robustness, domain adaptation, photometric and occlusion invariance, compositional generalisation, temporal robustness, alignment safety, and classical anisotropic regularisation are usually treated as separate problems with separate method families. This paper argues that much of their shared structure is one statistical problem: estimate the covariance of label-preserving deployment nuisance, then regularise the encoder Jacobian along a matrix whose range covers that covariance (the matching principle). CORAL, adversarial training, IRM, augmentation, metric learning, Jacobian penalties, and...

·

Finite-Particle Convergence Rates for Conservative and Non-Conservative Drifting Models

We propose and analyze a conservative drifting method for one-step generative modeling. The method replaces the original displacement-based drifting velocity by a kernel density estimator (KDE)-gradient velocity, namely the difference of the kernel-smoothed data score and the kernel-smoothed model score. This velocity is a gradient field, addressing the non-conservatism issue identified for general displacement-based drifting fields. We prove continuous-time finite-particle convergence bounds for the conservative method on $\R^d$: a joint-entropy identity yields bounds for the empirical Stein...

·
30 stories