Abstract. We study an interactive model of supervised clustering introduced by Balcan and Blum [6], where the clustering algorithm has query access to a teacher. We give an efficie...
We design algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors. We ...
We study the optimal rates of convergence for estimating a prior distribution over a VC class from a sequence of independent data sets respectively labeled by independent target f...
We present in this study a novel approach to predicting EEG epileptic seizures: we accurately model and predict non-ictal cortical activity and use prediction errors as parameters ...
Abstract This paper deals with the learning curve in a Gaussian process regression framework. The learning curve describes the generalization error of the Gaussian process used for...
Recent years have seen a surge of interest in Statistical Relational Learning (SRL) models that combine logic with probabilities. One prominent and highly expressive SRL model is M...
Tushar Khot, Sriraam Natarajan, Kristian Kersting,...
We present a novel probabilistic clustering model for objects that are represented via pairwise distances and observed at different time points. The proposed method utilizes the i...
Julia E. Vogt, Marius Kloft, Stefan Stark, Sudhir ...
Probabilistic logic programming allows to model domains with complex and uncertain relationships among entities. While the problem of learning the parameters of such programs has b...