Transformer - A Transformer is a neural-network architecture built around attention mechanisms that combine information from different positions in an input.
Transformer Language Model - A Transformer Language Model is a language model that uses Transformer layers to build contextual token representations and make language predictions.
Transformer Network - A Transformer Network is a neural network assembled from Transformer-style components, especially attention and feed-forward layers that build contextual...
Transient failure - A transient failure is a temporary malfunction that disrupts an observation or operation without necessarily leaving the component permanently broken.
Transient failure model - A transient failure model is a probabilistic description that allows a sensor or component to produce an occasional faulty result without assuming that the...
Transition-based - Transition-based describes an approach that constructs an output through a sequence of state-changing actions.
Transition constraint - A transition constraint is a rule that determines whether a change from one state to another is permitted.
Transition kernel - A transition kernel specifies a probability distribution over possible next states for each current state.
Transition model - A transition model describes how a system moves from its current state to a next state, sometimes depending on an action.
Transition probability - A transition probability is the conditional probability that a system moves to a specified state over a specified step or interval, given its starting state...
Transitive Dependency - A transitive dependency is an indirect functional dependency obtained through an intermediate attribute set.
Transitive Rule - The transitive rule is an inference rule for functional dependencies in relational database theory. If X → Y and Y → Z hold, then X → Z also holds.
Translation-invariant prior - A translation-invariant prior, in the location-parameter sense, assigns the same prior measure to equal-width parameter intervals regardless of where they lie.
Translation memory - A translation memory is a database of previously translated text segments paired with their corresponding translations.
Translation unit - A translation unit is a portion of text treated as a meaningful whole when translating.
Translational invariance - Translational invariance is the property that a model's relevant output remains unchanged when its input is shifted in position.
Transparency - Transparency in AI is the availability of meaningful information about a system, its use, and its outputs to the people who need to understand or assess them.
Transpose - The transpose of a matrix is formed by swapping its row and column positions. An entry originally in row i, column j moves to row j, column i.
Transposition table - A transposition table stores information about game positions that a search has already examined, so the information can be reused when a different sequence...
Traveling salesperson problem - The traveling salesperson problem, or TSP, asks for a minimum-cost tour that visits each required location once and returns to the starting location.
Traversed edges per second - Traversed edges per second, or TEPS, is a performance rate used to describe graph-processing work.
Treatment and control groups - Treatment and control groups are comparison groups used to assess an intervention.
Treatment-confounder feedback - Treatment-confounder feedback occurs when earlier treatment changes a later variable that both influences subsequent treatment and predicts the outcome.
Treatment effect - A treatment effect is the causal difference between outcomes under two specified interventions or treatment conditions.
Tree-based feature selection - Tree-based feature selection uses a fitted decision tree or tree ensemble to help choose which input features a model should retain.
Tree contraction - Tree contraction is an algorithmic technique that repeatedly reduces a tree to a smaller structure while preserving information needed to solve a problem.
Tree decomposition - A tree decomposition represents a graph as overlapping groups of vertices, called bags, connected in a tree.
Tree-like search - Tree-like search explores a tree of possible action sequences without maintaining a global record of every state already reached.
Tree-of-thought prompting - Tree-of-thought prompting organizes language-model problem solving as a search over alternative intermediate steps.
Tree selection policy - A tree selection policy is a rule for choosing which branch to follow while traversing a search tree.
Tree width - Tree width, commonly written treewidth, measures how small the largest bag can be in a valid tree decomposition of a graph, minus one.
Treebank - A treebank is a collection of sentences annotated with syntactic structures.
Trellis quantization - Trellis quantization chooses quantized values by searching paths through a graph of candidate decisions and states.
Trend analysis - Trend analysis examines how the underlying level or direction of a time series changes over a specified period.
Trend chart - A trend chart displays a measured quantity in time or observation order so that changes, recurring patterns and unusual values can be inspected.
Trend series - A trend series is an estimated time series that shows underlying movement after seasonal variation and irregular fluctuations have been reduced.
Trend-stationary process - A trend-stationary process is a time series that becomes stationary after removing a deterministic trend.
Triangle inequality - The triangle inequality says that the distance directly between two points is no greater than the sum of their distances through a third point.
Triangular network coding - Triangular network coding is a packet-coding approach that combines suitably shifted and zero-padded binary payloads using XOR operations.
Trifocal tensor - The trifocal tensor is a mathematical representation of the projective geometry connecting three camera views.
Trigram - A trigram is a sequence of three consecutive units, usually words or characters.
Trigram search - Trigram search retrieves or compares text using overlapping sequences of three characters.
Trimmed samples - Trimmed samples are samples from which a specified portion of the most extreme observations has been excluded for a particular analysis.
Trimmed statistics - Trimmed statistics are numerical summaries calculated after excluding a specified portion of extreme observations.
Triphone - A triphone is a context-dependent representation of a speech sound that includes its immediate left and right phonetic neighbors.
Triplestore - A triplestore is a database designed to store and query statements represented as subject - predicate - object triples, most commonly using RDF.
Triplet loss - Triplet loss is a training objective that encourages an anchor example to be closer to a related positive example than to an unrelated negative example by a...