MétaCan
Menu
Back to cohort
Record W2911305074 · doi:10.1109/cdc.2018.8619758

Graphon Linear Quadratic Regulation of Large-scale Networks of Linear Systems

2018· article· en· W2911305074 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks Stability and Synchronization
Canadian institutionsMcGill University
Fundersnot available
KeywordsControllabilityLinear-quadratic regulatorConvergence (economics)Limit (mathematics)Dynamical systems theoryLinear dynamical systemLinear systemQuadratic equationApplied mathematicsScale (ratio)Computer scienceRiccati equationOptimal controlControl theory (sociology)Controller (irrigation)MathematicsMathematical optimizationControl (management)Mathematical analysisPhysicsPartial differential equation

Abstract

fetched live from OpenAlex

We propose a graphon regulation methodology to solve linear quadratic regulator (LQR) problems for complex networks of dynamical systems following the formulation initiated in [1]. Conditions for the exact and approximate controllability of graphon dynamical systems are investigated. Approximation schemes are then developed to obtain finite dimensional LQR control laws which are utilized on large-scale network systems and for which the convergence properties are established. Finally, an example of the application of graphon-LQR control to networks of dynamical systems is given in which the Riccati equation of the limit graphon system is solved explicitly.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.906
Threshold uncertainty score0.325

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.012
GPT teacher head0.243
Teacher spread0.231 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it