Co-occurring keywords · papers mentioning both
Papers
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem
NeurIPS 2018
Bayesian Coreset Construction via Greedy Iterative Geodesic Ascent
ICML 2018
Budgeted Experiment Design for Causal Structure Learning
ICML 2018
Community Exploration: From Offline Optimization to Online Learning
NeurIPS 2018
Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings
ICML 2018
Differentiable Submodular Maximization
IJCAI 2018
Dynamic Query Re-Planning using QOOP
OSDI 2018
Experimental Design for Cost-Aware Learning of Causal Graphs
NeurIPS 2018
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
NeurIPS 2018
Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity
NeurIPS 2018
Gradient Hard Thresholding Pursuit
JMLR 2018
Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions
ICML 2018
Improving Information Centrality of a Node in Complex Networks by Adding Edges
IJCAI 2018
Maximizing Induced Cardinality Under a Determinantal Point Process
NeurIPS 2018
Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint
NeurIPS 2018
On the Statistical Efficiency of Compositional Nonparametric Prediction
AISTATS 2018
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function
NAACL 2018
Robust Maximization of Non-Submodular Objectives
AISTATS 2018
Stein Points
ICML 2018
The Computational Complexity of Distinctive Feature Minimization in Phonology
NAACL 2018
The Externalities of Exploration and How Data Diversity Helps Exploitation
COLT 2018
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
ICML 2018
When Rigging a Tournament, Let Greediness Blind You
IJCAI 2018
Acoustic Data-Driven Lexicon Learning Based on a Greedy Pronunciation Selection Framework
Interspeech 2017
A Greedy Approach for Budgeted Maximum Inner Product Search
NeurIPS 2017