Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer. Approximate resilience, monotonicity, and the complexity of agnostic learning. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 498-511, SIAM, 2015. [doi]
@inproceedings{Dachman-SoledFTWW15,
title = {Approximate resilience, monotonicity, and the complexity of agnostic learning},
author = {Dana Dachman-Soled and Vitaly Feldman and Li-Yang Tan and Andrew Wan and Karl Wimmer},
year = {2015},
doi = {10.1137/1.9781611973730.34},
url = {http://dx.doi.org/10.1137/1.9781611973730.34},
researchr = {https://researchr.org/publication/Dachman-SoledFTWW15},
cites = {0},
citedby = {0},
pages = {498-511},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015},
editor = {Piotr Indyk},
publisher = {SIAM},
isbn = {978-1-61197-373-0},
}