Error tolerance (PAC learning)

In PAC learning, error tolerance refers to the ability of an algorithm to learn when the examples received have been corrupted in some way. In fact, this is a very common and important issue since in many applications it is not possible to access noise-free data. Noise can interfere with the learning process at different levels: the algorithm may receive data that have been occasionally mislabeled, or the inputs may have some false information, or the classification of the examples may have been maliciously adulterated.

Notation and the Valiant learning model

In the following, let ${\displaystyle X}$ be our ${\displaystyle n}$-dimensional input space. Let ${\displaystyle {\mathcal {H}}}$ be a class of functions that we wish to use in order to learn a ${\displaystyle \{0,1\}}$-valued target function ${\displaystyle f}$ defined over ${\displaystyle X}$. Let ${\displaystyle {\mathcal {D}}}$ be the distribution of the inputs over ${\displaystyle X}$. The goal of a learning algorithm ${\displaystyle {\mathcal {A}}}$ is to choose the best function ${\displaystyle h\in {\mathcal {H}}}$ such that it minimizes ${\displaystyle error(h)=P_{x\sim {\mathcal {D}}}(h(x)\neq f(x))}$. Let us suppose we have a function ${\displaystyle size(f)}$ that can measure the complexity of ${\displaystyle f}$. Let ${\displaystyle {\text{Oracle}}(x)}$ be an oracle that, whenever called, returns an example ${\displaystyle x}$ and its correct label ${\displaystyle f(x)}$.

When no noise corrupts the data, we can define learning in the Valiant setting: ^{[1] [2]}

Definition: We say that ${\displaystyle f}$ is efficiently learnable using ${\displaystyle {\mathcal {H}}}$ in the Valiant setting if there exists a learning algorithm ${\displaystyle {\mathcal {A}}}$ that has access to ${\displaystyle {\text{Oracle}}(x)}$ and a polynomial ${\displaystyle p(\cdot ,\cdot ,\cdot ,\cdot )}$ such that for any ${\displaystyle 0<\varepsilon \leq 1}$ and ${\displaystyle 0<\delta \leq 1}$ it outputs, in a number of calls to the oracle bounded by ${\displaystyle p\left({\frac {1}{\varepsilon }},{\frac {1}{\delta }},n,{\text{size}}(f)\right)}$ , a function ${\displaystyle h\in {\mathcal {H}}}$ that satisfies with probability at least ${\displaystyle 1-\delta }$ the condition ${\displaystyle {\text{error}}(h)\leq \varepsilon }$.

In the following we will define learnability of ${\displaystyle f}$ when data have suffered some modification. ^{[3] [4] [5]}

Classification noise

In the classification noise model ^[6] a noise rate${\displaystyle 0\leq \eta <{\frac {1}{2}}}$ is introduced. Then, instead of ${\displaystyle {\text{Oracle}}(x)}$ that returns always the correct label of example ${\displaystyle x}$, algorithm ${\displaystyle {\mathcal {A}}}$ can only call a faulty oracle ${\displaystyle {\text{Oracle}}(x,\eta )}$ that will flip the label of ${\displaystyle x}$ with probability ${\displaystyle \eta }$. As in the Valiant case, the goal of a learning algorithm ${\displaystyle {\mathcal {A}}}$ is to choose the best function ${\displaystyle h\in {\mathcal {H}}}$ such that it minimizes ${\displaystyle error(h)=P_{x\sim {\mathcal {D}}}(h(x)\neq f(x))}$. In applications it is difficult to have access to the real value of ${\displaystyle \eta }$, but we assume we have access to its upperbound ${\displaystyle \eta _{B}}$. ^[7] Note that if we allow the noise rate to be ${\displaystyle 1/2}$, then learning becomes impossible in any amount of computation time, because every label conveys no information about the target function.

Definition: We say that ${\displaystyle f}$ is efficiently learnable using ${\displaystyle {\mathcal {H}}}$ in the classification noise model if there exists a learning algorithm ${\displaystyle {\mathcal {A}}}$ that has access to ${\displaystyle {\text{Oracle}}(x,\eta )}$ and a polynomial ${\displaystyle p(\cdot ,\cdot ,\cdot ,\cdot )}$ such that for any ${\displaystyle 0\leq \eta \leq {\frac {1}{2}}}$, ${\displaystyle 0\leq \varepsilon \leq 1}$ and ${\displaystyle 0\leq \delta \leq 1}$ it outputs, in a number of calls to the oracle bounded by ${\displaystyle p\left({\frac {1}{1-2\eta _{B}}},{\frac {1}{\varepsilon }},{\frac {1}{\delta }},n,size(f)\right)}$ , a function ${\displaystyle h\in {\mathcal {H}}}$ that satisfies with probability at least ${\displaystyle 1-\delta }$ the condition ${\displaystyle error(h)\leq \varepsilon }$.

Statistical query learning

Statistical Query Learning ^[8] is a kind of active learning problem in which the learning algorithm ${\displaystyle {\mathcal {A}}}$ can decide if to request information about the likelihood ${\displaystyle P_{f(x)}}$ that a function ${\displaystyle f}$ correctly labels example ${\displaystyle x}$, and receives an answer accurate within a tolerance ${\displaystyle \alpha }$. Formally, whenever the learning algorithm ${\displaystyle {\mathcal {A}}}$ calls the oracle ${\displaystyle {\text{Oracle}}(x,\alpha )}$, it receives as feedback probability ${\displaystyle Q_{f(x)}}$, such that ${\displaystyle Q_{f(x)}-\alpha \leq P_{f(x)}\leq Q_{f(x)}+\alpha }$.

Definition: We say that ${\displaystyle f}$ is efficiently learnable using ${\displaystyle {\mathcal {H}}}$ in the statistical query learning model if there exists a learning algorithm ${\displaystyle {\mathcal {A}}}$ that has access to ${\displaystyle {\text{Oracle}}(x,\alpha )}$ and polynomials ${\displaystyle p(\cdot ,\cdot ,\cdot )}$, ${\displaystyle q(\cdot ,\cdot ,\cdot )}$, and ${\displaystyle r(\cdot ,\cdot ,\cdot )}$ such that for any ${\displaystyle 0<\varepsilon \leq 1}$ the following hold:

1. ${\displaystyle {\text{Oracle}}(x,\alpha )}$ can evaluate ${\displaystyle P_{f(x)}}$ in time ${\displaystyle q\left({\frac {1}{\varepsilon }},n,size(f)\right)}$;
2. ${\displaystyle {\frac {1}{\alpha }}}$ is bounded by ${\displaystyle r\left({\frac {1}{\varepsilon }},n,size(f)\right)}$
3. ${\displaystyle {\mathcal {A}}}$ outputs a model ${\displaystyle h}$ such that ${\displaystyle err(h)<\varepsilon }$, in a number of calls to the oracle bounded by ${\displaystyle p\left({\frac {1}{\varepsilon }},n,size(f)\right)}$.

Note that the confidence parameter ${\displaystyle \delta }$ does not appear in the definition of learning. This is because the main purpose of ${\displaystyle \delta }$ is to allow the learning algorithm a small probability of failure due to an unrepresentative sample. Since now ${\displaystyle {\text{Oracle}}(x,\alpha )}$ always guarantees to meet the approximation criterion ${\displaystyle Q_{f(x)}-\alpha \leq P_{f(x)}\leq Q_{f(x)}+\alpha }$, the failure probability is no longer needed.

The statistical query model is strictly weaker than the PAC model: any efficiently SQ-learnable class is efficiently PAC learnable in the presence of classification noise, but there exist efficient PAC-learnable problems such as parity that are not efficiently SQ-learnable. ^[8]

Malicious classification

In the malicious classification model ^[9] an adversary generates errors to foil the learning algorithm. This setting describes situations of error burst, which may occur when for a limited time transmission equipment malfunctions repeatedly. Formally, algorithm ${\displaystyle {\mathcal {A}}}$ calls an oracle ${\displaystyle {\text{Oracle}}(x,\beta )}$ that returns a correctly labeled example ${\displaystyle x}$ drawn, as usual, from distribution ${\displaystyle {\mathcal {D}}}$ over the input space with probability ${\displaystyle 1-\beta }$, but it returns with probability ${\displaystyle \beta }$ an example drawn from a distribution that is not related to ${\displaystyle {\mathcal {D}}}$. Moreover, this maliciously chosen example may strategically selected by an adversary who has knowledge of ${\displaystyle f}$, ${\displaystyle \beta }$, ${\displaystyle {\mathcal {D}}}$, or the current progress of the learning algorithm.

Definition: Given a bound ${\displaystyle \beta _{B}<{\frac {1}{2}}}$ for ${\displaystyle 0\leq \beta <{\frac {1}{2}}}$, we say that ${\displaystyle f}$ is efficiently learnable using ${\displaystyle {\mathcal {H}}}$ in the malicious classification model, if there exist a learning algorithm ${\displaystyle {\mathcal {A}}}$ that has access to ${\displaystyle {\text{Oracle}}(x,\beta )}$ and a polynomial ${\displaystyle p(\cdot ,\cdot ,\cdot ,\cdot ,\cdot )}$ such that for any ${\displaystyle 0<\varepsilon \leq 1}$, ${\displaystyle 0<\delta \leq 1}$ it outputs, in a number of calls to the oracle bounded by ${\displaystyle p\left({\frac {1}{1/2-\beta _{B}}},{\frac {1}{\varepsilon }},{\frac {1}{\delta }},n,size(f)\right)}$ , a function ${\displaystyle h\in {\mathcal {H}}}$ that satisfies with probability at least ${\displaystyle 1-\delta }$ the condition ${\displaystyle error(h)\leq \varepsilon }$.

Errors in the inputs: nonuniform random attribute noise

In the nonuniform random attribute noise ^{[10] [11]} model the algorithm is learning a Boolean function, a malicious oracle ${\displaystyle {\text{Oracle}}(x,\nu )}$ may flip each ${\displaystyle i}$-th bit of example ${\displaystyle x=(x_{1},x_{2},\ldots ,x_{n})}$ independently with probability ${\displaystyle \nu _{i}\leq \nu }$.

This type of error can irreparably foil the algorithm, in fact the following theorem holds:

In the nonuniform random attribute noise setting, an algorithm ${\displaystyle {\mathcal {A}}}$ can output a function ${\displaystyle h\in {\mathcal {H}}}$ such that ${\displaystyle error(h)<\varepsilon }$ only if ${\displaystyle \nu <2\varepsilon }$.

See also

• Machine learning
• Data mining
• Probably approximately correct learning
• Adversarial machine learning

References

1. Valiant, L. G. (August 1985). Learning Disjunction of Conjunctions . In IJCAI (pp. 560–566).
2. Valiant, Leslie G. "A theory of the learnable." Communications of the ACM 27.11 (1984): 1134–1142.
3. Laird, P. D. (1988). Learning from good and bad data . Kluwer Academic Publishers.
4. Kearns, Michael. "Efficient noise-tolerant learning from statistical queries." Journal of the ACM 45.6 (1998): 983–1006.
5. Brunk, Clifford A., and Michael J. Pazzani. "An investigation of noise-tolerant relational concept learning algorithms." Proceedings of the 8th International Workshop on Machine Learning. 1991.
6. Kearns, M. J., & Vazirani, U. V. (1994). An introduction to computational learning theory, chapter 5. MIT press.
7. Angluin, D., & Laird, P. (1988). Learning from noisy examples . Machine Learning, 2(4), 343–370.
8. Kearns, M. (1998). [www.cis.upenn.edu/~mkearns/papers/sq-journal.pdf Efficient noise-tolerant learning from statistical queries]. Journal of the ACM, 45(6), 983–1006.
9. Kearns, M., & Li, M. (1993). [www.cis.upenn.edu/~mkearns/papers/malicious.pdf Learning in the presence of malicious errors]. SIAM Journal on Computing, 22(4), 807–837.
10. Goldman, S. A., & Sloan, Robert, H. (1991). The difficulty of random attribute noise. Technical Report WUCS 91 29, Washington University, Department of Computer Science.
11. Sloan, R. H. (1989). Computational learning theory: New models and algorithms (Doctoral dissertation, Massachusetts Institute of Technology).