Proximal Spherical Cubic Step
Implementation & benchmark of arXiv:2607.24046 — A Homogeneous Tensor Framework for High-Order Trust-Region and Spherical Polynomial Optimization
Source paper: A Homogeneous Tensor Framework for High-Order Trust-Region and Spherical Polynomial Optimization arXiv:2607.24046 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace the inner step of a neural optimizer with a safeguarded cubic local-model solve. Represent the cubic Taylor model as a homogeneous tensor in an augmented coordinate, solve proximal unit-sphere subproblems by alternating tensor contractions, decode a candidate step, and accept it only when the actual neural loss confirms the predicted decrease.
Formulas
Mathematical statement
For parameters x and step s, the cubic Taylor model is T_3(s)=c+g^T s+(1/2)s^T Hs+(1/6)C[s,s,s], where c=f(x), g is the gradient, H is the Hessian, and C is the third-derivative tensor. With the augmented vector ilde{s}=(1,s), an order-3 tensor A is defined so that T_3(s)=A[ ilde{s}]^3. For a trilinear representation F_h(u,v,w)=A[u,v,w] and unit vectors u,v,w, the proximal block problem is u^+=argmin_{||u||=1}[F_h(u,v,w)+(beta_1/2)||u-u_old||^2]. Because F_h is linear in u and both vectors have unit norm, the solution is u^+=normalize(beta_1 u_old-A(.,v,w)), with analogous updates for v and w. Alternating exact block minimization gives non-increasing proximal objectives and stationary accumulation points. A quartic safeguard can be added as m_3(s)=T_3(s)+(sigma/4)||s||^4.
Implementation notes
Integrate this as an optional inner solver for a selected parameter block, such as a final MLP layer, LoRA adapter, or small projection matrix; do not initially apply it to an entire large Transformer. At optimizer step k, flatten the block into x, compute g, Hessian-vector products, and approximate third-order directional contractions, then construct a low-rank tensor-contraction oracle for A rather than materializing a dense tensor. Choose a radius Delta and represent candidate directions with three unit vectors u,v,w using the augmented vector ilde{s}=(1,s). Initialize candidates from the negative-gradient direction, Adam's direction, and random unit vectors. For each PAM sweep, compute a_u=A(.,v,w) and update u <- normalize(beta_1 u-a_u); then compute a_v=A(u,.,w) and a_w=A(u,v,.) and apply the corresponding updates with beta_2 and beta_3. Decode the best candidate and scale it to ||s|| <= Delta. Evaluate rho=(f(x)-f(x+s))/(T_3(0)-T_3(s)); accept when rho >= eta, enlarge the radius for high rho, and shrink it after rejection. Estimate third derivatives using forward-over-reverse autodiff or finite differences of Hessian-vector products. First test a 2-layer MLP on CIFAR-10 against AdamW and a gradient-only cubic optimizer at matched gradient-equivalent FLOPs. Measure loss decrease per wall-clock second, final accuracy, gradient norm, rejected-step rate, and stability across seeds. Success is faster descent or fewer rejected steps on ill-conditioned blocks without loss spikes.
Verification
Stage 1 · Toy mechanism gate: Passed ✓
Stage 2 · Mechanism transferred to benchmark: Confirmed ✓
Stage 2 · Practical benchmark result: Inconclusive
Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works
Stage 1 — Mechanism check agent confidence 8/10
Built a readable proximal spherical cubic solver with exact homogeneous tensor construction, tensor contractions, PAM updates, quartic safeguard ratio testing, and deterministic toy verification. The mechanism manifested: representation error was 1.6e-14, maximum proximal block-objective increase was at numerical zero, and all quartic-strength acceptance patterns matched the analytically predicted radius transitions. The secondary comparison did not show a performance win: gradient descent reached -0.59694 versus -0.58612 for the safeguarded method, with 74/80 safeguarded attempts rejected.
- Agent confidence
- 8/10
- Baseline
- Toy quartic objective final value -0.5969433195 after 80 fixed-step gradient updates.
- Idea
- Toy quartic objective final value -0.5861162639 after 80 safeguarded cubic-direction attempts; 74/80 rejected. Analytic/observed transition radii: q=0.8, 1.4640/1.4585; q=1.7, 1.1675/1.1570; q=4.0, 0.9044/0.8987. q=0.2 transition was 2.3181, beyond the tested radius maximum 2.0.
Limitations: No CIFAR-10, neural-network training, Hessian-vector or third-derivative autodiff, matched-FLOP timing, GPU test, multiple random seeds, or high-dimensional/low-rank tensor benchmark was performed. The implementation materializes a small dense tensor and uses a fixed toy radius rather than a full adaptive trust-region optimizer.
How to run: python3 proximal_cubic.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.24046)
Ahead of the baseline (−1.9%) but not statistically significant (p=0.6102, wins 5 / 8 paired seeds).
- Benchmark
- Tabular regression (Friedman)
- Model
- mlp_tiny
- Paired seeds
- 8
- Baseline mean
- 13.1296
- Idea mean
- 12.8854
- Effect (Δ)
- -0.2441 (−1.9%; negative = idea better)
- Wins
- 5 / 8 paired seeds
- p-value
- 0.6102 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±8.2%
- Mechanism
- Confirmed ✓
- Practical effect
- Inconclusive
- Baseline tuning
- swept over 4 configs
Only the registered tabular track was tested; vision, sequence, and dynamics were not tested. The intervention uses a final-layer diagonal-curvature proxy and zero explicit third-derivative block rather than full Hessian-vector and third-order autodiff. Large-scale models, matched wall-clock/FLOP accounting, and longer training were not tested.
How to run: python3 bench_experiment.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Stage 2 — Benchmark latest Failed ✗
Agent confidence: 9/10
The Proximal Spherical Cubic Step was implemented as a final-layer training intervention on the registered tabular Friedman#1 benchmark with shared mlp_tiny architecture and matched baseline/idea hyperparameter grids. It improved mean test MSE from 13.129557 to 12.885437, but the paired permutation test was not significant (p=0.6102), so this is not a demonstrated win. The model-scale mechanism signature was confirmed with observed/predicted decrease ratio 0.9262.
- Baseline
- AdamW, best cfg {lr:0.006, weight_decay:0.0}; mean test MSE 13.1295574903, std 1.5250596544.
- Idea
- Proximal spherical cubic final-layer update plus AdamW elsewhere, best cfg {lr:0.006, weight_decay:0.0}; mean test MSE 12.8854370117, std 1.4828934326; paired delta -0.2441204786; 5/8 wins; p=0.6102.
Benchmark result
Ahead of the baseline (−1.9%) but not statistically significant (p=0.6102, wins 5 / 8 paired seeds).
- Benchmark
- Tabular regression (Friedman)
- Model
- mlp_tiny
- Paired seeds
- 8
- Baseline mean
- 13.1296
- Idea mean
- 12.8854
- Effect (Δ)
- -0.2441 (−1.9%; negative = idea better)
- Wins
- 5 / 8 paired seeds
- p-value
- 0.6102 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±8.2%
- Mechanism
- Confirmed ✓
- Practical effect
- Inconclusive
- Baseline tuning
- swept over 4 configs
Only the registered tabular track was tested; vision, sequence, and dynamics were not tested. The intervention uses a final-layer diagonal-curvature proxy and zero explicit third-derivative block rather than full Hessian-vector and third-order autodiff. Large-scale models, matched wall-clock/FLOP accounting, and longer training were not tested.
How to run: python3 bench_experiment.py
Artifacts
- bench_experiment.py 8.1 KB View Raw
- bench_report.json 12.6 KB View Raw
- proximal_cubic.py 5.9 KB View Raw
- report.md 1.6 KB View
- report_bench_2026-08-31T165804.md 5.3 KB View
- results.json 1.9 KB View Raw
- run_output.json 12.6 KB View Raw