Google DeepMind and UC Berkeley propose HOPE, a framework for progressively decomposing network weights
burkov · x · 2026-07-25
In a new paper from Google DeepMind and UC Berkeley, researchers introduce Hilbert Operator for Progressive Encoding (HOPE), a mathematical framework that gradually deconstructs representations embedded in trained network weights.
The post does not go into the full derivation, but points readers to the paper and suggests reading it with an AI tutor because the material is dense.
Related event: DeepMind and Berkeley Propose HOPE to Quantify Neuron Capacity(5 posts)→
More from Research
- Cognition's SWE-2 uses a KKT duality argument in RL to shift the effort Pareto curve — YouJiacheng · 2026-09-11
- VidMap uses RoMa coarse matching on all frames, fine-scale only for keyframes — ducha_aiki · 2026-09-11
- Bug Hunt Bench author: leaderboard noise is about 2-3 points — PawelHuryn · 2026-09-11
- PNAS paper shows a tiny billiard-ball system is a universal computer — undecidability lives in two dimensions — eigensteve · 2026-09-11
- New paper: Absolute pose estimation from affine cues and gravity direction — ducha_aiki · 2026-09-11
- LoMa Paper Ships REALLY HardPairs Dataset, Accepted at ECCV 2026 — ducha_aiki · 2026-09-11