AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Learning Optimal Feedback Operators and their Sparse Polynomial Approximations

Karl Kunisch, Donato Vásquez-Varas, Daniel Walter

JMLR 2023 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
increase number of training initial conditions (ablation)learned feedback law · Cucker-Smale optimal consensustest error: cardinalities 5, 10, 15 and 20; errors smaller than 2.1 %Improved
train with two or more initial conditions instead of one (ablation)learned feedback law · Modified Van der Pol oscillatorstabilization of test initial conditions: one initial condition fails near right-hand branch; two or more steer all to originImproved
increase training set size from 1 to 2 (ablation)learned feedback law · LC-circuitobjective error bars: Ntrain = 1 error-bars distinctly larger than Ntrain = 2 and 10Improved
increase polynomial degree (ablation)learned feedback law · Modified Van der Pol oscillatorsupport cardinality and solve time: degrees 4 to 8; closed-loop solve time under 0.42 secondsHurt
increase sparsity penalty gamma from 1e-1 to 1e-3 (ablation)learned feedback law · Allen-Cahn equationMNSE_J: slope 0.6 and intercept 0.13 at gamma 1e-1 to closer to identity at 1e-3Improved
increase gamma (ablation)learned feedback law · Allen-Cahn equationsupport size and training time: support size decreases with gamma over 10^-1 to 10^-6Improved
increase training cardinality from 5 to 20 (ablation)learned feedback law · Allen-Cahn (gamma 1e-3)regression to identity line: cardinality 5 to 20Improved
use full gradient (38) instead of greedy (40) in Algorithm 1 (ablation)learned feedback law · Cucker-Smale optimal consensuserror and training time: (40) gave larger errors and training times but sparser solutionsMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy