Pith. sign in

REVIEW 4 cited by

Fast PDE-constrained optimization via self-supervised operator learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.13297 v1 pith:E5GAFQEG submitted 2021-10-25 cs.LG math.OC

Fast PDE-constrained optimization via self-supervised operator learning

classification cs.LG math.OC
keywords controlcasesdesignoperatoroptimizationpde-constrainedproblemsvariables
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Design and optimal control problems are among the fundamental, ubiquitous tasks we face in science and engineering. In both cases, we aim to represent and optimize an unknown (black-box) function that associates a performance/outcome to a set of controllable variables through an experiment. In cases where the experimental dynamics can be described by partial differential equations (PDEs), such problems can be mathematically translated into PDE-constrained optimization tasks, which quickly become intractable as the number of control variables and the cost of experiments increases. In this work we leverage physics-informed deep operator networks (DeepONets) -- a self-supervised framework for learning the solution operator of parametric PDEs -- to build fast and differentiable surrogates for rapidly solving PDE-constrained optimization problems, even in the absence of any paired input-output training data. The effectiveness of the proposed framework will be demonstrated across different applications involving continuous functions as control or design variables, including time-dependent optimal control of heat transfer, and drag minimization of obstacles in Stokes flow. In all cases, we observe that DeepONets can minimize high-dimensional cost functionals in a matter of seconds, yielding a significant speed up compared to traditional adjoint PDE solvers that are typically costly and limited to relatively low-dimensional control/design parametrizations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Real-time optimal control with shallow recurrent decoder networks

    cs.LG 2026-07 conditional novelty 6.0

    A shallow recurrent decoder network maps time-lagged sparse sensor data directly to optimal distributed control actions for unseen parameter scenarios.

  2. A Single-Loop Bilevel Deep Learning Method for Optimal Control of Obstacle Problems

    math.OC 2026-01 conditional novelty 5.0

    Optimal control of obstacle problems is solved mesh-free by training constraint-embedding neural networks with S2-FOBA, a single-loop stochastic bilevel algorithm whose Moreau-penalized gradient converges sublinearly.

  3. Harnessing AI for Inverse Partial Differential Equation Problems: Past, Present, and Prospects

    cs.AI 2026-05 unverdicted novelty 4.0

    A survey organizing AI methods for inverse PDE problems into inverse problems, inverse design, and control categories, covering applications and future challenges like physics-informed models and uncertainty quantification.

  4. Towards Real Time Control of Water Engineering with Nonlinear Hyperbolic Partial Differential Equations

    math.OC 2025-12 conditional novelty 4.0

    Proposes a three-time-scale offline/meso/real-time architecture for real-time control of shallow-water-PDE-constrained hydropower systems, with a sketchy existence theorem and no implementation.