Approximation by Simple Poles—Part II: System Level Synthesis Beyond Finite Impulse Response
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In Part I, a novel Galerkin-type method for finite dimensional approximations of transfer functions in Hardy space was developed based on approximation by simple poles. In Part II, this approximation is applied to system level synthesis, a recent approach based on a clever reparameterization, to develop a new technique for optimal control design. To solve system level synthesis problems, prior work relies on finite impulse response approximations that lead to deadbeat control, and that can experience infeasibility and increased suboptimality, especially in systems with large separation of time scales. The new design method does not result in deadbeat control, is convex and tractable, always feasible, can incorporate prior knowledge, and works well for systems with large separation of time scales. Suboptimality bounds with convergence rate depending on the geometry of the pole selection are provided. An example demonstrates superior performance of the method.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it