Selected from source-grounded bilingual updates that are complete enough to check. Briefs are arranged automatically; items are AI-generated and not individually human-reviewed by default (human-reviewed items are labeled), so verify original sources before citing.
How this brief is selected: we include AI4Science updates with reliable sources and complete Chinese and English coverage, prioritizing fuller and easier-to-check information.
01Terence Tao
[This is a guest post by Diego Córdoba and Luis Martínez-Zoroa . This blog post was initially written in a different file format and converted using AI. — T.] Euler formulated the equations for an inviscid incompressible fluid more than 250 years ago. Published in his 1757 memoir , they belong to the earliest systems of partial differential equations in mathematical physics, following d’Alembert’s work on the wave equation. Understanding the evolution they describe has required the work of many generations of mathematicians. One of the central questions is whether an initially regular fluid flow can develop a singularity in finite time. The recent work on Euler and Navier–Stokes obtained with the aid of large language models has brought renewed attention to this question. These exciting developments build on decades of mathematical research, including works from recent years, when the field has continued to be specially active. In this post we describe some contributions to that body of knowledge, including our own. We will go over some of that recent mathematical literature, and discuss the ideas of constructing blow-ups through a cascade of vortex layers. Partial differential equations provide a common language for problems ranging from wave propagation and fluid motion to geometry and general relativity. For an evolution equation, the Cauchy problem asks us to determine the future from prescribed initial data. A local existence theorem gives a solution for a short time; the next question is whether it continues for all time or develops a singularity at a finite time. This distinction between global existence and finite-time blow-up is already visible in the elementary Riccati equation The solution starts from a finite value and remains smooth until , when it becomes unbounded. The quadratic nonlinearity in three-dimensional Euler suggests a similar possibility, but the fluid problem also involves transport, geometry and a pressure determined nonlocally by the entire flow. The challenge is to understand whether the full equation can sustain the amplification suggested by this simple ODE. The central aim of our research has been to construct classical solutions of incompressible fluid equations that develop singularities in finite time, starting within a regime of local existence and uniqueness. We want the initial data to determine a unique regular evolut…
Hugging Face Daily Papers
A large language model (LLM) agent solves long-horizon tasks through many reasoning-action turns, with one verification signal at termination. Deployed agents face streams of related tasks, making their trajectories a natural resource for improvement. In-context adaptation agents store reflections, memories, or skills as text, so reuse depends on retrieving the right experience and on a frozen policy executing it. We study Online Agentic Test-Time Training (OaTTT), which trains the LLM's weights on its own execution trajectories during deployment. The agent executes each task once, in one pass over the stream, and the executed trajectory with its verification result is the only learning signal for weight updates that persist across tasks. Directly imitating or reinforcing the generated tokens of this single attempt destabilizes the policy. We introduce ASCENT (Agentic Self-distillation for Cross-task EvolutioN at Test-time), which instead self-distills verified experience. A stable version of the LLM, its frozen initial copy, receives the verified trajectory as privileged information and predicts next-token distributions along it with this hindsight. Distilling them into persistent LoRA fast weights updates the agent for later tasks, without an external reference solution or stronger teacher. By further removing invalid-action turns, ASCENT distills enhanced privileged experience for more efficient execution. We characterize its population target and the limits of sparse outcome selection. Across ALFWorld, WebShop, and AppWorld at varied model scales, ASCENT improves task success and interaction efficiency as experience accumulates, outperforms online adaptation methods, and transfers to held-out scenes, showing that an agent can consolidate verified experience into its weights without a separate training phase or memory retrieval. Project page: https://artificer-ai-lab.github.io/ASCENT
Hugging Face Daily Papers
Jev-style decision models return categorical probability distributions over predefined options without generating free-form text, enabling software systems to act on their outputs directly. In this work, we investigate the extent to which general-purpose LLMs already possess this capability out of the box, and when fine-tuning is actually necessary. We present LLM-as-Jev, an architecture-preserving framework that extracts calibrated decisions directly from next-token probabilities over bracketed numeric identifiers. LLM-as-Jev provides both a training-free inference recipe and a fine-tuning objective that optimizes candidate selection via a tree-factorized listwise loss while anchoring auxiliary predictions to the base model using KL divergence penalties. Evaluating on Qwen3.5-4B and Qwen3-0.6B, we find that modern LLMs are inherently effective decision models: without training, the 4B model matches community Jev-style models built on the same backbone, outperforms letter-logit readouts, supports arbitrary option counts, and natively handles multimodal decisions over images. Fine-tuning provides targeted rather than universal benefits -- substantially improving weaker models and specific tasks (such as many-option intent routing), but offering diminishing returns for strong backbones. Crucially, our KL anchors prevent behavioral degradation in conversational text generation, with LoRA delivering the strongest performance on capable models.
