How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Negative entropy gives normalized multiplicative weights
Example
Let , let be the probability simplex represented by independent coordinates with for and . Probability labels are one-based; for any independent-coordinate vector , write for in the library's function-space convention. Set
Use as the mirror domain and define on , with . Initialize at the uniform distribution. At each round use the linear loss for a full-information vector and a fixed step size . In full probability coordinates, agile mirror descent updates
Consequently its distribution sequence equals the normalized weight distributions of Hedge initialized at unit weights and using learning rate . Hedge then samples an expert from each shared distribution; mirror descent outputs the distributions themselves.
Example references
Agile online mirror descent: defines the agile gradient update and Bregman projection.
Compactness makes the Bregman projection well-defined: establishes existence, uniqueness, and the Pythagorean property of the Bregman projection.
Negative entropy on the simplex is strongly convex and has range log n: proves continuity, strong convexity, and the entropy range for this regularizer.
Mirror maps, Bregman divergence, and local Hessian norms: defines the Hessian geometry and Bregman divergence.
Interior, closure, boundary, limit point, isolated point and dense subset of a metric space: defines the interior and closure used for the simplex mirror domain.
Hedge: defines Hedge's unit initial weights, normalization, full-information loss update, and sampled expert.
The natural logarithm as the inverse of the exponential function: defines the natural logarithm and supplies the positive range of and its inverse relation with .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: supplies logarithm quotient and product laws.
The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: supplies the derivative of used to differentiate entropy.
The real exponential function and the number by a power series: defines the real exponential function used in both updates.
The Euclidean inner product on : gradients in the independent coordinates use the standard Euclidean pairing.
Sums, scalar multiples, products and quotients: , , , and when : supplies the product rule used to differentiate .
The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with : differentiates the affine coordinate substitutions in the entropy summands.
Facts & Assumptions
Given: The simplex, negative entropy, uniform initialization, positive step size, and finite loss vectors in the Example.
Agile online mirror descent: the unconstrained point satisfies , followed by Bregman projection onto the simplex.
Negative entropy on the simplex is strongly convex and has range log n: the negative entropy on the closed simplex is continuous and strongly convex, and its minimum is attained at the uniform distribution.
Compactness makes the Bregman projection well-defined: a Bregman projection minimizer exists uniquely, and minimizes over the simplex.
Positive Hessians make Bregman divergence nonnegative: for and , , with the norm taken in the independent coordinates.
Hedge: Hedge starts from , normalizes to a distribution, and updates after the full loss vector is revealed.
Sums, scalar multiples, products and quotients: , , , and when supplies the product rule, and The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with supplies the chain rule for the affine coordinate substitutions in .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: and for positive , and .
The natural logarithm as the inverse of the exponential function: is a bijection and is its inverse, so exponentials are positive and exponentiating a logarithmic identity is valid.
The coordinate inequalities make nonempty, bounded, closed, and convex, and make open and convex; the strict inequalities show . The uniform point lies in . For every and , and converges to as , so .
Verification
On , differentiating using [F6, F7, F9] gives and . For every nonzero , . Thus the Hessian is positive definite on ; together with [F2] and [F10], this verifies the mirror-regularizer conditions for and the validity of the uniform initialization.
Fix an interior iterate and write for the full probability coordinates of a prospective dual point . In independent coordinates the linear loss is , a differentiable convex function on all of with gradient . By step 1.1, the dual equation [F1] becomes for .
By [F7, F8], is multiplicative: for real , , so injectivity of gives . Also by and [F8], hence . Any positive normalized solution of step 2.1 therefore satisfies . Its coordinates must have the form for a common , and normalization forces . Conversely, define by this formula. The denominator is a finite sum of positive finite terms by [F8], so is positive and normalized. Its first coordinates define , and [F7, F8] verify the dual equation in step 2.1. Thus this dual point exists uniquely.
For the interior dual point constructed in step 3.1, [F4] gives for every , and the defining Bregman formula gives zero at . Hence its unique projection [F3] is . In full probability coordinates this says , proving the displayed update. Starting from the interior uniform point in step 1.1, this construction applies inductively at every round and keeps all iterates in .
At initialization, [F2] and [F10] make the uniform distribution a minimizer of in , so it is a valid OMD initial point. If and , then [F5] gives , whose normalization is exactly the update proved in step 4.1. Induction from proves equality of the OMD and Hedge distributions at every round.
Depends on
- Positive Hessians make Bregman divergence nonnegative
- Agile online mirror descent
- Compactness makes the Bregman projection well-defined
- Negative entropy on the simplex is strongly convex and has range log n
- Mirror maps, Bregman divergence, and local Hessian norms
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Hedge
- The natural logarithm as the inverse of the exponential function
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- The real exponential function and the number $e$ by a power series
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
74 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Elad Hazan, Introduction to Online Convex Optimization, second edition (standard reference, not scraped)
- Peter Bartlett, Stat 260/CS 294-102: Learning in Sequential Decision Problems, mirror-descent lecture notes (standard reference, not scraped)
- Francesco Orabona, Online Mirror Descent III: Examples and Learning with Expert Advice (standard reference, not scraped)