Shai Ben-David

Available identifiers

zbMath Open ben-david.shaiDBLP15/6319WikidataQ83706889 ScholiaQ83706889MaRDI QIDQ1009295

List of research outcomes

Publication	Date of Publication	Type
Learnability can be independent of set theory (invited paper)	2023-11-14	Paper
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q4617633	2019-02-06	Paper
https://portal.mardi4nfdi.de/entity/Q2958594	2017-02-03	Paper
Multi-task and Lifelong Learning of Kernels	2016-11-30	Paper
Information Preserving Dimensionality Reduction	2016-11-30	Paper
On Version Space Compression	2016-11-09	Paper
Finding Meaningful Cluster Structure Amidst Background Noise	2016-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q5744842	2016-02-19	Paper
Understanding Machine Learning	2014-07-28	Paper
Domain adaptation -- can quantity compensate for quality?	2014-06-26	Paper
On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples	2012-10-16	Paper
Learning a Classifier when the Labeling Is Known	2011-10-19	Paper
Learning Theory and Kernel Machines	2010-03-23	Paper
A notion of task relatedness yielding provable multiple-task learning guarantees	2009-03-31	Paper
Stability of k-Means Clustering	2008-01-03	Paper
A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering	2007-09-20	Paper
A Sober Look at Clustering Stability	2007-09-14	Paper
Learning Bounds for Support Vector Machines with Learned Kernels	2007-09-14	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Learning Theory	2005-06-13	Paper
10.1162/153244303321897681	2004-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4470556	2004-07-01	Paper
On the difficulty of approximately maximizing agreements.	2003-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4781229	2002-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q3148823	2002-09-22	Paper
Hardness results for neural network approximation problems	2002-07-15	Paper
The computational complexity of densest region detection	2002-07-04	Paper
A Note on VC-Dimension and Measure of Sets of Reals	2001-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q4526997	2001-02-28	Paper
Learning changing concepts by exploiting the structure of change	2001-01-16	Paper
Learning with restricted focus of attention	2000-09-27	Paper
VC-dimension analysis of object recognition tasks	2000-06-21	Paper
Self-directed learning and its relation to the VC-dimension and to teacher-directed learning	1999-05-18	Paper
Localization vs. identification of semi-algebraic sets	1999-01-17	Paper
Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes	1998-09-27	Paper
Scale-sensitive dimensions, uniform convergence, and learnability	1998-02-17	Paper
Learning distributions by their density levels: A paradigm for learning without a teacher	1998-01-07	Paper
Online learning versus offline learning	1997-12-17	Paper
The two-cardinals transfer property and resurrection of supercompactness 󠀼span style=󠀢color:red󠀢󠀾This article has been retracted󠀼/span󠀾	1997-06-03	Paper
A parameterization scheme for classifying models of PAC learnability	1995-10-29	Paper
Learning by distances	1995-07-10	Paper
Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions	1995-06-08	Paper
On the theory of average case complexity	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4013546	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q3797178	1988-01-01	Paper
Souslin trees and successors of singular cardinals	1986-01-01	Paper
Non-special Aronszajn trees on \(\aleph _{\omega +1}\)	1986-01-01	Paper
The weak □* is really weaker than the full □	1986-01-01	Paper
On Shelah's compactness of cardinals	1978-01-01	Paper
Correction to On Shelah's compactness of cardinals	1978-01-01	Paper

Research outcomes over time

This page was built for person: Shai Ben-David