Unverified 2026

Ellipcenter Secant Optimizer

Usefulness6/10
Difficulty5/10
Novelty7/10

Source paper: The method of ellipcenters with momentum and relaxation for convex quadratic minimization arXiv:2608.29454 · analyzed Sep 1, 2026

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

Idea description

Use two points with approximately equal minibatch loss to construct an ellipcenter: the intersection of the normal lines through the two points, where the normals are their gradients. The resulting update uses local curvature information in the span of two gradients and can be relaxed toward the current parameters or combined with momentum.

Formulas

$$y_k=x_k-t_k\nabla f(x_k),\qquad f(y_k)=f(x_k)$$
$$\Pi_k:=\left\{x\in\mathbb{R}^n:x=x_k+\operatorname{span}\{\nabla f(x_k),\nabla f(y_k)\}\right\}$$
$$c_k=x_k+\alpha_k g_k=y_k+\beta_k g'_k,\qquad g_k=\nabla f(x_k),\quad g'_k=\nabla f(y_k)$$
$$\alpha_k=\frac{(d_k^Tg_k)(g'_k{}^Tg'_k)-(d_k^Tg'_k)(g_k^Tg'_k)}{(g_k^Tg_k)(g'_k{}^Tg'_k)-(g_k^Tg'_k)^2},\qquad d_k=y_k-x_k$$

Mathematical statement

The paper's ME construction starts from a current point $x_k$ and a nonzero gradient $g_k=\nabla f(x_k)$. It selects the unique point $y_k\neq x_k$ on the negative-gradient ray satisfying $y_k=x_k-t_k g_k$ and $f(y_k)=f(x_k)$. If $g_k$ and $g'_k=\nabla f(y_k)$ are linearly independent, the ellipse $E_k$ lies in the affine plane $\Pi_k=\{x:x=x_k+\operatorname{span}\{g_k,g'_k\}\}$ and is orthogonal to $g_k$ at $x_k$ and to $g'_k$ at $y_k$. For an ellipse, orthogonality means that its center $c_k$ lies on both normal lines, so $c_k=x_k+\alpha_k g_k=y_k+\beta_k g'_k$. Let $d_k=y_k-x_k$, $a=g_k^Tg_k$, $b=g_k^Tg'_k$, and $e=g'_k{}^Tg'_k$. Solving the two normal-line equations gives $\alpha_k=((d_k^Tg_k)e-(d_k^Tg'_k)b)/(ae-b^2)$, provided the Gram determinant $ae-b^2>0$. For a quadratic $f(x)=\tfrac12x^TQx+q^Tx+r$ with positive-definite $Q$, the exact equal-level step is $t_k=2\|g_k\|^2/(g_k^TQg_k)$; in a neural network, replace this unavailable curvature expression by backtracking or a secant estimate. The relaxed momentum update is $\theta_{k+1}=\theta_k+\rho_k(c_k-\theta_k)+\mu v_k$, with $0<\rho_k\le1$ and $0\le\mu<1$.

Implementation notes

(1) Integration point: replace the parameter update of SGD or AdamW for a selected parameter block, preferably the final projection layers or all weights in a small-model MVP. The forward pass at $\theta$ produces minibatch loss $L(\theta)$ and gradient $g=\nabla_\theta L(\theta)$. Create a trial point $\theta'=\theta-tg$ and evaluate the same minibatch loss and gradient there. (2) Pseudocode: g = grad(L(theta)); t = t_init; repeat theta_trial = theta - t*g; loss_trial = L(theta_trial); if abs(loss_trial-loss) <= tol*max(1,abs(loss)): break; if loss_trial > loss: t *= 0.5; else: t *= 1.1; g2 = grad(L(theta_trial)); d = theta_trial-theta; A = dot(g,g); B = dot(g,g2); C = dot(g2,g2); D = A*C-B*B; if D < eps*A*C: target = 0.5*(theta+theta_trial); else alpha=(dot(d,g)*C-dot(d,g2)*B)/D; target=theta+alpha*g; direction=target-theta; velocity=mu*velocity+rho*direction; theta += velocity. (3) The paper's mathematics supplies the equal-level construction, affine gradient plane, normal-line intersection, and Gram determinant $D$. The line-search tolerance, initial step $t_init$, relaxation $\rho$, momentum $\mu$, and determinant threshold are empirical hyperparameters. Estimate numerical degeneracy using $D/(AC)$ and fall back to the midpoint when gradients are nearly collinear. For noisy minibatches, keep the same batch for both evaluations and optionally use an exponential moving average of the two losses. (4) First experiment: train a 2-layer MLP and a small ResNet on MNIST or CIFAR-10 using identical minibatch order, comparing SGD with momentum, AdamW, and this optimizer at equal gradient-evaluation budget. Try $\rho\in\{0.25,0.5,1\}$, $\mu\in\{0,0.9\}$, and $t_init$ equal to the current SGD learning rate. Success means faster training-loss decrease or higher validation accuracy at equal wall-clock time; failure signals are excessive second-forward cost, frequent degenerate Gram systems, or instability caused by noisy equal-loss line search.

Verification

This idea has not been verified yet.

Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.

Artifacts

Artifacts unavailable.