Co-occurring keywords · papers mentioning both
Papers
On the Information Theoretic Limits of Learning Ising Models
NeurIPS 2014
Open Problem: Finding Good Cascade Sampling Processes for the Network Inference Problem
COLT 2014
Optimal learners for multiclass problems
COLT 2014
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing
ICML 2014
Optimistic Planning in Markov Decision Processes Using a Generative Model
NeurIPS 2014
PAC-inspired Option Discovery in Lifelong Reinforcement Learning
ICML 2014
Provable Bounds for Learning Some Deep Representations
ICML 2014
Provable Tensor Factorization with Missing Data
NeurIPS 2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
COLT 2014
Sparse Multi-Task Reinforcement Learning
NeurIPS 2014
Spectral Methods for Supervised Topic Models
NeurIPS 2014
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery
ICML 2014
The sample complexity of agnostic learning under deterministic labels
COLT 2014
Time--Data Tradeoffs by Aggressive Smoothing
NeurIPS 2014
A Competitive Test for Uniformity of Monotone Distributions
AISTATS 2013
Active and passive learning of linear separators under log-concave distributions
COLT 2013
B-test: A Non-parametric, Low Variance Kernel Two-sample Test
NeurIPS 2013
Cluster Trees on Manifolds
NeurIPS 2013
Differentially Private Learning with Kernels
ICML 2013
Distribution-Dependent Sample Complexity of Large Margin Learning
JMLR 2013
Efficient Ranking from Pairwise Comparisons
ICML 2013
Efficient Semi-supervised and Active Learning of Disjunctions
ICML 2013
Eluder Dimension and the Sample Complexity of Optimistic Exploration
NeurIPS 2013
Estimation, Optimization, and Parallelism when Data is Sparse
NeurIPS 2013
Low-Rank Matrix and Tensor Completion via Adaptive Sampling
NeurIPS 2013