← Search

Victor Picheny

7 accepted papers

2025

Omnipresent Yet Overlooked: Heat Kernels in Combinatorial Bayesian Optimization

NeurIPS 2025poster

Bayesian Optimization (BO) has the potential to solve various combinatorial tasks, ranging from materials science to neural architecture search. However, BO requires specialized kernels to effectively model combinatorial domains. Recent efforts have introduced several combinatorial kernels, but the…

Cited by 0SourceScholar
2023

Inducing Point Allocation for Sparse Gaussian Processes in High-Throughput Bayesian Optimisation

AISTATS 2023poster

Sparse Gaussian processes are a key component of high-throughput Bayesian optimisation (BO) loops; however, we show that existing methods for allocating their inducing points severely hamper optimisation performance. By exploiting the quality-diversity decomposition of determinantal point processes,…

2023

Spherical Inducing Features for Orthogonally-Decoupled Gaussian Processes

ICML 2023oral

Despite their many desirable properties, Gaussian processes (GPs) are often compared unfavorably to deep neural networks (NNs) for lacking the ability to learn representations. Recent efforts to bridge the gap between GPs and deep NNs have yielded a new class of inter-domain variational GPs in which…

Cited by 1SourcePDFScholar
2022

Bayesian quantile and expectile optimisation

UAI 2022poster

Bayesian optimisation (BO) is widely used to optimise stochastic black box functions. While most BO approaches focus on optimising conditional expectations, many applications require risk-averse strategies and alternative criteria accounting for the distribution tails need to be considered. In this…

2021

On Information Gain and Regret Bounds in Gaussian Process Bandits

AISTATS 2021poster

Consider the sequential optimization of an expensive to evaluate and possibly non-convex objective function $f$ from noisy feedback, that can be considered as a continuum-armed bandit problem. Upper bounds on the regret performance of several learning algorithms (GP-UCB, GP-TS, and their variants) a…

Cited by 166SourcePDFScholar
2021

Scalable Thompson Sampling using Sparse Gaussian Process Models

NeurIPS 2021poster

Thompson Sampling (TS) from Gaussian Process (GP) models is a powerful tool for the optimization of black-box functions. Although TS enjoys strong theoretical guarantees and convincing empirical performance, it incurs a large computational overhead that scales polynomially with the optimization budg…

Cited by 46SourcePDFScholar
2016

Bayesian optimization under mixed constraints with a slack-variable augmented Lagrangian

NeurIPS 2016poster

An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems which are then usually solved with local solvers. Recently, surrogate-based Bayesian optimization (BO) sub-solvers have been successfully deployed in the AL framework…