3 papers
cs.SI2025
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…
stat.CO2025
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…
stat.CO2025
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…