Recent work has exploited boundedness of data in the unsupervised learning of new types of generative model. For nonnegative data it was recently shown that the maximum-entropy ge...
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
The supremacy of n-gram models in statistical language modelling has recently been challenged by parametric models that use distributed representations to counteract the difficult...
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Blogs have the aordance to become an integral part of teaching and learning processes as a vehicle for knowledge management. Open, exible systems integrating blogs provide user-f...