Co-occurring keywords · papers mentioning both
Papers
Optimality Implies Kernel Sum Classifiers are Statistically Efficient
ICML 2019
Optimal Learning of Mallows Block Model
COLT 2019
P3O: Policy-on Policy-off Policy Optimization
UAI 2019
PAC Battling Bandits in the Plackett-Luce Model
ALT 2019
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
ICML 2019
PAC Learnability of Node Functions in Networked Dynamical Systems
ICML 2019
Planning in entropy-regularized Markov decision processes and games
NeurIPS 2019
Playgol: Learning Programs Through Play
IJCAI 2019
Private Center Points and Learning of Halfspaces
COLT 2019
Private Hypothesis Selection
NeurIPS 2019
Private Testing of Distributions via Sample Permutations
NeurIPS 2019
Pure Exploration with Multiple Correct Answers
NeurIPS 2019
Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice
AAAI 2019
Safe Policy Improvement with Baseline Bootstrapping in Factored Environments
AAAI 2019
Sample Complexity of Learning Mixture of Sparse Linear Regressions
NeurIPS 2019
Sample complexity of partition identification using multi-armed bandits
COLT 2019
Sample Complexity of Sinkhorn Divergences
AISTATS 2019
Sample-Optimal Low-Rank Approximation of Distance Matrices
COLT 2019
Sample-Optimal Parametric Q-Learning Using Linearly Additive Features
ICML 2019
Simultaneous Private Learning of Multiple Concepts
JMLR 2019
Sorted Top-k in Rounds
COLT 2019
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
NeurIPS 2019
Statistical Windows in Testing for the Initial Distribution of a Reversible Markov Chain
AISTATS 2019
Stochastic Canonical Correlation Analysis
JMLR 2019
Structure Learning for Safe Policy Improvement
IJCAI 2019