Groups
Category
Level
A random walk on a graph moves from a node to one of its neighbors chosen uniformly at random at each step.
The graph Laplacian translates a graphโs connectivity into a matrix that measures how much a function varies across edges.
Numerical stability measures how much rounding and tiny input changes can distort an algorithmโs output on real computers using floating-point arithmetic.
Floating-point numbers approximate real numbers using a fixed number of bits following the IEEE 754 standard.
A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.
A set is convex if every line segment between any two of its points lies entirely inside the set.
A confidence interval estimates a fixed but unknown parameter (like a population mean) with a range that would capture the true value in a long run of repeated samples.
A sufficient statistic compresses all information in the sample about a parameter into a lower-dimensional summary without losing inferential power.
Hypothesis testing is a decision-making process to evaluate claims about a population using sample data.
Maximum A Posteriori (MAP) estimation chooses the parameter value with the highest posterior probability after seeing data.
Maximum Likelihood Estimation (MLE) chooses parameters that make the observed data most probable under a chosen model.
Exponential family distributions express many common probability models in a single template p(x|ฮท) = h(x) exp(ฮท^T T(x) โ A(ฮท)).