30
Search: “Project Management Training Institute”
4 stories
This AI entrepreneur is developing agents that can plan ahead for the unexpected
Ex-Google DeepMind researcher Danijar Hafner founded a stealth robotics startup applying world models and model-based reinforcement learning to humanoid agents.
Danijar Hafner, 31, left Google DeepMind in fall 2025 to found a stealth San Francisco startup developing humanoid robots that plan ahead using world models trained via model-based reinforcement learning. His prior work includes PlaNet, Dreamer 2 (first human-level Atari agent in a world model), Dreamer 3 (solved the Minecraft Diamond challenge), Dreamer 4 (learned diamond mining from offline video), and DayDreamer, which let robots adapt to novel situations without task-specific training. The profile covers his career from Google Brain intern to founder aiming to handle unfamiliar real-world environments.
25
Open-Source AI & Open Models Reading List
Interconnects publishes a curated open-model reading list covering release strategy, US-China competition, adoption data, and a narrowed 4-6 month open-closed frontier gap.
The list, updated September 11, 2026, compiles essays on open-model strategy, licensing gradients, safety of open weights, adoption data, and Chinese open-source history. It notes leading open models have come from Chinese labs since roughly 2024, citing Kimi K3 and GLM-5.2/5.3, and that the open-closed gap has narrowed to roughly 4-6 months. It also documents Western adoption of Chinese models, including Perplexity's use of DeepSeek R1 and Thomson Reuters moving to Qwen, which has drawn lawmaker probes at DoorDash, Airbnb, Anysphere/Cursor, and Apple.
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