arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.15726math.STcs.LGstat.MEstat.TH
收藏

Refined bounds for randomized experimental design

PSL - Université Paris Dauphine(PSL巴黎多芬大学);CNRS(法国国家科学研究中心);Huawei Noah’s Ark Lab(华为诺亚方舟实验室);Capgemini(凯捷)

Geovani Rizk, Igor Colin, Albert Thomas, Moez Draief

英文摘要:

Experimental design is an approach for selecting samples among a given set so as to obtain the best estimator for a given criterion. In the context of linear regression, several optimal designs have been derived, each associated with a different criterion: mean square error, robustness, \emph{etc}. Computing such designs is generally an NP-hard problem and one can instead rely on a convex relaxation that considers probability distributions over the samples. Although greedy strategies and rounding procedures have received a lot of attention, straightforward sampling from the optimal distribution has hardly been investigated. In this paper, we propose theoretical guarantees for randomized strategies on E and G-optimal design. To this end, we develop a new concentration inequality for the eigenvalues of random matrices using a refined version of the intrinsic dimension that enables us to quantify the performance of such randomized strategies. Finally, we evidence the validity of our analysis through experiments, with particular attention on the G-optimal design applied to the best arm identification problem for linear bandits.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑