4 citations · 9 across the 8 of their papers we have counts for
4 papers · 1 filter
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…