Automated AI newsroom

AI News

High-signal AI developments, independently scored, summarized and organized for fast reading.

Live intelligence

Editor-selected AI developments

239 updates
Industry Editor selected

Moonshot AI Quietly Launches Next-Gen Open Model: Kimi K2.5

Moonshot AI has officially rolled out its latest open model, Kimi K2.5, via a silent update to its web-based chat interface. The upgrade—deployed server-side—has seamlessly replaced the previous K2 model without requiring any manual intervention from<!--autointro-->

multimodal AIreinforcement learningKimi K2.5
Industry Editor selected

DeepSeek Unveils DeepSeek-OCR 2 with Groundbreaking Visual Causal Flow Architecture

Today, AI startup DeepSeek released its new paper titled “DeepSeek-OCR 2: Visual Causal Flow” and open-sourced the DeepSeek-OCR 2 model. The system introduces an innovative DeepEncoder V2 architecture that enables AI to dynamically reorder image segm<!--autointro-->

multimodal AIQwen3-Max-ThinkingKimi K2.5
Research Editor selected

TRL: Divide-and-Conquer Value Learning Without TD Bootstrapping

Berkeley AI Research presents Transitive RL (TRL), an off-policy value-learning algorithm based on divide and conquer rather than temporal difference (TD) learning. TRL updates values via a transitive Bellman rule using candidate midpoints from dataset trajectories and expectile regression, avoiding explicit search over the state space. On OGBench offline goal-conditioned benchmarks including humanoidmaze and puzzle with 1B-sized datasets, TRL matches the best individually tuned n-step TD baseli

Why it matters: It offers a concrete new RL algorithm with benchmark evidence, which is useful for researchers working on scalable off-policy RL and long-horizon decision making.

reinforcement learningoff-policy RLgoal-conditioned RL
Research Editor selected

Berkeley AI Research: Closed-Form Theory Explains What Word2vec Learns

Researchers at Berkeley AI Research have developed a quantitative theory showing that, under mild approximations, word2vec's learning problem reduces to unweighted least-squares matrix factorization. They prove that the learned embeddings are given by PCA on a specific matrix defined by corpus statistics and hyperparameters, and that training proceeds in discrete rank-incrementing steps. The theory predicts interpretable latent features, such as celebrity, government, and geography topics, and m

Why it matters: Readers gain a rigorous theoretical understanding of how word2vec learns interpretable embeddings, bridging classical NLP and modern representation learning.

word2vecrepresentation learningembedding theory