Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Antti Rasmus

dblp:88/2878 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Deep learning architectures and training · 27% Reinforcement learning · 15% Motion planning and robot control · 15%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › feedforward neural network
ladder networks
0.522017
Recurrent Ladder Networks · NIPS 2017
Semi-supervised Learning with Ladder Networks · NIPS 2015
Machine learning › Reinforcement learning
model-based reinforcement learning
0.412019
Regularizing Trajectory Optimization with Denoising Autoencoders · NeurIPS 2019
Machine learning › Deep learning architectures and training
regularization
0.412019
Regularizing Trajectory Optimization with Denoising Autoencoders · NeurIPS 2019
Robotics › Motion planning and robot control
trajectory optimization
0.412019
Regularizing Trajectory Optimization with Denoising Autoencoders · NeurIPS 2019
Machine learning › Generative modeling › variational autoencoder
hierarchical latent variable model
0.312017
Recurrent Ladder Networks · NIPS 2017
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
iterative inference
0.312017
Recurrent Ladder Networks · NIPS 2017
Computer vision › Segmentation and scene understanding
perceptual grouping
0.212016
Tagger: Deep Unsupervised Perceptual Grouping · NIPS 2016
Machine learning › Learning paradigms
semi-supervised learning
0.212015
Semi-supervised Learning with Ladder Networks · NIPS 2015
Robotics › Motion planning and robot control › robot control › actuator control
motor control
0.112019
Regularizing Trajectory Optimization with Denoising Autoencoders · NeurIPS 2019
Machine learning › Reinforcement learning
sample efficiency
0.112019
Regularizing Trajectory Optimization with Denoising Autoencoders · NeurIPS 2019
Computer vision › Image recognition and object detection
image classification
0.112015
Semi-supervised Learning with Ladder Networks · NIPS 2015

Methods — techniques the papers use, named apart from their topics

gradient-free optimization · 0.4gradient-based optimization · 0.4denoising autoencoder · 0.4unsupervised learning · 0.3temporal modeling · 0.3semi-supervised learning · 0.3iterative inference · 0.2amortized inference · 0.2ladder network · 0.2backpropagation · 0.2
YearPublicationVenuePosition
2019 Regularizing Trajectory Optimization with Denoising Autoencoders
abstract
Trajectory optimization using a learned model of the environment is one of the core elements of model-based reinforcement learning. This procedure often suffers from exploiting inaccuracies of the learned model. We propose to regularize trajectory optimization by means of a denoising autoencoder that is trained on the same trajectories as the model of the environment. We show that the proposed regularization leads to improved planning with both gradient-based and gradient-free optimizers. We also demonstrate that using regularized trajectory optimization leads to rapid initial learning in a set of popular motor control tasks, which suggests that the proposed approach can be a useful tool for improving sample efficiency.
Rinu Boney, Norman Di Palo, Mathias Berglund, Alexander Ilin, Juho Kannala, Antti Rasmus, Harri Valpola
NeurIPS6
2017 Recurrent Ladder Networks
abstract
We propose a recurrent extension of the Ladder networks whose structure is motivated by the inference required in hierarchical latent variable models. We demonstrate that the recurrent Ladder is able to handle a wide variety of complex learning tasks that benefit from iterative inference and temporal modeling. The architecture shows close-to-optimal results on temporal modeling of video data, competitive results on music modeling, and improved perceptual grouping based on higher order abstractions, such as stochastic textures and motion cues. We present results for fully supervised, semi-supervised, and unsupervised tasks. The results suggest that the proposed architecture and principles are powerful tools for learning a hierarchy of abstractions, learning iterative inference and handling temporal information.
Isabeau Prémont-Schwarz, Alexander Ilin, Tele Hao, Antti Rasmus, Rinu Boney, Harri Valpola
NIPS4
2016 Tagger: Deep Unsupervised Perceptual Grouping
abstract
We present a framework for efficient perceptual inference that explicitly reasons about the segmentation of its inputs and features. Rather than being trained for any specific segmentation, our framework learns the grouping process in an unsupervised manner or alongside any supervised task. We enable a neural network to group the representations of different objects in an iterative manner through a differentiable mechanism. We achieve very fast convergence by allowing the system to amortize the joint iterative inference of the groupings and their representations. In contrast to many other recently proposed methods for addressing multi-object scenes, our system does not assume the inputs to be images and can therefore directly handle other modalities. We evaluate our method on multi-digit classification of very cluttered images that require texture segmentation. Remarkably our method achieves improved classification performance over convolutional networks despite being fully connected, by making use of the grouping mechanism. Furthermore, we observe that our system greatly improves upon the semi-supervised result of a baseline Ladder network on our dataset. These results are evidence that grouping is a powerful tool that can help to improve sample efficiency.
Klaus Greff, Antti Rasmus, Mathias Berglund, Tele Hao, Harri Valpola, Jürgen Schmidhuber
NIPS2
2015 Semi-supervised Learning with Ladder Networks
abstract
We combine supervised learning with unsupervised learning in deep neural networks. The proposed model is trained to simultaneously minimize the sum of supervised and unsupervised cost functions by backpropagation, avoiding the need for layer-wise pre-training. Our work builds on top of the Ladder network proposed by Valpola (2015) which we extend by combining the model with supervision. We show that the resulting model reaches state-of-the-art performance in semi-supervised MNIST and CIFAR-10 classification in addition to permutation-invariant MNIST classification with all labels.
Antti Rasmus, Mathias Berglund, Mikko Honkala, Harri Valpola, Tapani Raiko
NIPS1