✗ Mechanism failed 2026

Secant-Calibrated lp Optimizer

Implementation & benchmark of arXiv:2608.26688 — Optimal Parameter-Free Gradient Minimization in $\ell_p$ Geometry

Usefulness6/10
Difficulty5/10
Novelty6/10

Source paper: Optimal Parameter-Free Gradient Minimization in $\ell_p$ Geometry arXiv:2608.26688 ⓘ · analyzed Aug 29, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Bootstrap the optimizer curvature scale from a deliberately nondegenerate pair of gradient queries, then perform steepest descent in lp geometry with a local secant backtracking rule. The method does not require a supplied learning rate, smoothness constant L, initial distance R, or optimum value f*, and it automatically uses the dual norm associated with p.

Formulas

$$M_0=\frac{\|\nabla f(z_0)-\nabla f(x_0)\|_2}{\|z_0-x_0\|_2}>0,\qquad z_0\ne x_0,\quad \nabla f(z_0)\ne\nabla f(x_0).$$
$$q=\frac{p}{p-1},\qquad d_p(g)_i=-\frac{\operatorname{sign}(g_i)|g_i|^{q-1}}{\|g\|_q^{q-1}},\qquad \|d_p(g)\|_p=1,\quad g^\top d_p(g)=-\|g\|_q.$$
$$x^+=x-\frac{\alpha}{M}d_p(g),\qquad \text{accept if }\|g^+-g\|_q\le cM\|x^+-x\|_p;\quad M\leftarrow2M\text{ on rejection}.$$
$$\text{oracle complexity}=\begin{cases}O_p(\overline K^{1/2})&1<p\le2,\\O_p(\overline K^{p/(p+2)})&p>2,\end{cases}\qquad \overline K=\max\{1,LR/\varepsilon\}.$$

Mathematical statement

The paper initializes curvature adaptation with two queried points x_0 and z_0, where z_0 is not equal to x_0 and the gradients differ, defining the observable secant scale M_0 = ||grad f(z_0) - grad f(x_0)||_2 / ||z_0 - x_0||_2 > 0. Here f is the objective and M_0 is a measured local gradient-Lipschitz quotient. For 1 < p < infinity, define q = p/(p-1), let g = grad f(x), and use the unit lp steepest-descent direction d_p(g) with components -sign(g_i)|g_i|^(q-1)/||g||_q^(q-1). It satisfies ||d_p(g)||_p = 1 and g^T d_p(g) = -||g||_q. The adapted optimizer maintains M > 0, proposes x^+ = x - alpha d_p(g)/M, and accepts only when the observed secant obeys ||grad f(x^+) - g||_q <= c M ||x^+ - x||_p for a safety factor c > 1. On rejection, double M; after sufficiently conservative accepted steps, halve M. The paper gives target oracle complexity O_p(Kbar^(1/2)) for 1 < p <= 2 and O_p(Kbar^(p/(p+2))) for p > 2, where Kbar = max(1, LR/epsilon), plus O_p(log(e + L/M_0)) calibration queries.

Implementation notes

Integrate this as a replacement optimizer for a small MLP or Transformer, operating independently on each parameter tensor or on flattened parameter groups. Start with p = 2 and then test p = 4, with q = p/(p-1). At initialization, choose a random normalized perturbation u for each parameter group and set z_0 = x_0 + delta u, where delta is a small relative perturbation. Compute gradients at x_0 and z_0. If their difference is below a numerical threshold tau, multiply delta by two and retry until M_0 is nonzero or a maximum perturbation is reached. Set M = M_0. At each iteration compute g, then d_i = -sign(g_i)|g_i|^(q-1)/||g||_q^(q-1), and trial parameters x_trial = x - alpha d/M. Compute the trial gradient g_trial. Accept if ||g_trial - g||_q <= c M ||x_trial - x||_p; otherwise reject, set M = 2M, and retry from the same parameters. After s consecutive accepted steps whose secant ratio is below c/4, set M = M/2. Use separate M values per layer, epsilon floors in all norms, and a maximum step size for numerical safety. The exact mathematical quantities are M_0, the dual-norm direction, and the secant acceptance test; L and R are not estimated. First compare against AdamW and normalized SGD on CIFAR-10 using a three-layer MLP, with equal numbers of backward passes. Record loss versus gradient evaluations, rejected-trial fraction, final gradient norm, wall-clock overhead, and sensitivity to a 100-fold change in the nominal alpha. A useful signal is faster loss decrease at equal gradient-query count, fewer loss spikes, and comparable or better validation accuracy. Then repeat with a small Transformer and vary target gradient tolerances to estimate empirical log-log complexity slopes.

Verification

Mechanism failed

Stage 1 · Toy mechanism gate: Failed ✗

Stage 2 · Mechanism transferred to benchmark: Not tested

Stage 2 · Practical benchmark result: Not run

Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built a CPU MVP of the secant-calibrated lp optimizer for p=2 and p=4, including gradient-query calibration, dual-norm directions, secant rejection/backtracking, and conservative M reduction. The numerical identities passed to machine precision, but on the fixed regression task the method reached loss 10.64 (p=2) and 18.94 (p=4) after about 112 gradient queries, versus 0.126 for normalized SGD and 0.0285 for AdamW at comparable queries. The core math works, but no optimization win was observed.

Agent confidence
9/10
Baseline
AdamW final loss 0.02850 after 112 gradient queries; normalized SGD final loss 0.12575 after 112 queries.
Idea
Secant lp p=2 final loss 10.6384 after 112 queries with 1 rejection (0.89%); p=4 final loss 18.9434 after 116 queries with 5 rejections (4.31%).

Limitations: Only a tiny synthetic full-batch regression MLP was tested with one fixed seed on CPU. The MVP uses one global calibration scale rather than separate per-layer scales, and does not test CIFAR-10, Transformers, or oracle-complexity slopes. The implementation uses x_trial=x+alpha*d/M because the stated d already points downhill; the displayed x-alpha*d formula has a sign inconsistency.

How to run: OMP_NUM_THREADS=1 MKL_NUM_THREADS=1 /home/maxwelhelp/main/bin/python3 experiment.py > results.json

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Artifacts

Implementation overview ⬇ Download all as ZIP 3 files · code, reports and structured results