New method designs experiments robustly for nonlinear estimation, improving parameter knowledge.
problem Designing robust experiments for nonlinear estimation under parametric uncertainty.
method Multi-stage robust optimization framework for sequential experiments.
result Identifies experiments better conducted early for improved parameter knowledge.
Combines multi-fidelity and asynchronous batch methods for faster experimental design.
problem Designing optimal experimental setups for battery performance.
method Algorithm combining multi-fidelity and asynchronous batch Bayesian Optimization.
result Algorithm outperforms single-fidelity batch and multi-fidelity sequential methods.
Neural Optimal Design of Experiments improves inverse problem solving efficiency.
problem Optimal experimental design in inverse problems.
method Jointly trains a reconstruction model and design variables in a single loop.
result Significantly reduces computational complexity and improves reconstruction accuracy.
Paper uses transfer learning and Bayesian optimization to reduce DNA sequence design experiments.
problem Designing many similar DNA sequences for specific applications is expensive and time-consuming.
method Combines transfer learning with Bayesian optimization to reduce experiment count.
result Total number of experiments can be significantly reduced by sharing information between tasks.
Paper proposes a new method for efficient hyperparameter optimization.
problem Challenging task of optimizing hyperparameters in machine learning.
method Sequential Uniform Design (SeqUD) strategy for adaptive and efficient exploration of hyperparameter space.
result The proposed SeqUD strategy outperforms existing methods in hyperparameter optimization.
Paper develops an efficient algorithm for experiment design using synthetic controls.
problem Designing optimal experiments for treatment effect estimation.
method Solves a phase synchronization problem via a normalized generalized power method.
result First global optimality guarantee for experiment design with pre-treatment data.
We introduce Bayesian optimization, a technique developed for optimizing time-consuming engineering simulations and for fitting machine learning models on large datasets. Bayesian optimization guides the choice of experiments during materials design and discovery to find good material designs in as few experiments as p…
Paper optimizes experimental design for estimating treatment effect.
problem Estimating treatment effect with heterogeneous subjects and treatments.
method Adaptive experimental design incorporating bandit learning.
result Demonstrates optimality of proposed adaptive experiment framework.
Design of experiments improves validation of biomolecular networks.
problem Efficiently validate non-machine learning designed biomolecular networks.
method Use Gaussian processes and Bayesian optimization to select experimental points.
result Developed a stopping criterion based on discrepancy metric and uncertainty.
New method optimizes experiments under constraints.
problem Adapting BED to dynamic constraints in real-world tasks.
method Offline pre-training of an amortized policy and posterior network with online multi-step lookahead planning.
result Significantly more informative design sequences than existing methods.
This study optimizes covariate density and propensity score for efficient ATE estimation.
problem Efficiently estimating average treatment effects (ATEs) with minimal variance.
method Adaptive experiment optimizing both covariate density and propensity score.
result Proposed method minimizes the semiparametric efficiency bound for ATE estimation.
CO-BED optimizes experiments using Bayesian methods and information theory.
problem Optimizing experiments in a context-dependent manner.
method Formalizes contextual optimization with Bayesian experimental design, employing information-theoretic principles and black-box variational methods.
result CO-BED provides a general solution for contextual optimization problems.
The paper proposes an efficient nested simulation design using likelihood ratio method.
problem Designing nested simulations with fixed outer scenarios and minimizing simulation effort.
method Proposes a bi-level optimization problem to decide inner replications and pooling strategies.
result Optimized design achieves $\cO(Γ^{-1})$ mean squared error of estimators.
vsOED optimizes experiment design with reinforcement learning for Bayesian models.
problem Optimizing the sequence of experiments in Bayesian models for efficient data collection.
method Reinforcement learning with variational posterior approximations to optimize design policy.
result vsOED achieves superior sample efficiency compared to existing methods.
In this paper, we study the design and analysis of experiments conducted on a set of units over multiple time periods where the starting time of the treatment may vary by unit. The design problem involves selecting an initial treatment time for each unit in order to most precisely estimate both the instantaneous and cu…
A new method designs batches for Bayesian optimization more efficiently.
problem Efficiently designing batches for Bayesian optimization to reduce total time.
method Minimal Terminal Variance (MTV) acquisition function, optimizing I-optimality criterion.
result MTV designs batches more efficiently than other methods, as shown by numerical experiments.
Algorithm selects optimal experiments in Markov chains to learn unknown quantities.
problem Designing efficient experiments in Markov chains to learn about unknown quantities.
method Proposes extsc{markov-design} algorithm for sequential policy selection.
result Algorithm provably converges to optimal measurement allocation.
We use deep reinforcement learning to optimize experimental designs efficiently.
problem Optimizing sequential experimental designs with limited exploration and black-box models.
method Reduced the optimal design problem to an MDP and solved it with deep reinforcement learning.
result Our approach achieves state-of-the-art performance on both continuous and discrete design spaces.
We introduce a fully stochastic gradient based approach to Bayesian optimal experimental design (BOED). Our approach utilizes variational lower bounds on the expected information gain (EIG) of an experiment that can be simultaneously optimized with respect to both the variational and design parameters. This allows the …
GoBOED optimizes experiments for specific decision-making objectives, improving downstream outcomes.
problem Reducing parameter uncertainty does not always improve decision-making in critical settings.
method Combines variational posterior surrogate and differentiable convex decision layer for gradient-based design optimization.
result GoBOED identifies designs that better align with specific decision objectives and reveals wider optimal design windows.
Expands Bayesian experiment design framework to account for model discrepancies.
problem Model misspecification in Bayesian optimal experiment design.
method Introduces Expected General Information Gain and Expected Discriminatory Information criteria.
result Demonstrates improved robustness and detection capabilities in experiment design.
Transformer RL optimizes A/B testing for time series experiments.
problem Challenges in applying A/B testing to time series experiments, especially with limited history and strong assumptions.
method Transformer reinforcement learning approach that conditions allocation on full history and optimizes MSE without restrictive assumptions.
result Consistently outperforms existing designs in synthetic, simulator, and real-world data.
Optimizes recommender selection online with D-optimal design.
problem Finding the optimal recommender in online exploration-exploitation.
method Leverages D-optimal design from statistics to maximize information gain.
result Achieves maximum information gain during online exploration.
iDAD uses neural networks to quickly adapt experiments without likelihoods.
problem Performing adaptive experiments in real-time with implicit models.
method iDAD learns a design policy network upfront to make quick design decisions.
result iDAD can make design decisions in milliseconds, unlike traditional BOED approaches.
The design of multiple experiments is commonly undertaken via suboptimal strategies, such as batch (open-loop) design that omits feedback or greedy (myopic) design that does not account for future effects. This paper introduces new strategies for the optimal design of sequential experiments. First, we rigorously formul…
Bayesian SDOE method estimates QoIs from expensive black-box functions efficiently.
problem Estimating non-linear QoIs from expensive, unknown functions.
method Sequential design of experiments using Bayesian surrogate models and information gain.
result Method efficiently estimates QoIs with limited function evaluations.
Optimizes expensive experiments by incorporating expert knowledge.
problem Expensive experiments require minimizing the number of trials.
method Bayesian optimization with posterior sampling of expert knowledge.
result Demonstrates significant efficiency gains in experiments and hyperparameter tuning.
Bayesian design improves experimental optimization.
problem Computational challenges limit BED practical use.
method Recent advances in BED have reduced computational burdens.
result Effective BED design is now feasible.
Bayesian sOED uses PG reinforcement learning for efficient experiment design.
problem Optimizing sequential experiments for nonlinear models with limited data.
method Formulated as POMDP, solved via PG methods with neural network parameterization.
result Demonstrated advantages over batch and greedy designs in contaminant source inversion.
DAD learns to design experiments quickly, outperforming traditional methods.
problem Real-time decision-making in sequential Bayesian experimental design.
method Amortized design network trained with contrastive information bounds.
result DAD outperforms alternative strategies on various problems.
New method optimizes multiple objectives in A/B testing for AI and clinical trials.
problem Minimizing cumulative regret, maximizing CATE, and ensuring differential privacy in large-scale experiments.
method ConSE and DP-ConSE algorithms for sequential segmentation and elimination, achieving Pareto-optimal frontier.
result Privacy comes 'for free' in our framework, with only asymptotically negligible costs to regret and accuracy.
We introduce an application of the group lasso to design of experiments. Note that we are NOT trying to explain experimental design for the group lasso. Conversely, we explain how we can use the idea of the group lasso in experimental design, showing that the problem of constructing an optimal design matrix can be tran…
The paper optimizes spatial experimental designs to improve causal effect estimation.
problem Optimizing spatial experimental designs to enhance causal effect estimation accuracy.
method Proposes a surrogate function for MSE and uses graph cut algorithms to learn optimal designs.
result The method accommodates spatial interference and covariance, is computationally efficient, and validated by theoretical and numerical experiments.
We study the problem of causal structure learning over a set of random variables when the experimenter is allowed to perform at most M experiments in a non-adaptive manner. We consider the optimal learning strategy in terms of minimizing the portions of the structure that remains unknown given the limited number of e…
Unified approach for sequence design combining likelihood-free inference and black-box optimization.
problem Designing biological sequences efficiently and accurately.
method Unified probabilistic framework integrating likelihood-free inference and black-box optimization.
result Previous optimization methods can be adapted and new algorithms proposed within this framework.
Bayesian optimal design of experiments (BODE) has been successful in acquiring information about a quantity of interest (QoI) which depends on a black-box function. BODE is characterized by sequentially querying the function at specific designs selected by an infill-sampling criterion. However, most current BODE method…
PASOA optimizes Bayesian design by improving SMC samplers and EIG.
problem Sequential design optimization for accurate parameter inference.
method Sequential optimization using contrastive estimation, SMC samplers, and tempering.
result PASOA optimizes design and inference with improved consistency.
New method uses diffusion models to optimize experimental design efficiently.
problem Optimizing experimental design for high-dimensional and complex settings.
method Introduces a pooled posterior distribution and uses diffusion-based samplers for efficient sampling and optimization.
result Extends Bayesian Optimal Experimental Design to practical scenarios.
Green LIME reduces LIME's computational cost through optimal design of experiments.
problem Improving AI explainability in critical fields like healthcare.
method Optimal design of experiments to reduce LIME's computational cost.
result Significant reduction in computational effort of LIME.
Bayesian methods improve drug discovery experiment design.
problem Optimizing drug screening experiments in high-dimensional data.
method Bayesian inference and optimisation with upper confidence bound algorithms, Thompson sampling, and sparse tree search.
result Sparse tree search techniques outperform other methods in drug toxicity screening.
PIED optimizes experimental design for inverse problems using physics-informed neural networks.
problem Optimizing experimental design for inverse problems with limited budget and constraints.
method PIED uses physics-informed neural networks (PINNs) for continuous optimization of design parameters in one-shot deployments.
result PIED significantly outperforms existing ED methods in solving inverse problems, including unknown functions.
New BO methods exploit parallel experiments, reducing search time and improving solution quality.
problem Limitation of Bayesian optimization in exploiting parallel experiments.
method Propose new parallel BO paradigms that exploit the structure of the system to partition the design space.
result Significantly reduce search time and increase probability of finding global solutions.
New method uses neural networks to optimize experimental designs for complex models.
problem Designing experiments for complex, intractable models with high computational cost.
method Neural mutual information estimation for mutual information maximization.
result Optimal experimental designs and posterior inference can be jointly determined.
We address the problem of synthetic gene design using Bayesian optimization. The main issue when designing a gene is that the design space is defined in terms of long strings of characters of different lengths, which renders the optimization intractable. We propose a three-step approach to deal with this issue. First, …
Efficiently designs experiments without integrating posterior distributions.
problem Computational inefficiency in Bayesian experimental design for PDE-based models.
method Likelihood-free approach using ANN to approximate conditional expectation.
result Significant reduction in observation model evaluations.
Optimizes e-commerce traffic sales by incorporating hidden costs into auction mechanisms.
problem Hidden costs from unexpected advertising items in search results.
method Dynamic reserve price design with distributed solving algorithm.
result Ensures a balanced relationship between revenue and user experience.
BoFire optimizes chemistry experiments using Bayesian Optimization.
problem Effective deployment of Bayesian Optimization in the chemical industry.
method Combines Bayesian Optimization with DoE strategies, providing a rich feature-set.
result BoFire enables seamless integration into RESTful APIs for real-world use.
Optimizes experiment design for causal structure learning in linear models with cycles.
problem Causal structure learning from combined observational and interventional data in linear non-Gaussian cyclic models.
method Combinatorial characterization of equivalence classes, adaptive stochastic optimization, greedy policy with near-optimal performance guarantee, sampling-based estimator for reward function.
result Optimal experiment design reduces the equivalence class of causal graphs to a single true graph with a small number of interventions.