Large-Language-Models

TL;DR for operators Huang, Padó, and Weeber show that changing the grammatical realization of a political statement can change an LLM’s expressed stance even when the rewrite is intended to preserve the proposition.1 Across four Gemma-3 and Qwen3 models, active/passive conversions and cleft constructions produced measurable stance movement, and variance decomposition indicates that the effect is systematic rather than ordinary run-to-run sampling noise. ...

TL;DR for operators Should an explanation merely describe a model decision, or should it help the system make a better next prediction? The paper tests the second possibility: explanations guide prediction, and prediction errors become feedback for revising the reasoning used next.1 The strongest evidence comes from the KuaiLive component tests. The full system reached 0.771 accuracy, versus 0.650 for one-shot prediction without explanation and 0.711 for an iterative variant given matched-length but uninformative placebo explanations. The result does not show that generating more natural-language text inherently improves a model; it shows that, within this design, removing authentic explanatory content or replacing it with placebo text materially reduces performance. :contentReference[oaicite:0]{index=0} ...

TL;DR for operators A reasoning model can have useful confidence at one point in its workflow and misleading confidence at another. In a controlled comparison using the same Qwen2.5-7B-Instruct backbone and reasoning-data mixture, on-policy distillation produced the strongest average signal for estimating difficulty before reasoning, supervised fine-tuning supplied particularly useful confidence for stopping weak traces during generation, and reinforcement learning gained the most from confidence-based filtering after traces were complete.1 ...

TL;DR for operators Giving an AI system more reasoning tokens can improve difficult answers because each generated token triggers another round of model computation and preserves intermediate information for the next step. For problems requiring a sequence of dependent operations, this can create additional computational depth rather than merely reveal reasoning that was already complete inside the model. ...

TL;DR for operators An AI system receives one signal that an operating rule has changed. The important test is not whether its average performance eventually recovers, but whether it immediately applies the revised rule to cases it has not yet revisited. Many models fail this test quietly. They correct each stimulus only after encountering it again, producing gradual recovery without inferring that one hidden rule changed for every stimulus at once. For teams deploying agents, that distinction matters whenever a policy change, workflow update, or exception rule must propagate across related cases. ...

TL;DR for operators Asynchronous RLHF buys throughput by allowing rollout workers to continue generating completions while the learner updates the policy. The invoice arrives later: some rollouts were generated by a policy that the learner has already left behind. The paper’s useful contribution is not merely the familiar observation that stale data can destabilize training. It identifies two different speed limits.1 ...

TL;DR for operators Most organizations do not have a feedback shortage. They have a conversion problem. Comments arrive in multiple languages, contain personal information, mix several complaints in one paragraph, and rarely align themselves politely with the categories used in management reports. Human teams then compress this material into a few operational labels, often under time pressure and with rules inherited from whichever spreadsheet survived the last reorganization. ...

TL;DR for operators The reassuring headline is that both evaluated frontier models rejected most automated jailbreak attempts. The operationally useful headline is that they still produced 1,620 and 702 panel-confirmed harmful completions, respectively, across every top-level harm category in the benchmark.1 The strongest adaptive attack succeeded on 11.51% of attempts against one model and 6.10% against the other. Static encodings and familiar jailbreak templates, by contrast, were almost entirely neutralised. ...

The GPU bill is not the strategy The easiest way to make reinforcement learning for reasoning models sound impressive is to say: sample more responses, train longer, scale harder. It is also the easiest way to make the finance team develop a facial twitch. Modern reasoning-focused LLMs increasingly rely on reinforcement learning with verifiable rewards: generate multiple candidate answers, score them with a rule-based signal, and update the model toward better reasoning behavior. In mathematics and coding tasks, this has become one of the most important post-training recipes. But it has a small accounting problem, in the same way a leaking ship has a small moisture problem. ...

Causal claims are cheap now. A model can look at variable names such as advertising spend, web traffic, sales conversion, and customer churn, then produce a causal story in seconds. The story may even sound sensible. That is precisely the problem. In business analytics, “sensible” is often the polite costume worn by “untested.” ...