Pith. sign in

REVIEW 12 cited by

Bayesian Optimization with Unknown Constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1403.5607 v1 pith:FFUB46WP submitted 2014-03-22 stat.ML cs.LG

classification stat.MLcs.LG
keywords constraintsoptimizationbayesianeffectivenessproblemsfunctionsgeneralobjective
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recent work on Bayesian optimization has shown its effectiveness in global optimization of difficult black-box objective functions. Many real-world optimization problems of interest also have constraints which are unknown a priori. In this paper, we study Bayesian optimization for constrained problems in the general case that noise may be present in the constraint functions, and the objective and constraints may be evaluated independently. We provide motivating practical examples, and present a general framework to solve such problems. We demonstrate the effectiveness of our approach on optimizing the performance of online latent Dirichlet allocation subject to topic sparsity constraints, tuning a neural network given test-time memory constraints, and optimizing Hamiltonian Monte Carlo to achieve maximal effectiveness in a fixed time, subject to passing standard convergence diagnostics.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 12 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 289 citations worldwide. Full citation record

  1. Copy First, Translate Later: Interpreting Translation Dynamics in Multilingual Pretraining

    cs.CL 2026-04 unverdicted novelty 7.0 of 10

    SLO-Guard, a crash-aware two-phase autotuner for vLLM serving, achieves no best-latency improvement over random search but demonstrates more consistent budget allocation across 150 trials on Qwen2-1.5B/A100.

  2. Agentic Bayesian Optimization through Surrogate-Augmented Autoresearch

    cs.LG 2026-07 conditional novelty 6.0 of 10

    An LLM agent that fully controls a reconfigurable Bayesian-optimization backend preserves standard BO reliability, outperforms LLM-only optimizers, and exploits natural-language priors and mid-run problem reformulation.

  3. Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds

    cs.NE 2026-07 conditional novelty 6.0 of 10

    A GP-guided neural parametric model learns threshold-to-solution maps for expensive constrained problems, enabling fast prediction and one-step refinement for arbitrary unseen thresholds.

  4. Black-Box Optimization for Identifying and Inverting Audio Dynamic Range Control Effects

    cs.SD 2026-07 conditional novelty 6.0 of 10

    Blind DRC parameter estimation and inversion can be framed as derivative-free optimization in a dynamic-histogram feature space, yielding competitive reconstructions against neural baselines.

  5. Safe Bayesian Optimization with Counterfactual Policies

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Conformal intervals for counterfactual baseline outcomes can be nested inside online conformal SafeOpt to keep safety-constraint violations at or below a user-specified rate under weighted exchangeability.

  6. Safe Contextual Bayesian Optimization for Sustainable Room Temperature PID Control Tuning

    cs.LG 2019-06 unverdicted novelty 6.0 of 10

    Safe contextual Bayesian optimization tunes real-world PID controllers for room temperature, achieving 32% cost savings with explicit safety constraints.

  7. Evolutionary Intelligence for Scientific Discovery: From Evolutionary Computation to Cumulative Discovery Systems

    cs.NE 2026-07 accept novelty 5.0 of 10

    Evolutionary intelligence reframes evolutionary computation as cumulative scientific discovery by retaining search trajectories, failures, and lineages across cycles.

  8. A Human-in-the-Loop Bayesian Optimization Framework for Constraint-Aware Bioprocess Development

    cs.LG 2026-06 unverdicted novelty 4.0 of 10

    An extension of PFGS adds posterior probability of constraint satisfaction and Monte Carlo robustness estimation as Pareto objectives for interactive candidate selection in Bayesian optimization, demonstrated on an 8D...

  9. Target-confidence Recourse Using tSeTlin machines: TRUST

    cs.LG 2026-06 unverdicted novelty 4.0 of 10

    TRUST searches for minimal input changes that achieve a user-defined confidence target in PTM models, claiming perfect robustness and low cost on benchmarks versus standard boundary-crossing methods.

  10. Position: Intelligent Science Laboratory Requires the Integration of Cognitive and Embodied AI

    cs.AI 2025-06 unverdicted novelty 4.0 of 10

    The paper argues that integrating cognitive AI and embodied robots into closed-loop Intelligent Science Laboratories is essential for the next leap in automated scientific discovery.

  11. High-Dimensional Bayesian Optimisation with Large-Scale Constraints via Latent Space Gaussian Processes

    cs.CE 2024-12 conditional novelty 4.0 of 10

    Compressing thousands of constraints into a low-dimensional latent space lets Bayesian optimization solve a 108D aeroelastic-tailoring problem with 1,786 black-box constraints, at the cost of slightly worse solution q...

  12. Derivation of Output Correlation Inferences for Multi-Output (aka Multi-Task) Gaussian Process

    cs.LG 2025-01 reject novelty 2.0 of 10

    A tutorial that re-derives the known EM and gradient formulas for multi-task Gaussian processes, with two mathematical errors in the presented derivations.

Pith tools