conftrace_

vc dimension

108 papers

Explore in graph

Also known as

VC-DIMENSION VCDIM

Co-occurring keywords

sample complexity (1169) pac learning (283) generalization bound (652) learning theory (519) concept class (38) differential privacy (1016) sample compression (32) empirical risk minimization (352) hypothesis class (28) support vector machine (978)

Papers

On the Complexity of Learning from Label Proportions IJCAI 2017
Inapproximability of VC Dimension and Littlestone’s Dimension COLT 2017
Risk Bounds for Transferring Representations With and Without Fine-Tuning ICML 2017
Mixing Implies Lower Bounds for Space Bounded Learning COLT 2017
On the Recursive Teaching Dimension of VC Classes NIPS 2016
Sign rank versus VC dimension COLT 2016
Refined Error Bounds for Several Learning Algorithms JMLR 2016
Minimax Analysis of Active Learning JMLR 2015
Open Problem: Recursive Teaching Dimension Versus VC Dimension COLT 2015
An Almost Optimal PAC Algorithm COLT 2015
Sample Compression for Multi-label Concept Classes COLT 2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity COLT 2014
The sample complexity of agnostic learning under deterministic labels COLT 2014
Predictive PAC Learning and Process Decompositions NIPS 2013
Honest Compressions and Their Application to Compression Schemes COLT 2013
Distributed Learning, Communication Complexity and Privacy COLT 2012
Dimensionality Dependent PAC-Bayes Margin Bound NIPS 2012
A Geometric Approach to Sample Compression JMLR 2012
Multiclass Learning Approaches: A Theoretical Comparison with Implications NIPS 2012
Learning Multiple Tasks using Shared Hypotheses NIPS 2012
Generalization Bound for Infinitely Divisible Empirical Process AISTATS 2011
Complexity-Based Approach to Calibration with Checking Rules COLT 2011
Theory of matching pursuit NIPS 2008
Nearly Uniform Validation Improves Compression-Based Error Bounds JMLR 2008
Unlabeled Compression Schemes for Maximum Classes JMLR 2007