Charles Zhu’s page

(non-)multiplicativity of the expected value

Accelerated gradient descent

admissible Nash equilibrium strategy pair

affine subspace

affine transformation

agent-form game

alpha-approximation algorithm

Alternating direction method of multipliers

approachable set

Approximation filters

Aumann model of incomplete information

Aumann model of incomplete information with beliefs

Aumann situation of incomplete information

Aumann's agreement theorem

average hard NP puzzle

axioms of countability

Baker-Gill-Solovay theorem

Banach fixed-point theorem

Basic power method convergence

battle of the sexes game

Bayesian equilibrium

behavior strategy

Bernoulli distribution

Bernoulli's theorem

Bernstein inequality

best response function

better pair of strategies

big-Oh notation

bilevel programming problem

Bilinear interpolation

binomial distribution

Black-Scholes equation

Blackwell's approachability theorem

Block power method

Blum speed-up theorem

Bohnenblust-Karlin fixed point theorem

Boltzmann constant

Borel-Cantelli lemma

Box-Muller transform

Bregman divergence

Brouwer fixed-point theorem

Büchi-Elgot-Trakhtenbrot theorem

busy beaver problem

Byzantine agreement problem

Camera absorption function

Cantor–Schröder–Bernstein theorem

Cantor's theorem

Cauchy distribution

Cauchy sequence

Cauchy-Schwarz inequality

Cayley-Hamilton Theorem

center-of-gravity method

central limit theorem

characteristic function

Chebyshev's inequality

chosen ciphertext attack security

Church-Turing thesis

class AC hierarchy

class NP-complete

classical propositional logic

Cobham-Edmonds thesis

coefficient of determination

Color Image Specification

coloring problem

common knowledge

competitive ratio

complete metric space

completely mixed strategy

compound lottery

computationally indistinguishable

concentration inequality

concentration of chi-squared random variables

conformal field theory

conformal prediction

conjugate transpose

conjunctive normal form

consensus protocol

constrained convex optimization

constrained first order optimization

continuous function

continuous optimization

continuous time state equations

contraction property of convex projection

controllable subspace

controllable system

convergence almost everywhere

convergence in distribution

convergence in probability

convergence to stationary point

convex function

convex optimization

convex relaxation

Cook-Levin theorem

correlated equilibrium

Cosine similarity

count-min sketch

Courant-Fischer min-max principle

Courcelle's theorem

cross validation

cumulative distribution function

Curry-Howard correspondence

decision problem

decomposition in vector space

dependent type theory

deterministic finite automaton

differentiable function

differential entropy

dimension dependent convex optimization

directional derivative

discrete step function

discrete time state equations

distributional Johnson-Lindenstrauss lemma

duality between controllability and observability

effectively computable

effectively decidable

effectively enumerable

eigenvalue and eigenvector

ellipsoid method

encryption scheme

entropy of a random variable

epigraph and hypograph of functions

equivalent mixed and behavior strategies

Erdős girth conjecture

Euclidean dimensionality reduction

Euler's identity

evolutionarily stable strategy

existential second-order logic

exponential time hypothesis

extensive form game

Faddeev-LeVerrier algorithm

Fadeev-Leverrier method

Fagin's theorem

Fenchel conjugate

Fenchel coupling

first-order logic

Fischer-Lynch-Paterson theorem

Flajolet-Martin algorithm

Fokker-Planck equation

Follow-the-leader algorithm

Fourier transform

FPT-reducibility

full-order observer

Gács-Sipser-Lautemann theorem

game of pure competition

game with perfect information

Gamma correction

Gapless power method convergence

garbled circuit

Gaussian distribution

Gaussian pyramid

Gaussian tail bound

generalized circuit problem

geometric distribution

Goldman-Tucker theorem

Goldreich-Levin theorem

gradient descent

gradient descent convergence bound

Gradient descent convergence for α-strongly convex functions

Gradient descent convergence for β-smooth functions

Gradient descent for β-smooth, α-strongly convex

graph nonisomorphism problem

graph of a function

graph of the correspondence

Grayscale Image specification

gross substitutes function

Grothendieck inequality

group isomorphism

Grünbaum's theorem

Hadamard matrix

Hahn-Banach theorem

halting problem

Hamilton–Jacobi–Bellman equation

Hamiltonian (control theory)

hard-core predicate

Harsanyi game with incomplete information

Harsanyi's purification theorem

Hausdorff space

Heaviside step function

Histogram Equalization

Hoeffding inequality

Hölder's inequality

Hurwitz theorem

Immerman-Szelepscényi theorem

implicitly logspace computable

incompressible string

independent and identically distributed

indifference relation

Indyk and Motwani (1998)

Interior point method

Jaccard similarity

Jensen's inequality

Johnson-Lindenstrauss lemma

k-dimensional diﬀerentiable manifold

k-means clustering

k-round interaction

Kaiming initialization

Kakutani fixed-point theorem

Kalman decomposition

Karhunen–Loève transform

Karush-Kuhn-Tucker conditions

Kelly criterion

Kerckhoffs principle

Khintchine inequality

knowledge hierarchy

Kolmogorov axioms of probability

Kolmogorov complexity

Kolmogorov-Arnold network

Kolmogorov-Arnold representation theorem

Kosambi–Karhunen–Loève theorem

Kronecker delta

Krylov subspace method

Kuhn’s theorem

Kullback-Leibler divergence

Kuratowski-Zorn lemma

Ladner's theorem

Lagrange dual problem

Lagrange interpolating polynomial

Lagrange multiplier

lambda calculus

Langevin algorithm

Langevin equation

Laplace distribution

Laplace transform

law of composition

law of iterated expectation

law of the unconscious statistician

Lawvere's fixed-point theorem

learning parity with noise

learning problem

learning with errors problem

Least squares regression

Lebesgue measure

left half-plane

Leibniz integral rule

Lenz–Ising model

Leverrier's algorithm

Levin reduction

linear functional

linear manifold

linear programming

linear regression

linear subspace

Linear utility function

linearity of expectation

Lipschitz function

Locality sensitive hash function

locally Euclidean

logspace reducible

long short-term memory network

lottery (probability)

Low-rank approximation

lower hemicontinuity

Luce's choice axiom

Lyapunov function

machine learning model

majorizing measures theorem

manifold optimization

marginal probability

Markov perfect equilibrium

Markov's inequality

Matrix concentration inequality

Matrix diagonalization

matrix exponential

maximum a posteriori estimation

measurable space

Measure of central tendency

message authentication code

Method of trial functions

Miller-Rabin randomized primality test (1976, 1980)

MinHash (Broder, 1997)

Minkowski functional

mixed extension

mixed security strategy

moment-generating function

monadic second-order logic

Monge-Kantorovich problem

Moore-Penrose pseudoinverse

multiplicative spanner

mutual independence

Nash equilibrium

Nash social welfare

negligible function

Non-cooperative game

non-deterministic Turing Machine

non-interactive argument of knowledge

non-interactive zero-knowledge proof system

noncooperative (Nash) equilibrium solution

nondeterministic finite automaton

Nonlinear Stretching

normal subgroup

normal-form game

Nyström approximation

Observable system

one-way function

one-way permutation

online gradient descent

online gradient descent regret bound

online perceptron algorithm

online regret bound

orthogonal matrix

orthonormal basis

P versus NP problem

pairwise independence

parameterized problem

Pearson correlation coefficient

perfect indistinguishability

perfect secrecy

Point-Wise Transformation

Poisson distribution

polynomial hierarchy

polynomial-time approximation scheme

polynomial-time Karp reducible

Pontryagin's maximum principle

positive semidefinite

preference relation

prime number theorem

principal-agent model

probabilistic Turing machine

probability density function

probability mass function

probability space

probably approximately correct learning theory

projected gradient descent

projected gradient descent convergence bound

Projection from 3-D to 2-D camera plane

projection oracle

proper equilibrium

propositional logic

propositional proof system

pseudopolynomial time

pseudorandom function

pseudorandom generator

pumping lemma for regular languages

QR decomposition

quasiconvex function

quotient topology

Rabin Fingerprint (1981)

Rademacher complexity

Rademacher concentration

Radon's theorem

Ramsey's theorem

random variable

randomized linear regression

Rayleigh quotient

regular language

relativized complexity class

reproducing kernel Hilbert space

Riemannian manifold

right continuous function

Rolle's theorem

Rotational Invariance of Gaussian distribution

Rubenstein bargaining

saddle-point equilibrium (game theory)

sample complexity

Savitch's theorem

scalar property of variance and expectation

Schauder fixed point theorem

Schwartz-Zippel lemma

second-order logic

secure function evaluation

security strategy

separable signals

separation axioms

separation oracle

set cover problem

Shamir's secret sharing scheme

Shannon theorem of perfect secrecy

Sifting property

Singular value decomposition

Singularity functions

situation of incomplete information with beliefs

Slater condition

smooth function

smooth manifold

smoothly compatible

Soft thresholding

solution concept

spectral decomposition

stability of Gaussian random variables

Stackelberg equilibrium

Stackelberg game

State equation of finite dimensional linear systems

state space representation

stationary point

statistical distance

Stirling's approximation

stochastic boolean function evaluation problem

stochastic dominance

stochastic gradient descent

stochastic gradient descent convergence

stochastic score classification problem

strategically equivalent

strategy vector

strict preference relation

strong law of large numbers

subdifferential

subgame perfect equilibrium

subgraph spanner

submodular function

Subspace embedding from Johnson-Lindenstrauss

subspace topology

succinct non-interactive argument of knowledge

supervised learning

syllogistic logic

t-out-of-n threshold secret-sharing scheme

Theorem (Karmarkar, 1984)

Theorem (Khachiyan, 1979)

theorem, Cartesian product of compact or convex sets

theorem, composition of monotonically strictly increasing function with utility function

theorem, efficient universal Turing machine

theorem, fundamental property of fixed linear analog systems

theorem, perfect security and indistinguishability

theorem, security levels of matrix game players

theorem, stability of linear analog system equilibrium state at origin

theorem, stretch of a pseudorandom generator

Theorem, Turing machine non-computable function

time hierarchy theorem

time-constructible function

Toeplitz matrix

topological basis

topological manifold

topological space

total variation regularization

transfer function

transition matrix

tree decomposition

trembling hand perfect Nash equilibrium

Tristimulus values

Tseytin transformation

Tullock contest

two player zero-sum game

two to many theorem (cryptography)

types of independence

undirected graph

uniform distribution

uniformly random hash function

universal approximation theorem

universal hash function

upper hemicontinuity

upper semicontinuous function

utility function

value of the game

Vapnik-Chervonenkis dimension

von Neumann-Morgenstern utility theorem

von Neumann's minimax theorem

Wasserstein distance

Wasserstein space

weak law of large numbers

Weierstrass extreme value theorem

wide sense stationary

Yao's minimax lemma

Yao's XOR lemma

α-strongly convex

α-strongly convex and β-smooth

δ-hard function