Approximation of Maximally Monotone Operators : A Graph Convergence Perspective

• URL: http://arxiv.org/abs/2605.12301v1
• Date: Tue, 12 May 2026 15:53:13 GMT
• Title: Approximation of Maximally Monotone Operators : A Graph Convergence Perspective
• Abstract summary: We propose a paradigm shift by formulating approximation via graph convergence.<n>We show that uniform and $Lp$ approximation are fundamentally inadequate in this setting.
• Score: 12.336698508781405
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued, and lie outside classical approximation frameworks. We propose a paradigm shift by formulating approximation via graph convergence (Painlevé-Kuratowski convergence), which is well-suited for closed operators. We show that uniform and $L^p$ approximation are fundamentally inadequate in this setting. Focusing on maximally monotone operators, we prove that any such operator can be approximated in the sense of local graph convergence by continuous encoder-decoder architectures, and further construct structure-preserving approximations that retain maximal monotonicity via resolvent-based parameterizations.

Related papers

• Neural operators approximate strongly continuous convex monotone semigroups [41.99844472131922]
  We approximate strongly continuous monotone convex semigroups by learning their Chernoff-type one-step operators with neural operators.<n>We show in a universal approximation theorem that they can approximate the Chernoff one-step operators arbitrarily well.
  arXiv  Detail & Related papers  (2026-09-02T15:38:52Z)
• AI-Assisted Discovery of Convex Relaxations via Dual Agents [56.60366723277675]
  We show that a lower bound holds for every admissible function and follows from a convex relaxation giving stronger bounds.<n>A theory verifies each agent one and searches for counterexamples, and every reported bound is certified by an explicit dual-feasible point in the interval.
  arXiv  Detail & Related papers  (2026-06-30T06:10:25Z)
• Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives [48.91820744387913]
  We develop preconditioned gradient methods with a focus on Muon and Scions.<n>We introduce a family of algorithms that can handle a wide variety of convex and non-reduced constraints.
  arXiv  Detail & Related papers  (2026-05-12T09:36:13Z)
• Discrete Adjoint Matching [43.00097192213681]
  We propose a discrete variant of Adjoint Matching (AM) for fine-tuning discrete generative models.<n>The core of DAM is the introduction of discrete adjoint-an estimator of the optimal solution to the original problem.<n>We showcase DAM's effectiveness on synthetic and mathematical reasoning tasks.
  arXiv  Detail & Related papers  (2026-02-06T19:12:40Z)
• Max-Min Neural Network Operators For Approximation of Multivariate Functions [4.5657111459153885]
  We develop a framework for approximation by max-min neural network operators.<n>We establish pointwise and uniform convergence theorems and derive estimates for the order of approximation.
  arXiv  Detail & Related papers  (2026-01-12T06:14:05Z)
• Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking [45.147301546565316]
  This paper considers the problem of decentralized optimization on compact submanifolds.<n>We propose an algorithm where agents update variables using quantized variables.<n>To the best of our knowledge, this is the first algorithm to achieve an $mathcalO (1/K)$ convergence rate in the presence of quantization.
  arXiv  Detail & Related papers  (2025-06-09T01:57:25Z)
• New universal operator approximation theorem for encoder-decoder architectures (Preprint) [0.0]
  We present a novel universal operator approximation theorem for a broad class of encoder-decoder architectures.<n>In this study, we focus on approximating continuous operators in $mathcalC(mathcalX, mathcalY)$, where $mathcalX$ and $mathcalY$ are infinite-dimensional normed or metric spaces.
  arXiv  Detail & Related papers  (2025-03-31T13:43:21Z)
• Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency [52.60557300927007]
  We present a $textbfMA-OSMA$ algorithm to transfer the discrete submodular problem into a continuous optimization.<n>We also introduce a projection-free $textbfMA-OSEA$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution.<n>Our algorithms significantly improve the $(frac11+c)$-approximation provided by the state-of-the-art OSG algorithm.
  arXiv  Detail & Related papers  (2025-02-07T15:57:56Z)
• Approximation Rates in Fréchet Metrics: Barron Spaces, Paley-Wiener Spaces, and Fourier Multipliers [1.4732811715354452]
  We study some general approximation capabilities for linear differential operators by approximating the corresponding symbol in the Fourier domain.<n>In that sense, we measure the approximation error in terms of a Fr'echet metric.<n>We then focus on a natural extension of our main theorem, in which we manage to reduce the assumptions on the sequence of semi-norms.
  arXiv  Detail & Related papers  (2024-12-27T20:16:04Z)
• Operator Learning of Lipschitz Operators: An Information-Theoretic Perspective [2.375038919274297]
  This work addresses the complexity of neural operator approximations for the general class of Lipschitz continuous operators. Our main contribution establishes lower bounds on the metric entropy of Lipschitz operators in two approximation settings. It is shown that, regardless of the activation function used, neural operator architectures attaining an approximation accuracy $epsilon$ must have a size that is exponentially large in $epsilon-1$.
  arXiv  Detail & Related papers  (2024-06-26T23:36:46Z)
• Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
  This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
  arXiv  Detail & Related papers  (2023-10-20T12:45:12Z)
• Decentralized Riemannian Conjugate Gradient Method on the Stiefel Manifold [59.73080197971106]
  This paper presents a first-order conjugate optimization method that converges faster than the steepest descent method. It aims to achieve global convergence over the Stiefel manifold.
  arXiv  Detail & Related papers  (2023-08-21T08:02:16Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• Optimal variance-reduced stochastic approximation in Banach spaces [114.8734960258221]
  We study the problem of estimating the fixed point of a contractive operator defined on a separable Banach space. We establish non-asymptotic bounds for both the operator defect and the estimation error.
  arXiv  Detail & Related papers  (2022-01-21T02:46:57Z)
• Neural Operator: Learning Maps Between Function Spaces [75.93843876663128]
  We propose a generalization of neural networks to learn operators, termed neural operators, that map between infinite dimensional function spaces. We prove a universal approximation theorem for our proposed neural operator, showing that it can approximate any given nonlinear continuous operator. An important application for neural operators is learning surrogate maps for the solution operators of partial differential equations.
  arXiv  Detail & Related papers  (2021-08-19T03:56:49Z)
• The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization [68.8204255655161]
  We introduce a new convergence indicator that can be used to calculate whether the particles will finally converge to a single point or diverge. Using this convergence indicator we provide the actual bounds completely characterizing parameter regions that lead to a converging swarm.
  arXiv  Detail & Related papers  (2020-06-06T19:08:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.