SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints
16 references·0 citing·37 second hop
Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints (2019)Cautious Regret Minimization: Online Opti…Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity (2018)Projection-Free Online Optimi…Online Convex Optimization With Time-Varying Constraints and Bandit Feedback (2018)Online Convex Optimization Wi…Online convex optimization for cumulative constraints (2018)Online convex optimization fo…Online convex optimization and no-regret learning: Algorithms, guarantees and applications (2018)Online convex optimization an…Safety-Aware Algorithms for Adversarial Contextual Bandit. (2017)Safety-Aware Algorithms for A…Online Convex Optimization with Time-Varying Constraints (2017)Online Convex Optimization wi…Online Convex Optimization with Stochastic Constraints (2017)Online Convex Optimization wi…An Online Convex Optimization Approach to Proactive Network Resource Allocation (2017)An Online Convex Optimization…Adaptive algorithms for online convex optimization with long-term constraints (2016)Adaptive algorithms for onlin…Non-Stationary Stochastic Optimization (2015)Non-Stationary Stochastic Opt…Bandits with concave rewards and convex knapsacks (2014)Bandits with concave rewards …Bandits with Knapsacks (2013)Bandits with KnapsacksOnline Learning and Online Convex Optimization (2011)Online Learning and Online Co…Online Learning with Sample Path Constraints (2009)Online Learning with Sample P…Optimal Strategies and Minimax Lower Bounds for Online Convex Games (2008)Optimal Strategies and Minima…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…A desicion-theoretic generalization of on-line learning and an application to boosting (1995)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Linear Contextual Bandits with Knapsacks (2015)Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems (2016)Bandits and Experts in Metric Spaces (2019)Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)A general approach for predicting the behavior of the Supreme Court of the United States (2017)The Theory of Learning in Games (1998)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Ad click prediction (2013)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Constrained Online Convex Optimization With Feedback Delays (2020)Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints (2020)Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization (2022)Online Learning and Online Convex Optimization (2012)Decentralized Online Convex Optimization With Feedback Delays (2021)A Stochastic Approximation Method (1951)Robust Convex Optimization (1998)Online Optimization : Competing with Dynamic Comparators (2015)Online optimization in dynamic environments: Improved regret rates for strongly convex problems (2016)A Proof for the Queuing Formula: L = λ W (1961)Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks (1992)A Virtual-Queue-Based Algorithm for Constrained Online Convex Optimization With Applications to Data Center Resource Allocation (2018)Bandit Convex Optimization for Scalable and Dynamic IoT Management (2018)Logarithmic Regret Algorithms for Online Convex Optimization (2006)Mind the Duality Gap: Logarithmic regret algorithms for online optimization (2008)A Stochastic View of Optimal Regret through Minimax Duality (2009)Online Learning: Beyond Regret (2010)Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium (2017)Bandits with Knapsacks (2018)Distributed Online Linear Regressions (2020)Distributed Online Optimization With Long-Term Constraints (2021)
this work references cited by second hop

References

  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2011Online Learning and Online Convex Optimization1,095 cited
  • 2015Non-Stationary Stochastic Optimization336 cited
  • 2017An Online Convex Optimization Approach to Proactive Network Resource Allocation236 cited
  • 2013Bandits with Knapsacks211 cited
  • 2017Online Convex Optimization with Stochastic Constraints130 cited
  • 2014Bandits with concave rewards and convex knapsacks122 cited
  • 2008Optimal Strategies and Minimax Lower Bounds for Online Convex Games105 cited
  • 2018Online Convex Optimization With Time-Varying Constraints and Bandit Feedback97 cited
  • 2016Adaptive algorithms for online convex optimization with long-term constraints89 cited
  • 2009Online Learning with Sample Path Constraints74 cited
  • 2017Online Convex Optimization with Time-Varying Constraints69 cited
  • 2018Online convex optimization for cumulative constraints69 cited
  • 2018Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity44 cited
  • 2017Safety-Aware Algorithms for Adversarial Contextual Bandit.36 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2018
Online convex optimization and no-regret learning: Algorithms, guarantees and applications
36 cited

Cited by

No citing works inside the corpus for this window.