Regret bounded by gradual variation for online convex optimization (Q2251474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Adaptive routing with end-to-end feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbing the bandit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting certainty from uncertainty: regret bounded by variation in costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic regret algorithms for online convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for online decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Learning with Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excessive Gap Technique in Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041424328 / rank
 
Normal rank

Revision as of 17:41, 8 July 2024

scientific article
Language Label Description Also known as
English
Regret bounded by gradual variation for online convex optimization
scientific article

    Statements

    Regret bounded by gradual variation for online convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2014
    0 references
    online convex optimization
    0 references
    regret bound
    0 references
    gradual variation
    0 references
    bandit
    0 references

    Identifiers