Backend
Noether's Second Theorem and the Pareto Front Structure in Multi-Criteria Variational Problems
arXiv cs.SY0 views
arXiv:2611.06920v1 Announce Type: cross Abstract: This paper establishes a rigorous connection between Noether's second theorem and the structure of Pareto fronts in multi-criteria variational problems. We prove that for a family of functionals invariant under a common gauge Lie group, the regular part of the Pareto front is contained in the union of solutions to weighted Euler--Lagrange equations, and that on Pareto-optimal sections, combinations of Noether currents are conserved. Gauge symmetries are shown to impose additional constraints on the Lagrange multipliers via Bianchi-type identities, reducing the dimension of the admissible weight space. Two practical approaches are derived from this result: dimensionality reduction via gauge fixing and scalarization with penalty terms. The theory is validated on three classical problems: the linear-quadratic regulator with two criteria, a model predictive control problem with a minimax criterion, and the double integrator with control constraints. In each case, the Pareto front is shown to satisfy an exact conservation law, and the analytical structure of the front is recovered from the symmetries of the problem. The results demonstrate that gauge functions (null Lagrangians) can restore invariants even when the dynamics break the symmetry, and that control constraints do not destroy the underlying conservation laws but merely restrict the admissible set. The proposed approach yields a Pareto front with minimal deviation from the theoretical curve, outperforming known multi-objective algorithms, and provides a new foundation for the analytical treatment of multi-criteria optimization in nonlinear dynamics and control.
Source:https://arxiv.org/abs/2611.06920PreviousA Hybrid Framework for Explainable Aviation Risk: Causal Chain Extraction from Safety Reports with Physics-Based Failure Quantification and Interventional AnalysisNextStochastic Dynamics of Generative AI: From Autoregressive Models to Interacting LLM Networks and Neural SDEs
Related posts
The Verdict Compiler: Pre-Registering a 90-Minute Spike
0dev.to
Reviewing an Agent PR That Adds Request Coalescing: The Colliding Cache Key, the Test That Lied, and the Meter That Double-Charged
0dev.to
Portability Before Spill: A Two-Path Conformance Harness for Local-First Agents
0dev.to
Social media uploads without an API: an uploader that drives the browser
0dev.to
Benchmark Budgets Are Part of the Grader: A Paired Cost and Latency Gate for AI C++ Patches
0dev.to
Split Your Docs by Claim Type, Not by Section Size: A Manifest That Decides What a Model May Draft
0dev.to