Co-occurring keywords · papers mentioning both
Papers
Sampling from a k-DPP without looking at all items
NeurIPS 2020
Subset Selection by Pareto Optimization with Recombination
AAAI 2020
Active Ranking with Subset-wise Preferences
AISTATS 2019
Algorithms for Average Regret Minimization
AAAI 2019
Combinatorial Bandits with Relative Feedback
NeurIPS 2019
Deep Supervised Summarization: Algorithm and Application to Learning Instructions
NeurIPS 2019
DppNet: Approximating Determinantal Point Processes with Deep Networks
NeurIPS 2019
Exact sampling of determinantal point processes with sublinear time preprocessing
NeurIPS 2019
Learning Nonsymmetric Determinantal Point Processes
NeurIPS 2019
MaxHedge: Maximizing a Maximum Online
AISTATS 2019
PAC Battling Bandits in the Plackett-Luce Model
ALT 2019
Pareto Optimization for Subset Selection with Dynamic Cost Constraints
AAAI 2019
Sequential Facility Location: Approximate Submodularity and Greedy Algorithm
ICML 2019
Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection
JMLR 2018
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection
IJCAI 2018
Creating Capsule Wardrobes From Fashion Images
CVPR 2018
Distributed Pareto Optimization for Subset Selection
IJCAI 2018
Exploiting Transitivity for Learning Person Re-Identification Models on a Budget
CVPR 2018
Reverse Iterative Volume Sampling for Linear Regression
JMLR 2018
Selecting Representative Examples for Program Synthesis
ICML 2018
Diverse Image Annotation
CVPR 2017
Non-Uniform Subset Selection for Active Learning in Structured Data
CVPR 2017
Online Summarization via Submodular and Convex Optimization
CVPR 2017
On Subset Selection with General Cost Constraints
IJCAI 2017
Subset Selection under Noise
NeurIPS 2017