Approximate resilience, monotonicity, and the complexity of agnostic learning - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Dana Dachman-Soled' in GoogleThis author has not been identified. Look up 'Vitaly Feldman' in GoogleThis author has not been identified. Look up 'Li-Yang Tan' in GoogleThis author has not been identified. Look up 'Andrew Wan' in GoogleThis author has not been identified. Look up 'Karl Wimmer' in Google

runs on WebDSL