4 citations · 9 across the 8 of their papers we have counts for
8 papers
No-Regret Online Prediction with Strategic Experts
Omid Sadeghi, Maryam Fazel
We study a generalization of the online binary prediction with expert advice framework where at each round, the learner is allowed to pick experts from a pool of expe…
Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback
Adhyyan Narang, Omid Sadeghi, Lillian J Ratliff +2
In the context of online interactive machine learning with combinatorial objectives, we extend purely submodular prior work to more general non-submodular objectives. This includes…
Fast First-Order Methods for Monotone Strongly DR-Submodular Maximization
Omid Sadeghi, Maryam Fazel
Continuous DR-submodular functions are a class of functions that satisfy the Diminishing Returns (DR) property, which implies that they are concave along non-negative directions. E…
Improved Regret Bounds for Online Submodular Maximization
Omid Sadeghi, Prasanna Raut, Maryam Fazel
In this paper, we consider an online optimization problem over rounds where at each step , the algorithm chooses an action from the fixed convex and compact doma…
Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs
Mitas Ray, Omid Sadeghi, Lillian J. Ratliff +1
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…
Online DR-Submodular Maximization with Stochastic Cumulative Constraints
Prasanna Sanjay Raut, Omid Sadeghi, Maryam Fazel
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,…
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints
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 in…
Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems
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 Retu…