A gradient method in a Hilbert space with an optimized inner product:\n achieving a Newton-like convergence
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper we introduce a new gradient method which attains quadratic\nconvergence in a certain sense. Applicable to infinite-dimensional\nunconstrained minimization problems posed in a Hilbert space $H$, the approach\nconsists in finding the energy gradient $g(\\lambda)$ defined with respect to an\noptimal inner product selected from an infinite family of equivalent inner\nproducts $(\\cdot,\\cdot)_\\lambda$ in the space $H$. The inner products are\nparameterized by a space-dependent weight function $\\lambda$. At each iteration\nof the method, where an approximation to the minimizer is given by an element\n$u\\in H$, an optimal weight $\\hlambda$ is found as a solution of a nonlinear\nminimization problem in the space of weights $\\Lambda$. It turns out that the\nprojection of $\\kappa g(\\hlambda)$, where $0<\\kappa \\ll 1$ is a fixed step\nsize, onto a certain finite-dimensional subspace generated by the method is\nconsistent with Newton's step $h$, in the sense that $P_u(\\kappa\ng(\\hlambda))=P_u(h)$, where $P_u$ is an operator describing the projection onto\nthe subspace. As demonstrated by rigorous analysis, this property ensures that\nthus constructed gradient method attains quadratic convergence for error\ncomponents contained in these subspaces, in addition to the linear convergence\ntypical of the standard gradient method. We propose a numerical implementation\nof this new approach and analyze its complexity. Computational results obtained\nbased on a simple model problem confirm the theoretically established\nconvergence properties, demonstrating that the proposed approach performs much\nbetter than the standard steepest-descent method based on Sobolev gradients.\nThe presented results offer an explanation of a number of earlier empirical\nobservations concerning the convergence of Sobolev-gradient methods.\n
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.000 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it