Data and Training
Training data, synthetic data, fine-tuning, post-training, reinforcement learning, data pipelines, labeling, and dataset quality.
Children’s Data Profiles Can Begin Before Birth
Proton engineering director Eamonn Maguire argues that a child’s digital profile can begin before birth, as parents’ emails, searches and sign-ups create signals that advertising and platform systems can use to infer pregnancy, family status and future behavior. Speaking with Craig Smith, Maguire uses Proton’s Born Private initiative, which lets parents reserve an email address for a child, to make a broader case that privacy is an infrastructure decision made long before children can consent. He extends the argument to social media, AI training data and the limits of trusting platforms whose business models depend on profiling.
Low-Cost Robot Arms Let Non-Specialists Train Physical AI
On NVIDIA’s AI Podcast, Seeed Studio CEO Eric Pan and head of robotics Elaine Wu make the case that open-source, Jetson-powered robot arms can move embodied AI beyond specialist industrial settings. Their argument is that low-cost hardware, frameworks such as OpenClaw and LeRobot, and Isaac Sim digital twins let makers, students and small businesses teach and constrain robots around specific tasks, rather than waiting for a closed general-purpose humanoid.
Self-Consistent Interpolants Learn Clean Priors From Corrupted Data
Jiequn Han’s talk argues that transport-based generative models should be treated not only as tools for sampling clean data distributions, but as machinery for recovering and adapting those distributions when the usual clean training set is absent. His main proposal, Self-Consistent Stochastic Interpolants, learns a clean prior from corrupted observations by iterating a transport map until the learned distribution, passed through a trusted forward simulator, reproduces the observed data. Han presents the method as a black-box alternative to EM-style inverse generative modeling, with the caveat that simulator mismatch remains a central unresolved risk.
Hamiltonian Flow Maps Learn Larger Molecular Dynamics Steps Without Trajectories
Michael Plainer, Winfried Ripken and Gregor Lied argue that generative models can attack molecular dynamics’ central bottleneck: the gap between femtosecond integration steps and biological processes that unfold many orders of magnitude later. In the Microsoft Research seminar, they separate the problem by timescale, using diffusion models to sample equilibrium Boltzmann states and extract force information, while proposing Hamiltonian flow maps for the intermediate regime where simulations need large, stable steps without training on expensive future-state trajectories.
Fixed-Point Bridge Matching Makes Diffusion Sampling Scalable Without Target Data
Lorenz Richter’s seminar argues for a non-Markovian route to diffusion-based sampling when the target distribution is known only through an unnormalized density rather than data. He presents existing Markovian path-space samplers as theoretically flexible but increasingly constrained by trajectory simulation and storage costs, then proposes building reciprocal bridge measures from endpoint couplings and learning their Markovian projection by fixed-point regression. The resulting Bridge Matching Sampler, Richter says, uses a single learned control, accommodates flexible priors and reference processes, and shows improved stability and mode preservation in high-dimensional synthetic and molecular benchmarks, especially with damping.
Dynamic Measure Transport Needs New Rules for Density-Driven Sampling
Aimee Maurais argues that dynamic measure transport, now central to diffusion models and flow matching, needs different design principles when the target distribution is specified by densities, likelihoods, or prior samples rather than training data. In a Microsoft Research seminar, she presents three lines of work toward that goal: gradient-free particle dynamics using likelihood evaluations, PDE-constrained path design to avoid unstable interpolations, and localized transport velocities that exploit conditional-independence structure in high-dimensional Bayesian and data-assimilation problems.
Energy-Based Fine-Tuning Improves Accuracy Without RLVR’s Validation-Loss Penalty
Mujin Kwun and Carles Domingo-Enrich present energy-based fine-tuning as a post-training method that replaces next-token imitation or task-specific rewards with sequence-level feature matching. Their argument is that supervised fine-tuning remains efficient but is trained under teacher forcing, while RL with verifiable rewards can improve accuracy without preserving the target completion distribution. EBFT instead samples model rollouts, compares their frozen-model feature embeddings with reference completions, and uses that signal for policy-gradient updates; in the reported coding and translation experiments, it matched or exceeded RLVR accuracy while producing lower validation cross-entropy than both RLVR and SFT.
Meta Flow Maps Cut Reward-Alignment Costs With One-Step Posterior Sampling
Peter Potaptchik presents Meta Flow Maps as an amortized way to remove a costly inner loop in reward-aligning generative models: repeatedly simulating trajectories to estimate expected future reward from a noisy state. The method trains stochastic flow maps to produce differentiable, one-step samples from the clean-data posterior conditioned on any time and noisy state, enabling value-gradient estimates for inference-time steering and an off-policy objective for fine-tuning. In ImageNet experiments, Potaptchik argues, this lets a single-particle steered sampler outperform Best-of-1000 baselines across several rewards with far less compute.
The U.S. Military’s Constraint Is Industrial Depth, Not Battlefield Skill
Former Pentagon official Darren Farber argues to Patrick O’Shaughnessy that the United States’ military advantage depends less on battlefield skill than on whether its politics, industrial base, and technology pipeline can sustain force before a crisis becomes existential. Farber portrays China and Iran as powerful but brittle authoritarian systems, while warning that democracies face a harder test: defining victory, maintaining public consent, and converting commercial innovation into usable military depth. His case links Ukraine’s drone war, Taiwan, the Strait of Hormuz, defense startups, and military AI to a single constraint — whether America can turn legitimacy and markets into durable strategic capacity.
Distributed RL Let Composer Match Frontier Coding Models With Smaller-Model Speed
Cursor’s Federico Cassano and Fireworks’ Dmytro Dzhulgakov argue that Composer’s advantage comes from specializing a model for software engineering inside Cursor rather than spending capacity on general-purpose behavior. Starting from an open-source base, Cursor used mid-training and reinforcement learning against its own product environment, while Fireworks supplied the distributed infrastructure needed to make agent rollouts, weight synchronization, and inference efficient enough to run at scale. Their case is that application companies with enough product-specific usage, tools, and feedback can build models that are better, faster, and cheaper for their own workflows than larger general models.
Hassabis Says AI Drug Discovery Could Transform Medicine Within 20 Years
Demis Hassabis told Two Minute Papers’ Károly Zsolnai-Fehér that AI could help produce cures for most diseases on a 10- to 20-year horizon, but he framed the claim as a platform problem rather than a countdown. The DeepMind chief argued that AlphaFold is only one component of a broader drug-discovery system, with Isomorphic Labs and DeepMind building multiple specialized models to predict biological behavior, design molecules and eventually accelerate validation. He stressed that clinical testing and regulatory trust remain separate bottlenecks, and that evidence from working AI-designed drugs would have to come before any process change.
Macrocosmos Targets 70B-Parameter Training on 5,000 Distributed Nodes
Steffen Cruz, co-founder and CTO of Macrocosmos, argues that frontier AI training is approaching an economic ceiling as larger models require multi-billion-dollar, centralized GPU build-outs. Macrocosmos’s alternative, built inside the BitTensor ecosystem, is IOTA: a distributed training network that uses blockchain for identity, coordination, auditability, and payment while training happens off-chain across idle or underused machines. Cruz says the system has reproduced baseline benchmark performance and now needs to prove it can train enterprise-relevant models, starting with a 5,000-node and roughly 70 billion-parameter target.
Gemma Is Google’s On-Device Extension of Gemini Research
Google DeepMind’s Omar Sanseviero argues that Gemma is not a parallel alternative to Gemini but the open, local and on-device expression of the same research stream. He presents Gemma 4 as a model family optimized for efficiency, developer integration and emerging agentic use cases, while drawing a clear boundary around Gemini as Google’s route for frontier capability, broad factual knowledge and long-running tasks.
AI Infrastructure Demand Is Becoming Revenue, Contracts, and Market Stress
Gavin Baker joined the All-In panel to argue that AI’s economics are becoming tangible: Anthropic’s reported profitability, surging LLM revenue, Nvidia’s results, and SpaceX’s compute contracts all point to infrastructure demand that is no longer speculative. The group framed SpaceX’s potential $2 trillion valuation as a bet on Starlink, launch, and AI compute rather than current earnings, while Baker defended Nvidia against share-loss and GPU-useful-life bear cases. The counterweight was political and macro risk: public backlash to AI, labor displacement, regulation, higher inflation, rising yields, and U.S.-China tension.
Enterprise AI Advantage Comes From Internal Evals and Proprietary Context
Yash Patil, chief executive of Applied Compute and a guest speaker in Stanford’s MS&E435 seminar, argues that the enterprise opportunity in AI is shifting from access to general frontier models toward the ability to define and optimize company-specific tasks. General models provide a baseline, he says, but durable advantage comes from internal evals, verifiers, feedback loops, proprietary context and product constraints that teach systems what “correct” means inside a business.
DeepSeek Uses Visual Primitives to Make Image Reasoning Cheaper
Károly Zsolnai-Fehér presents DeepSeek’s “Thinking with Visual Primitives” paper as a meaningful shift in visual AI: not a model that merely sees images, but one that can reason by marking them with points, boxes and paths. He argues that this makes tasks such as counting and maze tracing cheaper, more accurate and easier to inspect, with the paper reporting strong benchmark results while using about 90% fewer visual tokens than many frontier systems. He also cautions that the work is a blueprint rather than a released model, and still depends on triggers and may struggle with fine visual detail or unfamiliar topology problems.
Coding Agents Can Tackle AI Systems Engineering With File-Based Skills
Hugging Face’s Ben Burtenshaw argues that coding agents can now take on parts of AI systems engineering when the work is narrow, measurable, and embedded in inspectable repositories. Using examples including an agent-written CUDA RMSNorm kernel with a reported 1.94x H100 speedup, an end-to-end Qwen3 fine-tune, and a multi-agent research lab, he makes the case that the limiting factor is not a better prompt but better primitives: skills, versioned artifacts, benchmarks, managed compute, and open metrics that agents can read, run, and improve.
Pre-Training Scale Is Losing Ground to Adaptive AI Systems
Sara Hooker, co-founder of Adaption Labs, argues in a Hugging Face ML Club India talk that AI progress is moving away from ever-larger pre-training runs as the default path and toward systems that adapt more efficiently after deployment. She says compute still matters, but the higher-return questions now concern data curation, post-training, test-time compute, interfaces, routing, and how cheaply models can learn from new information. Her case is that monolithic, one-size-fits-all models push the cost of adaptation onto users and concentrate participation among labs with the largest compute clusters.
Google’s I/O Pitch Put Distribution Ahead of Model Breakthroughs
John Coogan and Jordi Hays read Google I/O as a mixed signal: Google’s smart-glasses strategy looks stronger where it combines Gemini with eyewear distribution and Google’s own services, but its model launches exposed the risk of tying AI progress to a fixed conference calendar. On TBPN, they argued that Street View may be an underappreciated AI training asset and that AI video still has to move from impressive short clips to coherent long-form outputs. The episode also framed a potential SpaceX IPO and Nvidia’s latest results as evidence that the financial returns from space and AI infrastructure are already arriving at exceptional scale.
Kled Founder Alleges Luel Copied Its Human Data Marketplace
This Week in Startups put two founder arguments side by side: Mercury chief executive Immad Akhund said the fintech’s new $200mn round is meant to create strategic flexibility for a profitable company seeking a bank charter, while Kled founder Avi Patel argued that an alleged copycat in the human-data marketplace category threatens trust in a business built on consent and compliance. Jason Calacanis treated Patel’s dispute with Luel, Y Combinator and General Catalyst less as an intellectual-property case than as an ethics and diligence signal for investors.
Agent-Native Clouds Need Faster Primitives, Not New Ones
Railway founder Jake Cooper argues that software infrastructure does not need to abandon its old primitives for agents, but must make them much faster, cheaper, safer and more observable. In a wide-ranging interview with swyx and Alessio, Cooper lays out Railway’s attempt to build an agent-native cloud through own-metal data centers, production forks, progressive rollouts and deployment loops that assume thousands of concurrent software-producing actors rather than one human pushing a pull request.
Neuro-Symbolic Planning Makes Robot Learning More Data-Efficient
Jiayuan Mao, a Member of Technical Staff at Amazon Frontier AI & Robotics and incoming University of Pennsylvania assistant professor, argues in a Stanford Robotics Seminar that robot learning should be built around planning over compositional world models rather than direct policy fitting alone. His case is that neuro-symbolic systems — neural models embedded in symbolic constraint graphs for objects, relations, actions and effects — can learn from few demonstrations, compose skills at inference time and generalize to new objects, states and goals more reliably than end-to-end policies.
Robots Need Game-Theoretic Planning to Navigate Human Interaction
UC Berkeley roboticist Negar Mehr uses a Stanford robotics seminar on interactive autonomy to argue that robots cannot handle shared spaces by treating people and other robots as moving obstacles. She frames interaction as a coupled decision problem: agents must predict how others will respond to their own actions, coordinate across multiple possible equilibria, and learn from demonstrations of interaction rather than isolated behavior. Her broader case is that game-theoretic structure, multi-agent learning, and training-time foundation-model coaching can make that coupling tractable without replacing deployed control policies.
Language Models Generalize Differently From Parameters Than From Context
In a Stanford CS25 seminar, Anthropic researcher Andrew Lampinen argues that language models generalize differently depending on whether information is stored in their parameters or supplied in context. His experiments find that models can often use relations flexibly when the relevant facts are visible in the prompt, but fail to make the same reversals, syllogistic inferences, or codebook translations when those facts have only been learned through training. Lampinen presents augmentation, retrieval, and reinforcement-learned recall as partial ways to make latent implications more usable, while stressing that parametric learning and in-context learning remain complementary rather than substitutes.