← Search

Ichiro Takeuchi

30 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

Quantifying Statistical Significance of Deep Nearest Neighbor Anomaly Detection via Selective Inference

NeurIPS 2025poster

In real-world applications, anomaly detection (AD) often operates without access to anomalous data, necessitating semi-supervised methods that rely solely on normal data. Among these methods, deep $k$-nearest neighbor (deep $k$NN) AD stands out for its interpretability and flexibility, leveraging di…

Cited by 0SourceScholar
2025

Statistical Test for Auto Feature Engineering by Selective Inference

AISTATS 2025poster

Auto Feature Engineering (AFE) plays a crucial role in developing practical machine learning pipelines by automating the transformation of raw data into meaningful features that enhance model performance. By generating features in a data-driven manner, AFE enables the discovery of important features…

Cited by 0SourcecodeScholar
2025

Statistical Test for Feature Selection Pipelines by Selective Inference

ICML 2025oral

A data analysis pipeline is a structured sequence of steps that transforms raw data into meaningful insights by integrating various analysis algorithms. In this paper, we propose a novel statistical test to assess the significance of data analysis pipelines. Our approach enables the systematic devel…

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 8SourcePDFScholar
2024

CAD-DA: Controllable Anomaly Detection after Domain Adaptation by Statistical Inference

AISTATS 2024poster

We propose a novel statistical method for testing the results of anomaly detection (AD) under domain adaptation (DA), which we call CAD-DA—controllable AD under DA. The distinct advantage of the CAD-DA lies in its ability to control the probability of misidentifying anomalies under a pre-specified l…

Cited by 12SourcePDFScholar
2024

Multi-Objective Bayesian Optimization with Active Preference Learning

AAAI 2024technical

There are a lot of real-world black-box optimization problems that need to optimize multiple criteria simultaneously. However, in a multi-objective optimization (MOO) problem, identifying the whole Pareto front requires the prohibitive search cost, while in many practical scenarios, the decision mak…

Cited by 4SourcePDFScholar
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

Statistical Test for Attention Maps in Vision Transformers

ICML 2024poster

The Vision Transformer (ViT) demonstrates exceptional performance in various computer vision tasks. Attention is crucial for ViT to capture complex wide-ranging relationships among image patches, allowing the model to weigh the importance of image patches and aiding our understanding of the decision…

Cited by 8SourcePDFScholar
2023

A stopping criterion for Bayesian optimization by the gap of expected minimum simple regrets

AISTATS 2023poster

Bayesian optimization (BO) improves the efficiency of black-box optimization; however, the associated computational cost and power consumption remain dominant in the application of machine learning methods. This paper proposes a method of determining the stopping time in BO. The proposed criterion i…

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
2022

Fast and More Powerful Selective Inference for Sparse High-Order Interaction Model

AAAI 2022technical

Automated high-stake decision-making, such as medical diagnosis, requires models with high interpretability and reliability. We consider the sparse high-order interaction model as an interpretable and reliable model with a good prediction ability. However, finding statistically significant high-orde…

2022

Quantifying Statistical Significance of Neural Network-based Image Segmentation by Selective Inference

NeurIPS 2022accept

Although a vast body of literature relates to image segmentation methods that use deep neural networks (DNNs), less attention has been paid to assessing the statistical reliability of segmentation results. In this study, we interpret the segmentation results as hypotheses driven by DNN (called DNN-d…

Cited by 21SourcePDFScholar
2021

More Powerful and General Selective Inference for Stepwise Feature Selection using Homotopy Method

ICML 2021spotlight

Conditional selective inference (SI) has been actively studied as a new statistical inference framework for data-driven hypotheses. The basic idea of conditional SI is to make inferences conditional on the selection event characterized by a set of linear and/or quadratic inequalities. Conditional SI…

2021

Parametric Programming Approach for More Powerful and General Lasso Selective Inference

AISTATS 2021poster

Selective Inference (SI) has been actively studied in the past few years for conducting inference on the features of linear models that are adaptively selected by feature selection methods such as Lasso. The basic idea of SI is to make inference conditional on the selection event. Unfortunately, the…

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
2020

Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming

NeurIPS 2020spotlight

Although there is a vast body of literature related to methods for detecting change-points (CPs), less attention has been paid to assessing the statistical reliability of the detected CPs. In this paper, we introduce a novel method to perform statistical inference on the significance of the CPs, est…

2020

Multi-fidelity Bayesian Optimization with Max-value Entropy Search and its Parallelization

ICML 2020poster

In a standard setting of Bayesian optimization (BO), the objective function evaluation is assumed to be highly expensive. Multi-fidelity Bayesian optimization (MFBO) accelerates BO by incorporating lower fidelity observations available with a lower sampling cost. We propose a novel information-theor…

Cited by 150SourcePDFScholar
2020

Multi-scale Domain-adversarial Multiple-instance CNN for Cancer Subtype Classification with Unannotated Histopathological Images

CVPR 2020oral

We propose a new method for cancer subtype classification from histopathological images, which can automatically detect tumor-specific features in a given whole slide image (WSI). The cancer subtype should be classified by referring to a WSI, i.e., a large-sized image (typically 40,000x40,000 pixels…

Cited by 230PDFScholar
2019

Post Selection Inference with Incomplete Maximum Mean Discrepancy Estimator

ICLR 2019poster

Measuring divergence between two distributions is essential in machine learning and statistics and has various applications including binary classification, change point detection, and two-sample test. Furthermore, in the era of big data, designing divergence measure that is interpretable and can ha…

Cited by 28SourcePDFScholar
2019

Safe Grid Search with Optimal Complexity

ICML 2019oral

Popular machine learning estimators involve regularization parameters that can be challenging to tune, and standard strategies rely on grid search for this task. In this paper, we revisit the techniques of approximating the regularization path up to predefined tolerance $\epsilon$ in a unified frame…

2017

Selective Inference for Sparse High-Order Interaction Models

ICML 2017poster

Finding statistically significant high-order interactions in predictive modeling is important but challenging task because the possible number of high-order interactions is extremely large (e.g., $> 10^{17}$). In this paper we study feature selection and statistical inference for sparse high-order i…

Cited by 54SourcePDFScholar
2016

Simultaneous Safe Screening of Features and Samples in Doubly Sparse Modeling

ICML 2016poster

The problem of learning a sparse model is conceptually interpreted as the process of identifying active features/samples and then optimizing the model over them. Recently introduced safe screening allows us to identify a part of non-active features/samples. So far, safe screening has been individual…

2015

Regularization Path of Cross-Validation Error Lower Bounds

NeurIPS 2015poster

Careful tuning of a regularization parameter is indispensable in many machine learning tasks because it has a significant impact on generalization performances.Nevertheless, current practice of regularization parameter tuning is more of an art than a science, e.g., it is hard to tell how many grid-p…