Open Problem: Log(n) Factor in "Local Glivenko-Cantelli"
Abstract
Can the log(n) factor in the upper bound of Cohen and Kontorovich (COLT, 2023)be removed?
Cite
Text
Cohen and Kontorovich. "Open Problem: Log(n) Factor in "Local Glivenko-Cantelli"." Conference on Learning Theory, 2023.Markdown
[Cohen and Kontorovich. "Open Problem: Log(n) Factor in "Local Glivenko-Cantelli"." Conference on Learning Theory, 2023.](https://mlanthology.org/colt/2023/cohen2023colt-open/)BibTeX
@inproceedings{cohen2023colt-open,
title = {{Open Problem: Log(n) Factor in "Local Glivenko-Cantelli"}},
author = {Cohen, Doron and Kontorovich, Aryeh},
booktitle = {Conference on Learning Theory},
year = {2023},
pages = {5934-5936},
volume = {195},
url = {https://mlanthology.org/colt/2023/cohen2023colt-open/}
}