← Search

Yu Inatsu

10 accepted papers

2025

Distributionally Robust Active Learning for Gaussian Process Regression

ICML 2025poster

Gaussian process regression (GPR) or kernel ridge regression is a widely used and powerful tool for nonlinear prediction. Therefore, active learning (AL) for GPR, which actively collects data labels to achieve an accurate prediction with fewer data labels, is an important problem. However, existing…

Cited by 0SourcePDFScholar
2025

No-Regret Bayesian Optimization with Stochastic Observation Failures

AISTATS 2025poster

We study Bayesian optimization problems where observation of the objective function fails stochastically, e.g., synthesis failures in materials development. For this problem, although several heuristic methods have been proposed, they do not have theoretical guarantees and sometimes deteriorate in p…

Cited by 0SourceScholar
2024

Bounding Box-based Multi-objective Bayesian Optimization of Risk Measures under Input Uncertainty

AISTATS 2024poster

In this study, we propose a novel multi-objective Bayesian optimization (MOBO) method to efficiently identify the Pareto front (PF) defined by risk measures for black-box functions under the presence of input uncertainty (IU). Existing BO methods for Pareto optimization in the presence of IU are ris…

Cited by 1SourcePDFScholar
2024

Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds

ICML 2024poster

Among various acquisition functions (AFs) in Bayesian optimization (BO), Gaussian process upper confidence bound (GP-UCB) and Thompson sampling (TS) are well-known options with established theoretical properties regarding Bayesian cumulative regret (BCR). Recently, it has been shown that a randomize…

Cited by 5SourcePDFScholar
2024

Risk Seeking Bayesian Optimization under Uncertainty for Obtaining Extremum

AISTATS 2024poster

Real-world black-box optimization tasks often focus on obtaining the best reward, which includes an intrinsic random quantity from uncontrollable environmental factors. For this problem, we formulate a novel risk-seeking optimization problem whose aim is to obtain the best possible reward within a f…

Cited by 1SourcePDFScholar
2023

Randomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Bounds

ICML 2023poster

Gaussian process upper confidence bound (GP-UCB) is a theoretically promising approach for black-box optimization; however, the confidence parameter $\beta$ is considerably large in the theorem and chosen heuristically in practice. Then, randomized GP-UCB (RGP-UCB) uses a randomized confidence param…

Cited by 16SourcePDFScholar
2022

Bayesian Optimization for Distributionally Robust Chance-constrained Problem

ICML 2022spotlight

In black-box function optimization, we need to consider not only controllable design variables but also uncontrollable stochastic environment variables. In such cases, it is necessary to solve the optimization problem by taking into account the uncertainty of the environmental variables. Chance-cons…

Cited by 14SourcePDFScholar
2020

Computing Valid P-Values for Image Segmentation by Selective Inference

CVPR 2020poster

Image segmentation is one of the most fundamental tasks in computer vision. In many practical applications, it is essential to properly evaluate the reliability of individual segmentation results. In this study, we propose a novel framework for quantifying the statistical significance of individual…

Cited by 34PDFScholar