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.
Mirror maps, Bregman divergence, and local Hessian norms
Definition
Let , let be a nonempty bounded closed convex set with nonempty interior, and let be an open convex set such that and . If a decision set is lower-dimensional in an ambient Euclidean space, take to be orthonormal affine coordinates on its affine hull (the smallest affine subspace containing it); thus interior, gradients, Hessians, and norms are relative to that affine hull. A mirror regularizer on is a real-valued function on that is continuous on , twice continuously differentiable on , agrees on , and has symmetric positive-definite Hessian for every . We call -strongly convex on in the Euclidean norm if, for some , all and satisfy
For and , the Bregman divergence generated by is
For and vectors , define the squared local primal norm and local dual norm by
Definition references
A convex subset of contains every line segment between two of its points: convexity means that every segment between points of the set lies in the set.
Convex and strictly convex functions on Euclidean convex sets: defines ordinary and strict convexity; the displayed quantitative inequality defines strong convexity locally here.
The Euclidean inner product on : the pairing and norm are the standard Euclidean inner product and norm.
The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case: is the vector of first partial derivatives.
The Hessian matrix and critical points of a scalar field: is the Hessian matrix of second partial derivatives.
The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement: open and closed use the Euclidean metric topology.
Interior, closure, boundary, limit point, isolated point and dense subset of a metric space: and are the interior and closure in that topology.
Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space: boundedness uses the Euclidean metric.
Depends on
- A convex subset of $\mathbb{R}^m$ contains every line segment between two of its points
- Convex and strictly convex functions on Euclidean convex sets
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- The Hessian matrix and critical points of a scalar field
Used by
- Agile online mirror descent Algorithm
- A quadratic mirror map gives a projected gradient step Example
- Negative entropy gives normalized multiplicative weights Example
- Halving both terms in the agile mirror-descent regret bound False statement
- Compactness makes the Bregman projection well-defined Lemma
- Negative entropy on the simplex is strongly convex and has range log n Lemma
- Positive Hessians make Bregman divergence nonnegative Lemma
- The Bregman three-point identity Lemma
- A corrected regret bound for agile mirror descent Theorem
Dependency tree · two levels
36 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)