| Publication | Date of Publication | Type |
|---|
Learnability can be independent of set theory (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
Journal of the ACM | 2022-12-08 | Paper |
| Multi-task kernel learning based on probabilistic Lipschitzness | 2019-02-06 | Paper |
| A characterization of linkage-based hierarchical clustering | 2017-02-03 | Paper |
Multi-task and lifelong learning of kernels
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Information preserving dimensionality reduction
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Finding Meaningful Cluster Structure Amidst Background Noise
Lecture Notes in Computer Science | 2016-11-09 | Paper |
On version space compression
Lecture Notes in Computer Science | 2016-11-09 | Paper |
| Multiclass learnability and the ERM principle | 2016-02-19 | Paper |
Multiclass learnability and the ERM principle
(available as arXiv preprint) | 2016-02-19 | Paper |
| Understanding machine learning. From theory to algorithms | 2014-07-28 | Paper |
Domain adaptation -- can quantity compensate for quality?
Annals of Mathematics and Artificial Intelligence | 2014-06-26 | Paper |
On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Learning a classifier when the labeling is known
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Learning Theory and Kernel Machines
Lecture Notes in Computer Science | 2010-03-23 | Paper |
A notion of task relatedness yielding provable multiple-task learning guarantees
Machine Learning | 2009-03-31 | Paper |
Stability of k-Means Clustering
Learning Theory | 2008-01-03 | Paper |
A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
Machine Learning | 2007-09-20 | Paper |
A Sober Look at Clustering Stability
Learning Theory | 2007-09-14 | Paper |
Learning Bounds for Support Vector Machines with Learned Kernels
Learning Theory | 2007-09-14 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
10.1162/153244303321897681
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2077163 (Why is no real title available?) | 2004-07-01 | Paper |
On the difficulty of approximately maximizing agreements.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1827091 (Why is no real title available?) | 2002-11-12 | Paper |
| scientific article; zbMATH DE number 1804121 (Why is no real title available?) | 2002-09-22 | Paper |
Hardness results for neural network approximation problems
Theoretical Computer Science | 2002-07-15 | Paper |
The computational complexity of densest region detection
Journal of Computer and System Sciences | 2002-07-04 | Paper |
A note on VC-dimension and measure of sets of reals
Combinatorics, Probability and Computing | 2001-10-30 | Paper |
| scientific article; zbMATH DE number 1559548 (Why is no real title available?) | 2001-02-28 | Paper |
Learning changing concepts by exploiting the structure of change
Machine Learning | 2001-01-16 | Paper |
Learning with restricted focus of attention
Journal of Computer and System Sciences | 2000-09-27 | Paper |
VC-dimension analysis of object recognition tasks
Journal of Mathematical Imaging and Vision | 2000-06-21 | Paper |
Self-directed learning and its relation to the VC-dimension and to teacher-directed learning
Machine Learning | 1999-05-18 | Paper |
Localization vs. identification of semi-algebraic sets
Machine Learning | 1999-01-17 | Paper |
Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
Discrete Applied Mathematics | 1998-09-27 | Paper |
Scale-sensitive dimensions, uniform convergence, and learnability
Journal of the ACM | 1998-02-17 | Paper |
Learning distributions by their density levels: A paradigm for learning without a teacher
Journal of Computer and System Sciences | 1998-01-07 | Paper |
Online learning versus offline learning
Machine Learning | 1997-12-17 | Paper |
The two-cardinals transfer property and resurrection of supercompactness span style=color:redThis article has been retracted/span
Proceedings of the American Mathematical Society | 1997-06-03 | Paper |
A parameterization scheme for classifying models of PAC learnability
Information and Computation | 1995-10-29 | Paper |
Learning by distances
Information and Computation | 1995-07-10 | Paper |
Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
Journal of Computer and System Sciences | 1995-06-08 | Paper |
On the theory of average case complexity
Journal of Computer and System Sciences | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 67626 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 4063089 (Why is no real title available?) | 1988-01-01 | Paper |
The weak □* is really weaker than the full □
Journal of Symbolic Logic | 1986-01-01 | Paper |
Souslin trees and successors of singular cardinals
Annals of Pure and Applied Logic | 1986-01-01 | Paper |
Non-special Aronszajn trees on \(\aleph _{\omega +1}\)
Israel Journal of Mathematics | 1986-01-01 | Paper |
On Shelah's compactness of cardinals
Israel Journal of Mathematics | 1978-01-01 | Paper |
Correction to On Shelah's compactness of cardinals
Israel Journal of Mathematics | 1978-01-01 | Paper |
