Papers › Transductive Active Learning with Application to Safe Bayesian Optimization

Transductive Active Learning with Application to Safe Bayesian Optimization

12 Jul 2024ICML Workshop on Aligning Reinforcement Learning Experimentalists and Theorists 2024 7archive 2025-07-28

Jonas Hübotter, Bhavya Sukhija, Lenart Treven, Yarden As, Andreas Krause

Safe Bayesian optimization (Safe BO) is the task of learning an optimal policy within an unknown environment, while ensuring that safety constraints are not violated. We analyze Safe BO under the lens of a generalization of active learning with concrete prediction targets where sampling is restricted to an accessible region of the domain, while prediction targets may lie outside this region. We study a family of policies that sample adaptively to minimize uncertainty about prediction targets. We are the first to show, under general regularity assumptions, that such policies converge uniformly to the smallest possible uncertainty obtainable from the accessible data. Leveraging this result, we apply our framework to Safe BO and demonstrate that our policies improve substantially upon the state-of-the-art.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

jonhue/transductive-active-learning jaxMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Transductive Active Learning: Theory and Applications (arXiv:2402.15898; that paper's own run record: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Active LearningBayesian OptimizationPredictionReinforcement Learning (RL)Safe ExplorationSafe Reinforcement LearningTransductive Learning

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