The following pages link to Shai Ben-David (Q1009295):
Displaying 50 items.
- A notion of task relatedness yielding provable multiple-task learning guarantees (Q1009297) (← links)
- Souslin trees and successors of singular cardinals (Q1089334) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- On Shelah's compactness of cardinals (Q1248507) (← links)
- Correction to ''On Shelah's compactness of cardinals'' (Q1251654) (← links)
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes (Q1265741) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- Self-directed learning and its relation to the VC-dimension and to teacher-directed learning (Q1275348) (← links)
- Localization vs. identification of semi-algebraic sets (Q1275351) (← links)
- VC-dimension analysis of object recognition tasks (Q1300072) (← links)
- Learning distributions by their density levels: A paradigm for learning without a teacher (Q1370866) (← links)
- Online learning versus offline learning (Q1373713) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Learning changing concepts by exploiting the structure of change (Q1592380) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- The computational complexity of densest region detection (Q1604217) (← links)
- Non-special Aronszajn trees on \(\aleph _{\omega +1}\) (Q1821774) (← links)
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions (Q1892207) (← links)
- Learning by distances (Q1892878) (← links)
- A parameterization scheme for classifying models of PAC learnability (Q1898473) (← links)
- Domain adaptation -- can quantity compensate for quality? (Q2248544) (← links)
- A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering (Q2384132) (← links)
- A Note on VC-Dimension and Measure of Sets of Reals (Q2709844) (← links)
- On Version Space Compression (Q2830266) (← links)
- Finding Meaningful Cluster Structure Amidst Background Noise (Q2831395) (← links)
- Multi-task and Lifelong Learning of Kernels (Q2835628) (← links)
- Information Preserving Dimensionality Reduction (Q2835632) (← links)
- (Q2958594) (← links)
- Learning a Classifier when the Labeling Is Known (Q3093970) (← links)
- (Q3148823) (← links)
- On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples (Q3164816) (← links)
- The weak □* is really weaker than the full □ (Q3757911) (← links)
- (Q3797178) (← links)
- (Q4013546) (← links)
- Scale-sensitive dimensions, uniform convergence, and learnability (Q4377590) (← links)
- (Q4470556) (← links)
- (Q4526997) (← links)
- (Q4617633) (← links)
- Learning Theory (Q4680894) (← links)
- The two-cardinals transfer property and resurrection of supercompactness span style=color:redThis article has been retracted/span (Q4714696) (← links)
- (Q4781229) (← links)
- 10.1162/153244303321897681 (Q4825352) (← links)
- Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes (Q5056446) (← links)
- Learning Theory and Kernel Machines (Q5305879) (← links)
- A Sober Look at Clustering Stability (Q5307555) (← links)
- Learning Bounds for Support Vector Machines with Learned Kernels (Q5307567) (← links)
- Stability of k-Means Clustering (Q5432423) (← links)
- Understanding Machine Learning (Q5494386) (← links)
- (Q5744842) (← links)
- Theory and Applications of Models of Computation (Q5898878) (← links)
