Skip to content
AI NEWS JOURNAL
AI, IN PERSPECTIVE

All AI updates

Explore the complete news stream by source, topic and date.

Newest first

A 31-year-old unsolved problem in mathematics, the KLS conjecture, has been proven: a fundamental breakthrough has been achieved in high-dimensional geometry and the theory of randomized algorithms.

On October 4, 2026, Zhang Xinzhi, a researcher at Microsoft Research, together with his collaborators, completed a rigorous proof of the Kannan–Lovász–Simonovits (KLS) conjecture, thereby resolving a long-standing central problem that had remained open since its formulation in 1995. This achievement establishes a dimension-independent constant bound for the “plane‑cut bottleneck” in high-dimensional log-concave distributions, providing an unconditional theoretical foundation for random sampling, convex optimization, and theoretical computer science.

Timeline and related coverage

Google Cloud and NVIDIA have announced the official commercial availability of the NVIDIA Vera Rubin infrastructure: A5X instances are now live, focusing on large-scale reinforcement learning and agent reasoning.

Google Cloud and NVIDIA have announced that the A5X instances, built on the Vera Rubin architecture, will officially go commercial starting next month, initially available in the United States and later expanding to Europe. The platform integrates NVL72 GPUs, ConnectX-9 SuperNICs, the Virgo network, and fourth-generation liquid cooling technology, and is specifically designed for high-density computing workloads such as large-scale reinforcement learning and generative agent inference.

Timeline and related coverage

NVIDIA releases Kumo Forecast: a multivariate forecasting model that integrates pre-trained time-series representations, historical pattern retrieval, and interpretability.

NVIDIA has launched the open-source time-series forecasting model Kumo Forecast (formerly NV-Tesseract Forecasting), which is built on the MOMENT-1-large Transformer architecture. It supports both direct prediction and dual-path inference via Domain-Aware Representation and Retrieval (DARR), and includes a built-in interpretability framework that requires no modifications to the model structure.

Timeline and related coverage

GPT-OSS-20B Multilingual Reasoning Fine-Tuning Experiment: SFT Enables Zero-Base Behavior Acquisition, while GRPO Only Effectively Improves Performance When a Probabilistic Headspace Exists

The AWS team conducted multilingual inference fine-tuning experiments on Amazon SageMaker HyperPod using GPT‑OSS‑20B, employing LoRA for parameter-efficient fine-tuning. SFT boosted the correctness rate of inference in five languages (English, French, German, Spanish, and Italian) from 22% to 100%, though the correctness rate for the answer language remained at only 62%. GRPO further improved the answer-language correctness rate to 70% without compromising inference-language performance; however, the gains varied across languages—for example, Spanish saw a +30 percentage-point increase, while Italian experienced a -20 percentage-point decline. The experiments clearly demonstrated that GRPO cannot bootstrap new capabilities from scratch and can only optimize behaviors that already occur sporadically.

Timeline and related coverage

Called to serve: Tech, research, and positive impact

Lab Director Chris White has worked on research challenges with real-world implications—from new approaches to wartime data analysis to tools for combating human trafficking. He talks to program manager Weishung Liu about the influences that led to the work and more. The post Called to serve: Tech, research, and positive impact appeared first on Microsoft Research.

Timeline and related coverage

PyTorch 2.15 officially supports MPS: FP8, MoE acceleration, and a comprehensive upgrade to the Metal kernel.

PyTorch 2.15 brings a major MPS backend upgrade to Apple Silicon Macs, natively supporting FP8 tensor operations on macOS for the first time, boosting MoE model decoding speed by 5–6.5 times, reducing peak video VAE memory usage from 270 GiB to 8 GiB, and migrating numerous operators from MPSGraph to dedicated Metal kernels.

Timeline and related coverage

“We’ve been looking at it all wrong”: A Goodfire researcher proposes a new perspective on neural network interpretability, sending shockwaves through the AI community.

Goodfire researcher Nick Cammarata published a 26,000-word paper arguing that the internal mechanisms of large language models (LLMs) may be far more structured and comprehensible than the academic community has previously assumed. His central thesis hinges on a reinterpretation of “polysemous neurons” in models such as Inception v1—suggesting that neurons associated with both cats and cars, for instance, actually respond to V-shaped visual patterns rather than exhibiting disordered overgeneralization. This view has yet to undergo systematic validation on modern LLMs and has been challenged by scholars including Chris Potts of Stanford University and Jacob Hilton of the Alignment Research Center, who question its universality and technical depth.

Timeline and related coverage

Google Research advances AI agents rooted in real-world wet labs: Building the three technological cornerstones of autonomous biological discovery

Google Research has unveiled three key technological advances—the VERID digital twin framework, a closed-loop aptamer discovery system, and a targeted epitope‑cleaving protein design workflow—enabling AI agents to achieve a traceable, verifiable, and self‑iterating molecular discovery loop in real wet‑lab settings.

Timeline and related coverage

Microsoft releases Magnetar: a universal zero-knowledge virtual machine that supports Rust, Go, and C, with quantum-safe proofs implemented using standard hash functions.

Microsoft Research has unveiled Magnetar, a zero-knowledge virtual machine that, for the first time, simultaneously addresses the three long-standing bottlenecks of zero-knowledge proofs in a single system: low generation efficiency, high development barriers, and insufficient post-quantum security. It enables programs written in mainstream languages such as Rust, Go, and others to be compiled and executed directly, with verifiable proofs generated automatically. On average, it is 10–39 times faster than the fastest existing zkVMs, with proof verification taking only about 12 milliseconds. Moreover, its security relies solely on standard hash functions like SHA‑256 and SHA‑3—NIST‑standardized algorithms that have stood the test of decades of cryptographic scrutiny—eliminating the need for trusted setups, elliptic curves, or novel mathematical assumptions that have not been thoroughly validated.

Timeline and related coverage