SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
16 references·0 citing·33 second hop
Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization (2022)Regret and Cumulative Constraint Violatio…Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints (2020)Distributed Bandit Online Con…Online Convex Optimization With Time-Varying Constraints and Bandit Feedback (2018)Online Convex Optimization Wi…Bandit Convex Optimization for Scalable and Dynamic IoT Management (2018)Bandit Convex Optimization fo…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…Online optimization in dynamic environments: Improved regret rates for strongly convex problems (2016)Online optimization in dynami…Introduction to Online Convex Optimization (2016)Introduction to Online Convex…An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback (2015)An Optimal Algorithm for Band…Online Learning and Online Convex Optimization (2012)Online Learning and Online Co…Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Trading Regret for Efficiency…Online Display Advertising: Targeting and Obtrusiveness (2011)Online Display Advertising: T…Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback. (2010)Optimal Algorithms for Online…Logarithmic regret algorithms for online convex optimization (2007)Logarithmic regret algorithms…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Regret bounds for prediction problems (1999)Regret bounds for prediction …Worst-case quadratic loss bounds for prediction using linear functions and gradient descent (1996)Worst-case quadratic loss bou…Prediction, Learning, and Games (2006)The Nonstochastic Multiarmed Bandit Problem (2002)Stochastic Convex Optimization with Bandit Feedback (2013)AGGREGATING STRATEGIES (1990)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Relative Loss Bounds for Multidimensional Regression Problems (2001)Practical Issues in Structural Modeling (1987)Marketing Research: An Applied Orientation (1994)Estimating Production Functions Using Inputs to Control for Unobservables (2003)Attributing Conversions in a Multichannel Online Marketing Environment: An Empirical Model and a Field Experiment (2013)When Does Retargeting Work? Information Specificity in Online Advertising (2013)The Importance of Trust for Personalized Online Advertising (2015)The Theory of Learning in Games (1998)Online Learning and Online Convex Optimization (2011)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Ad click prediction (2013)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Improved Dynamic Regret for Non-degenerate Functions (2016)Adaptive Online Learning in Dynamic Environments (2018)The Pricing of Options and Corporate Liabilities (1973)A Marketplace for Data (2019)Introduction to Multi-Armed Bandits (2019)Theory of games and economic behavior (2019)A Stochastic Approximation Method (1951)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)Some aspects of the sequential design of experiments (1952)A general approach for predicting the behavior of the Supreme Court of the United States (2017)Optimization under uncertainty in the era of big data and deep learning: When machine learning meets mathematical programming (2019)Bandit Algorithms (2020)Non-Stationary Stochastic Optimization (2015)Introduction to Online Convex Optimization (2016)
this work references cited by second hop

References

  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2012Online Learning and Online Convex Optimization1,254 cited
  • 2007Logarithmic regret algorithms for online convex optimization836 cited
  • 2011Online Display Advertising: Targeting and Obtrusiveness817 cited
  • 2016Introduction to Online Convex Optimization814 cited
  • 2010Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.255 cited
  • 2017An Online Convex Optimization Approach to Proactive Network Resource Allocation236 cited
  • 2016Online optimization in dynamic environments: Improved regret rates for strongly convex problems190 cited
  • 2011Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints168 cited
  • 1996Worst-case quadratic loss bounds for prediction using linear functions and gradient descent148 cited
  • 2015An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback148 cited
  • 2018Bandit Convex Optimization for Scalable and Dynamic IoT Management139 cited
  • 2017Online Convex Optimization with Stochastic Constraints130 cited
  • 2020Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints113 cited

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

1999
Regret bounds for prediction problems
105 cited
  • 2018Online Convex Optimization With Time-Varying Constraints and Bandit Feedback97 cited
  • Cited by

    No citing works inside the corpus for this window.