Search Results for author:
Found 4 papers, 1 papers with code
Fully Dynamic Submodular Maximization over Matroids
Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning.
Deletion Robust Non-Monotone Submodular Maximization over Matroids
Maximizing a submodular function is a fundamental task in machine learning and in this paper we study the deletion robust version of the problem under the classic matroids constraint.
Deletion Robust Submodular Maximization over Matroids
Maximizing a monotone submodular function is a fundamental task in machine learning.
Optimal Auctions through Deep Learning: Advances in Differentiable Economics
Designing an incentive compatible auction that maximizes expected revenue is an intricate task.
