Omid Sadeghi
6 papers · 2020–2024 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Bronze
🌉
Interdisciplinary Bridge · Bronze
🗺️
Taxonomy Completionist
(14)
Venues
Top co-authors
Research topics
Keywords
regret bound
(5)
submodular maximization
(4)
online optimization
(3)
gaussian process
(1)
online prediction
(1)
expert advice
(1)
contextual bandit
(1)
sublinear regret
(1)
incentive compatibility
(1)
recommendation system
(1)
stochastic method
(1)
budget constraint
(1)
convex constraint
(1)
frank-wolfe algorithm
(1)
constraint violation
(1)
matroid constraint
(1)
diminishing return
(1)
knapsack constraint
(1)
strategic expert
(1)
submodular optimization
(1)
Papers
Efficient Interactive Maximization of BP and Weakly Submodular Objectives
UAI 2024
No-Regret Online Prediction with Strategic Experts
NeurIPS 2023
Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints
AISTATS 2021
Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation
AAAI 2021
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints
NeurIPS 2020
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints
AISTATS 2020