Computational learning theory: Difference between revisions

Revision as of 10:03, 8 January 2004

Latest revision as of 11:35, 20 August 2025

(187 intermediate revisions by more than 100 users not shown)

Line 1:

{{see also|Statistical learning theory}}

COLT (COmputational Learning Theory) is a field of [[machine learning]].

{{Short description|Theory of machine learning}}{{more citations needed|date=November 2018}}

{{Machine learning|Theory}}

In [[computer science]], '''computational learning theory''' (or just '''learning theory''') is a subfield of [[artificial intelligence]] devoted to studying the design and analysis of [[machine learning]] algorithms.<ref name="ACL">{{Cite web | url=http://www.learningtheory.org/ | title=ACL - Association for Computational Learning}}</ref>

In COLT the main interest is the computational aspects of learning, e.g., the time complexity of learning problem. The computational aspects are considered in a learning framework, like the very common one of [[Probably approximately correct learning]].

==Overview==

Note that a computation is considered feasible if it can be done in polynomial time.

Theoretical results in machine learning often focus on a type of inductive learning known as [[supervised learning]]. In supervised learning, an algorithm is provided with [[Labeled data|labeled]] samples. For instance, the samples might be descriptions of mushrooms, with labels indicating whether they are edible or not. The algorithm uses these labeled samples to create a classifier. This classifier assigns labels to new samples, including those it has not previously encountered. The goal of the supervised learning algorithm is to optimize performance metrics, such as minimizing errors on new samples.

In addition to performance bounds, computational learning theory studies the time complexity and feasibility of learning.{{citation needed|date=October 2017}} In

There are two kind of results in COLT.

Notecomputational thatlearning theory, a computation is considered feasible if it can be done in [[polynomial time]].{{citation needed|date=October 2017}} There are two kinds of time

Possitive results - Showing the a certain class of function is learnable in polynomial time.

Negativecomplexity results:

Negative results - Showing that certain classes cannot be learned in polynomial time.

Negative results were proven only by assumption.

The assumptions the are common in negative results are:

Computational - P<>NP

Cryptographic - One way functions exits.

Possitive* resultsPositive -results{{spaced ndash}}Showing thethat a certain class of functionfunctions is learnable in polynomial time.

* Negative results{{spaced ndash}}Showing that certain classes cannot be learned in polynomial time.<ref>{{Cite book |last1=Kearns |first1=Michael |title=An Introduction to Computational Learning Theory |last2=Vazirani |first2=Umesh |date=August 15, 1994 |publisher=MIT Press |isbn=978-0262111935}}</ref>

Negative results often rely on commonly believed, but yet unproven assumptions,{{citation needed|date=October 2017}} such as:

A list of important COLT papers

* Computational complexity – [[P versus NP problem|P ≠ NP (the P versus NP problem)]];

Surveys

* [[cryptography|Cryptographic]] – [[One-way function]]s exist.

There are several different approaches to computational learning theory based on making different assumptions about the [[inference]] principles used to generalise from limited data. This includes different definitions of [[probability]] (see [[frequency probability]], [[Bayesian probability]]) and different assumptions on the generation of samples.{{citation needed|date=October 2017}} The different approaches include:

* [Angluin, 92] Angluin, D. 1992. Computational learning theory: Survey and selected bibliography. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (May 1992), pp. 351--369.

* [Hau,90] D. Haussler. Probably approximately correct learning. In AAAI-90 Proceedings of the Eight National Conference on Artificial Intelligence, Boston, MA, pages 1101--1108. American Association for Artificial Intelligence, 1990.

* Exact learning, proposed by [[Dana Angluin]];<ref>{{cite thesis | type=Ph.D. thesis | author=Dana Angluin | title=An Application of the Theory of Computational Complexity to the Study of Inductive Inference | institution=University of California at Berkeley | year=1976 }}</ref><ref>{{cite journal | url=http://www.sciencedirect.com/science/article/pii/S0019995878906836 | author=D. Angluin | title=On the Complexity of Minimum Inference of Regular Sets | journal=Information and Control | volume=39 | number=3 | pages=337&ndash;350 | year=1978 }}</ref>

* [[Probably approximately correct learning]] (PAC learning), proposed by [[Leslie Valiant]];<ref>{{cite journal |last1=Valiant |first1=Leslie |title=A Theory of the Learnable |journal=Communications of the ACM |date=1984 |volume=27 |issue=11 |pages=1134–1142 |doi=10.1145/1968.1972 |s2cid=12837541 |url=https://www.montefiore.ulg.ac.be/~geurts/Cours/AML/Readings/Valiant.pdf |ref=ValTotL |access-date=2022-11-24 |archive-date=2019-05-17 |archive-url=https://web.archive.org/web/20190517235548/http://www.montefiore.ulg.ac.be/~geurts/Cours/AML/Readings/Valiant.pdf |url-status=dead }}</ref>

* [[VC theory]], proposed by [[Vladimir Vapnik]] and [[Alexey Chervonenkis]];<ref>{{cite journal |last1=Vapnik |first1=V. |last2=Chervonenkis |first2=A. |title=On the uniform convergence of relative frequencies of events to their probabilities |journal=Theory of Probability and Its Applications |date=1971 |volume=16 |issue=2 |pages=264–280 |doi=10.1137/1116025 |url=https://courses.engr.illinois.edu/ece544na/fa2014/vapnik71.pdf |ref=VCdim}}</ref>

* [[Solomonoff's theory of inductive inference|Inductive inference]] as developed by [[Ray Solomonoff]];<ref>{{cite journal |last1=Solomonoff |first1=Ray |title=A Formal Theory of Inductive Inference Part 1 |journal=Information and Control |date=March 1964 |volume=7 |issue=1 |pages=1–22 |doi=10.1016/S0019-9958(64)90223-2|doi-access=free }}</ref><ref>{{cite journal |last1=Solomonoff |first1=Ray |title=A Formal Theory of Inductive Inference Part 2 |journal=Information and Control |date=1964 |volume=7 |issue=2 |pages=224–254 |doi=10.1016/S0019-9958(64)90131-7}}</ref>

* [[Algorithmic learning theory]], from the work of [[E. Mark Gold]];<ref>{{Cite journal | last1 = Gold | first1 = E. Mark | year = 1967 | title = Language identification in the limit | journal = Information and Control | volume = 10 | issue = 5 | pages = 447–474 | doi = 10.1016/S0019-9958(67)91165-5 | url=http://web.mit.edu/~6.863/www/spring2009/readings/gold67limit.pdf | doi-access = free }}</ref>

* [[Online machine learning]], from the work of Nick Littlestone{{citation needed|date=October 2017}}.

While its primary goal is to understand learning abstractly, computational learning theory has led to the development of practical algorithms. For example, PAC theory inspired [[Boosting (meta-algorithm)|boosting]], VC theory led to [[support vector machine]]s, and Bayesian inference led to [[belief networks]].

Feature selection

* [DH,94] A. Dhagat and L. Hellerstein. PAC learning with irrelevant attributes. In Proceedings of the IEEE Symp. on Foundation of Computer Science, 1994. To appear.

==See also==

Inductive inference

* [[Error tolerance (PAC learning)]]

* [Gold, 67] E. M. Gold. Language identification in the limit. Information and Control, 10:447--474, 1967.

* [[Grammar induction]]

* [[Information theory]]

* [[Occam learning]]

* [[Stability (learning theory)]]

==References==

Optimal O notation learning

{{Reflist}}

* [GG96] O. Goldreich, D. Ron. On universal learning algorithms.

==Further reading==

Negative results

A description of some of these publications is given at important publications in machine learning.

* [KV,89] M. Kearns and L. G. Valiant. 1989. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433--444, New York. ACM.

===Surveys===

* [Angluin, 92] Angluin, D. 1992. Computational learning theory: Survey and selected bibliography. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (May 1992), pppages&nbsp;351–369. 351--369http://portal. acm.org/citation.cfm?id=129712.129746

* [Hau,90] D. Haussler. Probably approximately correct learning. In AAAI-90 Proceedings of the Eight National Conference on Artificial Intelligence, Boston, MA, pages 1101--11081101–1108. American Association for Artificial Intelligence, 1990. http://citeseer.ist.psu.edu/haussler90probably.html

===Feature selection===

[[Boosting]]

* [DH,94] A. Dhagat and L. Hellerstein., "PAC learning with irrelevant attributes.", Inin 'Proceedings of the IEEE Symp. on Foundation of Computer Science', 1994. To appearhttp://citeseer. ist.psu.edu/dhagat94pac.html

* [Sch, 90] Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197--227, 1990

[[Probably===Optimal approximatelyO correctnotation learning]]===

* [[Oded Goldreich]], [[Dana Ron]]. ''[http://www.wisdom.weizmann.ac.il/~oded/PS/ul.ps On universal learning algorithms]''. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.2224

* [Valiant, 84] L. Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134--1142, 1984.

===Negative results===

* [KV,89] M. Kearns and L. G.[[Leslie Valiant]]. 1989. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433--444433–444, New York. ACM. http://citeseer.ist.psu.edu/kearns89cryptographic.html{{dl|date=August 2024}}

===Error tolerance===

* Michael Kearns and Ming Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807–837, August 1993. http://citeseer.ist.psu.edu/kearns93learning.html

* Kearns, M. (1993). Efficient noise-tolerant learning from statistical queries. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 392–401. http://citeseer.ist.psu.edu/kearns93efficient.html

===Equivalence===

''This article is a [[Wikipedia:Perfect stub article|stub]]. You can help Wikipedia by [[Wikipedia:Find or fix a stub|fixing it]].''

* D.Haussler, M.Kearns, N.Littlestone and [[Manfred K. Warmuth|M. Warmuth]], Equivalence of models for polynomial learnability, Proc. 1st ACM Workshop on Computational Learning Theory, (1988) 42-55.

* {{Cite journal | last1 = Pitt | first1 = L. | last2 = Warmuth | first2 = M. K. | year = 1990 | title = Prediction-Preserving Reducibility | journal = Journal of Computer and System Sciences | volume = 41 | issue = 3| pages = 430–467 | doi = 10.1016/0022-0000(90)90028-J | doi-access = free }}

==External links==

* [http://research.microsoft.com/adapt/MSBNx/msbnx/Basics_of_Bayesian_Inference.htm Basics of Bayesian inference]

{{Differentiable computing}}

[[Category:Computational learning theory| ]]

[[Category:Computational fields of study]]

[[de:Maschinelles Lernen]]