We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
ing Complex Languages through Transformation and Composition Jendrik Johannes, Steffen Zschaler, Miguel A. Fernández, Antonio Castillo, Dimitrios S. Kolovos and Richard F. Paige ...
Jendrik Johannes, Steffen Zschaler, Miguel A. Fern...
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
: Current learning modelling languages do not allow formalization of scripts where generic tools are required. This limitation is especially relevant on remote courses when using c...
We propose a probabilistic model for the Independent Vector Analysis approach to blind deconvolution and derive an asymptotic Newton method to estimate the model by Maximum Likelih...
Jason A. Palmer, Kenneth Kreutz-Delgado, Scott Mak...