1 code implementation • 7 Jul 2022 • Adhyyan Narang, Omid Sadeghi, Lillian J Ratliff, Maryam Fazel, Jeff Bilmes
In the context of online interactive machine learning with combinatorial objectives, we extend purely submodular prior work to more general non-submodular objectives.
no code implementations • 15 Nov 2021 • Omid Sadeghi, Maryam Fazel
Then, we study $L$-smooth monotone strongly DR-submodular functions that have bounded curvature, and we show how to exploit such additional structure to obtain algorithms with improved approximation guarantees and faster convergence rates for the maximization problem.
no code implementations • 15 Jun 2021 • Omid Sadeghi, Prasanna Raut, Maryam Fazel
For $(1)$, we obtain the first logarithmic regret bounds.
no code implementations • 23 Dec 2020 • Mitas Ray, Omid Sadeghi, Lillian J. Ratliff, Maryam Fazel
We study the problem of online resource allocation, where multiple customers arrive sequentially and the seller must irrevocably allocate resources to each incoming customer while also facing a procurement cost for the total allocation.
no code implementations • NeurIPS 2020 • Omid Sadeghi, Prasanna Raut, Maryam Fazel
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.
no code implementations • 29 May 2020 • Prasanna Sanjay Raut, Omid Sadeghi, Maryam Fazel
Stochastic long-term constraints arise naturally in applications where there is a limited budget or resource available and resource consumption at each step is governed by stochastically time-varying environments.
no code implementations • 30 Jun 2019 • Omid Sadeghi, Maryam Fazel
In this paper, we study a class of online optimization problems with long-term budget constraints where the objective functions are not necessarily concave (nor convex) but they instead satisfy the Diminishing Returns (DR) property.
no code implementations • 30 Jun 2019 • Omid Sadeghi, Reza Eghbali, Maryam Fazel
In this paper, we study a certain class of online optimization problems, where the goal is to maximize a function that is not necessarily concave and satisfies the Diminishing Returns (DR) property under budget constraints.