{"list":"other","total":73,"rows":[{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1909.05207","title":"Introduction to Online Convex Optimization","created":"2019-09-07","cited_by_count":803},{"id":"1912.13213","title":"Online Learning: A Modern Introduction Using Convex Optimization","created":"2019-12-31","cited_by_count":417},{"id":"1802.05399","title":"Competitive caching with machine learned advice","created":"2018-02-15","cited_by_count":195},{"id":"1306.0686","title":"Online Learning under Delayed Feedback","created":"2013-06-04","cited_by_count":141},{"id":"1602.04128","title":"Coin Betting and Parameter-Free Online Learning","created":"2016-02-12","cited_by_count":133},{"id":"1802.06293","title":"Black-Box Reductions for Parameter-free Online Learning in Banach Spaces","created":"2018-02-17","cited_by_count":125},{"id":"1803.04311","title":"Deep Learning in Mobile and Wireless Networking: A Survey","created":"2018-03-12","cited_by_count":118},{"id":"1708.03741","title":"Online Convex Optimization with Stochastic Constraints","created":"2017-08-12","cited_by_count":95},{"id":"1902.08721","title":"Online Control with Adversarial Disturbances","created":"2019-02-23","cited_by_count":92},{"id":"1402.5758","title":"Bandits with concave rewards and convex knapsacks","created":"2014-02-24","cited_by_count":83},{"id":"1811.11881","title":"Adversarial Bandits with Knapsacks","created":"2018-11-28","cited_by_count":73},{"id":"1707.03384","title":"Deep Learning-Based Communication Over the Air","created":"2017-07-11","cited_by_count":72},{"id":"1512.07422","title":"Adaptive Algorithms for Online Convex Optimization with Long-term Constraints","created":"2015-12-23","cited_by_count":65},{"id":"1302.4387","title":"Online Learning with Switching Costs and Other Adaptive Adversaries","created":"2013-02-18","cited_by_count":61},{"id":"1802.06472","title":"Online convex optimization for cumulative constraints","created":"2018-02-19","cited_by_count":47},{"id":"1701.03974","title":"An Online Convex Optimization Approach to Dynamic Network Resource Allocation","created":"2017-01-14","cited_by_count":42},{"id":"2108.04973","title":"6G Internet of Things: A Comprehensive Survey","created":"2021-08-11","cited_by_count":39},{"id":"2002.04726","title":"Online Learning with Imperfect Hints","created":"2020-02-11","cited_by_count":37},{"id":"2106.06885","title":"Online Learning with Optimism and Delay","created":"2021-06-13","cited_by_count":33},{"id":"2002.02085","title":"Minimizing Dynamic Regret and Adaptive Regret Simultaneously","created":"2020-02-06","cited_by_count":31},{"id":"2102.06933","title":"Revisiting Smoothed Online Learning","created":"2021-02-13","cited_by_count":29},{"id":"1903.04277","title":"Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraints","created":"2019-03-06","cited_by_count":28},{"id":"1405.6076","title":"Online Linear Optimization via Smoothing","created":"2014-05-23","cited_by_count":24},{"id":"1709.02726","title":"A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds","created":"2017-09-08","cited_by_count":23},{"id":"1902.09003","title":"Combining Online Learning Guarantees","created":"2019-02-24","cited_by_count":22},{"id":"2302.04552","title":"Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization","created":"2023-02-09","cited_by_count":22},{"id":"2202.07554","title":"Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness","created":"2022-02-15","cited_by_count":21},{"id":"2010.08177","title":"Projection-free Online Learning over Strongly Convex Sets","created":"2020-10-16","cited_by_count":20},{"id":"1907.08965","title":"Machine Learning for Resource Management in Cellular and IoT Networks: Potentials, Current Solutions, and Open Challenges","created":"2019-07-21","cited_by_count":19},{"id":"1508.03769","title":"A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret","created":"2015-08-15","cited_by_count":18},{"id":"1807.03205","title":"Bandit Online Learning with Unknown Delays","created":"2018-07-09","cited_by_count":18},{"id":"2301.03377","title":"Machine Learning for Large-Scale Optimization in 6G Wireless Networks","created":"2023-01-03","cited_by_count":18},{"id":"2205.13451","title":"Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback","created":"2022-05-26","cited_by_count":17},{"id":"1904.09849","title":"Learning to Cache With No Regrets","created":"2019-04-22","cited_by_count":16},{"id":"2208.05898","title":"Enabling Long-term Fairness in Dynamic Resource Allocation","created":"2022-08-11","cited_by_count":15},{"id":"2009.08228","title":"LeadCache: Regret-Optimal Caching in Networks","created":"2020-09-17","cited_by_count":14},{"id":"1906.00049","title":"Online Convex Optimization with Perturbed Constraints","created":"2019-05-31","cited_by_count":12},{"id":"2101.12588","title":"No-Regret Caching via Online Mirror Descent","created":"2021-01-29","cited_by_count":12},{"id":"2101.07043","title":"Online Caching with Optimal Switching Regret","created":"2021-01-18","cited_by_count":11},{"id":"2211.06358","title":"Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions","created":"2022-11-05","cited_by_count":11},{"id":"2305.13946","title":"Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness","created":"2023-05-23","cited_by_count":11},{"id":"2412.08060","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","created":"2024-12-11","cited_by_count":11},{"id":"2006.07541","title":"Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games","created":"2020-06-13","cited_by_count":10},{"id":"2202.03519","title":"Smoothed Online Optimization with Unreliable Predictions","created":"2022-02-07","cited_by_count":10},{"id":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","cited_by_count":10},{"id":"1805.11721","title":"The Role of Caching in Future Communication Systems and Networks","created":"2018-05-29","cited_by_count":9},{"id":"2404.14238","title":"Beyond the Edge: An Advanced Exploration of Reinforcement Learning for Mobile Edge Computing, its Applications, and Future Research Trajectories","created":"2024-04-22","cited_by_count":9},{"id":"2406.01577","title":"An Equivalence Between Static and Dynamic Regret Minimization","created":"2024-06-03","cited_by_count":9},{"id":"1602.00173","title":"Wireless Caching: Technical Misconceptions and Business Barriers","created":"2016-01-31","cited_by_count":7},{"id":"2001.06351","title":"Online Convex Optimization for Caching Networks","created":"2020-01-16","cited_by_count":7},{"id":"2202.10590","title":"Online Caching with Optimistic Learning","created":"2022-02-22","cited_by_count":7},{"id":"1912.12339","title":"Cache Optimization Models and Algorithms","created":"2019-12-27","cited_by_count":6},{"id":"2204.08572","title":"Expert-Calibrated Learning for Online Optimization with Switching Costs","created":"2022-04-18","cited_by_count":6},{"id":"2205.00446","title":"Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments","created":"2022-05-01","cited_by_count":6},{"id":"2211.11219","title":"Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret","created":"2022-11-21","cited_by_count":6},{"id":"1309.1110","title":"When Backpressure Meets Predictive Scheduling","created":"2013-09-04","cited_by_count":5},{"id":"1501.00644","title":"Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey","created":"2015-01-04","cited_by_count":5},{"id":"1801.03572","title":"Learning Aided Optimization for Energy Harvesting Devices with Outdated State Information","created":"2018-01-10","cited_by_count":5},{"id":"1804.04529","title":"Online convex optimization and no-regret learning: Algorithms, guarantees and applications","created":"2018-04-12","cited_by_count":5},{"id":"1810.11613","title":"Learning and Management for Internet-of-Things: Accounting for Adaptivity and Scalability","created":"2018-10-27","cited_by_count":5},{"id":"2211.16051","title":"Regret-Optimal Online Caching for Adversarial and Stochastic Arrivals","created":"2022-11-29","cited_by_count":5},{"id":"1712.05677","title":"Timely-Throughput Optimal Scheduling with Prediction","created":"2017-12-15","cited_by_count":4},{"id":"2204.09345","title":"Online Caching with no Regret: Optimistic Learning via Recommendations","created":"2022-04-20","cited_by_count":4},{"id":"2402.11285","title":"Fair Resource Allocation in Virtualized O-RAN Platforms","created":"2024-02-17","cited_by_count":4},{"id":"2501.08099","title":"Smooth Handovers via Smoothed Online Learning","created":"2025-01-14","cited_by_count":4},{"id":"2310.01309","title":"Optimistic Online Caching for Batched Requests","created":"2023-10-02","cited_by_count":3},{"id":"2310.02261","title":"Adaptive Online Non-stochastic Control","created":"2023-10-02","cited_by_count":3},{"id":"2404.03309","title":"Optimistic Online Non-stochastic Control via FTRL","created":"2024-04-04","cited_by_count":3},{"id":"1802.06581","title":"Dynamic Cloud Network Control under Reconfiguration Delay and Cost","created":"2018-02-19","cited_by_count":2},{"id":"2303.08772","title":"Reservation of Virtualized Resources with Optimistic Online Learning","created":"2023-03-15","cited_by_count":2},{"id":"1511.03417","title":"Adaptive Policies for Scheduling with Reconfiguration Delay: An End-to-End Solution for All-Optical Data Centers","created":"2015-11-11","cited_by_count":1},{"id":"2303.06851","title":"On the Regret of Online Edge Service Hosting","created":"2023-03-13","cited_by_count":1}],"next_cursor":null}