{"slug": "mike-winer-wants-math-not-guesswork-to-keep-ai-in-check", "title": "Mike Winer wants math, not guesswork, to keep AI in check", "summary": "Statistical physicist Mike Winer, a Marvin L. Goldberger Member at the Institute for Advanced Study and an affiliate of the Alignment Research Center, is developing mathematical methods to predict how neural networks behave rather than relying on Monte Carlo sampling. Winer's approach uses cumulants and Hermite expansions to approximate a multilayer perceptron's expected outputs and the distribution of its internal activations at initialization, targeting rare extreme outputs that sampling struggles to find. Winer presented the work at the Yale FDS Colloquium on October 22, 2025 and is scheduled to speak at UCLA's IPAM Foundations of Interpretability Workshop on September 2, 2026, though he acknowledges the research so far covers only MLPs at initialization, not fully trained models.", "body_md": "# Mike Winer wants math, not guesswork, to keep AI in check\n\nA statistical physicist at the Institute for Advanced Study is building tools to predict how neural networks behave before anything goes wrong\n\nMost efforts to make AI safe come down to testing. You poke the model, watch what it does, and hope you poked it in the right places.\n\nMike Winer, a statistical physicist, wants something sturdier: mathematical guarantees about how a neural network will behave, worked out with equations rather than trial runs.\n\n## Who Winer is and what he is building\n\nWiner holds the title of **Marvin L. Goldberger Member** at the Institute for Advanced Study (IAS). His specialty is the statistical physics of disordered systems, along with how that field applies to deep learning.\n\nHe is also affiliated with the Alignment Research Center (ARC) in Berkeley. ARC focuses on keeping advanced AI systems aligned with human intentions.\n\nHis current research targets multilayer perceptrons, or MLPs. Think of an MLP as a stack of filters. Data enters at the top, gets transformed layer by layer, and an answer comes out at the bottom.\n\nMLPs are among the most basic building blocks in deep learning. That makes them a sensible place to start if you want to understand neural networks from the ground up.\n\nWiner’s work centers on two questions. First, what output should you expect from a network on average? Second, how likely are rare, extreme outputs, the kind that rarely surface but could cause real damage?\n\n## Swapping dice rolls for equations\n\nThe standard way to answer those questions is Monte Carlo sampling. You feed the network huge numbers of random inputs and tally what comes out. Run enough samples and a reliable picture of its behavior eventually emerges.\n\nThe catch is that rare events are, by definition, rare. To catch a one-in-a-billion failure by sampling, you need an enormous number of tries.\n\n### AI, tech, and the markets they move—in one daily briefing.\n\nDaily. Free. Join 34,000+ readers across crypto, finance, and policy.\n\nWiner’s approach skips much of that. He mathematically approximates a network’s expected outputs and the distribution of its internal activations at initialization, the point when a model is first set up before training.\n\nTo build those approximations, Winer relies on cumulants and Hermite expansions. Both are classical mathematical tools for describing the shape of probability distributions, including their tails.\n\nThe tails are where the safety question lives. A model that behaves well 99.9% of the time can still produce dangerous outputs in the remaining sliver, and sampling is notoriously bad at finding that sliver.\n\n## A growing push for verifiable AI\n\nWiner’s work fits into a wider research movement often called mechanistic interpretability. The idea is to understand neural networks the way engineers understand bridges: by knowing why they hold up, not just observing that they have so far.\n\nHis research falls under a field ARC calls heuristic estimation. That means producing reasoned, mathematically grounded estimates of a network’s behavior without running every possible scenario.\n\nOn October 22, 2025, he spoke about heuristic estimation of neural networks at the Yale FDS Colloquium.\n\nHe is also scheduled to present at UCLA’s IPAM Foundations of Interpretability Workshop on September 2, 2026. That talk is expected to cover his methods built on cumulants and Hermite expansions.\n\n## What this means for AI safety\n\nThe caveats are real, and Winer acknowledges them. His work so far focuses on MLPs and on networks at initialization, a long way from the massive, fully trained models that dominate the AI industry.\n\nTrained models develop intricate internal structure that is much messier to describe than a freshly initialized network.\n\nWiner has said that much work remains in this area.\n\nStill, his background is an interesting asset. Statistical physicists have spent decades describing systems with countless interacting parts, from magnets to glasses, where tracking every component individually is hopeless.\n\nNeural networks share that character. Millions or billions of parameters interact in ways no one can follow one by one, which is exactly the kind of problem disordered-systems physics was built to tackle.\n\nFor researchers, the key milestone to watch is whether these techniques scale beyond simple architectures. The September 2026 IPAM workshop should offer a fresh look at how far the methods have come.\n\n**Disclosure:** This article was edited by Diego Almada Lopez. For more information on how we create and review content, see our [Editorial Policy](https://cryptobriefing.com/editorial-policy/).", "url": "https://wpnews.pro/news/mike-winer-wants-math-not-guesswork-to-keep-ai-in-check", "canonical_source": "https://cryptobriefing.com/mike-winer-mathematical-safeguards-ai-control/", "published_at": "2026-11-22 10:09:14+00:00", "updated_at": "2026-11-22 10:14:33.897830+00:00", "lang": "en", "topics": ["ai-safety", "ai-research", "machine-learning", "neural-networks"], "entities": ["Mike Winer", "Institute for Advanced Study", "Alignment Research Center", "Yale FDS Colloquium", "UCLA IPAM Foundations of Interpretability Workshop"], "also_reported_by": [], "takeaway": "Cumulant and Hermite-expansion approximations can estimate an MLP's expected outputs and activation distributions at initialization without Monte Carlo sampling, which is poorly suited to catching one-in-a-billion tail events.", "recommendation": {"advice": "For rare-failure analysis of small networks at initialization, approximate output and activation distributions analytically with cumulants and Hermite expansions instead of Monte Carlo sampling, which needs enormous sample counts to reach tail events.", "playbook": "evals-testing", "playbook_url": "https://wpnews.pro/playbooks/evals-testing"}, "alternates": {"html": "https://wpnews.pro/news/mike-winer-wants-math-not-guesswork-to-keep-ai-in-check", "markdown": "https://wpnews.pro/news/mike-winer-wants-math-not-guesswork-to-keep-ai-in-check.md", "text": "https://wpnews.pro/news/mike-winer-wants-math-not-guesswork-to-keep-ai-in-check.txt", "jsonld": "https://wpnews.pro/news/mike-winer-wants-math-not-guesswork-to-keep-ai-in-check.jsonld"}}