Current methods for training convolutional neural networks depend on large amounts of labeled samples for supervised training. In this paper we present an approach for training a convolutional neural network using only unlabeled data. We train the network to discriminate between a set of surrogate classes. Each surrogate class is formed by applying a variety of transformations to a randomly sampled 'seed' image patch. We find that this simple feature learning algorithm is surprisingly successful when applied to visual object recognition. The feature representation learned by our algorithm achieves classification results matching or outperforming the current state-of-the-art for unsupervised learning on several popular datasets (STL-10, CIFAR-10, Caltech-101).

We present a probabilistic variant of the recently introduced maxout unit. The success of deep neural networks utilizing maxout can partly be attributed to favorable performance under dropout, when compared to rectified linear units. It however also depends on the fact that each maxout unit performs a pooling operation over a group of linear transformations and is thus partially invariant to changes in its input. Starting from this observation we ask the question: Can the desirable properties of maxout units be preserved while improving their invariance properties ? We argue that our probabilistic maxout (probout) units successfully achieve this balance. We quantitatively verify this claim and report classification performance matching or exceeding the current state of the art on three challenging image classification benchmarks (CIFAR-10, CIFAR-100 and SVHN).

We present an electricity demand forecasting algorithm based on Gaussian processes. By introducing a task-specific, custom covariance function k_power, which incorporates all available seasonal information as well as weather data, we are able to make accurate predictions of power consumption and renewable energy production. The hyper-parameters of the Gaussian process are optimized automatically using marginal likelihood maximization. There are no parameters to be specified by the user. We evaluate the prediction performance on simulated data and get superior results compared to a simple baseline method.

RoboCup is no longer just the Soccer World Cup for autonomous robots but has evolved to become a coordinated initiative encompassing four different robotics events: (1) Soccer, (2) Rescue, (3) Junior (focused on education), and (4) a Scientific Symposium. RoboCup-2003 took place from 2 to 11 July 2003 in Padua (Italy); it was colocated with other scientific events in the field of AI and robotics. In this article, in addition to reporting on the results of the games, we highlight the robotics and AI technologies exploited by the teams in the different leagues and describe the most meaningful scientific contributions.

This article reports on the RoboCup-2003 event. RoboCup is no longer just the Soccer World Cup for autonomous robots but has evolved to become a coordinated initiative encompassing four different robotics events: (1) Soccer, (2) Rescue, (3) Junior (focused on education), and (4) a Scientific Symposium. RoboCup-2003 took place from 2 to 11 July 2003 in Padua (Italy); it was colocated with other scientific events in the field of AI and robotics. In this article, in addition to reporting on the results of the games, we highlight the robotics and AI technologies exploited by the teams in the different leagues and describe the most meaningful scientific contributions.

Two "exact" algorithms were developed which lead to exactly the same results as OBS but using less time.

Two "exact" algorithmswere developed which lead to exactly the same results as OBS but using less time.