Papers › PAC-Bayes Control: Learning Policies that Provably Generalize to Novel Environments

PAC-Bayes Control: Learning Policies that Provably Generalize to Novel Environments

11 Jun 2018arXiv:1806.04225archive 2025-07-28

Anirudha Majumdar, Alec Farid, Anoopkumar Sonar

Our goal is to learn control policies for robots that provably generalize well to novel environments given a dataset of example environments. The key technical idea behind our approach is to leverage tools from generalization theory in machine learning by exploiting a precise analogy (which we present in the form of a reduction) between generalization of control policies to novel environments and generalization of hypotheses in the supervised learning setting. In particular, we utilize the Probably Approximately Correct (PAC)-Bayes framework, which allows us to obtain upper bounds that hold with high probability on the expected cost of (stochastic) control policies across novel environments. We propose policy learning algorithms that explicitly seek to minimize this upper bound. The corresponding optimization problem can be solved using convex optimization (Relative Entropy Programming in particular) in the setting where we are optimizing over a finite policy space. In the more general setting of continuously parameterized policies (e.g., neural network policies), we minimize this upper bound using stochastic gradient descent. We present simulated results of our approach applied to learning (1) reactive obstacle avoidance policies and (2) neural network-based grasping policies. We also present hardware results for the Parrot Swing drone navigating through different obstacle environments. Our examples demonstrate the potential of our approach to provide strong generalization guarantees for robotic systems with continuous state and action spaces, complicated (e.g., nonlinear) dynamics, rich sensory inputs (e.g., depth images), and neural network-based policies.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 10 code samples harvested from 1 repository linked to this paper: 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 10 samples from 1 repository, 6 ran (6 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

irom-lab/PAC-Bayes-Control officialmentioned in papermentioned on GitHubBSD-3-ClauseSyntology: 10 samples, 6 ran (0 instrument-failed) · 4 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested: 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

6ran
4unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from irom-lab/PAC-Bayes-Control. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

irom-lab/PAC-Bayes-Control official repository 10 samples, 6 ran (0 instrument-failed) · 4 unverified
expected_cost Extension-Domain_Shifts/utils.py ran fingerprinted BSD-3-Clause (permissive) · 2fb362e87fc95efa · report fixture: signature p:ndarray/1/float, precomputed_costs:ndarray/2/float · returned float64 · level recorded 2026-09-25
generate_obstacles utils_simulation.py ran BSD-3-Clause (permissive) · bcfb58b7ccbd0875 · report fixture: signature p:MockPhysicsClient/0/?, heightObs:float/0/float, robotRadius:float/0/float · returned int · level recorded 2026-09-25
kl_divergence in 86 papers
census: 18 implementations from 18 papers, 15 distinct outputs across 7 buckets, one shared input per bucket
Extension-Domain_Shifts/utils.py ran fingerprinted BSD-3-Clause (permissive) · cbbc4f939b2eef2f · report fixture: signature p:float/0/float, q:float/0/float · returned float64 · level recorded 2026-09-25
kl_inverse optimize_PAC_bound.py ran fingerprinted BSD-3-Clause (permissive) · 792b054090d3d04d · report fixture: signature q:float/0/float, c:float/0/float · returned float64 · level recorded 2026-09-25
optimize_PAC_bound optimize_PAC_bound.py ran BSD-3-Clause (permissive) · b784191da03032db · report fixture: signature costs_precomputed:ndarray/2/float, p0:ndarray/1/float, delta:float/0/float · returned tuple · level recorded 2026-09-25
robot_update_state utils_simulation.py ran fingerprinted BSD-3-Clause (permissive) · 1367ffaf9c43fa2c · report fixture: signature state:list/1/float, u_diff:float/0/float · returned list · level recorded 2026-09-25
getDistances utils_simulation.py unverified BSD-3-Clause (permissive) · 18f46646194cedc3 · report
kl_inverse_l Extension-Domain_Shifts/utils.py unverified BSD-3-Clause (permissive) · 4f716bb619cd86fa · report
optimize_PAC_bound_MPB Extension-Domain_Shifts/optimize_PAC_bound.py unverified BSD-3-Clause (permissive) · aa0698dcefebb731 · report
optimize_PAC_bound_NPB Extension-Domain_Shifts/optimize_PAC_bound.py unverified BSD-3-Clause (permissive) · 7c22ea7dcb0a20d8 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections