AI Research Methods
New technical methods, papers, architectures, training techniques, reasoning approaches, and research findings with applied significance.
Unified FHE Accelerator Targets Logic and SIMD Schemes on One Array
Minxuan Zhou of the Illinois Institute of Technology argues that fully homomorphic encryption will not become practical through cryptographic schemes alone, because its costs are dominated by ciphertext expansion, polynomial arithmetic, and data movement. In a Microsoft Research talk hosted by Patrick Longa, Zhou presents UFC, a unified FHE accelerator designed to support both logic and SIMD schemes by reducing their workloads to shared low-level primitives rather than building separate scheme-specific pipelines. The case for UFC is that hybrid FHE applications need both styles of computation, and that a common hardware substrate, NTT-centered interconnect, near-memory support, and compiler scheduling can outperform or avoid the inefficiencies of split accelerators.
OpenAI Model Disproves Erdős’s 80-Year-Old Unit Distance Conjecture
OpenAI reasoning researchers Alexander Wei, Hongxun Wu and Lijie Chen say a general-purpose model disproved Paul Erdős’s 80-year-old unit distance conjecture, a central problem in discrete geometry, by finding a construction that beat the square-grid arrangement Erdős had proposed as essentially optimal. In the podcast, they argue the result is significant not just because of the problem’s status, but because the model was not a bespoke math system: given enough inference-time compute, it produced a proof idea that internal reviewers initially doubted and that other mathematicians quickly began using. Their broader claim is that AI is moving beyond contest math toward a collaborative role in research, where models solve hard problems and humans verify, interpret and extend the ideas.
Nested Learning Lets AI Models Adapt Without Forgetting Core Knowledge
Cornell graduate student and Google researcher Ali Behrouz argues that continual learning requires AI systems to update on multiple time scales rather than treating training and inference as separate modes. In a Cognitive Revolution interview, Behrouz describes his Nested Learning work as a framework for models whose fast components adapt to current context while slower components preserve durable knowledge, with sleep-like phases used to consolidate what should persist. He says the approach has not solved continual learning, but offers a way to think about architectures, optimizers and memory systems as nested learning processes rather than fixed blocks.
Axiom Math Says Verified Reasoning Can Outscale Informal AI
Carina Hong, founder and CEO of Axiom Math, argues on the AI for Science podcast that formal verification is not mainly a way to police AI errors but a mechanism for scaling reasoning itself. Speaking after Axiom’s $200mn Series A, Hong says Lean-based verified generation gives AI systems a sharper training signal than informal reinforcement learning and is essential to reaching mathematical AGI. She points to Axiom’s reported perfect score on the 2024 Putnam exam as evidence, while acknowledging that specification, provenance and human judgment remain hard limits.
Neuroevolution Offers AI a Path Beyond Bigger Models
Risto Miikkulainen, a UT Austin professor and vice-president of AI research at Cognizant AI Labs, argues that neuroevolution offers a different path for AI than simply scaling larger models. In a conversation with Craig Smith, he says gradient descent is well suited to optimizing toward known targets, but population-based evolutionary search is better for problems where the goal is uncertain, the landscape is irregular, and useful solutions may require diversity, novelty and recombination.
NVIDIA Frames Cosmos 3 as Compute-Generated Data for Physical AI
NVIDIA presents Cosmos 3 as an open foundation model for physical AI, built to address what it frames as a data-scaling problem in robotics, autonomous vehicles and other systems that operate in the physical world. The company argues that real-world data cannot capture enough variability on its own, so compute must generate usable training and evaluation signals: synthetic video, predicted sensor outputs, simulation loops and action plans. Cosmos 3 is positioned as a post-trainable mixture-of-transformers system that combines multimodal reasoning with generation to support perception, prediction, simulation and action.
Open Image Models Converge on Flow Matching and DiT Architectures
Stanford adjunct lecturer Shervine Amidi uses Lecture 8 of CME296 to argue that modern visual generation is best understood as a stack of choices for transporting noise into data: the paradigm, representation, architecture, training procedure, and evaluation method. He presents flow matching as the current default for image-generation systems, diffusion transformers as the dominant architectural direction, and latent spaces as a practical compression tradeoff now being challenged by scaled pixel-space models.
Luma AI Targets Robotics Generalization With Open Physical AI Lab
Luma AI is launching an open physical AI lab to work on robots that can generalize beyond task-by-task demonstrations, CEO Amit Jain told Bloomberg Technology. Jain argues that physical AI should be built on large-scale multimodal data systems rather than narrow robotics training alone, and that the stack must remain open because robots could become part of homes, factories, hospitals and other productive systems.
Language Models Are Becoming the Bottleneck in Video Generation
Ethan He, who worked on NVIDIA’s Cosmos world model and xAI’s Grok Imagine, argues that the next major gains in video generation will come less from diffusion models alone than from language models, agents, and context management around them. In an interview with swyx and Vibhu Sapra, He describes Grok Imagine as a fast-built example of that shift: diffusion renders pixels, while language systems increasingly rewrite prompts, plan clips, call tools, manage memory, and turn short generations into longer, editable video.
Inference Hardware and Continual Learning Are Replacing Data as AI Bottlenecks
Google chief scientist Jeff Dean argues in a Two Minute Papers interview that AI progress is not chiefly constrained by running out of public text, but by systems work: extracting more from existing data, building inference-specialized hardware, distilling large models into smaller ones, and giving models access to much larger context. Dean frames the next phase less as better chatbots than as action-driven, agentic systems that can test, simulate and learn under controlled safety gates, while acknowledging unresolved problems in continual learning, healthcare deployment and infrastructure reliability at Google scale.
AI Is Lowering the Cost of Experimentation in Mathematics
Fields Medalist Terence Tao argues that AI is changing mathematics by lowering the cost of experimentation: researchers can test unlikely ideas, offload tedious computations, search literature more effectively, and keep collaborations moving. OpenAI chief research officer Mark Chen frames that shift as part of a broader goal of building tools that help many scientists make discoveries themselves, rather than positioning AI companies as the primary claimants to scientific credit.
Hugging Face Ships a $299 Hackable Robot for Voice AI Experiments
Andres Marafioti argues that Hugging Face’s Reachy Mini is meant to move robotics experimentation out of expensive humanoid hardware and into a $299-to-$449 open-source platform that users can assemble, repair and modify themselves. The robot’s most-used application is conversation, and Marafioti’s account ties its social ambition to a technical stack built for low-latency speech: Parakeet transcription, Qwen 3.5 27B, and an optimized Qwen3 TTS implementation that he says improved from 0.8x to 5.8x real time.
Model Behavior Depends More on Post-Training Data Than Algorithms
Stanford computer scientist Tatsunori Hashimoto’s CS336 lecture argues that post-training is less a matter of exotic algorithms than of choosing the data and feedback that turn a broadly capable pretrained model into a controllable product. He presents supervised fine-tuning as a way to extract behaviors already latent in pretraining, and RLHF as preference optimization whose results depend heavily on annotators, reward models, safety data and evaluation incentives. The lecture’s central warning is that style, refusals, hallucination, and reward hacking are not side issues; they are consequences of the data pipeline that shapes what users actually see.
Language-Model Data Pipelines Decide What Models Can Learn
Stanford’s CS336 lecture on data, taught by Percy Liang and Tatsunori Hashimoto, argues that language-model performance is shaped as much by corpus construction as by training itself. The lecture treats transformation, filtering, deduplication, source mixing and synthetic post-training data as engineering decisions that define what the model sees, how often it sees it and which compute is wasted. Its recurring point is that scalable algorithms are necessary, but the decisive choices still come from inspecting concrete data and deciding what “quality” means for the model being built.
RLVR Moves Post-Training From Human Preferences to Checkable Rewards
Stanford computer scientist Tatsunori Hashimoto presents reinforcement learning from verifiable rewards as the current practical route beyond RLHF for reasoning models, especially in math, coding and software-agent settings. His argument is that RLVR works because it replaces learned preference proxies with rewards that can be checked more directly, but that the reward remains the bottleneck: GRPO and related methods made the recipe simpler to run, while systems such as DeepSeek R1, Kimi k1.5 and Qwen show both the gains and the ways ostensibly verifiable rewards can still be gamed.
DeepMind’s AI Co-Scientist Turns LLMs Into Debate-Driven Research Agents
Google DeepMind’s Vivek Natarajan used a Stanford CS25 seminar to argue that scientific AI will require more than stronger chatbot-style models. He presented the company’s Gemini-based AI co-scientist as a multi-agent system built to generate, critique, rank and refine hypotheses over longer time horizons, with lab validation rather than benchmark scores as the test of usefulness. The case he made was cautious as well as ambitious: such systems may help scientists traverse large hypothesis spaces, but their value still depends on expert judgment, experimental capacity, publishing norms and safety controls.
Manna Bets Low-Cost Airline Economics Will Win Drone Delivery
Manna founder Bobby Healy tells This Week in Startups that drone delivery is becoming a low-cost operations business, not a novelty market, and argues his Dublin-based company can win by applying airline-style discipline to delivery networks. Healy says Manna’s 300,000 completed deliveries, claimed 97% Irish-weather availability and new $50 million Series B position it to expand in the U.S. as regulation opens up. Theseus co-founder Ian Laffey adds a defense-side version of the same argument from Kyiv: drone scale depends less on exotic aircraft than on cheap, reliable systems that can keep working when GPS and supply chains fail.
ChatGPT Lacks the Self-Generated Thought Required for Sentience
AI pioneer Terry Sejnowski argues that ChatGPT is neither a conscious mind nor a mere parrot, but an alien form of intelligence built from vast written knowledge and limited by the parts of biological intelligence it lacks. In a conversation with Craig Smith, the Salk Institute professor and Boltzmann machine co-inventor says current models can show creativity and a form of understanding, yet they have no organismic goals, no lived reinforcement, and no inner activity when not prompted. That absence of self-generated thought, he says, is the clearest reason ChatGPT is not sentient.
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.
Flow Policies Need New Q-Learning Methods for Online Robot Adaptation
UC Berkeley PhD student Qiyang “Colin” Li argues that the flow-matching and diffusion policies now effective for robotic manipulation expose a weakness in standard Q-learning: they model complex, multimodal action chunks well, but are hard to optimize with the reparameterized actor gradients used in efficient continuous-control RL. He presents two approaches, Flow Q-learning and Q-learning with Adjoint Matching, as ways to make off-policy RL work with these policies while reusing prior robot data. The trade-off, in Li’s account, is between the stability gained by distilling flows into one-step actors and the expressivity preserved by keeping multistep flow policies.
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.
Denoising Markov Models Generalize Diffusion Through Reverse-Time Generators
Stanford Ph.D. candidate Yinuo Ren argues that diffusion, discrete diffusion, and broader jump-based generative models can be treated as instances of the same problem: choose a forward Markov process that carries data toward a simple reference law, then learn its reverse-time generator. His framework gives conditions under which that reverse generator is explicit up to unknown densities and turns the resulting approximation problem into a path-space KL objective via Doob’s h-transform. The payoff, Ren says, is a principled way to design denoising models beyond Gaussian diffusion, including discrete and Lévy-type dynamics.
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.