Search Results for author:
Found 6 papers, 1 papers with code
Bayes correlated equilibria and no-regret dynamics
In particular, we focus on communication equilibria (also known as coordination mechanisms), which can be realized by a mediator who gathers each player's private information and then sends correlated recommendations to the players.
Lazy and Fast Greedy MAP Inference for Determinantal Point Process
One classical and practical method is the lazy greedy algorithm, which is applicable to general submodular function maximization, while a recent fast greedy algorithm based on the Cholesky factorization is more efficient for DPP MAP inference.
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
This paper proposes a new framework for providing approximation guarantees of local search algorithms.
Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio
We propose a new concept named adaptive submodularity ratio to study the greedy policy for sequential decision making.
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
In dictionary selection, several atoms are selected from finite candidates that successfully approximate given data points in the sparse representation.
Budgeted stream-based active learning via adaptive submodular maximization
In contrast, there have been few methods for stream-based active learning based on adaptive submodularity.
