Name
Abstract | ||
|---|---|---|
We introduce a notion of non-black-box access to computational devices (such as circuits, formulas, decision trees, and so forth) that we call restriction access. Restrictions are partial assignments to input variables. Each restriction simplifies the device, and yields a new device for the restricted function on the unassigned variables. On one extreme, full restrictions (assigning all variables) correspond to evaluating the device on a complete input, yielding the result of the computation on that input, which is the same as standard black-box access. On the other extreme, empty restrictions (assigning no variables) yield a full description of the original device. We explore the grey-scale of possibilities in the middle. Focusing on learning theory, we show that restriction access provides a setting in which one can obtain positive results for problems that have resisted attack in the black-box access model. We introduce a PAC-learning version of restriction access, and show that one can efficiently learn both decision trees and DNF formulas in this model. These two classes are not known to be learnable in the PAC model with black-box access. Our DNF learning algorithm is obtained by a reduction to a general learning problem we call population recovery, in which random samples from an unknown distribution become available only after a random part of each is obliterated. Specifically, assume that every member of an unknown population is described by a vector of values. The algorithm has access to random samples, each of which is a random member of the population, whose values are given only on a random subset of the attributes. Analyzing our efficient algorithm to fully recover the unknown population calls for understanding another basic problem of independent interest: "robust local inversion" of matrices. The population recovery algorithm and construction of robust local inverses for some families of matrices are the main technical contributions of the paper. We also discuss other possible variants of restriction access, in which the values to restricted variables, as well as the subset of free (unassigned) variables, are generated deterministically or randomly, in friendly or adversarial fashions. We discuss how these models may naturally suit situations in computational learning, computational biology, automated proofs, cryptography and complexity theory. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2090236.2090239 | ITCS |
Keywords | DocType | Volume |
non-black-box access,random sample,black-box access model,restriction access,population recovery,black-box access,decision tree,standard black-box access,full restriction,empty restriction | Journal | 18 |
Citations | PageRank | References |
7 | 0.58 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zeev Dvir | 1 | 437 | 30.85 |
| Anup Rao | 2 | 581 | 32.80 |
| Avi Wigderson | 3 | 8205 | 1064.31 |
| Amir Yehudayoff | 4 | 530 | 43.83 |