Co-occurring keywords · papers mentioning both
Papers
Distributed Learning, Communication Complexity and Privacy
COLT 2012
Learning DNF Expressions from Fourier Spectrum
COLT 2012
Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs
NeurIPS 2012
Multi-Instance Learning with Any Hypothesis Class
JMLR 2012
New Bounds for Learning Intervals with Implications for Semi-Supervised Learning
COLT 2012
Sample Complexity of Composite Likelihood
AISTATS 2012
Tight Bounds on Proper Equivalence Query Learning of DNF
COLT 2012
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
COLT 2011
Missing Information Impediments to Learnability
COLT 2011
Impossibility Theorems for Domain Adaptation
AISTATS 2010
Risk Bounds for Levy Processes in the PAC-Learning Framework
AISTATS 2010
Zero-shot Learning with Semantic Output Codes
NeurIPS 2009
An Error Bound Based on a Worst Likely Assignment
JMLR 2008
Look Ma, No Hands: Analyzing the Monotonic Feature Abstraction for Text Classification
NeurIPS 2008
A general agnostic active learning algorithm
NeurIPS 2007
Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions
JMLR 2007
FilterBoost: Regression and Classification on Large Datasets
NeurIPS 2007
Separating Models of Learning from Correlated and Uncorrelated Data
JMLR 2007
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
NeurIPS 2007
Attribute-efficient learning of decision lists and linear threshold functions under unconcentrated distributions
NeurIPS 2006
On the Complexity of Learning Lexicographic Strategies
JMLR 2006
Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds
NeurIPS 2006
Some Discriminant-Based PAC Algorithms
JMLR 2006
Maximum Margin Algorithms with Boolean Kernels
JMLR 2005
PAC-learnability of Probabilistic Deterministic Finite State Automata
JMLR 2004