Shai Ben-David

From MaRDI portal
Person:1009295

Available identifiers

zbMath Open ben-david.shaiWikidataQ83706889 ScholiaQ83706889MaRDI QIDQ1009295

List of research outcomes

PublicationDate of PublicationType
Learnability can be independent of set theory (invited paper)2023-11-14Paper
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes2022-12-08Paper
https://portal.mardi4nfdi.de/entity/Q46176332019-02-06Paper
https://portal.mardi4nfdi.de/entity/Q29585942017-02-03Paper
Multi-task and Lifelong Learning of Kernels2016-11-30Paper
Information Preserving Dimensionality Reduction2016-11-30Paper
On Version Space Compression2016-11-09Paper
Finding Meaningful Cluster Structure Amidst Background Noise2016-11-09Paper
https://portal.mardi4nfdi.de/entity/Q57448422016-02-19Paper
Understanding Machine Learning2014-07-28Paper
Domain adaptation -- can quantity compensate for quality?2014-06-26Paper
On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples2012-10-16Paper
Learning a Classifier when the Labeling Is Known2011-10-19Paper
Learning Theory and Kernel Machines2010-03-23Paper
A notion of task relatedness yielding provable multiple-task learning guarantees2009-03-31Paper
Stability of k-Means Clustering2008-01-03Paper
A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering2007-09-20Paper
A Sober Look at Clustering Stability2007-09-14Paper
Learning Bounds for Support Vector Machines with Learned Kernels2007-09-14Paper
Theory and Applications of Models of Computation2007-04-30Paper
Learning Theory2005-06-13Paper
10.1162/1532443033218976812004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44705562004-07-01Paper
On the difficulty of approximately maximizing agreements.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47812292002-11-12Paper
https://portal.mardi4nfdi.de/entity/Q31488232002-09-22Paper
Hardness results for neural network approximation problems2002-07-15Paper
The computational complexity of densest region detection2002-07-04Paper
A Note on VC-Dimension and Measure of Sets of Reals2001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45269972001-02-28Paper
Learning changing concepts by exploiting the structure of change2001-01-16Paper
Learning with restricted focus of attention2000-09-27Paper
VC-dimension analysis of object recognition tasks2000-06-21Paper
Self-directed learning and its relation to the VC-dimension and to teacher-directed learning1999-05-18Paper
Localization vs. identification of semi-algebraic sets1999-01-17Paper
Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes1998-09-27Paper
Scale-sensitive dimensions, uniform convergence, and learnability1998-02-17Paper
Learning distributions by their density levels: A paradigm for learning without a teacher1998-01-07Paper
Online learning versus offline learning1997-12-17Paper
The two-cardinals transfer property and resurrection of supercompactness 󠀼span style=󠀢color:red󠀢󠀾This article has been retracted󠀼/span󠀾1997-06-03Paper
A parameterization scheme for classifying models of PAC learnability1995-10-29Paper
Learning by distances1995-07-10Paper
Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions1995-06-08Paper
On the theory of average case complexity1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40135461992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q37971781988-01-01Paper
Souslin trees and successors of singular cardinals1986-01-01Paper
Non-special Aronszajn trees on \(\aleph _{\omega +1}\)1986-01-01Paper
The weak □* is really weaker than the full □1986-01-01Paper
On Shelah's compactness of cardinals1978-01-01Paper
Correction to On Shelah's compactness of cardinals1978-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Shai Ben-David