Prasanna Raut — accepted AI-conference papers

2021

Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation

Prasanna Raut, Omid Sadeghi, Maryam Fazel

AAAI 2021technical

In this paper, we consider online continuous DR-submodular maximization with linear stochastic long-term constraints. Compared to the prior work on online submodular maximization, our setting introduces the extra complication of stochastic linear constraint functions that are i.i.d. generated at eac…

Cited by 6 Source ↗PDF ↗Scholar ↗

2020

A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints

Omid Sadeghi, Prasanna Raut, Maryam Fazel

NeurIPS 2020spotlight

In this paper, we consider an online optimization problem in which the reward functions are DR-submodular, and in addition to maximizing the total reward, the sequence of decisions must satisfy some convex constraints on average. Specifically, at each round $t\in\{1,\dots,T\}$, upon committing to an…

Cited by 12 Source ↗PDF ↗Scholar ↗