Computational learning theory

Machine learning and data mining
Part of a series on
Paradigms Supervised learning Unsupervised learning Online learning Batch learning Meta-learning Semi-supervised learning Self-supervised learning Reinforcement learning Curriculum learning Rule-based learning Quantum machine learning
Problems Classification Generative modeling Regression Clustering Dimensionality reduction Density estimation Anomaly detection Data cleaning AutoML Association rules Semantic analysis Structured prediction Feature engineering Feature learning Learning to rank Grammar induction Ontology learning Multimodal learning
Supervised learning (classification • regression) Apprenticeship learning Decision trees Ensembles Bagging Boosting Random forest k-NN Linear regression Naive Bayes Artificial neural networks Logistic regression Perceptron Relevance vector machine (RVM) Support vector machine (SVM)
Clustering BIRCH CURE Hierarchical k-means Fuzzy Expectation–maximization (EM) DBSCAN OPTICS Mean shift
Dimensionality reduction Factor analysis CCA ICA LDA NMF PCA PGD t-SNE SDL
Structured prediction Graphical models Bayes net Conditional random field Hidden Markov
Anomaly detection RANSAC k-NN Local outlier factor Isolation forest
Artificial neural network Autoencoder Cognitive computing Deep learning DeepDream Feedforward neural network Recurrent neural network LSTM GRU ESN reservoir computing Restricted Boltzmann machine GAN Diffusion model SOM Convolutional neural network U-Net Transformer Vision Mamba Spiking neural network Memtransistor Electrochemical RAM (ECRAM)
Reinforcement learning Q-learning SARSA Temporal difference (TD) Multi-agent Self-play
Learning with humans Active learning Crowdsourcing Human-in-the-loop RLHF
Model diagnostics Coefficient of determination Confusion matrix Learning curve ROC curve
Mathematical foundations Kernel machines Bias–variance tradeoff Computational learning theory Empirical risk minimization Occam learning PAC learning Statistical learning VC theory
Machine-learning venues ECML PKDD NeurIPS ICML ICLR IJCAI ML JMLR
Related articles Glossary of artificial intelligence List of datasets for machine-learning research List of datasets in computer vision and image processing Outline of machine learning
v t e

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.^[1]

YouTube Encyclopedic

1/5
Views:
1 558
2 564
17 826
1 961 526
71 044

Transcription

Overview

Theoretical results in machine learning mainly deal with a type of inductive learning called supervised learning. In supervised learning, an algorithm is given samples that are labeled in some useful way. For example, the samples might be descriptions of mushrooms, and the labels could be whether or not the mushrooms are edible. The algorithm takes these previously labeled samples and uses them to induce a classifier. This classifier is a function that assigns labels to samples, including samples that have not been seen previously by the algorithm. The goal of the supervised learning algorithm is to optimize some measure of performance such as minimizing the number of mistakes made on new samples.

In addition to performance bounds, computational learning theory studies the time complexity and feasibility of learning.^{[citation needed]} In computational learning theory, a computation is considered feasible if it can be done in polynomial time.^{[citation needed]} There are two kinds of time complexity results:

Positive results – Showing that a certain class of functions is learnable in polynomial time.
Negative results – Showing that certain classes cannot be learned in polynomial time.

Negative results often rely on commonly believed, but yet unproven assumptions,^{[citation needed]} such as:

Computational complexity – P ≠ NP (the P versus NP problem);
Cryptographic – One-way functions 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]} The different approaches include:

Exact learning, proposed by Dana Angluin^{[citation needed]};
Probably approximately correct learning (PAC learning), proposed by Leslie Valiant;^[2]
VC theory, proposed by Vladimir Vapnik and Alexey Chervonenkis;^[3]
Inductive inference as developed by Ray Solomonoff;^[4]^[5]
Algorithmic learning theory, from the work of E. Mark Gold;^[6]
Online machine learning, from the work of Nick Littlestone^{[citation needed]}.

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, VC theory led to support vector machines, and Bayesian inference led to belief networks.

References

^ "ACL - Association for Computational Learning".
^ Valiant, Leslie (1984). "A Theory of the Learnable" (PDF). Communications of the ACM. 27 (11): 1134–1142. doi:10.1145/1968.1972. S2CID 12837541. Archived from the original (PDF) on 2019-05-17. Retrieved 2022-11-24.
^ Vapnik, V.; Chervonenkis, A. (1971). "On the uniform convergence of relative frequencies of events to their probabilities" (PDF). Theory of Probability and Its Applications. 16 (2): 264–280. doi:10.1137/1116025.
^ Solomonoff, Ray (March 1964). "A Formal Theory of Inductive Inference Part 1". Information and Control. 7 (1): 1–22. doi:10.1016/S0019-9958(64)90223-2.
^ Solomonoff, Ray (1964). "A Formal Theory of Inductive Inference Part 2". Information and Control. 7 (2): 224–254. doi:10.1016/S0019-9958(64)90131-7.
^ Gold, E. Mark (1967). "Language identification in the limit" (PDF). Information and Control. 10 (5): 447–474. doi:10.1016/S0019-9958(67)91165-5.

External links

Basics of Bayesian inference

Differentiable computing

General

Concepts

Applications

Hardware

Software libraries

Implementations

Audio–visual	AlexNet WaveNet Human image synthesis HWR OCR Speech synthesis Speech recognition Facial recognition AlphaFold Text-to-image models DALL-E Midjourney Stable Diffusion Text-to-video models Sora VideoPoet Whisper
Verbal	Word2vec Seq2seq BERT Gemini LaMDA Bard NMT Project Debater IBM Watson IBM Watsonx Granite GPT-1 GPT-2 GPT-3 GPT-4 ChatGPT GPT-J Chinchilla AI PaLM BLOOM LLaMA PanGu-Σ
Decisional	AlphaGo AlphaZero Q-learning SARSA OpenAI Five Self-driving car MuZero Action selection Auto-GPT Robot control

People

Organizations

Architectures

Portals
- Computer programming
- Technology
Categories
- Artificial neural networks
- Machine learning

This page was last edited on 9 June 2024, at 12:01

From Wikipedia, the free encyclopedia

YouTube Encyclopedic

Transcription

Overview

See also

References

Further reading

Surveys

Feature selection

Optimal O notation learning

Negative results

Error tolerance

Equivalence

External links