6 papers
Laplacian Network Optimization via Information Functions
Samuel Rosa, Radoslav Harman
Designing networks to optimize robustness and other performance metrics is a well-established problem with applications ranging from electrical engineering to communication network…
Removal of Redundant Candidate Points for the Exact D-Optimal Design Problem
Radoslav Harman, Samuel Rosa
One of the most common problems in statistical experimentation is computing D-optimal designs on large finite candidate sets. While optimal approximate (i.e., infinite-sample) desi…
Optimal Exact Designs of Multiresponse Experiments under Linear and Sparsity Constraints
Lenka Filová, Pál Somogyi, Radoslav Harman
We propose a computational approach to constructing exact designs on finite design spaces that are optimal for multiresponse regression experiments under a combination of the stand…
Green LIME: Improving AI Explainability through Design of Experiments
Alexandra Stadler, Werner G. Müller, Radoslav Harman
In artificial intelligence (AI), the complexity of many models and processes surpasses human understanding, making it challenging to determine why a specific prediction is made. Th…
A Randomized Exchange Algorithm for Optimal Design of Multi-Response Experiments
Pál Somogyi, Samuel Rosa, Radoslav Harman
Despite the increasing prevalence of vector observations, computation of optimal experimental design for multi-response models has received limited attention. To address this probl…
The Polytope of Optimal Approximate Designs: Extending the Selection of Informative Experiments
Radoslav Harman, Lenka Filová, Samuel Rosa
Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this prob…