CORTEXA
← Browse
arxivcs.LGmath.NAmath.OC2026-07-08

An optimal control approach for neural network architecture adaptation with a posteriori error estimation

C G Krishnanunni, Thomas Scott, Tan Bui-Thanh

This work presents a novel approach for adapting neural network architecture along the depth based on a posteriori error estimation. By formulating neural network training as a continuous-time optimal control problem, we derive rigorous error estimates that quantify how approximation error distributes across network layers. This error decomposition enables a principled depth adaptation strategy: new layers are inserted at locations of maximum estimated error, allowing the network to efficiently capture complex, nonlinear variations in the underlying problem. Our framework introduces a novel network architecture that treats weights and biases as piecewise linear functions varying across layers, with the error estimator bounding the discrepancy between this discrete representation and the true continuous optimal control solution. The approach leverages dual weighted residual methodology from finite element analysis to derive computable upper bounds on the functional error. A key theoretical contribution is the derivation of explicit error bounds that decompose the total approximation error into interval-wise contributions, providing a rigorous basis for targeted architecture refinement. We demonstrate the effectiveness of our method on scientific datasets, including learning the observable-to-parameter map for the Navier-Stokes equation. Numerical results reveal that our approach consistently outperforms existing architecture adaptation methods in terms of generalization performance.

View free PDFSource page

Related papers

arxivcs.LGmath.NAmath.OCphysics.comp-ph2026-07-02

An Optimisation Framework for the Well-Conditioned Training of Physics-Informed Neural Networks

Joseph Webb, Sadok Jerad, Coralia Cartis

Physics-informed neural networks (PINNs) have emerged as a promising route to solve partial differential equations, yet they have struggled to reach the precision of classical solvers. The obstacle is increasingly understood to be one of optimisation, owing to the severely ill-co…

View free PDFSource page
arxivmath.OCcs.LGcs.NEmath.NA2026-07-16

Fast and Scalable Caputo Fractional Gradient Descent via Perturbation-Preserving Memory Compression

Hwanseo Lee, Junseo Lee, Hyunju Kim

Fractional gradient descent (FGD) incorporates long-range memory through Caputo-type operators and has been shown to improve stability in ill-conditioned and nonconvex optimization problems. Despite these advantages, its practical use remains limited, mainly due to the high compu…

View free PDFSource page
arxivcs.LGmath.NAmath.OC2026-07-10

Graph-Regularized Low-Rank Matrix Completion by Variable Projection

Benoît Loucheur, P. -A. Absil, Michel Journée

We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework. The latter uses the geometry of the low-rank constraint to remodel the problem as an unconstrained optimization p…

View free PDFSource page
arxivmath.OCcs.LGmath.NA2026-07-07

On the Condition Number Upper Bound of the L-BFGS Inverse Hessian Approximation Matrix with a Two-Sided Geometric Envelope Safeguarding Mechanism

Don Li

The limited-memory BFGS (L-BFGS) algorithm is a cornerstone of large-scale optimization due to its linear memory and computational costs. However, in ill-conditioned or non-convex landscapes, the implicit inverse Hessian approximation can suffer from an exploding condition number…

View free PDFSource page