Algorithms

aka A* beam search for sequence decoding

A sequence-decoding beam framework that ranks active hypotheses by accumulated score plus an optimistic future-score heuristic, uses shorter…

2 sources

aka A* search

A heuristic graph-search method that selects an open node using the sum of its best known path cost from the start and an estimated remainin…

1 source

aka ABRA-s, ABRA static progressive betweenness approximation

A progressive sampling algorithm for static-graph betweenness that averages fractions of shortest paths through each node over uniformly sam…

1 source

aka ABRA-s-fix, ABRA fixed-sample betweenness approximation

A fixed-sample static-graph betweenness algorithm that averages shortest-path fractions over a user-specified number of uniform endpoint pai…

1 source

A sequence-beam pruning procedure that first applies the beam-size cap, then discards candidates whose score is at least a specified positiv…

2 sources

aka AGDL

An approximate graph degree linkage algorithm that selects merges from maintained cluster-neighbor sets and updates those sets locally inste…

1 source

An episodic tabular on-policy control algorithm that propagates each selected-next-action temporal-difference error through accumulating sta…

8 sources

aka Adaptive boosting

Boosting that reweights training observations according to prior prediction errors.

1 source

An adaptive gradient optimization method that rescales gradients using exponentially weighted squared-gradient and squared-update histories.

1 source

An adaptive gradient optimization method that approximates matrix-valued second-moment statistics using row and column factors.

2 sources

An adaptive gradient optimization method that scales each coordinate's update using accumulated squared gradients.

1 source

aka Adaptive moment estimation

Stochastic gradient optimization using bias-corrected exponential estimates of first and second gradient moments to scale parameter updates.

2 sources

An Adam-family optimizer using an exponentially weighted infinity-norm gradient scale instead of a second raw moment denominator.

1 source

aka Adaptive MixUp

An adaptive interpolation-training procedure that learns example-dependent mixing-coefficient regions with a policy network and trains a cla…

2 sources

An Adam-family optimization method that uses time-dependent first- and second-moment decay schedules.

1 source

An Adam optimization variant that applies weight decay directly to parameters separately from gradient moment estimation.

1 source

An online optimizer-hyperparameter controller that compares sample quality under a current and a hypothetical setting, using either fresh ev…

3 sources

aka AAM (adaptive alternating minimization)

A two-coordinate minimization procedure that performs one exact alternating sweep over a newly supplied pair of feasible sets at each iterat…

1 source

aka Adaptive Metropolis algorithm

A history-adaptive random-walk Metropolis sampler whose Gaussian proposal covariance is estimated from the accumulated retained states, incl…

2 sources

aka Adaptive parallel tempering algorithm

A parallel-tempering algorithm that adapts temperature gaps and within-replica random-walk proposal parameters through projected stochastic…

1 source

aka ARS

The Gilks–Wild univariate rejection sampler that uses tangents to a concave log density as a piecewise-linear upper hull and chords as a low…

1 source

aka ASM

A random-walk Metropolis algorithm that adapts its proposal scale through stochastic approximation driven by the proposal acceptance probabi…

1 source

aka ASWAM

An adaptive Metropolis algorithm that combines acceptance-rate-driven scalar proposal scaling with recursive mean and covariance-shape adapt…

1 source

aka Zhang projected-gradient adversarial debiasing

An adversarial learning algorithm that trains a task predictor alongside a protected-attribute adversary, modifying the predictor gradient w…

2 sources

aka AECM, AECM Algorithm

A likelihood-optimization framework that alternates cycles of expectation and constrained maximization, permitting the admissible data augme…

1 source

aka Alternating I-Divergence Minimization, Alternating Information Projection

A paired-distribution optimization procedure that alternately minimizes Kullback-Leibler divergence in its first and second arguments over s…

1 source

aka Amortized SVGD

A differentiable stochastic-sampler training procedure that repeatedly generates a minibatch, computes kernelized Stein target-score directi…

2 sources

An Adam variant that normalizes first-moment updates with the coordinatewise historical maximum of second-moment estimates.

1 source

aka Gaussian-process assumed-density filtering, GP-ADF

A Gaussian assumed-density filtering algorithm that uses trained squared-exponential Gaussian-process transition and measurement models, ana…

2 sources

An exact without-replacement sampler for finite discrete Bayesian-network configurations that propagates conditional Gumbel subtree maxima t…

1 source

aka Unrestricted AND/OR abstraction sampling

An importance-sampling algorithm for partition functions of discrete graphical models that samples representatives in a pseudo-tree-guided A…

2 sources

aka AIS

A Monte Carlo estimation algorithm that draws from a tractable base distribution, applies Markov transitions invariant for a prescribed sequ…

1 source

aka ACO, Ant colony optimization metaheuristic

A metaheuristic framework for optimization in which artificial ants construct solutions using local information and communicate indirectly t…

1 source

aka ACS

An ant-colony optimization algorithm that combines a greedy-or-proportional construction rule, local pheromone updates during construction,…

2 sources

A constructive combinatorial optimization method in which artificial ants sample solution components using shared pheromone trails and probl…

1 source

A distributed telephone-routing algorithm that adapts neighbor-choice probabilities using mobile ant agents. Ants sample moves from destinat…

1 source

A family of cooperative ant-based optimization algorithms that learns shared edge desirabilities using Q-learning-inspired next-state estima…

2 sources

A distributed adaptive routing algorithm in which forward agents sample network paths and backward agents use the measured trip times to upd…

1 source

Frequent-itemset mining using breadth-first candidate enumeration and support-based pruning.

1 source

aka ASHA, Asynchronous Successive Halving Algorithm

An asynchronous resource-allocation algorithm that promotes promising completed hyperparameter trials through increasing resource levels as…

2 sources

A preprocessing-and-run algorithm that estimates a fixed noise setting for a stochastic SAT solver by probing a terminal-score mean-to-stand…

2 sources

An automated augmentation-policy search procedure that trains a controller to propose image-transform subpolicies and rewards those proposal…

1 source

aka ASGD

A stochastic gradient optimization method that maintains an average of parameter iterates in addition to the current iterate.

1 source

aka BPTT

A reverse differentiation algorithm that computes derivatives of a finite dynamic-system objective by propagating adjoints backward through…

1 source

aka Bootstrap aggregating

Ensemble learning that aggregates predictors trained on bootstrap samples.

1 source

aka BLDM, Balanced LDM

A two-way number-partitioning heuristic that first differences disjoint adjacent pairs in the sorted original list, then repeatedly differen…

1 source

aka BVM

An approximate SVM training procedure that uses fixed-radius enclosing-ball center updates in a transformed kernel feature space, with multi…

2 sources

A self-supervised representation-learning procedure that trains shared encoder and projection networks to make the cross-correlation of two…

3 sources

aka BasicILS(N)

A ParamILS algorithm-configuration method that compares candidate configurations using cost estimates on the same fixed number of target-alg…

1 source

aka Reciprocal-neighbor batch clustering, de Rham reciprocal-neighbor clustering

An agglomerative clustering procedure that alternates finding reciprocal nearest-neighbor pairs across the current clusters with merging a b…

3 sources

aka Bayesian Data Augmentation, Bayesian DA…

Tran et al.’s supervised deep-learning procedure that treats synthetic labeled examples as latent data, repeatedly samples them from an evol…

1 source

aka Optimal-ending beam search

A layer-based sequence beam decoder that retains the best completed hypothesis seen so far and stops when the highest current prefix score c…

2 sources

aka BULB, Limited discrepancy beam search

A memory-bounded beam search that explores heuristic-ranked slices using increasing limited-discrepancy budgets and removes backtracked slic…

3 sources

A layer-based beam search augmented with a stack of admitted evaluation ranges so that backtracking systematically revisits successors previ…

2 sources

A best-first search procedure that limits the entire open frontier to a fixed number of nodes by discarding the worst-ranked frontier nodes…

3 sources

The sequence-decoding beam procedure of Meister, Vieira and Cotterell that prioritizes active hypotheses by decreasing accumulated score, br…

3 sources

A search strategy that repeatedly expands the open node with the best value under a specified evaluation rule, adding eligible successors to…

2 sources

The original 2009 multistart CMA-ES algorithm that interlaces increasing-population attempts with randomized smaller population and initial-…

2 sources

aka Two-Class Multiple Kernel Clustering

A two-class unsupervised clustering procedure that jointly fits a nonnegative multiple-kernel combination and absolute-margin classifier usi…

1 source

aka Balanced Iterative Reducing and Clustering using Hierarchies

Clustering that compresses observations into a clustering-feature tree for subsequent grouping.

1 source

aka BBVI

A variational-inference procedure that estimates evidence-lower-bound gradients from samples of a tractable variational distribution using i…

2 sources

aka Blahut Rate-Distortion Algorithm

An alternating channel-and-marginal minimization algorithm for a fixed-source rate-distortion problem at a specified nonnegative distortion…

2 sources

aka BM3D

A grayscale image-denoising algorithm that stacks similar square patches into three-dimensional groups, jointly shrinks their transform coef…

1 source

aka Bayesian Optimization and Hyperband

A hyperparameter optimization algorithm combining Hyperband resource brackets with model-guided configuration proposals from performance-spl…

4 sources

aka Outlier detection using classifier instability, Bootstrap output-variance novelty detection

A novelty-detection procedure that trains classifiers on bootstrap resamples of reference data, estimates the variance of their outputs at a…

1 source

aka BYOL

A self-supervised image representation-learning procedure that trains an online predictor to match a stopped-gradient target projection from…

2 sources

aka Brandes algorithm

An exact graph algorithm for computing shortest-path vertex betweenness that combines single-source shortest-path counting with reverse-dist…

1 source

aka Brandes-Fleischer exact current-flow betweenness

An exact network-analysis algorithm that computes current-flow betweenness by forming grounded-Laplacian current-response rows, sorting each…

1 source

aka Brandes-Fleischer grounded resistance-sum closeness algorithm

An exact network-analysis algorithm that accumulates effective-resistance sums from successive columns of an embedded grounded-Laplacian inv…

1 source

aka Brandes-Fleischer current-flow betweenness approximation

A randomized network-analysis algorithm that estimates normalized, endpoint-excluded current-flow betweenness by independently sampling unif…

1 source

aka Brandes-Pich centrality estimation

A network-analysis procedure that estimates shortest-path closeness and betweenness from single-source computations at a selected subset of…

1 source

aka Beam search

A heuristic search procedure that advances by depth layers, retaining at most a chosen beam width of the best-ranked candidate nodes for eac…

2 sources

aka BFBnB

A heuristic graph-search procedure that expands states in breadth-first layers and prunes candidate paths whose accumulated cost plus an adm…

2 sources

aka BFIDA*, Breadth-first iterative-deepening A*

An iterative-deepening heuristic graph-search algorithm that repeatedly runs breadth-first branch-and-bound within increasing hypothetical f…

2 sources

aka BFS, Breadth first traversal

A graph or state-space traversal that expands vertices in nondecreasing shortest-path distance from a start vertex, where distance counts ed…

2 sources

aka Breakout

A finite constraint-satisfaction search method that takes strictly improving local assignment changes under a weighted nogood cost and incre…

1 source

Decision-tree induction extending ID3 with tests on continuous-valued features.

1 source

aka Classification and Regression Trees

Decision-tree induction using binary recursive partitioning for classification or regression.

1 source

A conditional RBM training algorithm that contrasts the observed output free energy with that of a prediction selected by input-initialized…

1 source

aka Chakrabarti focused crawler, Taxonomy-guided focused crawling

A focused web-acquisition procedure that uses a trained classifier over a supplied topic taxonomy to decide or prioritize hyperlink expansio…

1 source

aka CHAMELEON hierarchical clustering

A graph-clustering procedure that first partitions a sparse neighbor graph into small subclusters and then agglomerates them using interconn…

1 source

A finite-state Markov transition construction that partitions a circle into intervals with target-weight lengths and derives each transition…

4 sources

aka CLARANS, Clustering Large Applications based on RANdomized Search

A randomized medoid-clustering algorithm that searches fixed-size sets of representative observations by accepting improving single swaps an…

1 source

aka Classification Annealing EM, CAEM

A stochastic hard-clustering algorithm that samples component assignments from current mixture posterior probabilities raised to an inverse…

1 source

aka Classification EM, CEM (classification expectation maximization)

A model-based hard-clustering algorithm that computes mixture responsibilities, assigns every observation to a highest-responsibility compon…

1 source

aka CNM, CNM community detection…

A greedy community-detection algorithm that agglomerates graph vertices using modularity changes, with sparse change tables and heap-based m…

2 sources

aka CliXO

An overlapping hierarchical clustering heuristic that constructs a directed acyclic hierarchy from pairwise dissimilarities by selecting inf…

1 source

aka Melting Algorithm for Clustering

A scale-dependent clustering procedure that heats Gaussian-weighted center iterations to build a merging membership tree, then selects clust…

1 source

aka Complete BLDM

A complete anytime two-way number-partitioning search that carries signed effective cardinalities through difference and sum branches, uses…

1 source

aka CGA, Complete greedy algorithm for number partitioning

A complete anytime number-partitioning search that assigns weights in decreasing order to a fixed number of bins, explores the currently lig…

1 source

aka CKK

A complete anytime algorithm for two-way number partitioning that first follows Karmarkar–Karp differencing, then explores complementary sum…

1 source

aka CLARS

A layer-wise gradient optimization method whose published rate formula divides the current parameter-block L2 norm by the average L2 norm of…

3 sources

aka Multiway CKK

A complete anytime multiway number-partitioning search that combines partial bin assignments in alternative relative permutations, explores…

1 source

aka CNNDD, Condensed NNDD rule

A greedy reference-selection algorithm for the NNDD distance-norm decision rule that uses two passes over the original observations followed…

1 source

aka CPDD, Greedy prototype domain condensation

A greedy prototype-selection procedure that constructs kth-neighbor radius offsets from the full reference dataset and repeatedly chooses th…

1 source

aka Conditional Distribution Prediction

A search-effort estimation procedure that predicts the number of expanded nodes in a complete IDA* threshold iteration by recursively propag…

1 source

aka CGMC

A population Markov sampler that obtains a local-optimization anchor from one population member and updates another member along the anchor…

1 source

aka CD, CD-k

A parameter-learning algorithm for energy-based or product-of-experts models that replaces the equilibrium negative-phase expectation by con…

3 sources

aka CPC

A representation-learning procedure that encodes observations, summarizes preceding representations as context, and jointly trains these com…

2 sources

aka CVM

An approximate kernel training algorithm that reformulates supported constant-diagonal simplex quadratic programs as minimum enclosing balls…

4 sources

aka CVR

A support-vector regression training algorithm that approximates a penalized-bias, paired squared-slack formulation with a learned unconstra…

2 sources

aka CSVDD

An approximate one-class training algorithm that grows a core subset using the nearest expanded-sphere violator, refits support vector data…

1 source

A two-stage identification algorithm for a real-valued single-input single-output polynomial Hammerstein cascade that estimates a scaled lin…

2 sources

A two-stage identification algorithm for a real-valued single-input single-output polynomial Wiener cascade that estimates a scaled linear r…

2 sources

aka CMA-ES

An evolution strategy for continuous optimization that samples a multivariate normal search distribution and adapts its mean, covariance and…

1 source

aka CNL

A Metropolis-corrected Gaussian-reference sampler that combines a Crank–Nicolson treatment of the reference precision with an explicit gradi…

1 source

aka CN sampler

A Metropolis sampler for a Gaussian-reference target using a Crank–Nicolson discretization of the unpreconditioned reference Ornstein–Uhlenb…

1 source

aka Cross-entropy method for optimization

A stochastic optimization method that iteratively samples a parameterized search distribution, selects high-performing samples using an adap…

1 source

A rare-event probability estimation algorithm that fits a parametric importance-sampling proposal by cross-entropy minimization toward the n…

1 source

A Bayesian hierarchical-model diagnostic that leaves an assessed unit out of population-parameter fitting, generates predictive-prior and re…

3 sources

An online augmentation-policy adaptation procedure that samples image operations and adjusts their parameter-selection weights using classif…

6 sources

aka CURE, Clustering Using REpresentatives

An agglomerative clustering procedure that represents each cluster by several scattered points shrunk toward its mean and merges the pair wi…

1 source

A neural-network training procedure that starts without unit suppression and gradually increases Bernoulli dropout by decreasing the probabi…

2 sources

A training augmentation procedure that replaces a rectangular region of one image with the corresponding region of another and mixes their c…

2 sources

aka CPM3C

A fixed-kernel multiclass clustering procedure that fits latent winning-class margins by adding violated aggregate constraints and repeatedl…

1 source

aka Density-Based Spatial Clustering of Applications with Noise

Density-based clustering that connects dense neighborhoods and identifies unsupported observations as noise.

1 source

A clustering algorithm that jointly learns a nonlinear autoencoder and one latent representative per observation by combining reconstruction…

7 sources

aka DDPG

An off-policy actor–critic method for continuous control using neural function approximators and deterministic policy gradients.

1 source

aka DEC, Unsupervised deep embedding for clustering analysis

A neural clustering procedure that jointly refines an embedding and cluster centers by fitting Student-t soft assignments to periodically re…

2 sources

aka DIM

A representation-learning procedure that jointly trains an encoder and a dependence critic on matched versus mismatched global or local-to-g…

5 sources

aka DQN, Deep Q-network

A deep Q-learning method that trains a neural action-value function using replayed transitions and a separate target network.

1 source

A compositional approximation of neural-network Shapley attributions using component-level SHAP values and backward multipliers.

1 source

aka Deep clustering for unsupervised learning of visual features

A visual representation-learning procedure that alternates clustering current neural features into pseudo-labels and training the feature ex…

4 sources

aka Deep Learning Important FeaTures

A neural-network attribution method that distributes an output's difference from a reference activation to input differences using backward…

1 source

aka self-contained Girvan–Newman algorithm, strong/weak community validation for Girvan–Newman

A Girvan–Newman variant that retains a branching event in the reported hierarchy only when at least two resulting groups satisfy a selected…

1 source

aka Evolutionary Hyperband

A hyperparameter optimization algorithm that combines Hyperband resource schedules with differential-evolution populations at different reso…

2 sources

aka DRAM

An adaptive Metropolis procedure combining history-based Gaussian proposal covariance updates between transitions with corrected delayed-rej…

2 sources

aka Delayed rejection Metropolis-Hastings

A Metropolis-Hastings sampling procedure that can propose another candidate after rejection within the same transition, correcting acceptanc…

1 source

aka DFID, Iterative deepening depth-first search…

A search algorithm that repeatedly performs depth-first searches from the start with successively larger depth limits, redoing shallower wor…

2 sources

aka DFS, Depth first traversal

A graph or state-space traversal that follows a newly chosen successor down the current search branch and backtracks when that branch has no…

2 sources

aka Gaussian process regression with derivative observations

A Gaussian-process regression procedure that jointly conditions a sufficiently differentiable scalar-function prior on function values and p…

1 source

aka Deterministic Annealing EM, DAEM

A latent-variable likelihood-fitting procedure that performs deterministic powered-posterior EM updates along a warm-started cooling schedul…

1 source

A finite-state Metropolis sampler that uses partitions into ordered lines, retains a binary direction for each partition, and combines a nei…

1 source

A scheduled-sampling training procedure that replaces discrete model-feedback embeddings with differentiable soft mixtures, allowing later s…

1 source

aka DE

A population-based continuous optimization method that generates trial vectors using scaled differences between population members, combines…

1 source

aka Diffusion Map

A family of spectral embedding algorithms that normalizes a nonnegative symmetric affinity kernel into a reversible Markov operator and repr…

1 source

aka Dijkstra's algorithm, Dijkstra shortest path

A shortest-path algorithm for nonnegative edge weights that repeatedly settles the unsettled vertex with the smallest tentative distance fro…

2 sources

aka Self-distillation with no labels

A self-supervised representation-learning procedure that matches cross-view student probabilities to centered and sharpened probabilities fr…

2 sources

A deterministic derivative-free global optimization algorithm that adaptively partitions a bounded real search box, samples rectangle center…

1 source

aka DPO

Preference-based policy fitting using a classification objective on policy-to-reference probability ratios for preferred and dispreferred re…

1 source

A concurrent temporal-planning search procedure that alternates node expansion between a weighted goal-progress open list and a dispatch-con…

1 source

aka DBS

The inference procedure of Vijayakumar and colleagues that partitions a sequence beam budget into groups and updates each group using model…

1 source

A memory-limited breadth-first heuristic search that discards least-promising open nodes when its chosen capacity is reached and recovers a…

3 sources

aka DCBSS

A beam-stack search implementation that retains a small set of search layers and relay information, regenerates missing layers for backtrack…

2 sources

A univariate slice-sampling algorithm that expands a randomly placed initial interval by randomly directed doublings and uses shrinkage with…

1 source

A dropout-mask training procedure proposed to optimize the likelihood of a normalized geometric ensemble, updating through a selected shared…

1 source

The source’s MAX-rooted application of the dual of SSS*, using LIVE/SOLVED node descriptors, maximum-based merit updates and dual MAX/MIN ex…

1 source

A warmup procedure that tunes the logarithm of a Hamiltonian sampler’s integration step size using cumulative discrepancy from a target acce…

1 source

A neural-network training procedure that applies dropout during an initial portion of optimization and disables it for the remaining trainin…

1 source

Frequent-itemset mining using depth-first enumeration and transaction-set intersections.

1 source

The original sequential optimization algorithm of Jones, Schonlau and Welch for expensive deterministic scalar functions on bounded continuo…

1 source

aka ASelite

An Ant System variant that retains the standard all-ant pheromone deposits and adds extra reinforcement to edges of the best-so-far tour aft…

2 sources

aka ESS

A Markov-chain update for a target factored into a Gaussian prior and a likelihood, which performs an angular slice search along the ellipse…

1 source

A forward state-space search controller that repeatedly uses breadth-first search to find a state with a strictly smaller heuristic value, c…

1 source

A Bayesian global optimization algorithm that approximates the location of a function minimum on sampled representer points using expectatio…

2 sources

aka Eppstein-Wang closeness approximation

A randomized graph-analysis algorithm that estimates closeness centrality from independent uniformly sampled source vertices, averaging scal…

1 source

aka CDP epsilon-truncation

A modification of conditional distribution prediction for IDA* tree size that removes conditional child-type probabilities below a calibrate…

1 source

aka Hardt equalized-odds binary postprocessing

A randomized postprocessing algorithm that uses a binary predictor and protected-group membership to minimize expected label loss subject to…

1 source

A family of population-based optimization algorithms whose central offspring-generation mechanism estimates a search distribution from selec…

3 sources

aka Maximal-clique PoClustering

A dissimilarity-based clustering construction that accumulates maximal cliques of pairwise-distance threshold graphs and organizes their set…

2 sources

aka Convex Clustering with Exemplar-Based Models, Convex Mixture Model Clustering

An exemplar-based clustering procedure that fixes candidate component centers at every observed point, fits their simplex weights through a…

1 source

aka ECM Algorithm, ECM

An extension of expectation maximization that replaces a joint maximization of the expected complete-data log likelihood with a sequence of…

1 source

aka ECME Algorithm, ECME

An extension of expectation conditional maximization that replaces selected final conditional maximizations of expected complete-data log li…

2 sources

aka EM

Parameter estimation alternating expected complete-data log-likelihood evaluation and its maximization.

1 source

A Gaussian black-box optimization algorithm that adapts a search mean and full covariance factor from ranked samples in local standard-norma…

1 source

aka Agarwal exponentiated-gradient fairness reduction

A cost-sensitive classification reduction that alternates classifier best responses with exponentiated-gradient updates of bounded Lagrange…

1 source

aka EGLS

The Tsang–Mills–Ford extension of Guided Local Search that combines cost-scaled penalty weighting, aspiration for a new best original-object…

1 source

A statistical racing method for configuring metaheuristics that evaluates a finite candidate set on shared problem-instance blocks and elimi…

1 source

aka Fast Bayesian Optimization on Large Data Sets

A Bayesian hyperparameter optimization algorithm that jointly chooses a model configuration and training-data subset size using surrogate mo…

5 sources

An acoustic-model adaptation procedure that combines separately estimated speaker and environment LHUC transforms by interpolating their tra…

1 source

aka fVSSGP

The Gal–Turner finite spectral regression inference procedure that explicitly optimizes diagonal Gaussian output-coefficient factors and ind…

3 sources

aka Kusner counterfactual fair learning

A causal-model-dependent learning procedure that minimizes predictive loss averaged over inferred background variables, restricting the late…

1 source

aka Dwork fairness linear program

A finite-population optimization procedure that assigns outcome distributions to individuals to minimize expected loss under pairwise Lipsch…

1 source

aka FAA

An augmentation-policy search procedure that evaluates candidate transformations on held-out training examples using a fixed classifier trai…

5 sources

aka FastCPDD, FCPDD

A heuristic for selecting PDD prototypes that samples remaining reference observations, computes their radius offsets against the full datas…

1 source

aka Fast dropout

A dropout approximation procedure that replaces masked weighted sums by Gaussian distributions with matched means and variances, using Gauss…

2 sources

An incremental kernel clustering algorithm that chooses each new singleton seed by maximizing a computable lower bound on error reduction, t…

1 source

aka FLS

A neighborhood-search procedure that uses activation bits to scan selected subneighborhoods, deactivating unsuccessful ones and reactivating…

2 sources

aka FPCD

A persistent-chain RBM learning algorithm that adds rapidly updated, rapidly decaying auxiliary parameters to the sampling energy while reta…

1 source

aka Fast Independent Component Analysis

A family of independent-component estimation algorithms that repeatedly apply normalized approximate-Newton fixed-point updates to nonlinear…

2 sources

An idealized finite constraint-satisfaction search algorithm that takes any strictly cost-reducing single-variable change when available and…

1 source

A post-training visual-question-answering procedure that uses a parser to construct related questions and combines their generated FiLM scal…

1 source

aka FCFS beam decoding

The sequence beam-decoding procedure described by Kasai and colleagues that stores completed hypotheses separately from the continuing beam…

2 sources

aka Mixture-Weight Expectation Maximization

An expectation-maximization specialization that keeps every component distribution fixed and updates only their simplex mixing weights by av…

1 source

A semi-supervised classifier-training procedure that fits labeled examples and trains on strongly augmented unlabeled inputs using hard pseu…

3 sources

aka EXACT-FLOW-COMMUNITY, Flake exact-flow community algorithm

A seeded web-graph grouping procedure that adds infinite-capacity source arcs to seed vertices, makes original hyperlink connections bidirec…

2 sources

aka APPROXIMATE-FLOW-COMMUNITY, Flake focused-crawl algorithm

A flow-based focused-crawling family that alternates gathering a local web graph around positive seed pages, extracting a group through seed…

2 sources

An exact attention computation algorithm using tiling and recomputation to reduce transfers between GPU memory levels.

1 source

An execution algorithm for state-space sequence convolutions that fuses FFT-based convolution in GPU on-chip memory, uses block FFT matrix m…

1 source

A finite categorical conditional-update algorithm that splits excess probability from a maximum-probability state into additional bars and s…

1 source

aka FM (flow matching)

A generative-model training method that fits a time-dependent vector field by regression to velocities associated with a chosen probability…

1 source

A ParamILS algorithm-configuration method that adaptively extends paired evaluation prefixes until one configuration dominates the other, an…

1 source

A structured regularization procedure for fractal networks that trains shared parameters using locally selected nonempty subsets of join inp…

1 source

An information-exploration modification of tabular Q-routing that queries immediate neighbors whenever a node needs a routing decision and u…

1 source

A named cross-entropy optimization variant, called FACE in the source, that fixes an elite sample count and adapts the number of sampled can…

1 source

aka NCVB-UF

A nonconjugate variational inference procedure for a loss-defined mixed-effects generalized posterior that retains a joint Gaussian over fix…

2 sources

A Bayesian GLMM screening procedure that separates Gaussian prior and likelihood natural-parameter messages at local variational fixed point…

3 sources

aka Gaussian input Gaussian process moment matching

A Gaussian-process prediction procedure that analytically integrates a fixed squared-exponential posterior over an independently prescribed…

3 sources

aka GAM (generalized alternating minimization)

An information-geometric fitting framework that updates a generating distribution constrained by the observations and model parameters to de…

1 source

aka Generalized CVM, Generalized core vector machines

A kernel optimization algorithm that converts a quadratic program with a positive-semidefinite Gram matrix and simplex constraints into a ce…

2 sources

aka Generalized EM, GEM (generalized expectation maximization)

A latent-variable likelihood-fitting framework that computes the expected complete-data log likelihood under the current exact posterior and…

2 sources

aka Generic linkage algorithm (Müllner), GENERIC_LINKAGE

An agglomerative clustering algorithm that caches candidate nearest neighbors and lower bounds on row-minimum dissimilarities in a priority…

3 sources

aka Chen generic sampling, Generic importance-weighted tree sampling

An importance-sampling generalization of Chen heuristic tree sampling that merges representatives of ordered tree strata using specified pos…

1 source

aka GA

Evolutionary optimization using fitness-based selection and genetic variation of candidate solutions.

1 source

aka Genie linkage, Genie hierarchical clustering

An agglomerative clustering algorithm that normally selects a nearest pair by single-link distance and, when cluster-size inequality exceeds…

4 sources

aka Gibbs sampler

A Markov chain Monte Carlo algorithm that repeatedly draws a coordinate or block from its full conditional distribution given the current va…

2 sources

aka Girvan–Newman algorithm, edge-betweenness community detection

A divisive community-detection algorithm that repeatedly removes an edge with maximal current shortest-path betweenness and recalculates aff…

1 source

An incremental kernel clustering algorithm that adds a singleton datum cluster at each stage, runs kernel k-means from each such candidate p…

1 source

aka CMM-Initialized Global Kernel K-Means

An incremental kernel clustering algorithm that fits a convex mixture over datum exemplars once, restricts each new-cluster seed search to i…

1 source

aka Global Vectors for Word Representation

Word-vector learning from global word co-occurrence statistics.

1 source

aka Gradient boosting, GBM

Boosting that adds predictors fitted to negative loss-function gradients.

1 source

aka Global gradient norm clipping

A gradient transformation that bounds the Euclidean norm of a chosen joint parameter-gradient vector by uniformly scaling it down to a posit…

3 sources

aka Grad-CAM

A convolutional-network localization method weighting activation maps by spatially averaged gradients of a selected target output.

1 source

aka GDL, Graph degree linkage clustering

An agglomerative clustering algorithm that merges the pair with greatest symmetric graph-degree affinity, formed by summing products of clus…

1 source

aka GBFS

A best-first search algorithm that prioritizes open nodes by a heuristic estimate of remaining cost to a goal, without adding the cost alrea…

2 sources

aka Cartesian Hyperparameter Grid Search

A hyperparameter optimization procedure that evaluates a finite Cartesian product of chosen values for each configuration variable and selec…

1 source

aka Agarwal grid-search fairness reduction

A fairness-aware classification reduction that evaluates cost-sensitive classifier best responses over a grid of Lagrange-multiplier-derived…

1 source

aka Grinch algorithm

An incremental hierarchical clustering algorithm that uses set-wise linkage scores to revise a binary cluster tree through local rotations,…

5 sources

A randomized local-search SAT procedure that repeatedly flips a Boolean variable giving the largest change toward more satisfied CNF clauses…

1 source

A GSAT restart-initialization strategy that reuses agreements between earlier complete assignments, randomizes their differing positions, an…

1 source

A GSAT extension that starts each clause with weight one, uses weighted clause counts to select flips, and increases the weights of clauses…

1 source

A GSAT variant that mixes a random flip drawn from all formula variables with a globally best GSAT flip, without restricting the random choi…

1 source

aka GWSAT

A GSAT variant that mixes a uniformly chosen flip from the distinct variables currently occurring in unsatisfied clauses with a globally bes…

3 sources

A local-search algorithm that combines GLS feature-penalty updates with FLS activation-bit search, reactivating subneighborhoods associated…

2 sources

aka GGA

The Lau–Tsang genetic-search framework that uses shared adaptive solution-feature penalties both to modify fitness and to construct per-chro…

2 sources

A visualization method combining an upsampled Grad-CAM localization map with guided-backpropagation input-space scores.

1 source

aka GLS

A local-search metaheuristic that repeatedly minimizes an objective augmented by feature penalties, increasing selected penalties at local m…

1 source

A continuous-state Metropolis sampler that augments a univariate state with a binary direction, proposes a half-normal displacement along th…

1 source

aka HAC-E

A hierarchical network-clustering variant that greedily guides agglomeration by the observed edge density between two vertex groups and uses…

1 source

aka HAC-ES

A hierarchical network-clustering variant that guides agglomeration by the sum of cross-group edge density and Jaccard overlap of the groups…

1 source

aka HAC-ML

A greedy network-clustering algorithm that builds a hierarchical stochastic block structure by merging groups with the least loss of profile…

1 source

aka HAC-Q

A hierarchical network-clustering variant that uses a degree-corrected modularity contribution to guide group merges and retains hierarchica…

1 source

aka HMC, Hybrid Monte Carlo

A Markov chain Monte Carlo algorithm for differentiable continuous targets that augments positions with momenta, proposes a state through re…

2 sources

A conditional RBM training and prediction method that uses spectral hashing of inputs to retrieve distinct training-output configurations an…

2 sources

aka Hierarchical DBSCAN

Hierarchical density-based clustering that selects clusters across density scales.

1 source

aka Chen heuristic sampling

A randomized estimator of additive properties of an implicit rooted tree that processes ordered strata using one sampled representative and…

2 sources

aka Hill-climbing search, Greedy local search

A family of local-improvement search procedures that replaces a current solution with a strictly better neighbor and stops when no improving…

2 sources

aka HITS

A link-analysis ranking algorithm that constructs a query-focused directed page graph and alternately propagates authority scores from incom…

1 source

A classifier-system credit-assignment procedure in which satisfied condition/action rules compete using strength-and-specificity bids, winni…

1 source

A source-scoped SAT-search algorithm described by the literal composition of the 1995 GenSAT stages: a probability-controlled choice between…

2 sources

A GSAT variant that breaks ties among best-scoring variable flips by choosing the variable flipped least recently in the current attempt, us…

1 source

A hyperparameter resource-allocation algorithm that runs successive-halving brackets with different initial configuration counts and startin…

1 source

aka IA3, Infused Adapter by Inhibiting and Amplifying Inner Activations

A transformer adaptation method that learns task-specific vectors to rescale attention key/value channels and intermediate feedforward activ…

2 sources

aka Iterative Dichotomiser 3

Decision-tree induction that selects categorical attributes by information gain.

1 source

aka IDA*IM

An iterative-deepening heuristic search algorithm that learns a conditional model of search-tree cost increments, predicts later cost thresh…

1 source

A constrained classification procedure that models each known class by a mixture of elliptical category distributions, marginalizes category…

3 sources

A GenSAT variant that chooses the least recently flipped variable among all flips that do not decrease the satisfied-clause count, or among…

1 source

aka iCT (consistency training)

The consistency-model training procedure of Song and Dhariwal that learns directly from paired shared-noise data perturbations using a stop-…

1 source

aka ILDS

Korf’s discrepancy-search variant that uses a supplied maximum search depth and remaining discrepancy count to generate each path to that de…

2 sources

aka Incremental EM, IEM (incremental expectation maximization)

An EM variant for independent observed cases that refreshes selected cached case posteriors at the current parameters and then fits paramete…

2 sources

aka Independence Metropolis sampler, IMH

A Metropolis–Hastings sampler whose proposal distribution is fixed independently of the current state, with proposal-density ratios still in…

1 source

aka Infomax ICA, Bell-Sejnowski ICA

An unsupervised source-separation learning algorithm that adjusts an invertible square linear transform and biases by the ordinary gradient…

1 source

aka IMSAT, Information maximising self-augmented training

A discrete representation-learning procedure that combines self-augmentation consistency with an information objective, using categorical ou…

4 sources

A stochastic black-box optimization framework that adapts a parametrized sampling distribution using objective ranks and Fisher natural grad…

1 source

A finite-CSP repair-oriented backtracking controller that uses an existing complete assignment to order repairs while recursively extending…

1 source

An adversarial game-tree search procedure that augments NegaScout’s minimal-window traversal with recursively retained information from an i…

1 source

A group-wise Bayesian model diagnostic for latent Gaussian models that uses two INLA fits per selected group to compare remaining-data and w…

8 sources

aka ICT

A semi-supervised training procedure that encourages a student’s prediction at an interpolated pair of unlabeled inputs to match the same in…

1 source

aka IIC

A neural clustering procedure that maximizes mutual information between discrete cluster-assignment variables for paired unlabeled samples,…

2 sources

The original increasing-population restart CMA-ES algorithm, which independently restarts its weighted, rank-mu covariance-matrix-adaptation…

4 sources

aka Isometric Feature Mapping

A nonlinear dimensionality-reduction algorithm that estimates manifold geodesic distances by shortest paths in a local neighborhood graph an…

2 sources

aka ICM

A deterministic conditional-mode optimization algorithm that repeatedly updates one variable to a mode of its conditional distribution given…

2 sources

aka ILS

A metaheuristic that builds a single search trajectory among solutions returned by an embedded optimizer by perturbing the current accepted…

1 source

aka IWF

An iterative MAP image-denoising algorithm that majorizes a fixed Product of Student-t log-potential and alternates response-dependent preci…

1 source

A tree-search strategy that repeats depth-first search with increasing limits on the number of ordered successors considered at each parent,…

1 source

aka ICE

An incomplete-data parameter-estimation procedure that repeatedly replaces a chosen complete-data estimator by its conditional expectation g…

2 sources

A recursive heuristic tree-search procedure that repeatedly explores a lowest-valued child within a bound set by its caller and competing ch…

2 sources

aka ILBFS

An iterative organization of best-first tree search that explicitly retains a principal path and its immediate children, eagerly collapses a…

1 source

A limited-memory heuristic tree-search algorithm that explores branches within an iteratively revised cost threshold, stores bounds for bran…

1 source

A policy for selecting a sufficient search bias by trying a fixed family of search-space restrictions in increasing order of known evaluatio…

1 source

aka IDA*, Iterative-deepening-A*

A heuristic search algorithm that repeats depth-first passes bounded by f=g+h, starting with the start-state heuristic and raising each cuto…

2 sources

A memory-bounded solution-tree search algorithm for minimax evaluation of a finite uniform alternating game tree that controls an SSS*-style…

1 source

aka JULE, Joint unsupervised learning

An image representation and clustering procedure that alternates periods of graph-based agglomerative merging with convolutional-network upd…

2 sources

Clustering that partitions observations around centroids by minimizing within-cluster squared distances.

1 source

A dictionary-learning algorithm that alternates sparse coding of training samples with sequential updates of each dictionary atom and its ac…

1 source

aka KADABRA, KADABRA all-node adaptive betweenness approximation

An adaptive sampling algorithm for static-graph betweenness that averages internal-node indicators of uniformly sampled shortest paths and s…

2 sources

aka KADABRA balanced bidirectional BFS sampler, KADABRA shortest-path sampler

A shortest-path sampling algorithm that expands complete breadth-first-search frontiers from opposite endpoints according to frontier edge v…

2 sources

aka Karmarkar–Karp heuristic

A two-way number-partitioning heuristic that repeatedly replaces the two largest remaining nonnegative residuals by their difference, then r…

2 sources

aka Kernelized K-Means

A clustering algorithm that alternates nearest-feature-mean assignments and mean updates to minimize within-cluster squared distances in a k…

2 sources

aka Kernel PCA, KPCA

A spectral feature-extraction algorithm that performs principal component analysis on centered implicit feature vectors by eigendecomposing…

1 source

A model-agnostic Shapley-attribution estimator using weighted linear regression on feature-presence subsets.

1 source

aka Nonprincipal eigenvector hub-authority extraction

A link-analysis procedure that uses paired nonprincipal eigenvectors of the authority and hub Gram matrices of a query-focused directed page…

1 source

aka Knuth tree-size estimator

A randomized estimator of additive properties of a fixed backtracking tree that follows a sampled root-to-terminal path and weights each vis…

2 sources

aka L2-loss SVDD, Squared-hinge-loss support vector data description

A support-vector data-description algorithm that learns a feature-space sphere using squared-hinge penalties on squared-distance violations,…

1 source

aka Laplacian Eigenmap

A spectral embedding algorithm that builds a weighted neighborhood graph and uses nonconstant generalized eigenvectors of its graph Laplacia…

3 sources

aka LMNN, Large-margin nearest-neighbor classification…

A supervised metric-learning method that fits a positive-semidefinite distance matrix by pulling fixed same-class target neighbors together…

1 source

A dimensionality-reduction and graph-visualization algorithm that constructs an approximate weighted nearest-neighbor graph and learns low-d…

1 source

A neural-network training procedure that begins without dropout, activates it after a selected training cutoff and continues optimization wi…

2 sources

aka LAMB

A gradient optimizer that combines coordinate-wise Adam moment scaling with layer-wise normalization of the resulting update direction, opti…

2 sources

aka LARC

A parameter-block learning-rate control rule whose clipping form limits a vanilla stochastic-gradient step by using the smaller of a global…

2 sources

A gradient optimization method that multiplies each selected layer or parameter block direction by a scalar based on its current weight L2 n…

1 source

aka LFR, Learned Fair Representations

A prototype-based representation-learning algorithm that jointly balances reconstruction, supervised prediction and differences between grou…

2 sources

aka LHUC

A neural acoustic-model adaptation method that learns speaker- or environment-specific multipliers on hidden-unit activations while keeping…

1 source

aka LRTA*, Learning real-time A-star

A real-time heuristic learning algorithm that moves to a minimum estimated path-cost neighbor, stores that minimum edge-cost-plus-heuristic…

2 sources

aka LARS

Regression that advances along directions equiangular to predictors most correlated with the residual.

1 source

aka Lee-Seung NMF Updates

The Lee-Seung block multiplicative algorithms for nonnegative matrix factorization, using objective-specific elementwise factor rescaling to…

1 source

aka LDS

A backtracking tree-search strategy that repeatedly explores paths under an increasing upper limit on deviations from a successor-ordering h…

3 sources

aka L-BFGS, Limited-memory Broyden-Fletcher-Goldfarb-Shanno

A limited-memory quasi-Newton optimization method using a bounded history of parameter and gradient differences to compute approximate inver…

1 source

A discrete conditional sampling algorithm that proposes a category from the full conditional distribution with the current category excluded…

1 source

aka Lattices by Leveraging Agglomerations and Multiple Ancestors

An agglomerative clustering algorithm that unions each current cluster with a nearest neighboring cluster in successive rounds and retains t…

2 sources

aka LIME

A prediction-explanation method fitting an interpretable surrogate to locally weighted samples of a model's behavior.

1 source

aka LOF

An unsupervised local outlier-scoring procedure that compares each observation's inverse mean reachability distance with those of its tie-in…

3 sources

aka LSS-LRTA*, Local search space LRTA*

A real-time heuristic learning algorithm that constructs a bounded local search space with A*, repairs the heuristic values of its expanded…

2 sources

aka LLE

A nonlinear dimensionality-reduction algorithm that learns sparse, sum-to-one linear reconstructions of each point from nearby points and co…

2 sources

aka Lookup CDP

A computational variant of conditional distribution prediction that precomputes or memoizes fixed-model subtree expansion-count estimates fo…

1 source

aka LoRA

A parameter-efficient adaptation method that freezes pretrained weights and learns additive low-rank matrix updates.

1 source

A processor-configuration optimizer that evolves a symmetry-based network encoding through constrained swap mutation and rank-grouped offspr…

1 source

A memory-controlled heuristic tree-search algorithm that stores separate lower bounds for absent and all successors, expands promising conti…

1 source

A neural-network training procedure that interpolates paired examples’ representations at a selected network layer and interpolates their la…

1 source

A memory-controlled heuristic search algorithm for acyclic AND/OR graphs that expands a marked partial solution graph, revises lower-bound c…

1 source

aka MCMC-SAEM, SAEM-MCMC…

A stochastic approximation EM extension that advances a persistent latent-state Markov chain targeting the conditional distribution at the c…

2 sources

A greedy fixed-dictionary approximation algorithm that repeatedly selects a unit-norm atom by its absolute correlation with the current resi…

2 sources

A Bayesian global optimization algorithm that chooses evaluations using an approximate information acquisition for the latent maximum functi…

2 sources

A sequence-beam pruning procedure that limits how many retained candidate extensions may come from the same predecessor hypothesis, discardi…

2 sources

aka Coding likelihood estimation, Coding maximum likelihood estimation

A conditional parameter-estimation method that selects mutually non-neighboring sites in a Markov field and maximizes their joint conditiona…

2 sources

aka MPLE

A parameter-estimation method that maximizes the product of a specified model’s sitewise full conditional probabilities or densities evaluat…

1 source

aka MMAS

An ant-colony optimization algorithm that reinforces solution components from a single selected best ant per iteration, constrains pheromone…

1 source

Mode-seeking clustering that moves candidate centers toward local density maxima.

1 source

A semi-supervised classifier-training procedure that regularizes a student prediction toward the prediction of a same-architecture teacher w…

2 sources

aka Mean-field theory learning algorithm

A deterministic approximation to Boltzmann-machine parameter learning that substitutes mean-field phase statistics for stochastic equilibriu…

1 source

A capacity-limited variant of per-length best-first sequence beam search that, when its chosen total queue capacity is reached, removes the…

2 sources

aka MALA

A Metropolis–Hastings sampler that proposes a Gaussian step with drift proportional to the target log-density gradient and corrects the asym…

2 sources

aka MWG

A componentwise Monte Carlo scheme that uses Metropolis–Hastings transitions targeting full conditional distributions for one or more coordi…

1 source

aka MH

A Markov chain Monte Carlo algorithm that proposes a new state from a specified transition distribution and accepts it with the smaller of o…

2 sources

aka Min-conflicts

A constraint-repair value-selection heuristic that uses a complete assignment to choose a value for a conflicted variable with as few confli…

1 source

A bounded single-agent lookahead planner that backs up minimum path-cost-plus-heuristic frontier estimates and prunes branches using an incu…

2 sources

A semi-supervised classifier-training procedure that averages predictions over augmented unlabeled inputs, sharpens the resulting soft targe…

1 source

A training-data interpolation procedure that fits a predictor to convex combinations of example inputs and their corresponding targets using…

1 source

The original neural action-value learning procedure that uses a selected-next-action temporal-difference error to update weights through acc…

1 source

aka MoCo

A contrastive representation-learning mechanism that maintains a queue of encoded negative keys and produces new keys with an encoder update…

1 source

aka GP with monotonicity information, Gaussian process with monotonicity information

A Gaussian-process inference procedure that promotes monotonicity in selected input coordinates by combining observed outputs with finite vi…

1 source

aka MCEM, Monte Carlo EM

An expectation-maximization method that approximates the current conditional expected complete-data log objective by Monte Carlo integration…

1 source

A recursive heuristic search algorithm that retains an explicit search graph within available additional memory, explores unstored successor…

1 source

The original Swersky–Snoek–Adams 2013 family of Bayesian optimization procedures that uses a Gaussian process with separable finite-task and…

1 source

aka Multi-Class Multiple Kernel Clustering

A multiclass unsupervised clustering procedure that jointly fits shared nonnegative multiple-kernel weights and latent class-score functions…

1 source

A Bayesian evidence-synthesis diagnostic that partitions information at replicated separator nodes, stacks declared contrasts between transf…

3 sources

aka MTM

A Metropolis sampling algorithm that selects a candidate from several weighted forward proposals, draws a backward reference set containing…

1 source

aka MTM-Gibbs, Griddy Gibbs multiple-try Metropolis

A coordinate-update sampler that applies a multiple-try Metropolis transition to a conditional target while holding all other coordinates fi…

1 source

aka MVKKM

A multiview clustering algorithm that alternates kernel k-means on a power-weighted combination of fixed view kernels with simplex view-weig…

1 source

A multiway number-partitioning heuristic that represents partial partitions by normalized bin-load vectors and repeatedly combines two selec…

2 sources

aka Muon

A neural-network optimization method that approximately orthogonalizes momentum-based matrix updates using Newton–Schulz iterations.

1 source

aka MINE, Mutual information neural estimator

A mutual-information estimation procedure that trains a neural statistics function to maximize a Donsker–Varadhan objective contrasting join…

3 sources

aka Nesterov-accelerated adaptive moment estimation

An Adam-family optimizer combining adaptive moment scaling with a Nesterov-style momentum update.

1 source

A NASNet training regularizer that stochastically suppresses operation-bearing edges within convolutional cells using a drop probability tha…

1 source

aka NES

A family of black-box optimization algorithms that adapts a parameterized search distribution using estimates of the natural gradient of exp…

1 source

A finite-state MCMC construction that augments a reversible chain with its preceding state and replaces a conditional resampling step with a…

2 sources

aka Nearest neighbor domain description (Angiulli), NNDD distance-norm rule

A one-class decision rule that forms the ordered distances from a query to its first k reference neighbors and accepts the query when the L_…

2 sources

aka Nearest neighbor distance ratio data description, Nearest-neighbor data description (Tax-Duin)

A target-class data-description algorithm that scores a query by its distance to a nearest reference observation divided by that observation…

2 sources

aka Nearest neighbor chain algorithm, NN-chain clustering

An agglomerative clustering algorithm that follows a chain of nearest clusters until its last pair are reciprocal nearest neighbors, merges…

7 sources

aka Neighborhood components analysis, NCA

A supervised metric-learning algorithm that learns a linear transformation by maximizing the expected number of correctly classified trainin…

1 source

A finite conditional transition construction that starts with independent draws from the conditional distribution and successively applies m…

1 source

aka NVIL

A method for jointly training a directed latent-variable model and an amortized stochastic inference network by maximizing a variational log…

2 sources

aka Newman fast community detection, Newman agglomerative modularity

Newman’s direct edge-fraction-matrix algorithm for greedy agglomerative community detection, which starts with singleton vertices, joins adj…

2 sources

aka Newman matrix algorithm for random-walk betweenness

An exact network-analysis algorithm that computes random-walk betweenness from an embedded inverse of a grounded graph Laplacian, explicitly…

2 sources

aka AlignOntology

An iterative ontology-alignment algorithm that combines shared-terminal set overlap with parent and child neighborhood similarities, then gr…

1 source

aka NeXO construction algorithm

A network-based ontology-construction procedure that starts from a probabilistic hierarchy of gene communities, removes unsupported binary r…

2 sources

The original 2014 slice-based NUTS algorithm, which adapts a Hamiltonian trajectory’s length through randomly directed binary-tree doubling…

2 sources

aka NCVMP

An approximate inference algorithm that restricts variational blocks to exponential families and updates their natural parameters by matchin…

3 sources

A classical image-denoising algorithm that estimates each pixel by a normalized average of observed pixel values, assigning exponential simi…

1 source

A Metropolis transition algorithm that retains a signed uniform acceptance variable, updates it by wrapped translation, and rescales it afte…

1 source

aka Norm stabilization regularization, Norm-stabilizer regularization

A recurrent-network regularization procedure that adds a penalty on the average squared change in Euclidean norm between successive selected…

1 source

aka Novelty

A clause-based SAT local-search heuristic that ranks candidate flips by total violation count with oldest-variable tie breaks, normally sele…

2 sources

aka Novelty+

A Novelty extension that, at each SAT search step, chooses a random variable from a randomly selected unsatisfied clause with a fixed walk p…

2 sources

A stochastic gradient optimizer that rescales each parameter block gradient by a scalar running second moment of that block gradient norm be…

3 sources

aka Nu-SVC, ν-SVC…

A supervised binary-classification algorithm that jointly fits a regularized kernel hyperplane and a nonnegative margin level, using nu to r…

1 source

aka Nu-SVR, ν-SVR…

A supervised regression algorithm that jointly fits a regularized kernel expansion and a nonnegative constant epsilon-insensitive tube half-…

1 source

aka Oja’s Rule

A single-output linear-neuron learning rule that combines a Hebbian input-output weight increment with an output-squared weight decay, obtai…

1 source

aka OCSVM, One-class SVM…

A support-estimation algorithm that optimizes a kernel feature-space score relative to the origin using a norm penalty, a learned offset and…

1 source

An online planning-and-scheduling procedure that plans successive jobs by goal-regression A* over logical conditions, variable bindings, sha…

2 sources

aka Ordering Points To Identify the Clustering Structure

Density-based clustering analysis that orders observations using reachability across neighborhood scales.

1 source

aka OPTICS-OF, OPTICS with outlier factors

An unsupervised local outlier-scoring procedure that uses self-inclusive, tie-inclusive nearest neighborhoods to compute inverse mean neighb…

8 sources

aka Order-agnostic training of NADE

A stochastic training procedure that shares neural conditional parameters across variable orderings and estimates the order-averaged NADE lo…

1 source

aka Forward regression orthogonal least squares, FROLS

A greedy fixed-candidate regression algorithm that repeatedly adds the column giving the largest reduction in squared residual after joint l…

3 sources

aka OMP

A greedy fixed-dictionary approximation algorithm that selects an atom correlated with the current residual and recomputes the approximation…

3 sources

aka Otsu’s method, Otsu threshold selection

A histogram-based threshold-selection algorithm that partitions ordered gray levels by maximizing class-weighted between-class variance, equ…

1 source

A Bayesian global optimization algorithm that selects evaluations using an approximation to information about the latent maximum function va…

2 sources

aka OHC clustering

A graph-based agglomerative clustering algorithm that expands clusters across increasing distance thresholds when the change in induced edge…

1 source

aka Pairwise Controlled Manifold Approximation Projection

A nonlinear dimensionality-reduction algorithm that embeds neighbor, mid-near and farther point pairs using separate attractive and repulsiv…

1 source

aka PageRank citation ranking

A link-analysis ranking algorithm that assigns node scores using a random walk mixing normalized outgoing-link transitions with teleportatio…

3 sources

aka PDM

A two-way number-partitioning heuristic that sorts residuals and differences disjoint adjacent pairs in whole rounds, carries an unpaired re…

2 sources

A randomized 2-SAT search procedure that starts from any complete truth assignment and repeatedly selects an unsatisfied clause and flips a…

1 source

A block-alternating Newton-like method for fitting an admixture of Poisson Markov random fields through a sparsity-penalized nodewise Poisso…

3 sources

A batch Bayesian optimization algorithm that jointly selects parallel evaluations of one scalar objective using approximate information gain…

2 sources

A batch Bayesian optimization algorithm for multiple objectives and unknown constraints that jointly selects parallel evaluation locations u…

2 sources

aka Replica exchange Monte Carlo, Metropolis-coupled Markov chain Monte Carlo

A population Monte Carlo method that combines within-temperature target-preserving updates with corrected exchanges between replicas targeti…

1 source

aka PX-EM, Parameter-Expanded EM

An expectation-maximization construction that fits an expanded complete-data model with auxiliary parameters, reduces its result to the orig…

1 source

aka Parametric Uniform Manifold Approximation and Projection

A parametric dimensionality-reduction algorithm that trains a neural mapping from input points to embedding coordinates using sampled attrac…

2 sources

An iterated-local-search framework for algorithm configuration that searches finite parameter settings through one-parameter neighborhood mo…

1 source

A NegaScout variant for adversarial game-tree search that retains prove-best information near the root of each subtree and the principal var…

1 source

A Bayesian generalized linear mixed-model inference procedure that uses cluster-specific partial noncentering to define independent Gaussian…

1 source

aka PSO

A population-based optimization method that moves candidate particles through a search space using retained velocities and stochastic attrac…

3 sources

aka Agglomerative clustering via maximum incremental path integral, PIC (path integral clustering)

An agglomerative clustering algorithm that merges clusters with the greatest increase in their size-normalized sums of discounted random-wal…

1 source

aka FCFS beam decoding with controlled patience

A generalization of first-come, first-served sequence beam decoding that retains beam width k for continuing hypotheses but uses a positive…

2 sources

The 1996 tabular incremental Q(lambda) algorithm that combines a direct one-step Q-learning update for the current state-action pair with a…

2 sources

aka Purity Enhancing Rotations for Cluster Hierarchies

An online hierarchical clustering algorithm that inserts observations near existing leaves of a binary cluster tree and uses masking and bal…

4 sources

aka PCD

A learning algorithm that estimates an energy model’s negative-phase statistics with Markov chains whose states persist across parameter upd…

2 sources

An adaptive computation variant of Predictive Entropy Search with Constraints that alternates full inference and acquisition updates with pa…

4 sources

aka Potential of Heat Diffusion for Affinity-based Transition Embedding

A dimensionality-reduction algorithm that computes diffusion transition probabilities, measures Euclidean distances between their negative-l…

1 source

aka Π-model

A semi-supervised classifier-training procedure that combines labeled cross-entropy with squared disagreement between two stochastic predict…

2 sources

An approximate PoClustering algorithm that incrementally extends and prunes clique sets to cover the edges of dissimilarity-threshold graphs…

1 source

aka PBA

An augmentation-schedule learning procedure that jointly trains a population of child classifiers and evolves their augmentation hyperparame…

3 sources

aka PBT

A population-based neural-network training procedure that interleaves parameter updates with performance-guided copying of partially trained…

1 source

aka PBIL

An optimization method that samples candidate solutions from a probability-vector representation and incrementally moves that representation…

1 source

aka PIC (power iteration clustering)

A clustering algorithm that uses an early-stopped power iteration of a normalized similarity matrix to embed observations and then applies k…

2 sources

aka pCNL

A Metropolis-corrected Gaussian-reference sampler that preconditions the potential-gradient drift by the reference covariance and uses a sca…

1 source

aka pCN

A Metropolis sampler for a Gaussian-reference target whose proposal combines the current state with an independent draw from that reference…

1 source

A Bayesian global optimization algorithm that approximates information about the global maximizer by subtracting maximizer-conditioned predi…

3 sources

A Bayesian multi-objective optimization algorithm that selects evaluations using an approximate information gain about the Pareto set, compu…

3 sources

A Bayesian optimization algorithm for multiple objectives and unknown constraints that selects evaluations using approximate information gai…

4 sources

A Bayesian optimization algorithm for an unknown objective and unknown inequality constraints that selects evaluations using an approximatio…

3 sources

An adversarial recurrent-network training procedure that retains teacher-forced likelihood learning while training an auxiliary discriminato…

1 source

aka PDD radius-offset rule

A one-class decision rule that accepts a query when its metric distance to at least one prototype, plus that prototype's stored radius offse…

1 source

aka PPO

A family of policy-gradient algorithms alternating collected interaction data with repeated optimization of a surrogate objective using clip…

1 source

A semi-supervised neural-network training procedure that recomputes hard labels from the model’s most probable class for unlabeled examples…

1 source

aka Pseudo-linear regression algorithm

A family of recursive coefficient estimators that uses the current regressor as a surrogate prediction sensitivity, omitting derivatives thr…

1 source

A model-free reinforcement-learning method that incrementally updates action-value estimates toward an observed reward plus the discounted m…

1 source

A distributed adaptive packet-routing algorithm that learns destination-specific delivery-time estimates by combining observed local queue a…

1 source

aka R-Novelty

A Novelty-derived SAT heuristic whose choice between the best and second-best flips depends on their objective-score gap when the best varia…

3 sources

aka R-Novelty+

The 1999 R-Novelty extension that replaces its periodic random override with a fixed per-step probability of a random clause-variable flip a…

3 sources

aka Radicchi divisive algorithm, modified edge-clustering community detection

A divisive graph-community algorithm family that repeatedly removes edges with the lowest modified cycle-based edge-clustering score, update…

1 source

An image-augmentation procedure that applies a uniformly sampled sequence of operations sharing one magnitude parameter, reducing augmentati…

1 source

aka ROAR, Random Online Adaptive Racing

An algorithm-configuration procedure that proposes uniformly random parameter settings and compares each challenger with an incumbent throug…

1 source

aka Random Hyperparameter Search

A hyperparameter optimization procedure that draws trial configurations independently from a specified search distribution, evaluates their…

1 source

aka RWMH

A Metropolis–Hastings sampler that proposes a new state by adding an increment drawn from a fixed distribution independent of the current st…

1 source

aka Randomised latent score conflict diagnostic

A Bayesian hierarchical-model diagnostic that freezes draws from a parent posterior excluding selected child data, draws child latent parame…

1 source

aka ASrank

An Ant System variant that weights pheromone deposits from a selected number of the current iteration’s best tours by rank and adds a separa…

1 source

aka RBFSϵ

A recursive best-first search variant that adds a finite nonnegative epsilon tolerance to the competitive expansion threshold, retaining the…

1 source

aka RBFSkthrt

A bounded-suboptimal recursive best-first search variant that divides a quality budget w between a heuristic factor w^((k-1)/k) and a compet…

1 source

aka RTA*, Real-time A-star

A real-time heuristic search algorithm that moves to a neighbor with minimum edge-cost-plus-heuristic estimate and stores the second-best su…

2 sources

aka RTAA*

A real-time heuristic search algorithm that repeatedly runs bounded forward A*, updates every expanded state to the selected next-to-expand…

2 sources

aka RTRL

A recurrent-network training algorithm that propagates state sensitivities to adjustable weights forward in time and contracts those sensiti…

1 source

aka RS clustering

A hierarchical clustering algorithm that follows nearest-neighbor chains to construct sub-clustering trees around reciprocal pairs, prunes o…

1 source

aka RAdam

An Adam-family optimizer that rectifies its adaptive update using a time-dependent estimate of the effective history of the second-moment st…

1 source

aka RF (rectified flow)

A transport-learning method that regresses a velocity field on endpoint differences along straight interpolations of coupled samples and use…

2 sources

aka RBFS

A recursive search algorithm that explores the best stored subtree alternative within an upper bound and conditionally passes a previously b…

2 sources

aka RBFS_CR, RBFS with bounded overhead

An RBFS variant that estimates subtree evaluation-value distributions and inflates backed-up values to make later visits expand geometricall…

2 sources

aka Recursive prediction error method

A recursive parameter-estimation method that incrementally adjusts a parameterized predictor using prediction errors and search directions b…

1 source

aka Aging Evolution

An evolutionary neural-architecture search algorithm that selects a parent by recorded validation accuracy from a uniformly sampled tourname…

2 sources

aka RIM, Regularised information maximisation

A discriminative clustering framework that fits conditional class probabilities by maximizing empirical input–assignment mutual information…

1 source

aka REINFORCE algorithm

A family of stochastic reinforcement-learning update rules that multiply a sampled reward relative to an admissible baseline by the derivati…

2 sources

aka Accept-reject sampling

A random-variate generation algorithm that draws proposals from a normalized envelope dominating an unnormalized target and accepts each wit…

1 source

An independence Metropolis sampler whose proposals are generated by a rejection procedure with a fixed possibly non-dominating envelope, fol…

2 sources

aka Relevance-conscious topic distillation, Chakrabarti relevance-weighted distillation

An iterative web-link ranking procedure that alternates authority and hub score propagation using destination relevance for forward contribu…

1 source

aka RCA

A partially supervised linear metric-learning procedure that estimates within-group covariance from positive equivalence constraints and whi…

1 source

A semi-supervised classifier-training procedure that adjusts weak-view guessed labels toward an estimated class prior, sharpens and anchors…

4 sources

aka Rprop

A gradient-based optimization method that adapts coordinate step sizes using successive gradient signs and takes sign-directed parameter ste…

1 source

aka RWS

A learning procedure for paired generative and inference networks that uses multiple inference samples and normalized importance weights for…

1 source

aka RK betweenness approximation, Riondato–Kornaropoulos betweenness sampling

A fixed-sample graph betweenness approximation algorithm that chooses a sample count using a VC-dimension bound for shortest-path incidence…

1 source

aka POP–BAS–OUT mixture fitting

A two-stage mixture-parameter fitting procedure that estimates a regular component from a threshold-selected basic subset of a contaminated…

1 source

An adaptive gradient optimization method that normalizes coordinate updates using an exponentially weighted estimate of squared gradients.

1 source

aka RAM

An adaptive random-walk Metropolis algorithm that updates the proposal shape factor by a rank-one transformation driven by the proposal dire…

1 source

aka RCC clustering

A clustering algorithm that optimizes one representative per observation using squared data fidelity and robust attraction along a neighborh…

5 sources

aka ROCK, Robust Clustering using linKs

An agglomerative clustering procedure that merges clusters using shared-neighbor link counts divided by a cluster-size normalization derived…

1 source

An image-classification augmentation procedure that averages an anchor image with a randomly selected training image using equal pixel weigh…

1 source

aka State-action-reward-state-action

An on-policy temporal-difference control algorithm that updates the current state-action value toward the observed reward plus the discounte…

2 sources

An autoregressive sequence-training procedure that chooses between reference and model-produced previous outputs as feedback, using a schedu…

2 sources

aka Self-labelling via simultaneous clustering and representation learning, Self-labeling via simultaneous clustering and representation learning

A self-supervised representation-learning procedure that alternates neural pseudo-label prediction and dataset-wide self-labelling through a…

3 sources

aka Xu2004 Maximum Margin Clustering

A binary clustering procedure that relaxes latent label-equivalence matrices to a convex semidefinite program for a fixed-kernel soft-margin…

1 source

aka Semiparametric LP regression

A supervised regression algorithm that jointly fits a finite kernel expansion and an unpenalized supplied parametric basis by minimizing fix…

1 source

aka Semiparametric SV regression

A supervised regression algorithm that jointly fits an unpenalized finite expansion of supplied basis functions and a kernel component, mini…

1 source

aka Xu2004 Semisupervised Maximum Margin Clustering

A semisupervised binary margin-learning procedure that adds observed-label pair constraints and labeled-to-unlabeled linkage constraints to…

1 source

The Gaussian population natural evolution strategy that samples independent normal coordinates, ranks their evaluated fitness, and adapts th…

1 source

A Bayesian graphical-model diagnostic that duplicates a selected separator node or node vector, partitions the information informing it, and…

1 source

aka SMAC

A sequential algorithm-configuration procedure that uses random-forest performance models to propose parameter settings and compares candida…

1 source

The original residual-network training and inference procedure that combines two learned branch outputs with complementary uniform random we…

1 source

A residual-network regularization procedure that uses a Bernoulli switch to alternate ordinary residual computation with separately specifie…

2 sources

The Tan–Ong–Nott–Jasra sparse-spectrum regression inference procedure that alternates a Gaussian nonconjugate variational proposal for a sha…

2 sources

aka Simple framework for contrastive learning of visual representations

A self-supervised representation-learning procedure that jointly trains an encoder and a nonlinear projection head by contrasting two augmen…

1 source

aka SRBFS

A recursive best-first search procedure that initializes generated children from their static evaluation values, explores the best child wit…

2 sources

aka SMA*

A node-budgeted best-first tree-search algorithm that generates one successor at a time, propagates evaluation values through pathmax and co…

1 source

A self-supervised representation-learning procedure that trains a shared encoder and predictor to match the encoder output of another augmen…

1 source

A stochastic optimization procedure that explores candidate configurations with temperature-controlled acceptance of cost-increasing moves a…

2 sources

A simultaneous-inference procedure for a declared family of linear functions of model parameters that standardizes joint estimates and uses…

1 source

An auxiliary-variable Monte Carlo method that augments a target density with a uniform height below its graph and updates the state using a…

1 source

A learned augmentation procedure that trains a network to synthesize examples from same-class inputs while receiving both a within-class ref…

1 source

A sensitivity-map smoothing method that averages maps computed on Gaussian-noise perturbations of an input.

1 source

aka SAC

An off-policy actor-critic algorithm fitting a stochastic policy and soft value functions under a reward-plus-policy-entropy objective.

1 source

The 2017 maximum-entropy continuous-control learning algorithm that fits neural soft action values from replayed transitions and trains an a…

3 sources

aka SAGE Algorithm, Space-Alternating GEM

A generalized expectation-maximization method that updates selected parameter blocks using block-specific hidden-data spaces or valid object…

3 sources

aka Sparse EM

An EM variant that updates relative latent-state probabilities within selected plausible sets while preserving their total mass and all outs…

1 source

aka pruned PAM Gibbs sampling

An approximate pachinko-allocation fitting procedure that restricts token path resampling to currently active document topics and word-assoc…

1 source

aka SSGP-EMM

An uncertain-input prediction algorithm that analytically integrates sine/cosine feature moments of a fixed sparse-spectrum Gaussian-process…

3 sources

aka SSGP-Lin

A local uncertain-input prediction algorithm for a fixed sparse-spectrum Gaussian-process posterior that linearizes the posterior mean at th…

4 sources

aka SAT-LHUC

An acoustic-model training procedure that jointly learns shared network parameters, training-speaker hidden-unit contribution transforms and…

1 source

An acoustic-model adaptation procedure that updates a small set of pooling parameters for a target speaker using decoded acoustic targets wh…

1 source

An unsupervised binary-code learning algorithm that approximates a spectral similarity-preservation objective using a PCA-aligned rectangula…

1 source

aka Stacked generalization

Ensemble learning that trains a final estimator on base-estimator predictions.

1 source

An interacting-particle inference algorithm that approximates a differentiable continuous target by synchronously transporting particles wit…

3 sources

aka SVPG

A policy optimization method that applies Stein variational gradient descent to an entropy-regularized distribution over policy parameters,…

2 sources

A univariate slice-sampling algorithm that randomly places a width-w interval around the current point, expands it in width-w steps under a…

1 source

aka SAEM, Stochastic Approximation EM

An incomplete-data fitting method that recursively averages simulated complete-data log objectives or sufficient statistics using a step-siz…

2 sources

aka SBS

The sequence-sampling algorithm of Kool, van Hoof and Welling that implements Gumbel-Top-k without replacement implicitly on a locally norma…

2 sources

A residual-network training procedure that randomly bypasses residual transformations during training and uses all residual transformations…

1 source

aka Stochastic EM, SEM (stochastic expectation maximization)

A finite-mixture fitting algorithm that draws one hard component assignment for each observation from its current posterior responsibilities…

2 sources

aka sfVSSGP

The Gal–Turner stochastic extension of factorized variational sparse-spectrum regression that estimates its full-data evidence lower bound w…

3 sources

aka SGD

Optimization using gradients estimated from sampled training observations.

1 source

A configurable family of combinatorial search algorithms that initializes a search position and any memory, then applies a specified neighbo…

2 sources

A finite-population Bayesian GLMM inference procedure that iterates selected cluster-local Gaussian factors and uses expanded cluster miniba…

2 sources

A search-control strategy that alternates search directions or regimes around selected boundaries, controlling excursions and returns to exp…

2 sources

A symbolic planning method that uses means–ends analysis and theorem proving over world models to construct a sequence of operators satisfyi…

1 source

aka Structured mean-field inference for factorial HMMs

A variational inference procedure for factorial hidden Markov models that approximates the posterior by independent chain-path distributions…

1 source

aka Sub-Cluster Component algorithm

An agglomerative clustering algorithm that repeatedly merges weakly connected components of a thresholded nearest-neighbor graph over the cu…

1 source

aka SP-LIME

A method selecting a budgeted set of local LIME explanations by greedily increasing weighted coverage of explanatory features.

1 source

aka SHA, Sequential Halving

A staged best-candidate selection algorithm that divides a resource budget across elimination rounds, evaluates surviving candidates with co…

2 sources

aka Supervised Principal Components Regression

A prediction procedure that screens features by their marginal association with an outcome, computes principal components of the retained fe…

1 source

aka Supplemented ECM, SECM

A numerical supplement to expectation conditional maximization that recovers observed-data asymptotic parameter covariance from expected com…

1 source

aka Supplemented EM, SEM Algorithm (Supplemented EM)

A numerical supplement to expectation maximization that combines expected complete-data information with the local Jacobian of the EM update…

1 source

aka SVC

An unsupervised clustering procedure that fits a soft enclosing sphere to observations in Gaussian-kernel feature space, then labels retaine…

1 source

aka SVDD, Support vector domain description…

A one-class support-estimation algorithm that learns a sphere in an input or kernel feature space by minimizing squared radius plus linearly…

3 sources

A stochastic neural-network training and inference procedure that forms elementwise Bernoulli-selected sums of already computed compatible t…

1 source

aka Swapping assignments between views

An online self-supervised visual representation-learning procedure that predicts soft prototype assignments of one augmented image view from…

2 sources

aka Symmetric delaying rejection algorithm

The delayed-rejection specialization using the same symmetric proposal kernel at every stage, centered through the last rejected candidate,…

1 source

aka T-Few

A few-shot classification fine-tuning recipe that adapts a pretrained T0 model through IA3 activation vectors, multitask pretraining of thos…

2 sources

aka TS

A memory-guided optimization framework that steers a search trajectory by making selected moves temporarily inadmissible from search history…

1 source

The SAT-specific basic tabu-search method described by Mazure, Saïs and Grégoire in 1997, which systematically excludes recently flipped var…

2 sources

aka Taylor Gaussian-process uncertainty propagation

A local Gaussian-process prediction algorithm that expands a fixed posterior mean to first order and its latent variance to second order abo…

3 sources

A sequence-training procedure that supplies reference outputs from earlier steps as feedback for subsequent predictions, in place of the mod…

2 sources

aka Tempered EM

An entropy-tempered generalization of expectation maximization for finite latent-state models that alternates powered latent-joint responsib…

1 source

aka Neal tempered transitions

A Markov chain Monte Carlo transition algorithm that proposes a new target state through a prescribed outward and return sequence of mutuall…

2 sources

A semi-supervised classifier-training procedure that regularizes a current stochastic prediction toward a bias-corrected exponential average…

2 sources

aka TSA

A supervised-loss scheduling procedure that temporarily excludes labeled examples already predicted with confidence above an increasing thre…

3 sources

A tree-specific algorithm computing Shapley feature attributions through recursive bookkeeping of weighted feature subsets along decision pa…

2 sources

aka Purdom partial-backtracking estimator

A randomized backtracking-tree estimator that explores a uniformly selected subset of successors at each visited branching point and uses in…

1 source

aka TPE, Tree-structured Parzen Estimator Approach

A sequential hyperparameter optimization method that separates observations by a loss quantile, fits tree-structured densities for the bette…

1 source

A nonlinear dimensionality-reduction algorithm that selects weighted triplet comparisons from high-dimensional data and optimizes embedding…

2 sources

A linear off-policy state-value prediction algorithm that couples two Dutch eligibility traces with an accumulating gradient-correction trac…

1 source

A linear on-policy action-value control algorithm that combines a Dutch eligibility trace with a correction for changing predictions, using…

2 sources

A linear temporal-difference policy-evaluation algorithm that combines a Dutch eligibility trace with a correction for changing predictions,…

2 sources

aka TRPO

A policy-optimization method that optimizes a surrogate objective while constraining the change in policy by a trust region based on Kullbac…

1 source

A query-specific sparse-spectrum regression procedure that fits a variational model to Euclidean neighbors, reselects neighbors from the ful…

1 source

aka Uniform Manifold Approximation and Projection, Uniform Manifold Approximation and Projection for Dimension Reduction

A nonlinear embedding algorithm that constructs a locally scaled, symmetrized nearest-neighbor similarity graph and places its vertices in a…

3 sources

aka ULA

An approximate sampling algorithm that discretizes overdamped Langevin dynamics by an explicit gradient drift and Gaussian noise without a M…

2 sources

The original unsmoothed binary population optimizer that selects a nonempty set of evaluated bit strings, replaces each coordinate probabili…

2 sources

aka UDA

A semi-supervised classifier-training procedure that combines labeled prediction loss with consistency between fixed current-model predictio…

5 sources

aka Multiview Convex Mixture Model Clustering, Convex Mixture Models for Multi-view Clustering

A multiview exemplar-clustering procedure that fits a single vector of exemplar weights by minimizing the equally weighted sum of fixed-comp…

1 source

A finite conditional Markov update that chooses with equal probability between complete upward and downward nested antithetic modification k…

1 source

A finite conditional Markov update that equally mixes maximum-shift tower kernels built from paired upward and downward cyclic state orders,…

1 source

An on-policy linear state-value prediction algorithm that combines ordinary accumulating TD eligibility traces with componentwise step sizes…

1 source

An on-policy linear state-value prediction algorithm that combines componentwise inverse feature-usage step sizes with a component-scaled Du…

1 source

aka Vanilla beam decoding

A layer-based sequence beam decoder in which completed and unfinished hypotheses compete for the same k beam slots: finished hypotheses are…

2 sources

A recurrent-network training regularization procedure that softly penalizes deviations from unit norm gain when a local recurrent Jacobian t…

3 sources

A local-search metaheuristic that repeatedly perturbs an incumbent through an indexed collection of neighborhoods, locally optimizes the per…

1 source

aka Variational EM, VEM (variational expectation maximization)

A latent-variable model-fitting procedure that alternates optimization of a posterior approximation within a specified restricted family and…

1 source

aka IM algorithm, IM algorithm (Barber and Agakov)

An alternating optimization procedure that adjusts a noisy encoder and a variational decoder to increase the Barber–Agakov lower bound on tr…

1 source

aka VMP

A variational inference algorithm that organizes conjugate-exponential coordinate updates as local messages carrying expected sufficient sta…

1 source

aka VSSGP

The Gal–Turner finite spectral regression inference procedure that factorizes spectral parameters from output coefficients, analytically opt…

3 sources

aka Variance-invariance-covariance regularization

A self-supervised joint-embedding procedure that combines a paired-view invariance loss with separate per-branch penalties for insufficient…

4 sources

aka VAT

A prediction-smoothing regularization procedure that trains a model to preserve its current output distribution under approximately worst-ca…

4 sources

aka Wake-sleep

An alternating learning procedure that trains a generative network from observed data and recognition-sampled hidden states during wake, and…

3 sources

aka WalkSAT/SKC, SKC WalkSAT

A clause-focused SAT local-search algorithm, in its classical SKC formulation, that first selects an unsatisfied clause, prioritizes a varia…

2 sources

aka Ward hierarchical clustering, Ward minimum-variance method…

An agglomerative clustering algorithm for Euclidean observations that starts from singletons and repeatedly merges the pair causing the smal…

2 sources

The original hard-cut multistep Q-learning construction that estimates action returns using maximum-value bootstraps and continuation throug…

1 source

aka Weighted A*, WA*

A heuristic best-first search algorithm that orders open nodes by g+w h using a fixed finite weight w greater than one, where g is path cost…

3 sources

aka Weighted Multiview CMM Clustering

A multiview exemplar-clustering procedure that learns shared exemplar weights and view weights through outer view-responsibility updates and…

1 source

aka MVSpec, Tzortzis-Likas Multiview Spectral Clustering

A multiview clustering algorithm that alternates a leading-eigenspace relaxation of within-cluster variance with simplex weights for a power…

1 source

aka W-MSE, Whitening MSE

A self-supervised representation-learning procedure that differentiably whitens projected image-view embeddings and minimizes the average sq…

5 sources

A linear off-policy state-value prediction algorithm that combines an importance-weighted accumulating eligibility trace and an auxiliary GT…