Continuous Optimization for p-adic Models

We present the first method for native, continuous gradient descent for machine learning models with p-adic parameters. Existing native optimizers are discrete, mostly combinatorial searches, as the p-adic numbers mathbbQp are totally disconnected, with standard losses that are flat away from their minima. To enable continuous optimization, we propose working with mathbbQp via its Berkovich affine line: a canonical, path-connected expansion of mathbbQp that preserves its isometries and uniquely extends its analytic maps. This hull is a metric tree with interpretable points and local derivatives, which we show enables effective optimizers and backpropagation. We formulate gradient descent and show that its approximations efficiently learn linear models with coefficients in mathbbQp to do modular arithmetic, an XOR-like task not expressible by linear models in ℝ. We also demonstrate momentum and Adam variants, linear regression, and classification on binary-encoded hierarchies (Quillian semantic networks), addressing open problems posed by Martins (2025). Library at https://github.com/google-deepmind/padic-ml