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. 2005.14708
  4. Cited By
Online DR-Submodular Maximization with Stochastic Cumulative Constraints
v1v2v3 (latest)

Online DR-Submodular Maximization with Stochastic Cumulative Constraints

29 May 2020
P. Raut
Omid Sadeghi
Maryam Fazel
ArXiv (abs)PDFHTML

Papers citing "Online DR-Submodular Maximization with Stochastic Cumulative Constraints"

5 / 5 papers shown
Title
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
188
1,939
0
07 Sep 2019
A Short Note on Concentration Inequalities for Random Vectors with
  SubGaussian Norm
A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm
Chi Jin
Praneeth Netrapalli
Rong Ge
Sham Kakade
Michael I. Jordan
105
150
0
11 Feb 2019
Online convex optimization for cumulative constraints
Online convex optimization for cumulative constraints
Jianjun Yuan
Andrew G. Lamperski
46
112
0
19 Feb 2018
Bandits with concave rewards and convex knapsacks
Bandits with concave rewards and convex knapsacks
Shipra Agrawal
Nikhil R. Devanur
133
201
0
24 Feb 2014
Bandits with Knapsacks
Bandits with Knapsacks
Ashwinkumar Badanidiyuru
Robert D. Kleinberg
Aleksandrs Slivkins
107
433
0
11 May 2013
1