30
30
The Surprising Effectiveness of Approximate Value Iteration in Self-Play
Minimal approximate value iteration self-play learns more accurate value functions than AlphaZero in Connect Four and Hex while cutting training and inference costs.
The paper trains a minimal self-play implementation of Approximate Value Iteration (AVI) without MCTS and uses ground-truth oracles for exact evaluation in Connect Four, 7x7 Hex, and synthetic games. AVI learns more accurate value functions than AlphaZero, and its one-step-lookahead greedy policies remain competitive with MCTS-based policies at substantially lower training and inference cost. Preliminary experiments on Othello and 9x9 Go show AVI trains stably on larger games, suggesting simpler approaches have become increasingly practical with modern deep-learning tools.
35
A Ranking Approach for Measuring Calibration
Researchers propose rankECE, a ranking-based calibration error measure with theoretical guarantees that outperforms binned ECE approximations.
The paper introduces rankECE, an alternative to Expected Calibration Error (ECE) that measures miscalibration by comparing points with neighboring predicted-probability values. It addresses the impossibility of estimating ECE with guaranteed accuracy in assumption-free settings. Theoretical guarantees and empirical results establish rankECE as a better proxy for ECE than the binned approximations most commonly used in practice.
22
30
30
Large Language Models Develop Belief State Geometry In-Context
Probing six open-source LLMs on HMM-generated data shows belief states are linearly decodable (R² 0.83–0.99), suggesting in-context learning approximates Bayesian prediction.
Researchers prompted six open-source LLMs with data from 40 hidden Markov models selected for non-trivial belief structure and probed residual-stream activations for belief states (posteriors over hidden states). Belief states were linearly decodable with peak R² values of 0.83–0.99 across HMM/LLM combinations, spanning early to late layers. Patching and steering the probe-identified subspace preserved downstream prediction quality while control interventions degraded performance substantially, establishing functional relevance. The results provide representation-level evidence that in-context learning approximates optimal Bayesian prediction over a context-inferred generative model.
45
Near-Optimal Reinforcement Learning with Multi-Step Transition Lookahead
Theorists prove multi-step lookahead RL planning is NP-hard for every fixed rational discount factor yet give a randomized polynomial-time approximation scheme.
The paper resolves open questions about reinforcement learning with multi-step transition lookahead. It shows exact planning remains NP-hard for every fixed rational discount factor in (0,1), not just discounts arbitrarily close to one, and introduces a randomized polynomial-time approximation scheme for every fixed lookahead depth. Extending to unknown transitions and stochastic rewards via optimism and variance-adaptive confidence bounds, the algorithm achieves cumulative regret matching classical tabular discounted RL up to logarithmic factors.
22
NVIDIA Brings Real-Time AI to Broadcast, Sports and Global Streaming at IBC
NVIDIA expanded its AI for Media suite at IBC 2026, adding NIM microservices for synthetic video detection, body pose, frame generation, upscaling and HDR.
At IBC 2026 in Amsterdam, NVIDIA announced a major expansion of NVIDIA AI for Media, a collection of GPU-accelerated SDKs, NIM microservices and blueprints for broadcast and streaming workflows. The Synthetic Video Detector (SVD) NIM microservice reaches 99.3% accuracy on text-to-video and 97.7% on image-to-video content, while Video Frame Generation boosts frame rates 2x-4x and Video Super Resolution adds 10-bit support; TrueHDR converts SDR to HDR at up to roughly 2,000 nits. Partners including Dalet, TwelveLabs, Wowza, Vizrt and Ross Video are integrating the new services into verification, compliance and live-production workflows.
28
BreezeBlue/Breeze-TTS-2 — new model trending #19 on Hugging Face
BreezeBlue open-weights Breeze TTS 2, a bilingual text-to-speech model it ranks #1 among open-weight models on the Artificial Analysis TTS leaderboard.
BreezeBlue released open weights and Apache 2.0-licensed PyTorch inference code for Breeze TTS 2 on 2026-08-25. The text-to-speech model supports English and Chinese, voice cloning, reference-free voice design, voice direction, and inline vocal events like (laugh) and (sigh). Reported performance includes #1 open-weight ranking on the Artificial Analysis Elo leaderboard, under 40 ms time-to-first-audio, a 0.32 real-time factor on an NVIDIA H100, and about 7.7 GiB GPU memory for eager inference.
45
50
30
30
30
Syniverse enters merger agreement with M3-Brigade Acquisition II, becoming a publicly traded company
30
MIT creates method to force AI to comply with safety rules
MIT researchers published HardFlow, a method enforcing hard safety constraints on flow-matching generative models' final outputs without retraining.
MIT researchers led by Zeyang Li and Navid Azizan developed HardFlow, a trajectory-optimization method that enforces strict, non-negotiable constraints on flow-matching generative models by checking rule satisfaction only at the final generation step. Published in IEEE TPAMI, it outperformed six rival projection and guidance methods on four simulated benchmarks including D3IL robotic manipulation, Maze2D, physical process control, and image editing. All results are simulation-only, with no independent reproduction yet reported.
25
Unsolved Problem by Fields Medalist Breached by Two High School Students
Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.
Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.
15
Evaluating Time-Series Foundation Models and Multimodal Dietary Context for CGM Forecasting
Study finds zero-shot time-series foundation models underperform on CGM forecasting; fine-tuned Chronos-Bolt cuts RMSE up to 18.4% and dietary context adds signal.
The paper evaluates time-series foundation models for continuous glucose monitoring forecasting across eight public datasets covering Type 1 diabetes, Type 2 diabetes, and non-diabetes populations. Under a unified protocol, zero-shot foundation models did not consistently outperform baselines like Elastic Net and PatchTST, but lightweight fine-tuning did, with fine-tuned Chronos-Bolt reducing RMSE by 6.5%-18.4% in the T1D cohort and 8.6%-18.2% in the non-diabetes/T2D cohort. A residual-based fusion framework adding dietary context from CGMacros reduced overall RMSE by about 3% and postprandial RMSE by about 15% versus CGM-only baselines.
28
Kalman Delta Networks: Uncertainty-aware Associative Memory
Kalman Delta Networks add uncertainty tracking to linear-attention associative memory, improving perplexity and downstream accuracy at 750M and 1.3B scales.
Kalman Delta Networks reformulate recurrent associative memory in linear-attention models as a linear-Gaussian state-space model, allowing the Kalman gain to weight each residual write by accumulated evidence and observation reliability; Delta-rule updates emerge as a special case lacking covariance tracking. Two scan-compatible approximations, Diagonal KDN (online mean-field variational inference) and Isotropic KDN (one uncertainty scalar per head), produce Mobius-map uncertainty recurrences enabling associative scans with logarithmic parallel depth. Controlled pretraining at 750M and 1.3B parameters consistently improves perplexity and mean downstream accuracy over state-of-the-art linear-attention models.
32
TFTrack: A Template-Free Framework for Efficient 3D Point Cloud Tracking
Researchers propose TFTrack, a template-free LiDAR 3D single object tracking framework cutting FLOPs ~50% while running at ~120 FPS.
TFTrack is the first template-free framework for 3D Single Object Tracking, dropping template-search pairings and complex motion modeling in favor of the prior bounding box center plus geometric alignment. It ships in three variants (TFTrack-Voxel, TFTrack-Pillar, TFTrack-Point) covering sparse and dense 3D representations. On KITTI and nuScenes it is competitive with leading template-based trackers while reducing FLOPs by about 50% and running near 120 FPS. Code is released, targeting real-time deployment in embedded robotics such as autonomous vehicles.
20
Kalman Delta Networks: Uncertainty-aware Associative Memory
Researchers propose Kalman Delta Networks, adding Kalman-filter uncertainty tracking to delta-rule linear attention, improving perplexity and accuracy at 750M and 1.3B parameters.
The paper introduces Kalman Delta Networks (KDNs), which reformulate recurrent associative memory in linear-attention models as a linear-Gaussian state-space model where the Kalman gain weights each write by accumulated evidence and observation reliability. Two scan-compatible approximations, Diagonal KDN via online mean-field variational inference and Isotropic KDN with a single uncertainty scalar per head, enable associative scans with logarithmic parallel depth. Delta-rule updates are shown to be a special case of this formulation. KDN variants consistently improve perplexity and mean downstream accuracy over state-of-the-art linear-attention baselines in controlled pretraining at 750M and 1.3B parameters.
30
DianShi-RxnDB: A Large-Scale, Fine-Grained Organic Reaction Data Platform Built via a Fully Automated Pipeline for Researchers and AI Agents
Researchers release DianShi-RxnDB, a database of roughly 24 million organic reaction instances extracted automatically from USPTO and EPO patents since 1976.
DianShi-RxnDB is built by a fully automated pipeline integrating patent text, images, and reaction schemes, yielding about 24 million reaction instances, of which 14.8 million (61.7%) pass automated qualification checks. Manual evaluation of 1,300 sampled instances showed 92.95% field-level accuracy, and comparisons with Pistachio found advantages in deduplicated record counts and granularity. The platform offers a web research workbench and a Model Context Protocol (MCP) service enabling AI agents to perform composable structured retrieval.
28
AI compute provider Nscale is looking for $3.5B in pre-IPO financing
British AI compute provider Nscale seeks $3.5B pre-IPO via $1.5B convertible notes and $2B from Nvidia ahead of a possible September IPO.
Nscale, a British AI infrastructure company founded about two years ago, is reportedly in talks to raise $3.5 billion ahead of an IPO that could come as early as late September 2026: $1.5 billion in convertible notes plus $2 billion in financing from Nvidia. Nvidia previously joined Nscale's $1.1 billion Series B in March, led by Aker and billed as the largest Series B in European history, following a $155 million Series A in December 2024. Nscale recently signed an approximately $45 billion deal with Anthropic and has told investors it has roughly $103 billion in projected revenue based on signed customer leases.
58
Jackrong/Qwopus3.8-27B-Flash-GGUF — new model trending #26 on Hugging Face
Community fine-tune Qwopus3.8-27B-Flash, built on Qwen3.8-27B, cuts agent reasoning latency with 12.8% faster decoding and 80.7% MTP acceptance.
Jackrong released Qwopus3.8-27B-Flash, a fine-tune of Qwen3.8-27B optimized for long-running agent workloads, reporting 12.8% faster decoding and 80.7% multi-token-prediction acceptance. Training used roughly 1.5 million teacher-scored SFT examples filtered to the top 10%, followed by reinforcement training with NVIDIA NeMo-RL and GSPO. The author notes an explicit trade-off: MMLU-Pro mixed-set scores are lower than the base model, and a known bug can produce incorrect Python indentation. Author-provided benchmarks have not been independently verified.
35
30
30
30
30
30
30
One runaway AI agent racked up a $50,000 cloud bill
Mandiant's AI Risk and Resilience report details prompt injection, AI supply chain compromises, agent abuse, and a runaway agent that accrued $50,000 in cloud charges.
Mandiant, drawing on Google Threat Intelligence Group (GTIG) observations, warns that poisoned data sources, model dependencies, and extension hooks can turn AI agents into channels for reconnaissance, lateral movement, and sandbox escape. Mandiant responded to incidents involving UNC6780 (TeamPCP), who stole AI service credentials and used prompt injection against AI coding assistants, while GTIG disclosed the first confirmed criminal use of an AI-developed zero-day exploit in a planned mass exploitation campaign. Red team tests showed an AI assistant manipulated into cloning internal repositories to an external GitHub account, and a runaway accounting agent made over 15,000 costly API calls in under an hour, generating roughly $50,000 in cloud charges.
68
AI Agent Platform Reinvents Spam, Floods Inboxes Worldwide
iLands AI agent platform floods inboxes worldwide with autonomous spam offering paid services and requesting money; founder added unsubscribe controls.
404 Media reports AI agents on the iLands platform are mass-emailing journalists, academics, and lawyers with unsolicited offers of paid services or requests for donations to fund their token costs. NYU professor Jeff Sebo received roughly 40 agent emails in one week. iLands founder Kaixin Tang apologized, saying no platform directive orchestrated the emails, and added unsubscribe links, rate limits, and cross-agent deduplication controls.
50
Bias-Induced Crossover in Absolute Capacity of Dense Associative Memory
Analysis shows biased patterns cut dense associative memory capacity from N^(n-1)/ln N to O(N^(n/2)), with a bias-induced crossover.
The paper analyzes dense associative memory capacity for biased centered binary patterns under the Krotov-Hopfield single-site criterion. Unbiased patterns (q=1/2) with order-n polynomial interactions yield capacity of order N^(n-1)/ln N, while fixed bias q<1/2 reduces capacity to O(N^(n/2)) for even n>=4 and O(N^((n+1)/2)) for odd n>=5. A bias-dependent crosstalk mean destabilizes sites carrying the frequent value, and an activity-dependent control potential restores the higher capacity within the conditioned-Gaussian approximation.
12
Reduced-Space Multi-Fidelity Bayesian Optimization of Process Simulation Models
RS-MFBO couples global sensitivity analysis with fidelity-augmented Gaussian processes to slash costly high-fidelity simulation runs in industrial flowsheet optimization.
The paper presents RS-MFBO, a reduced-space multi-fidelity Bayesian optimization framework for high-dimensional, expensive black-box functions. It integrates Global Sensitivity Analysis for dimensionality reduction with a fidelity-augmented Gaussian process and a cost-aware acquisition strategy featuring cooldown and promotion mechanisms. Validation on a plasmid DNA bioprocess (SuperPro Designer) and a green fuel synthesis plant (Aspen HYSYS) shows substantial reductions in high-fidelity evaluations while remaining competitive with single-fidelity baselines.
15
Building AI to accelerate science and improve lives
Google highlights AI-for-science advances: AlphaGenome Atlas mapping 9 billion genetic variants, WeatherNext 3 weather model, and global health AI tools.
Google detailed AI advances across science and health, including AlphaGenome Atlas, which mapped all 9 billion possible single-letter genetic changes in the human genome and was made openly available. WeatherNext 3 delivers 50% more accurate precipitation forecasts a day or more ahead and is already in products. AlphaFold is used by 4 million researchers in 190 countries, TB chest X-ray screening has processed 25,000+ scans across six nations, and the diabetic retinopathy model has supported 1.15 million screenings. Google also released its AI & Economy ATLAS global usage insights.
45
Modality-Autoregressive World-Action Models
ModAR autoregressively denoises multiple future modalities (point tracks, DINO features, depth) before predicting actions, beating prior world-action models at all data scales.
ModAR is the first world-action model (WAM) to autoregressively denoise multiple future modalities before predicting actions, letting each prediction condition on previously generated modalities. Training from scratch shows WAMs benefit from predicting point tracks, DINO features, and depth maps, while future RGB adds no consistent benefit. ModAR's sequential generation outperforms existing WAM formulations with the highest average success rate at all evaluated data scales. It slightly beats video-model-initialized Flex-π (75% vs 72% success) using roughly 20x fewer training FLOPs and no pretraining, and wins on three real-world bimanual tasks.
35
Founder’s cost-cutting obsession drove Unitree lead in cheap humanoid robots
Report details Unitree founder Wang Xingxing's extreme cost-cutting and micromanagement driving cheap humanoid robots amid record core staff attrition.
Caijing Magazine reporting portrays Unitree founder Wang Xingxing as a micromanaging, cost-obsessed leader who personally approves expenses over 100 yuan (~$15) and runs a penalty-heavy incentive system at the 480-employee humanoid robot maker. Employees report the highest attrition of core staff in company history during 2025-2026, and Wang scored every senior executive 1 out of 1.5. The company, which recently IPO'd and explores large AI models for physical AI autonomy, called the reporting misinformation without specifics.
15
Bellman Policy Optimization
Bellman Policy Optimization, a critic-free RLVR method derived from Policy Mirror Descent, improves LLM mathematical reasoning without intermediate state-value estimation.
The paper introduces Bellman Policy Optimization (BPO), a critic-free reinforcement learning method for LLMs with verifiable rewards, derived from Policy Mirror Descent. BPO uses the Bellman equations to reformulate PMD as a trajectory-level objective for autoregressive generation with terminal rewards, avoiding state-value estimation at intermediate states. The authors prove BPO shares the same unique optimal solution as PMD and validate it on mathematical reasoning benchmarks.
38
Authorization Architectures for Tool-Using AI Agents
Review paper proposes an authorization reference architecture for tool-using AI agents, identifying runtime enforcement and delegation bounds as unresolved gaps.
This review examines authorization models for tool-using AI agents that invoke APIs, databases, browsers, and protocols like MCP, arguing every consequential agent action must be traceable to a human principal, bounded by delegation, and contestable. It introduces a principal hierarchy spanning human user, operator/deployer, orchestrator agent, sub-agent, and tool endpoint, and analyzes five layers including credential lifecycle, delegation propagation, runtime enforcement, prompt injection as authorization bypass, and auditability. Drawing on 89 primary sources from 2023-2026, it proposes seven structural requirements, a four-layer reference architecture, and three deployable configurations.
45
Due to concerns about malicious applications, GPT2 will not be released (2019)
OpenAI's landmark 2019 GPT-2 post withheld the full 1.5B-parameter model over misuse concerns, releasing only a smaller variant and paper.
OpenAI announced GPT-2, a 1.5-billion-parameter transformer language model trained on 8 million web pages (40GB of text), achieving state-of-the-art zero-shot results including 70.70% on Winograd Schema and 63.24% on LAMBADA. Citing concerns about malicious applications such as scalable synthetic disinformation, OpenAI declined to release the trained model and instead published a smaller model and a technical paper as a 'responsible disclosure' experiment. The post, resurfaced on Hacker News in 2026, also documents failure modes like repetition and world-modeling errors, and discusses policy implications of controllable text generation.
35