(untitled)

Elad Hazan, I. (2016). (untitled).

Type

Unclassified

Intellectual base

Unclassified

Year

2016

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Competitive regret
  • … and a convenient observable transfers from A computationally limited online algorithm is compared with an oracle that solves the combinatorial action problem exactly each round. to A theorem states oracle access and normalizes zero or negative benchmark regret so a competitive ratio is mathematically meaningful..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:649b9503b22e · see in the full table