Home›Concepts
Concepts
Concepts
How AI works, in plain language: from the artificial neuron to the Transformer, pre-training and reasoning models.
Total 28 · Clear filters
Information theoryA framework that treats information as a measurable quantity to be encoded and transmitted, founded in Shannon's 1948 paper; it gave the field the bit, entropy and channel capacity.k-means clusteringk-means clustering splits n observations into k groups by repeatedly sending each point to its nearest centroid and recomputing each centroid as its cluster's mean. It is simple and scales to large data, but k must be fixed in advance.Support vector machineA supervised maximum-margin model for classification and regression that separates classes by the widest possible margin and uses kernel functions to handle non-linear data.Cross-validationA model validation technique that repeatedly splits data into folds, trains on some parts and validates on others, then averages the results to estimate how well a model or statistical result will generalise to unseen data.Autonomous drivingAutonomous driving is the operation of a road vehicle by a computer system instead of a person. Its six automation levels, its two main technical traditions and its long line of research vehicles define how the field is discussed today.Imitation learningImitation learning trains an agent by supervised learning on expert demonstrations rather than by trial and error. Its simplest form is behaviour cloning, and its best-known weakness is distribution shift.AdaBoostAdaBoost, short for Adaptive Boosting, is a statistical classification meta-algorithm introduced by Yoav Freund and Robert Schapire in 1995. It reweights training examples, trains weak classifiers in sequence and combines their outputs into one weighted classifier.Topic modelTopic models represent documents as mixtures of latent topics, giving a compact statistical description of text collections. The 2003 Latent Dirichlet Allocation paper formalized this idea as a hierarchical Bayesian model.Retrieval-augmented generationRetrieval-augmented generation (RAG) lets a language model fetch relevant documents from an external store and put them into its prompt before answering, so it can use knowledge beyond its training data and cite where an answer came from.Test-time computeTest-time compute is the computation a model spends while answering a prompt, beyond what training already fixed into its weights. A 2024 study by Snell et al. showed how to spend it adaptively, and how it can stand in for a bigger model.Vision-Language-Action model (VLA)A vision-language-action model (VLA) is a robot policy that takes in camera images and a language instruction and outputs actions directly, usually by adapting a pretrained vision-language model to control.Sim-to-real transferSim-to-real transfer is the practice of training robot policies in simulation and then adapting them to physical robots, using synthetic data to supplement costly real-world demonstrations.Reinforcement learningReinforcement learning is the branch of machine learning and optimal control in which an agent learns, by trial and error, which actions in a dynamic environment maximise a reward signal.Supervised learningSupervised learning trains a model to map inputs to outputs using paired labelled examples, so that it can predict answers for new, unseen data. Its central measure of success is how well the model generalises beyond the training set.Loss functionA loss function turns the cost of a prediction into a single number, and training a model means making that number as small as possible. Its choice decides which mistakes a model is punished for.OverfittingOverfitting is when a model fits its training data so closely that it performs poorly on new data. It is one half of the bias–variance trade-off and is usually spotted by comparing training and validation performance.RegularizationRegularization is the practice of making a problem's answer simpler, usually by adding a penalty term to the objective, so that ill-posed problems become solvable and models avoid overfitting.Decision tree learningDecision tree learning builds a classification or regression tree from data by repeatedly splitting it into more homogeneous groups. It is a widely used supervised method whose rules can be read directly, and whose main weaknesses are instability and a tendency to overfit.Feature engineeringFeature engineering is the preprocessing step that turns raw data into more useful inputs for machine learning and statistical models, shaping, cleaning and trimming the attributes a model learns from.AutoencoderAn autoencoder is an unsupervised neural network that compresses its input into a low-dimensional code and reconstructs it back, learning a latent representation useful for dimensionality reduction, denoising and anomaly detection.