Approximate resilience, monotonicity, and the complexity of agnostic learning

Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer

Type: Preprint

Publication Date: 2014-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1405.5268

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Low-degree learning and the metric entropy of polynomials	2022	Alexandros Eskenazis Paata Ivanisvili Lauritz Streck
+	Learning low-degree functions from a logarithmic number of random queries	2021	Alexandros Eskenazis Paata Ivanisvili
+	Learning low-degree functions from a logarithmic number of random queries	2022	Alexandros Eskenazis Paata Ivanisvili
+	Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications)	2018	Ilias Diakonikolas Daniel M. Kane
+	Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications)	2018	Ilias Diakonikolas Daniel M. Kane
+	Hardness Amplification and the Approximate Degree of Constant-Depth Circuits	2013	Mark Bun Justin Thaler
+	Algorithmic polynomials	2018	Alexander A. Sherstov
+	Agnostic Membership Query Learning with Nontrivial Savings: New Results, Techniques	2023	Ari Karchmer
+ PDF Chat	Algorithmic Polynomials	2020	Alexander A. Sherstov
+	Algorithmic Polynomials	2018	Alexander A. Sherstov
+	The Query Complexity of Certification	2022	Guy Blanc Caleb Koch Jane Lange Li-Yang Tan
+	Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions	2014	Vitaly Feldman Pravesh K. Kothari J. Vondrák
+	Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions	2014	Vitaly Feldman Pravesh K. Kothari J. Vondrák
+	Low Degree Testing over the Reals	2022	Vipul Arora Arnab Bhattacharyya Noah Fleming Esty Kelman Yuichi Yoshida
+	Adversarial Robustness: What fools you makes you stronger.	2021	Grzegorz Głuch Rüdiger Urbanke
+	Explicit Resilient Functions Matching Ajtai-Linial	2017	Raghu Meka
+	An Explicit VC-Theorem for Low-Degree Polynomials.	2012	Eshan Chattopadhyay Adam R. Klivans Pravesh K. Kothari
+ PDF Chat	Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs	2024	Ilias Diakonikolas Daniel M. Kane Vasilis Kontonis Sihan Liu Nikos Zarifis
+	Adversarial Robustness: What fools you makes you stronger	2021	Grzegorz Głuch Rüdiger Urbanke
+	Agnostically Learning Juntas from Random Walks	2008	Jan Arpe Elchanan Mossel

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors