SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Learning and Online Convex Optimization
3 references·16 citing·44 second hop
Online Learning and Online Convex Optimization (2012)Online Learning and Online Convex Optimiz…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Testing facility location and dynamic capacity planning for pandemics with demand uncertainty (2021)Testing facility location and…Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs (2021)Marrying Stochastic Gradient …Distributed Online Optimization With Long-Term Constraints (2021)Distributed Online Optimizati…Online learning and its problems in the Covid-19 emergency period (2020)Online learning and its probl…Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints (2020)Distributed Bandit Online Con…Bandit Algorithms (2020)Bandit AlgorithmsOptimization under uncertainty in the era of big data and deep learning: When machine learning meets mathematical programming (2019)Optimization under uncertaint…Online Convex Optimization With Time-Varying Constraints and Bandit Feedback (2018)Online Convex Optimization Wi…Learning in games with continuous action sets and unknown payoff functions (2018)Learning in games with contin…Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium (2017)Learning in Repeated Auctions…An Online Convex Optimization Approach to Proactive Network Resource Allocation (2017)An Online Convex Optimization…A general approach for predicting the behavior of the Supreme Court of the United States (2017)A general approach for predic…Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand (2016)Technical Note—Nonparametric …Online optimization in dynamic environments: Improved regret rates for strongly convex problems (2016)Online optimization in dynami…Learning in Games via Reinforcement and Regularization (2016)Learning in Games via Reinfor…Bandits with concave rewards and convex knapsacks (2014)Bandits with concave rewards …A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Theory of games and economic behavior (2019)A Stochastic Approximation Method (1951)Bandit Processes and Dynamic Allocation Indices (1979)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Online convex programming and generalized infinitesimal gradient ascent (2003)Improved Dynamic Regret for Non-degenerate Functions (2016)Adaptive Online Learning in Dynamic Environments (2018)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Evolutionary stable strategies and game dynamics (1978)Potential Games (1996)Learning in Generalized Linear Contextual Bandits with Stochastic Delays (2019)On Gradient-Based Learning in Continuous Games (2020)The Confluence of Networks, Games, and Learning a Game-Theoretic Framework for Multiagent Decision Making Over Networks (2022)Regret in Decision Making under Uncertainty (1982)The Price of Robustness (2004)Introduction to Stochastic Programming (2011)Multiple kernel learning-aided robust optimization: Learning algorithm, computational tractability, and usage in multi-stage decision-making (2020)Data science and big data analytics: a systematic review of methodologies used in the supply chain and logistics research (2023)Rethinking "Risk" in Algorithmic Systems Through A Computational Narrative Analysis of Casenotes in Child-Welfare (2023)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)The Effects of Summer Vacation on Achievement Test Scores: A Narrative and Meta-Analytic Review (1996)A framework to guide an education response to the COVID-19 Pandemic of 2020 (2020)Effect of COVID-19 on the Performance of Grade 12 Students: Implications for STEM Education (2020)E-learning evaluation during the COVID-19 pandemic era based on the updated of Delone and McLean information systems success model (2022)The Role of Digital Collaboration in Student Engagement towards Enhancing Student Participation during COVID-19 (2022)Blended learning in physical education: A systematic review (2023)Dynamic Ideal Point Estimation via Markov Chain Monte Carlo for the U.S. Supreme Court, 1953–1999 (2002)The Supreme Court and the Attitudinal Model Revisited (2002)Online Learning and Online Convex Optimization (2011)Legal Judgment Prediction via Topological Learning (2018)Using machine learning to predict decisions of the European Court of Human Rights (2019)LexGLUE: A Benchmark Dataset for Legal Language Understanding in English (2022)PORTFOLIO SELECTION* (1952)Prospect Theory: An Analysis of Decision under Risk (1979)Optimization of conditional value-at-risk (2000)Hedging the Drift: Learning to Optimize Under Non-Stationarity (2018)Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Multi-Armed Bandits With Correlated Arms (2021)
this work references cited by second hop

References

  • 2006Prediction, Learning, and Games3,176 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited

Cited by

  • 2020Bandit Algorithms981 cited
  • 2017A general approach for predicting the behavior of the Supreme Court of the United States530 cited
  • 2019Optimization under uncertainty in the era of big data and deep learning: When machine learning meets mathematical programming348 cited
  • 2017An Online Convex Optimization Approach to Proactive Network Resource Allocation236 cited
  • 2020Online learning and its problems in the Covid-19 emergency period208 cited
  • 2016Online optimization in dynamic environments: Improved regret rates for strongly convex problems190 cited
  • 2018Learning in games with continuous action sets and unknown payoff functions183 cited
  • 2017Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium151 cited
  • 2016Learning in Games via Reinforcement and Regularization132 cited
  • 2014Bandits with concave rewards and convex knapsacks122 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

2018
Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
97 cited
  • 2021Testing facility location and dynamic capacity planning for pandemics with demand uncertainty89 cited
  • 2016Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand84 cited
  • 2021Distributed Online Optimization With Long-Term Constraints81 cited
  • 2021Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs72 cited