Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 d≥1, let K⊆Rd be a nonempty bounded closed convex set with nonempty interior, and let U⊆Rd be an open convex set such that int⁡(K)⊆U and K⊆U‾. If a decision set is lower-dimensional in an ambient Euclidean space, take Rd 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 (K,U) is a real-valued function R on K∪U that is continuous on K, twice continuously differentiable on U, agrees on K∩U, and has symmetric positive-definite Hessian HR(z):=∇2R(z) for every z∈U. We call R m-strongly convex on K in the Euclidean norm if, for some m>0, all x,y∈K and λ∈[0,1] satisfy

R((1−λ)x+λy)≤(1−λ)R(x)+λR(y)−m2λ(1−λ)∥x−y∥22.

For x∈K∪U and y∈U, the Bregman divergence generated by R is

BR(x∥y):=R(x)−R(y)−⟨∇R(y),x−y⟩.

For z∈U and vectors v,h∈Rd, define the squared local primal norm and local dual norm by

∥v∥z2:=v⊤HR(z)v,∥h∥∗,z2:=h⊤HR(z)−1h.

Definition references

A convex subset of Rm 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 ⟨x,y⟩=∑k<nxkyk on Rn: 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: ∇R is the vector of first partial derivatives.

The Hessian matrix and critical points of a scalar field: ∇2R 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: int⁡(K) and U‾ 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

Used by

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