A Banach-Space Theory of Markovian Halpern Iteration for Non-Expansive Maps
arXiv:2608.15966
2026
Optimization
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper's transferable asset is a stochastic fixed-point solver for non-expansive maps when samples arrive along a correlated Markov trajectory rather than as independent minibatches. Halpern's anchored averaging avoids the lack of contraction drift, while PAGE-style refresh/difference estimators reduce the number of expensive Markovian oracle samples; the Poisson-equation analysis is specifically designed to control temporal correlation. The most credible neural-network use is a deep-equilibrium or recurrent module whose state update is constrained to be non-expansive, replacing ordinary noisy fixed-point iteration with an anchored, variance-reduced solver.
Ideas from this paper
Unverified
2026
Use Halpern iteration to solve a non-expansive neural equilibrium layer from temporally correlated samples, and estimate its stochastic operator with a PAGE-style refresh/difference estimator. The anchor supplies a vanishing but explicit stabilizing force, while same-state differences reuse consecutive Markov samples and should reduce the number of full oracle evaluations required for a target fixed-point residual.
Useful6/10
Difficulty6/10
Novelty7/10