{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/closing-the-gap-to-quadratic-invariance-a","title":"Closing the Gap to Quadratic Invariance: a Regret Minimization Approach to Optimal Distributed Control","arxiv_id":"2311.02068","date":"2023-11-03","proceeding":null,"authors":["Daniele Martinelli","Andrea Martin","Giancarlo Ferrari-Trecate","Luca Furieri"],"abstract":"In this work, we focus on the design of optimal controllers that must comply with an information structure. State-of-the-art approaches do so based on the H2 or Hinfty norm to minimize the expected or worst-case cost in the presence of stochastic or adversarial disturbances. Large-scale systems often experience a combination of stochastic and deterministic disruptions (e.g., sensor failures, environmental fluctuations) that spread across the system and are difficult to model precisely, leading to sub-optimal closed-loop behaviors. Hence, we propose improving performance for these scenarios by minimizing the regret with respect to an ideal policy that complies with less stringent sensor-information constraints. This endows our controller with the ability to approach the improved behavior of a more informed policy, which would detect and counteract heterogeneous and localized disturbances more promptly. Specifically, we derive convex relaxations of the resulting regret minimization problem that are compatible with any desired controller sparsity, while we reveal a renewed role of the Quadratic Invariance (QI) condition in designing informative benchmarks to measure regret. Last, we validate our proposed method through numerical simulations on controlling a multi-agent distributed system, comparing its performance with traditional H2 and Hinfty policies.","url_abs":"https://arxiv.org/abs/2311.02068v2","url_pdf":"https://arxiv.org/pdf/2311.02068v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"closing-the-gap-to-quadratic-invariance-a","repo_url":"https://github.com/decodepfl/spregret","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[],"methods":[{"method_slug":"focus","method_name":"Focus"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2311.02068","atlas_url":"https://app.syntology.ai/?focus=2311.02068","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2311.02068"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2311.02068\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2311.02068"},"call":"get_concepts_for_paper(arxiv_id=\"2311.02068\")"}],"by_repo":[{"repo":"decodepfl/spregret","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f7d1fee1bc700ee50d0b59ff0d44b3e3bd59b11f747e90f0d00f333d4f1fcc4c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}