Pith. sign in

REVIEW 5 cited by

The Vizier Gaussian Process Bandit Algorithm

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 2408.11527 v3 pith:2LYJGGU7 submitted 2024-08-21 cs.LG cs.AImath.OC

classification cs.LGcs.AImath.OC
keywords algorithmviziergooglemultiplenumerousresearchacceleratedbandit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Google Vizier has performed millions of optimizations and accelerated numerous research and production systems at Google, demonstrating the success of Bayesian optimization as a large-scale service. Over multiple years, its algorithm has been improved considerably, through the collective experiences of numerous research efforts and user feedback. In this technical report, we discuss the implementation details and design choices of the current default algorithm provided by Open Source Vizier. Our experiments on standardized benchmarks reveal its robustness and versatility against well-established industry baselines on multiple practical modes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RoboBallet: Planning for Multi-Robot Reaching with Graph Neural Networks and Reinforcement Learning

    cs.RO 2025-09 conditional novelty 6.0 of 10

    A graph-neural-network policy trained with reinforcement learning solves joint task allocation, scheduling, and motion planning for multi-robot reaching, scaling to eight arms and 40 tasks with zero-shot generalization.

  2. Performance Prediction for Large Systems via Text-to-Text Regression

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A 60M-parameter text-to-text regression model predicts Google Borg cluster efficiency from raw system logs, achieving up to 0.99 rank correlation and 100x lower MSE than tabular baselines.

  3. Efficient Heteroscedastic Bayesian Optimization for Risk-Aware AutoRL

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Adaptive re-sampling of RAHBO finds reliable RL hyperparameters more sample-efficiently than fixed-replication risk-averse or risk-neutral BO on offline multi-seed datasets.

  4. Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A string-based, metadata-guided language model framework for universal offline black-box optimization, with two variants and two embedding regularizations.

  5. Rethinking Data Mixture for Large Language Models: A Comprehensive Survey and New Perspectives

    cs.CL 2025-05 accept novelty 5.0 of 10

    A survey organizing LLM data mixture methods into offline and online families, with a fine-grained taxonomy based on optimization frameworks.

Pith tools