{"format": "latex", "id": "00_frontmatter", "sha256": "ea767fb6a4182eaa4d4894ad4ffa1fd9e27d124d67ded243e3a5e2dee0284718", "source_path": "research/chapters/00_frontmatter.tex", "text": "\\chapter*{Abstract}\n\\addcontentsline{toc}{chapter}{Abstract}\n\\markboth{Abstract}{}\n\nConvexity of an objective does not determine the discrete curvature of\nits optimization trajectory. This monograph develops a certificate-based\naccount of that separation and connects it to decisions in recursive\nlearning. For constant-step gradient descent on a convex $L$-smooth\nobjective, let $h=\\eta L$, $D_k=f(x_k)-f(x_{k+1})$, and\n$\\kappa_k=D_k-D_{k+1}$. We establish the exact universal threshold\n\\[\n h_{\\mathrm{iso}}=\\frac{19-\\sqrt{17}}8\n\\]\nfor the compensation law $D_{k+1}+D_{k+2}\\leq2D_k$.\nWe also identify the distinct exact threshold\n$h_*=1.863425364363717\\ldots$ for excluding two adjacent strictly\nnegative second differences. The latter constant is defined by an\nisolated root of an explicit degree-seven polynomial. Both converses\nare realized by globally smooth, strongly convex, real-analytic\nobjectives. The positive results are finite interpolation certificates;\nthe converses use exact polynomial transcripts, a positive-slack\nquadratic repair, constructive interpolation, and quantified smoothing.\n\nFor every $m\\geq1$, an explicit two-dimensional real-analytic objective\nhas $m$ consecutive negative second differences despite global strong\nconvexity and geometric convergence. With $M=m+1$, its optimal\ncondition number is exactly $128M$, its step is $2-1/(128M)$, and\n\\[\n \\kappa_k\\leq-\\frac3{128M^2}\\qquad(0\\leq k{\\raggedright\\arraybackslash}p{0.25\\textwidth}>{\\raggedright\\arraybackslash}X@{}}\n\\toprule\nEvidence level & Meaning in this manuscript\\\\\n\\midrule\nWritten proof & A quantified mathematical argument under stated assumptions.\\\\\nExact arithmetic audit & Reproducible checks of algebraic identities,\nfinite rational instances, interval bounds, and implementation behavior.\\\\\nNumerical exploration & Floating-point optimization or plotting used for\nillustration; it is not treated as an exact certificate.\\\\\nIndependent internal check & A second derivation or mathematical review\nwithin this research effort, not external replication.\\\\\nApplication theorem & A guarantee for an explicitly declared model of\ntraining, evaluation, proposals, and resources.\\\\\n\\bottomrule\n\\end{tabularx}\n\\end{center}\n\nThe accompanying programs do not formally verify the whole manuscript in\na proof assistant. They do not numerically integrate the Gaussian\nconvolutions and then infer their universal properties. Analyticity,\nglobal curvature bounds, all-horizon statements, and probabilistic\ncoverage follow from the written proofs. The computations independently\ncheck finite and algebraic components for which exact executable checks\nare informative.\n\nThe classical $7/4$ boundary, smooth convex interpolation, performance\nestimation, and concentration inequalities have established sources.\nTheir use is acknowledged in the text and bibliography. The targeted\nliterature search described in the verification chapter is not a claim\nof exhaustive historical priority. Publication impact and practical\nacceleration are separate from the mathematical assertions proved here.\n"} {"format": "latex", "id": "01_overview", "sha256": "6491c9a806d382edc1c9c2c6c19e7bd19b7d49980e1c5756fdfd9727e7a69930", "source_path": "research/chapters/01_overview.tex", "text": "\\chapter{Questions, results, and their implications}\n\\label{ch:overview}\n\n\\section{The central question}\n\nAn automated learning system frequently decides whether to continue a\ntraining run, switch an optimizer, enlarge a model, or accept a proposed\nreplacement. A curve that appears to be improving slowly can make\ncontinuation seem unpromising. That inference is justified only if the\navailable assumptions restrict future improvement.\n\nThe simplest mathematical setting already contains a substantial\ndistinction. For exact gradient descent on a convex $L$-smooth objective,\na normalized step $h=\\eta L$ in $(0,2)$ makes the objective decrease.\nIt does not always make the improvements decrease. Barzilai, Shamir and\nZamani proved that discrete convexity of the loss sequence is universally\nguaranteed exactly up to $h=7/4$, and asked whether concavity can persist\nfor several consecutive steps \\cite{barzilai2025}. The question is about\nthe geometry of an orbit, not merely the geometry of the objective.\n\nThis manuscript supplies explicit long runs and a sharper account of\nthe transition into them. There are three distinct local thresholds:\nthe loss-convexity threshold $7/4$; a two-step compensation threshold;\nand a strictly larger adjacent-concavity threshold. Their separation\nshows that a local increase in improvement, failure of a particular\naveraged law, and persistence of increasing improvement are different\nphenomena even in a globally smooth strongly convex setting.\nRelated finite consecutive examples and rational threshold brackets are\nalready available in \\texttt{optcurves} \\cite{optcurves2026}. The\ncontributions here are stated relative to that work in\nChapter~\\ref{ch:verification}, including the exact adjacent boundary\nand the quantitative arbitrary-length analytic construction.\n\n\\section{The exact local phase boundaries}\n\nWith $D_k=f_k-f_{k+1}$ and $\\kappa_k=D_k-D_{k+1}$, define\n\\begin{equation}\n h_c=\\frac74,\\qquad\n h_{\\mathrm{iso}}=\\frac{19-\\sqrt{17}}8.\n \\label{eq:overview-boundaries}\n\\end{equation}\nLet $h_*$ be the unique root in\n$(1.863425364,1.863425365)$ of\n\\begin{align}\n P(h)={}&5000h^7-33602h^6+97161h^5-175306h^4\\notag\\\\\n &+235672h^3-224304h^2+126080h-33536.\n \\label{eq:overview-polynomial}\n\\end{align}\nThe isolating interval is part of the exact definition; the decimal\napproximation is a display aid. The three values satisfy\n\\[\n h_c=1.75