sample complexity

Efficient Compressive Phase Retrieval with Constrained Sensing Vectors NeurIPS 2015 Fast Exact Matrix Completion with Finite Samples COLT 2015 Learnability of Influence in Networks NeurIPS 2015 Learning with Group Invariant Features: A Kernel Perspective. NeurIPS 2015 Matrix Completion with Noisy Side Information NeurIPS 2015 Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample Complexity COLT 2015 Minimax rates for memory-bounded sparse linear regression COLT 2015 Mixing Time Estimation in Reversible Markov Chains from a Single Sample Path NeurIPS 2015 Multiclass Learnability and the ERM Principle JMLR 2015 On Learning Distributions from their Samples COLT 2015 On the Pseudo-Dimension of Nearly Optimal Auctions NeurIPS 2015 On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NeurIPS 2015 Optimal and Adaptive Algorithms for Online Boosting ICML 2015 Optimal Testing for Properties of Distributions NeurIPS 2015 Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top ICML 2015 Sample Complexity Bounds for Iterative Stochastic Policy Optimization NeurIPS 2015 Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning NeurIPS 2015 Sample Complexity of Learning Mahalanobis Distance Metrics NeurIPS 2015 Sparse Dueling Bandits AISTATS 2015 Spectral Learning of Large Structured HMMs for Comparative Epigenomics NeurIPS 2015 Stochastic Dual Coordinate Ascent with Adaptive Probabilities ICML 2015 Structured Estimation with Atomic Norms: General Bounds and Applications NeurIPS 2015 Testing Closeness With Unequal Sized Samples NeurIPS 2015 The Sample Complexity of Learning Linear Predictors with the Squared Loss JMLR 2015 Towards a Lower Sample Complexity for Robust One-bit Compressed Sensing ICML 2015