ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1804.04529
  4. Cited By
Online convex optimization and no-regret learning: Algorithms,
  guarantees and applications

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

12 April 2018
E. V. Belmega
P. Mertikopoulos
Romain Negrel
L. Sanguinetti
ArXiv (abs)PDFHTML

Papers citing "Online convex optimization and no-regret learning: Algorithms, guarantees and applications"

5 / 5 papers shown
Title
Distributed Online Non-convex Optimization with Composite Regret
Distributed Online Non-convex Optimization with Composite Regret
Zhanhong Jiang
Aditya Balu
Xian Yeow Lee
Young M. Lee
Chinmay Hegde
Soumik Sarkar
102
4
0
21 Sep 2022
Solving reward-collecting problems with UAVs: a comparison of online
  optimization and Q-learning
Solving reward-collecting problems with UAVs: a comparison of online optimization and Q-learning
Yixuan Liu
Chrysafis Vogiatzis
Ruriko Yoshida
Erich Morman
31
4
0
30 Nov 2021
Coordinated Online Learning for Multi-Agent Systems with Coupled
  Constraints and Perturbed Utility Observations
Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations
Ezra Tampubolon
Holger Boche
30
1
0
21 Oct 2020
Predictive online optimisation with applications to optical flow
Predictive online optimisation with applications to optical flow
T. Valkonen
29
3
0
08 Feb 2020
Pricing Mechanism for Resource Sustainability in Competitive Online
  Learning Multi-Agent Systems
Pricing Mechanism for Resource Sustainability in Competitive Online Learning Multi-Agent Systems
Ezra Tampubolon
Holger Boche
28
3
0
21 Oct 2019
1