Computable Bounds on the Exploration Bias
Adaptive data analysis is known to introduce bias in reported measurements. Russo and Zou [1] recently introduced an information-theoretic framework to study this problem. Herein, this framework is adopted and new dependence measures are introduced to bound the exploration bias. When the measurements have bounded L1− or L2 -norms, or when the selection procedure is symmetric, the new bounds are such that the contribution of the selection procedure to the bias is decoupled from the effects of the underlying distribution generating the data, thus enabling direct comparisons between different selection procedures.
Cite this item
Issa, I., & Gastpar, M. (2018). Computable Bounds on the Exploration Bias. Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), 576–580. https://doi.org/10.1109/ISIT.2018.8437470
Click Copy to copy the citation, or select the text manually.
2018
576
580
REVIEWED
EPFL
| Event name | Event place | Event date |
Vail, CO, USA | June 17-22, 2018 | |