{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article9958","name":"Agnostic Learning from Tolerant Natural Proofs","abstract":"We generalize the \"learning algorithms from natural properties\" framework of [CIKK16] to get agnostic learning algorithms from natural properties with extra features. We show that if a natural property (in the sense of Razborov and Rudich [RR97]) is useful also against functions that are close to the class of \"easy\" functions, rather than just against \"easy\" functions, then it can be used to get an agnostic learning algorithm over the uniform distribution with membership queries.\r\n\r\n* For AC0[q], any prime q (constant-depth circuits of polynomial size, with AND, OR, NOT, and MODq gates of unbounded fanin), which happens to have a natural property with the requisite extra feature by [Raz87, Smo87, RR97], we obtain the first agnostic learning algorithm for AC0[q], for every prime q. Our algorithm runs in randomized quasi-polynomial time, uses membership queries, and outputs a circuit for a given Boolean function f that agrees with f on all but at most polylog(n)*opt fraction of inputs, where opt is the relative distance between f and the closest function h in the class AC0[q]. \r\n\r\n* For the ideal case, a natural proof of strongly exponential correlation circuit lower bounds against a circuit class C containing AC0[2] (i.e., circuits of size exp(Omega(n)) cannot compute some n-variate function even with exp(-Omega(n)) advantage over random guessing) would yield a polynomial-time query agnostic learning algorithm for C with the approximation error O(opt).","keywords":["agnostic learning","natural proofs","circuit lower bounds","meta-algorithms","AC0[q]","Nisan-Wigderson generator"],"author":[{"@type":"Person","name":"Carmosino, Marco L.","givenName":"Marco L.","familyName":"Carmosino"},{"@type":"Person","name":"Impagliazzo, Russell","givenName":"Russell","familyName":"Impagliazzo"},{"@type":"Person","name":"Kabanets, Valentine","givenName":"Valentine","familyName":"Kabanets"},{"@type":"Person","name":"Kolokolova, Antonina","givenName":"Antonina","familyName":"Kolokolova"}],"position":35,"pageStart":"35:1","pageEnd":"35:19","dateCreated":"2017-08-11","datePublished":"2017-08-11","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Carmosino, Marco L.","givenName":"Marco L.","familyName":"Carmosino"},{"@type":"Person","name":"Impagliazzo, Russell","givenName":"Russell","familyName":"Impagliazzo"},{"@type":"Person","name":"Kabanets, Valentine","givenName":"Valentine","familyName":"Kabanets"},{"@type":"Person","name":"Kolokolova, Antonina","givenName":"Antonina","familyName":"Kolokolova"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2017.35","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6284","volumeNumber":81,"name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2017)","dateCreated":"2017-08-11","datePublished":"2017-08-11","editor":[{"@type":"Person","name":"Jansen, Klaus","givenName":"Klaus","familyName":"Jansen"},{"@type":"Person","name":"Rolim, Jos\u00e9 D. P.","givenName":"Jos\u00e9 D. P.","familyName":"Rolim"},{"@type":"Person","name":"Williamson, David P.","givenName":"David P.","familyName":"Williamson"},{"@type":"Person","name":"Vempala, Santosh S.","givenName":"Santosh S.","familyName":"Vempala"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article9958","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6284"}}}