Mathematical Methods
52 ConceptsFormal mathematical formulations, kernels, transforms, and sampling algorithms.
Showing 52 of 52
| Concept | Origin | Kind / Branch | Identifier | Evidence / Status |
|---|---|---|---|---|
|
Activation-Value Gaussian Pooling
aka Diff-Gauss pooling
A parameterized neural pooling unit that averages a group of transformed activations using normalized Gaussian-kernel weights determined by…
|
Curated | Mathematical Methods |
AIMech:ActivationValueGaussianPooling
|
5 claims
1 source
|
|
Active CMA covariance update
A matrix-valued covariance-update component from the original 2006 active CMA construction that combines retained search covariance and an e…
|
Curated | Mathematical Methods |
AIMech:ActiveCMACovarianceUpdate
|
6 claims
1 source
|
|
Barber–Agakov mutual information bound
aka Barber-Agakov bound, BA bound
A variational lower bound on mutual information formed by adding input entropy to the expected log probability assigned by a normalized cond…
|
Curated | Mathematical Methods |
AIMech:BarberAgakovBound
|
1 claim
2 sources
|
|
Barker acceptance rule
An acceptance-probability rule for reversible Monte Carlo proposals that uses R/(1+R), where R is the target-density ratio times the reverse…
|
Curated | Mathematical Methods |
AIMech:BarkerAcceptanceRule
|
1 claim
1 source
|
|
Basis pursuit
A signal-representation optimization principle that minimizes the L1 norm of real synthesis coefficients subject to exact reconstruction of…
|
Curated | Mathematical Methods |
AIMech:BasisPursuit
|
7 claims
1 source
|
|
Bounded adaptive reward for sequence scoring
A beam-dependent sequence rescoring rule that adds per-step rewards derived from the beam’s mean negative log token probability, accumulatin…
|
Curated | Mathematical Methods |
AIMech:BoundedAdaptiveReward
|
1 claim
1 source
|
|
Bounded length reward for sequence scoring
aka Bounded word reward
A sequence scoring rule that adds a fixed nonnegative reward per generated position up to a finite length cap, giving score S(y)+r·min(l,|y|…
|
Curated | Mathematical Methods |
AIMech:BoundedLengthReward
|
2 claims
2 sources
|
|
Bounded word reward with predicted length
A sequence rescoring method that adds a fixed word reward only up to an input-specific length predicted from encoder states, replacing a cor…
|
Curated | Mathematical Methods |
AIMech:PredictedLengthBoundedReward
|
1 claim
1 source
|
|
Brevity-penalty normalization for sequence scoring
aka BP-Norm
A sequence rescoring rule that adds a predicted-length brevity penalty in log space to average token log probability: S(x,y)/|y| + min(1−Lpr…
|
Curated | Mathematical Methods |
AIMech:BrevityPenaltyNormalization
|
2 claims
2 sources
|
|
CMA rank-mu covariance update
A covariance-valued update component introduced in the 2003 CMA-ES construction that forms an equal-weight second moment of selected mutatio…
|
Curated | Mathematical Methods |
AIMech:CMARankMuCovarianceUpdate
|
6 claims
1 source
|
|
Dispatch-dependent value functional
A dispatch-prefix-conditioned mathematical rule that returns, as a function of a contemplated search start time t, the modeled probability o…
|
Curated | Mathematical Methods |
AIMech:DispatchDependentValueFunctional
|
6 claims
1 source
|
|
Dutch eligibility traces
An eligibility-trace update that propagates prior feature credit and adds a current-feature contribution adjusted by the prior trace’s proje…
|
Curated | Mathematical Methods |
AIMech:DutchEligibilityTraces
|
5 claims
3 sources
|
|
Elastic net
aka Elastic-net regression
Linear regression regularized by a combination of L1 and L2 penalties.
|
Curated | Mathematical Methods |
AIMech:ElasticNet
|
1 claim
1 source
|
|
Expected improvement acquisition
An acquisition criterion for deterministic scalar minimization that scores a candidate evaluation by the predictive expected positive reduct…
|
Curated | Mathematical Methods |
AIMech:ExpectedImprovementAcquisition
|
5 claims
1 source
|
|
Fully factorized mean-field inference
aka Naive mean-field inference, Fully factorized variational inference
A variational inference method that restricts its approximating distribution to a product of single-variable factors and adjusts those facto…
|
Curated | Mathematical Methods |
AIMech:FullyFactorizedMeanFieldInference
|
1 claim
1 source
|
|
Generalized advantage estimation
aka GAE
An advantage-function estimator for policy-gradient learning formed from an exponentially weighted sum of temporal-difference residuals.
|
Curated | Mathematical Methods |
AIMech:GeneralizedAdvantageEstimation
|
1 claim
1 source
|
|
Gumbel-Softmax relaxation
aka Gumbel-Softmax, Concrete distribution…
A continuous relaxation of a finite categorical random variable obtained by applying softmax to independent Gumbel-perturbed log weights div…
|
Curated | Mathematical Methods |
AIMech:GumbelSoftmaxRelaxation
|
3 claims
2 sources
|
|
Gumbel-Top-k trick
aka Gumbel top-k sampling
A categorical sampling construction that adds independent standard Gumbel noise to each category’s log weight and returns the indices of the…
|
Curated | Mathematical Methods |
AIMech:GumbelTopKTrick
|
2 claims
2 sources
|
|
High-order polynomial projection operators
aka HiPPO (polynomial projection)
A family of time-dependent operators that represents a signal's past by coefficients of its optimal finite-dimensional polynomial approximat…
|
Curated | Mathematical Methods |
AIMech:HiPPOProjection
|
1 claim
1 source
|
|
InfoNCE
aka InfoNCE loss
A contrastive log-softmax objective that identifies a joint positive among sampled candidates and, under independent marginal-negative sampl…
|
Curated | Mathematical Methods |
AIMech:InfoNCE
|
1 claim
2 sources
|
|
Integrated gradients
aka IG
A feature-attribution method that integrates a prediction's input gradients along the straight path from a chosen baseline to the input.
|
Curated | Mathematical Methods |
AIMech:IntegratedGradients
|
1 claim
1 source
|
|
Interpolated variational information bound
aka I-alpha bound, Nonlinearly interpolated mutual information lower bound
A family of multi-sample mutual-information lower bounds that interpolates the critic’s empirical partition estimate with a positive variati…
|
Curated | Mathematical Methods |
AIMech:InterpolatedVariationalInformationBound
|
3 claims
3 sources
|
|
Layer-wise relevance propagation
aka LRP
A prediction-decomposition framework that redistributes relevance backward through a classifier's computational layers toward its input feat…
|
Curated | Mathematical Methods |
AIMech:LayerWiseRelevancePropagation
|
1 claim
1 source
|
|
Learned-Norm Pooling Unit
aka Lp unit, Learned-norm pooling
A parameterized neural unit that pools a group of learned linear projections by the power mean of their absolute deviations from learned cen…
|
Curated | Mathematical Methods |
AIMech:LearnedNormPoolingUnit
|
4 claims
1 source
|
|
Leave-one-out mutual information upper bound
aka Leave-one-out variational information upper bound
An expectation-level upper bound on mutual information that compares a known conditional density for each paired sample with a mixture of co…
|
Curated | Mathematical Methods |
AIMech:LeaveOneOutMutualInformationUpperBound
|
1 claim
1 source
|
|
Lifted structured embedding loss
aka Lifted structured loss
A metric-learning objective that penalizes a positive pair’s Euclidean distance against negative distances incident to either endpoint, usin…
|
Curated | Mathematical Methods |
AIMech:LiftedStructuredEmbeddingLoss
|
1 claim
2 sources
|
|
Logarithmic opinion pool
aka Log opinion pool, Logarithmic pooling
A probability-aggregation method that forms a normalized weighted geometric mean of expert distributions over the same outcomes, using nonne…
|
Curated | Mathematical Methods |
AIMech:LogarithmicOpinionPool
|
1 claim
2 sources
|
|
Maxout Unit
aka Maxout
A parameterized neural unit that outputs the maximum of a finite group of learned affine functions of its input.
|
Curated | Mathematical Methods |
AIMech:MaxoutUnit
|
5 claims
2 sources
|
|
MEX Operator
aka MEX (SimNets)
A scalar aggregation operator that returns log(mean(exp(xi times input)))/xi for a nonzero real parameter xi, with its continuous zero-param…
|
Curated | Mathematical Methods |
AIMech:MEXOperator
|
4 claims
1 source
|
|
Multi-class N-pair loss
aka N-pair-mc loss
A supervised metric-learning objective that averages a joint positive-versus-multiple-negative log-softmax loss across a batch of positive p…
|
Curated | Mathematical Methods |
AIMech:MultiClassNPairLoss
|
1 claim
1 source
|
|
Natural gradient
A metric-dependent differential method that maps the coordinate derivatives of a differentiable objective to a tangent vector by the inverse…
|
Curated | Mathematical Methods |
AIMech:NaturalGradient
|
6 claims
3 sources
|
|
Nguyen–Wainwright–Jordan variational bound
aka NWJ bound, MINE-f objective…
A variational lower bound on Kullback–Leibler divergence that subtracts a product-distribution exponential critic moment from a joint-distri…
|
Curated | Mathematical Methods |
AIMech:NguyenWainwrightJordanBound
|
1 claim
2 sources
|
|
Noh–Rieger random-walk centrality
aka Random walk centrality of Noh and Rieger
A node-scoring method for an undirected random walk that divides each node’s stationary visitation probability by its integrated excess retu…
|
Curated | Mathematical Methods |
AIMech:NohRiegerRandomWalkCentrality
|
6 claims
1 source
|
|
Noisy rectifier
A stochastic activation that adds zero-mean noise to a preactivation and then applies the positive-part rectifier, producing h=max(0,a+z).
|
Curated | Mathematical Methods |
AIMech:NoisyRectifier
|
1 claim
1 source
|
|
Nonnegative Matrix Factorization
aka NMF
A matrix-decomposition method that represents or approximates a nonnegative data matrix as the product of two entrywise nonnegative factor m…
|
Curated | Mathematical Methods |
AIMech:NonnegativeMatrixFactorization
|
3 claims
1 source
|
|
Normalized temperature-scaled cross entropy loss
aka NT-Xent, NT-Xent loss
A contrastive cross-entropy objective that uses cosine-normalized, temperature-scaled similarities to identify a paired positive representat…
|
Curated | Mathematical Methods |
AIMech:NTXentLoss
|
2 claims
2 sources
|
|
One-vs-one N-pair loss
aka N-pair-ovo loss
A supervised metric-learning objective that sums separate positive-versus-negative softplus comparisons for each anchor in a batch of positi…
|
Curated | Mathematical Methods |
AIMech:OneVsOneNPairLoss
|
1 claim
1 source
|
|
Partial least squares regression
aka PLS regression, PLSR
Regression using latent components chosen to capture predictor-response covariance.
|
Curated | Mathematical Methods |
AIMech:PartialLeastSquaresRegression
|
1 claim
1 source
|
|
Principal Curves
aka Hastie–Stuetzle Principal Curves
A nonlinear statistical summary defined by a smooth curve that is self-consistent for a data distribution: almost every point on the curve e…
|
Curated | Mathematical Methods |
AIMech:PrincipalCurves
|
4 claims
1 source
|
|
Probability of improvement acquisition
An acquisition criterion for scalar optimization that scores a candidate by the predictive probability of meeting a specified improvement th…
|
Curated | Mathematical Methods |
AIMech:ProbabilityOfImprovementAcquisition
|
6 claims
2 sources
|
|
Random-only abstraction for abstraction sampling
aka Random-only abstraction sampling, simpleRand abstraction…
A randomized abstraction rule for graphical-model sampling that uniformly permutes the current search nodes and divides that order into grou…
|
Curated | Mathematical Methods |
AIMech:RandomOnlyAbstractionSampling
|
6 claims
1 source
|
|
Replacing eligibility traces
An eligibility-trace update that replaces a visited state’s eligibility by one while geometrically attenuating other state traces, preservin…
|
Curated | Mathematical Methods |
AIMech:ReplacingEligibilityTraces
|
5 claims
1 source
|
|
Scaled Legendre HiPPO operator
aka HiPPO-LegS
The HiPPO projection operator using the uniform measure over the full elapsed interval from zero to the current time, with scaled-Legendre c…
|
Curated | Mathematical Methods |
AIMech:HiPPOLegS
|
1 claim
1 source
|
|
SHapley additive explanations
aka SHAP
An additive feature-attribution framework assigning Shapley values to a prediction through a specified function for evaluating feature subse…
|
Curated | Mathematical Methods |
AIMech:SHAP
|
1 claim
1 source
|
|
Stochastic-times-smooth unit
aka STS unit
A stochastic activation that sets p=sigmoid(a), samples a Bernoulli gate with success probability sqrt(p), and outputs the gate multiplied b…
|
Curated | Mathematical Methods |
AIMech:StochasticTimesSmoothUnit
|
1 claim
1 source
|
|
Straight-through estimator
aka ST estimator, Identity straight-through estimator
A surrogate-gradient rule that keeps a hard threshold or sampled binary output in the forward computation while propagating its downstream d…
|
Curated | Mathematical Methods |
AIMech:StraightThroughEstimator
|
3 claims
1 source
|
|
Straight-through Gumbel-Softmax estimator
aka ST Gumbel-Softmax, ST Gumbel estimator
A surrogate-gradient estimator that uses a hard one-hot argmax of a Gumbel-Softmax sample in the forward computation and substitutes the cor…
|
Curated | Mathematical Methods |
AIMech:StraightThroughGumbelSoftmax
|
2 claims
1 source
|
|
Structured mean-field inference
aka Structured mean-field approximation
A variational inference method that approximates a target distribution with a tractable family retaining selected dependencies, choosing its…
|
Curated | Mathematical Methods |
AIMech:StructuredMeanFieldInference
|
1 claim
1 source
|
|
Tractable unnormalized Barber–Agakov bound
aka TUBA, TUBA bound
A tractable unnormalized Barber–Agakov lower-bound parameterization that uses a real critic and a positive output-dependent normalizer to re…
|
Curated | Mathematical Methods |
AIMech:TUBABound
|
2 claims
2 sources
|
|
Value-based abstraction functions for abstraction sampling
aka Value-based abstraction sampling
A family of graphical-model sampling abstractions that assigns a positive scalar value to each current search node and partitions nodes in v…
|
Curated | Mathematical Methods |
AIMech:ValueBasedAbstractionSampling
|
6 claims
1 source
|
|
Vicinal risk minimization
aka VRM
A risk-minimization principle that chooses a predictor from a specified function class by minimizing expected loss under an estimated distri…
|
Curated | Mathematical Methods |
AIMech:VicinalRiskMinimization
|
1 claim
1 source
|
|
Zhou random-walk distance-profile dissimilarity
aka Zhou neighbor dissimilarity index
A pairwise graph dissimilarity that compares the mean first-passage-time profiles of two adjacent vertices by taking the Euclidean norm of t…
|
Curated | Mathematical Methods |
AIMech:ZhouRandomWalkDissimilarity
|
6 claims
2 sources
|