Optimizes data acquisition in high-dimensional Bayesian optimization.
problem Suboptimal data acquisition in high-dimensional Bayesian optimization tasks.
method Utility-calibrated variational inference to align approximations with BO goals.
result Optimal data acquisition decisions under a limited computational budget.
A2MT learns agents to select which modalities to acquire at test time.
problem Learning agents to select modalities for multimodal temporal data acquisition.
method Perceiver IO architecture for active acquisition of multimodal temporal data.
result Agents successfully learn cost-reactive acquisition behavior on real-world datasets.
We develop BatchBALD, a tractable approximation to the mutual information between a batch of points and model parameters, which we use as an acquisition function to select multiple informative points jointly for the task of deep Bayesian active learning. BatchBALD is a greedy linear-time 1−e1-approximate a…
Dynamic acquisition of features improves predictions with limited data.
problem Limited or uncertain data requires additional relevant information for accurate assessments.
method Proposes models that dynamically acquire new features using conditional mutual information and arbitrary conditional flow.
result Demonstrates superior performance over baselines in multiple settings.
AFA evaluates AI feature acquisition strategies in domains with high costs.
problem Evaluate AI feature acquisition strategies in domains with high costs.
method Apply missing data methods and offline reinforcement learning under NDE and NUC assumptions.
result Propose a novel semi-offline reinforcement learning framework with three new estimators.
POLAR learns efficient data acquisition policies using pretrained belief representations.
problem Challenges in learning effective policies for adaptive data acquisition.
method POLAR decouples representation learning from policy learning by leveraging pretrained predictive foundation models as belief-state encoders.
result POLAR outperforms state-of-the-art methods across diverse tasks while requiring fewer training samples.
Proposes efficient data acquisition for personalized treatment effects from observational data.
problem Efficiently acquiring outcomes for personalized treatment effects in observational studies.
method Introduces causal, Bayesian acquisition functions to select points with overlapping support.
result Demonstrates improved sample efficiency and accuracy in learning personalized treatment effects.
GOIMDA selects inputs to maximize expected influence on a goal functional, reducing data acquisition needs.
problem Challenges in active data acquisition for learning and optimization tasks in deep neural networks.
method GOIMDA uses inverse curvature and goal gradient to select inputs maximizing expected influence on a specified goal functional.
result GOIMDA achieves target performance with fewer labeled samples or function evaluations compared to baselines.
A simple method improves batch active learning without high compute.
problem Efficient batch active learning in machine learning.
method Adapting standard single-point acquisition strategies to batch.
result Simple strategy performs as well as advanced batch methods.
Study improves feature acquisition for static settings in AFAPE.
problem Evaluate AFAPE performance in static feature settings.
method Derive and adapt IPW, DM, and DRL estimators for MAR and MNAR missingness.
result Improved data efficiency in synthetic and real-world experiments.
Model selection is treated as a standard performance boosting step in many machine learning applications. Once all other properties of a learning problem are fixed, the model is selected by grid search on a held-out validation set. This is strictly inapplicable to active learning. Within the standardized workflow, the …
BOOST automates kernel and acquisition function selection in Bayesian optimization.
problem Inappropriate kernel and acquisition function combinations lead to poor performance in Bayesian optimization.
method BOOST uses offline evaluation to predict and select the best kernel-acquisition function pair.
result BOOST consistently improves over fixed-hyperparameter BO and is competitive with state-of-the-art adaptive methods.
Generalization of voxelwise classifiers is hampered by differences between MRI-scanners, e.g. different acquisition protocols and field strengths. To address this limitation, we propose a Siamese neural network (MRAI-NET) that extracts acquisition-invariant feature vectors. These can consequently be used by task-specif…
Deep RL optimizes sensor placement in digital twins for dynamic data acquisition.
problem Limited applicability of traditional sensor placement techniques for online applications.
method Formulates sensor placement as a Markov decision process and uses deep reinforcement learning.
result Improves predictive accuracy and reliability of digital twins through adaptive sensor repositioning.
Meta-learning improves model performance by optimizing data acquisition.
problem Lack of operationally realistic data limits model performance.
method Gaussian process surrogate fit to metadata-driven training data variations.
result Meta-learning enhances model performance compared to random data acquisition.
A new method estimates uncertainty without explicit prediction models.
problem Costly data acquisition in machine learning.
method Distance-weighted Class Impurity method for uncertainty estimation.
result Distance-weighted Class Impurity effectively estimates uncertainty without prediction models.
Voxelwise classification approaches are popular and effective methods for tissue quantification in brain magnetic resonance imaging (MRI) scans. However, generalization of these approaches is hampered by large differences between sets of MRI scans such as differences in field strength, vendor or acquisition protocols. …
In many real-world scenarios where data is high dimensional, test time acquisition of features is a non-trivial task due to costs associated with feature acquisition and evaluating feature value. The need for highly confident models with an extremely frugal acquisition of features can be addressed by allowing a feature…
Slice Tuner optimizes data acquisition for accurate and fair machine learning models.
problem Acquiring enough data for all slices of data to ensure accurate and fair models.
method Selective data acquisition using convex optimization and iterative learning curve updates.
result Significantly outperforms baselines in model accuracy and fairness.
Bayesian optimization is a sample-efficient approach to solving global optimization problems. Along with a surrogate model, this approach relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Maximizing acquisition functions yields the best performance; unfortunately, t…
Evidence acquisition costs influence disclosure behavior and preference.
problem How evidence acquisition costs affect disclosure behavior and preference.
method Analyzes sender-receiver interactions with covert and overt evidence acquisition, varying certification costs.
result Equilibria converge to the Pareto-worst free-learning equilibrium as costs vanish, and receivers prefer covert to overt acquisition.
The paper improves Gaussian process models for efficient batch optimization.
problem Poor scaling and optimization loop issues in Gaussian process models.
method Dual GP parameterization for linear scaling and non-Gaussian likelihood updates.
result Extends sparse models to greedy batch fantasizing acquisition functions.
New method tackles constrained optimization in multi-fidelity Bayesian optimization.
problem Efficiently identifying feasible regions in constrained optimization problems.
method Proposes CMFBO method with novel acquisition functions.
result Demonstrates effectiveness on synthetic problems and real-world ICF and joint design problems.
Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions …
Bayesian optimization (BO) is a popular approach for expensive black-box optimization, with applications including parameter tuning, experimental design, robotics. BO usually models the objective function by a Gaussian process (GP), and iteratively samples the next data point by maximizing an acquisition function. In t…
Inexact acquisition solutions in BO lead to sublinear cumulative regret.
problem Inexact maximization of acquisition functions in Bayesian optimization.
method Define inaccuracy measure, establish cumulative regret bounds for GP-UCB and GP-TS.
result Inexact BO algorithms can achieve sublinear cumulative regret under appropriate inaccuracy conditions.
New methods prioritize acquiring confounding features for efficient treatment effect estimation.
problem Efficient treatment effect estimation from observational data with missing confounding information.
method Proposes two acquisition strategies: covariate balancing and reducing factual outcome error.
result Our proposed methods, especially reducing factual outcome error, improve sample efficiency for treatment effect estimation.
Proposes a meta-learning method for Bayesian optimization with neural network kernels.
problem Improving BO performance on high-dimensional data with complex structure.
method Meta-learning approach that trains a neural network policy to select the next data point to evaluate, using a reinforcement learning framework.
result The proposed method achieves better BO performance than existing methods on text document datasets.
This paper explores optimising acquisition functions in Bayesian optimisation.
problem Optimising acquisition functions in Bayesian optimisation is challenging due to their non-convex nature.
method The authors derive compositional forms for acquisition functions and use them to recast maximisation as a compositional optimisation problem.
result The compositional approach to maximising acquisition functions shows empirical advantages across various tasks.
This paper optimizes Bayesian acquisition functions in Gaussian Processes for better optimization.
problem Improving the efficiency of Bayesian optimization methods.
method Analysis of different acquisition functions and optimizers for optimizing Bayesian acquisition functions.
result Optimization of acquisition functions leads to faster and more accurate sampling points.
HH-VAEM improves imputation and acquisition of missing data using hierarchical models and Hamiltonian Monte Carlo.
problem Imputation and acquisition of missing heterogeneous data.
method Hierarchical VAE model with Hamiltonian Monte Carlo and automatic hyper-parameter tuning.
result HH-VAEM outperforms existing methods in imputation and supervised learning tasks.
MicAugment transfers audio style from few seconds of input to match target conditions.
problem Audio model robustness to diverse acquisition conditions.
method Identifies and applies transformations learned from target audio to input audio.
result MicAugment significantly improves model robustness in downstream tasks.
Paper shows statistical learning can't always lead to true knowledge.
problem Statistical learning and knowledge acquisition.
method Bayesian approach, Gibbs distribution, active information.
result Full learning and knowledge acquisition are not always possible.
Optimizes information acquisition to reduce estimation risk and maximize utility.
problem Estimation risk in investor decision-making.
method Derives closed-form value functions using CARA and CRRA utility functions, employs variational methods to explore optimal acquisition.
result Acquiring information earlier is more valuable in reducing estimation risk and achieving higher utility.
NM-PPG optimizes adaptive feature acquisition in POMDPs for better predictions.
problem Optimizing adaptive feature acquisition in prediction problems with costly features.
method Non-myopic pathwise policy gradients (NM-PPG) with continuous relaxation and straight-through rollout.
result NM-PPG outperforms state-of-the-art AFA methods on synthetic and real-world datasets.
Boundary effects inflate variance in Gaussian processes, leading to acquisition bias.
problem Boundary-induced acquisition bias in Gaussian processes.
method Traced root cause to geometric mechanism of kernel truncation at domain boundaries.
result Boundary effects create distortion that worsens with dimensionality, affecting acquisition behavior.
Feature missing is a serious problem in many applications, which may lead to low quality of training data and further significantly degrade the learning performance. While feature acquisition usually involves special devices or complex process, it is expensive to acquire all feature values for the whole dataset. On the…
Active testing for large language models is made more efficient and accurate.
problem Efficient evaluation of large language models with limited labels.
method Cost-saving measures and in-context learning for constructing a surrogate model.
result Significantly more accurate evaluations of LLM performance compared to random data acquisition.
Unified framework connects EI and information-theoretic acquisition functions.
problem Distinguish between Expected Improvement and information-theoretic acquisition functions.
method Introduces Variational Entropy Search (VES) to unify EI and information-theoretic approaches.
result EI can be seen as a variational inference approximation of Max-value Entropy Search (MES).
Proposes a new acquisition function for batched Bayesian optimization.
problem Intractability of acquisition functions for batched Bayesian optimization.
method Statistical physics inspired acquisition function for Gaussian processes.
result Demonstrates competitive performance on various problems.
A cost-effective approach to label acquisition using active learning markets.
problem Improving model fitting and training for predictive analytics.
method Formalizing market clearing as an optimisation problem, integrating budget constraints and improvement thresholds, using two active learning strategies with distinct pricing mechanisms.
result Superior performance with fewer labels acquired compared to conventional methods.
New acquisition function improves batch Bayesian active learning.
problem BatchBALD conflates epistemic and aleatoric uncertainty, leading to suboptimal performance.
method Focus on predictive probabilities to separate epistemic uncertainty, leading to better performance and faster evaluation.
result The new acquisition function performs better and allows for larger batches.
This paper optimizes sampling policies for Bayesian optimization to improve exploration and exploitation.
problem Improving the balance between exploration and exploitation in Bayesian optimization.
method Developed efficient methods to estimate and optimize non-myopic acquisition functions using rollout policies and stochastic gradient optimization.
result Efficient optimization of sampling policies leads to better performance in Bayesian optimization.
We seek decision rules for prediction-time cost reduction, where complete data is available for training, but during prediction-time, each feature can only be acquired for an additional cost. We propose a novel random forest algorithm to minimize prediction error for a user-specified {\it average} feature acquisition b…
We consider the problem of active feature acquisition, where we sequentially select the subset of features in order to achieve the maximum prediction performance in the most cost-effective way. In this work, we formulate this active feature acquisition problem as a reinforcement learning problem, and provide a novel fr…
KPCA-BO improves BO for high-dimensional optimization problems by learning a non-linear sub-manifold.
problem High-dimensional optimization problems where Gaussian Process regression requires too much data and computation.
method KPCA-BO embeds a non-linear sub-manifold in the search space, learning a GPR model on this sub-manifold.
result KPCA-BO outperforms vanilla BO in convergence speed, especially as dimensionality increases.
New methods improve global optimisation for expensive functions using lookahead strategies.
problem Optimising expensive functions without gradient info in high dimensions.
method Nonmyopic acquisition strategies based on approximate dynamic programming.
result Nonmyopic methods outperform myopic approaches in various applications.
This study improves hyperparameter optimization for categorical and non-normal data.
problem Bayesian hyperparameter optimization struggles with categorical hyperparameters and non-normal data.
method Integrates conformalized quantile regression to address estimation weaknesses and provides robust calibration guarantees.
result Quantile surrogate architectures and acquisition functions yield superior performance compared to existing methods.