The Mandelbrot question we have not answered

If the loss landscape is self-similar across scales, a fixed-window optimiser is the wrong instrument by construction. A question, written down before the work, with what it would take to become a claim.

1 Nov 2026 · 2 min read

Gradient descent is a striking idea once you see it plainly: every one of billions of parameters looking for the lowest point, like a river in a valley or snow melting downhill. Then one word: Mandelbrot. The set every mathematician knows by sight, and still not fully decoded 3.

The question

AdamW searches for a minimum in a space it assumes is locally smooth. If that landscape is self-similar across scales, then a fixed moment and a fixed step are the wrong instrument: you are crossing structure that looks the same at every zoom level with a single stride.

That is not nonsense. It is an interesting question.

Stating it precisely

The naive version is wrong and has to be dropped first. AdamW does not use one step size: its per-parameter adaptive scaling already responds to local curvature. 1 2 The serious version is narrower:

what AdamW fixeswhy it matters if the landscape is fractal
moment coefficients β₁, β₂ are constantsthe memory of past gradients has one time scale
adaptation is first-order over a fixed windowstructure repeating across scales is invisible to it by construction

Self-similarity, if present, is a statement about structure across scales. A fixed-window first-order method cannot see across scales. That is the whole question.

The inverted version

The hint that came with it: not classic Mandelbrot, inverted. Our blueprint notes work this out against AdamW’s update rule term by term 4. Instead of reaching into the weights and reshaping them, reshape the habitat: the constraints and environment the model grows in. The optimiser follows the terrain. Change the terrain.

It connects to everything else on this site: gardener, not architect; gradients and boundaries, not decisions.

What it needs to become a claim

  1. A measurable definition of self-similarity on a real deep-learning loss surface, not on a picture of one.
  2. A prediction that differs from AdamW’s, one that could come out the other way.

Without both, it stays what it is: a geometric intuition argued from an analogy.

Why publish a question

It was written down on 17 September 2026, deliberately before any work, so the framing cannot be reconstructed favourably later. Source material is gathered. Formal work has not started. It is parked until there is time and compute to do it properly.

Update, 1 November 2026. One implementation from our blueprints claimed to answer it. We ran it: its fractal term never switched on. The fractal optimizer that was plain gradient descent has the numbers. The question itself is still open.

Status: open question. If you have a measurement that settles it either way, we want to read it.

References
  1. D. P. Kingma, J. Ba. Adam: A Method for Stochastic Optimization. ICLR 2015not in corpus
  2. I. Loshchilov, F. Hutter. Decoupled Weight Decay Regularization. ICLR 2019not in corpus
  3. Quanta Magazine. The Quest to Decode the Mandelbrot Set, Math's Famed Fractal (2024)saved pagecorpus: ~/fractal-optimizer
  4. AdamW vs. Fractal Orbits. blueprint, generated in a NotebookLM session (2026)synthesiscorpus: ~/fractal-optimizer
Our records

The measurements in this article come from these records in the running system.

  • ~/content/alteranai-content/11-NOTE-mandelbrot-vs-adamw-the-question.md.md — NOTE: Mandelbrot vs AdamW, the question stated before the work, 2026-09-17
  • ~/content/alteranai-content/01-The Mandelbrot Hypothesis.md — The Mandelbrot hypothesis
Read next