Distributionally robust submodular maximization
Submodular functions have applications throughout machine learning, but in many settings, we do not have direct access to the underlying function f. We focus on stochastic functions that are given as an expectation of functions over a distribution P. In practice, we often have only a limited set of...
Main Authors: | Staib, Matthew, Wilder, B, Jegelka, Stefanie Sabrina |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
MLResearchPress
2021
|
Online Access: | https://hdl.handle.net/1721.1/129983 |
Similar Items
-
Robust Budget Allocation Via Continuous Submodular Functions
by: Staib, Matthew, et al.
Published: (2021) -
Robust monotone submodular function maximization
by: Orlin, James B, et al.
Published: (2021) -
Robust Monotone Submodular Function Maximization
by: Orlin, James B, et al.
Published: (2021) -
Provable variational inference for constrained log-submodular models
by: Djolonga, Josip, et al.
Published: (2022) -
Online risk-averse submodular maximization
by: Soma, Tasuku, et al.
Published: (2022)