Header logo is


2016


Learning Where to Search Using Visual Attention
Learning Where to Search Using Visual Attention

Kloss, A., Kappler, D., Lensch, H. P. A., Butz, M. V., Schaal, S., Bohg, J.

Proceedings of the IEEE/RSJ Conference on Intelligent Robots and Systems, IEEE, IROS, October 2016 (conference)

Abstract
One of the central tasks for a household robot is searching for specific objects. It does not only require localizing the target object but also identifying promising search locations in the scene if the target is not immediately visible. As computation time and hardware resources are usually limited in robotics, it is desirable to avoid expensive visual processing steps that are exhaustively applied over the entire image. The human visual system can quickly select those image locations that have to be processed in detail for a given task. This allows us to cope with huge amounts of information and to efficiently deploy the limited capacities of our visual system. In this paper, we therefore propose to use human fixation data to train a top-down saliency model that predicts relevant image locations when searching for specific objects. We show that the learned model can successfully prune bounding box proposals without rejecting the ground truth object locations. In this aspect, the proposed model outperforms a model that is trained only on the ground truth segmentations of the target object instead of fixation data.

am

Project Page [BibTex]

2016


PDF Project Page [BibTex]


Parameter Learning for Improving Binary Descriptor Matching
Parameter Learning for Improving Binary Descriptor Matching

Sankaran, B., Ramalingam, S., Taguchi, Y.

In International Conference on Intelligent Robots and Systems (IROS) 2016, IEEE/RSJ International Conference on Intelligent Robots and Systems, October 2016 (inproceedings)

Abstract
Binary descriptors allow fast detection and matching algorithms in computer vision problems. Though binary descriptors can be computed at almost two orders of magnitude faster than traditional gradient based descriptors, they suffer from poor matching accuracy in challenging conditions. In this paper we propose three improvements for binary descriptors in their computation and matching that enhance their performance in comparison to traditional binary and non-binary descriptors without compromising their speed. This is achieved by learning some weights and threshold parameters that allow customized matching under some variations such as lighting and viewpoint. Our suggested improvements can be easily applied to any binary descriptor. We demonstrate our approach on the ORB (Oriented FAST and Rotated BRIEF) descriptor and compare its performance with the traditional ORB and SIFT descriptors on a wide variety of datasets. In all instances, our enhancements outperform standard ORB and is comparable to SIFT.

am

[BibTex]

[BibTex]


no image
Experiments with Hierarchical Reinforcement Learning of Multiple Grasping Policies

Osa, T., Peters, J., Neumann, G.

International Symposium on Experimental Robotics (ISER), 1, pages: 160-172, Springer Proceedings in Advanced Robotics, (Editors: Dana Kulic, Yoshihiko Nakamura, Oussama Khatib and Gentiane Venture), Springer, October 2016 (conference)

ei

DOI [BibTex]

DOI [BibTex]


no image
Stable Reinforcement Learning with Autoencoders for Tactile and Visual Data

van Hoof, H., Chen, N., Karl, M., van der Smagt, P., Peters, J.

Proceedings of the IEEE/RSJ Conference on Intelligent Robots and Systems (IROS), pages: 3928-3934, IEEE, October 2016 (conference)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
A New Trajectory Generation Framework in Robotic Table Tennis

Koc, O., Maeda, G., Peters, J.

Proceedings of the IEEE/RSJ Conference on Intelligent Robots and Systems (IROS), pages: 3750-3756, October 2016 (conference)

am ei

link (url) DOI [BibTex]

link (url) DOI [BibTex]


Superpixel Convolutional Networks using Bilateral Inceptions
Superpixel Convolutional Networks using Bilateral Inceptions

Gadde, R., Jampani, V., Kiefel, M., Kappler, D., Gehler, P.

In European Conference on Computer Vision (ECCV), Lecture Notes in Computer Science, Springer, 14th European Conference on Computer Vision, October 2016 (inproceedings)

Abstract
In this paper we propose a CNN architecture for semantic image segmentation. We introduce a new “bilateral inception” module that can be inserted in existing CNN architectures and performs bilateral filtering, at multiple feature-scales, between superpixels in an image. The feature spaces for bilateral filtering and other parameters of the module are learned end-to-end using standard backpropagation techniques. The bilateral inception module addresses two issues that arise with general CNN segmentation architectures. First, this module propagates information between (super) pixels while respecting image edges, thus using the structured information of the problem for improved results. Second, the layer recovers a full resolution segmentation result from the lower resolution solution of a CNN. In the experiments, we modify several existing CNN architectures by inserting our inception modules between the last CNN (1 × 1 convolution) layers. Empirical results on three different datasets show reliable improvements not only in comparison to the baseline networks, but also in comparison to several dense-pixel prediction techniques such as CRFs, while being competitive in time.

am ps

pdf supplementary poster Project Page Project Page [BibTex]

pdf supplementary poster Project Page Project Page [BibTex]


no image
Probabilistic Decomposition of Sequential Force Interaction Tasks into Movement Primitives

Manschitz, S., Gienger, M., Kober, J., Peters, J.

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 3920-3927, IEEE, October 2016 (conference)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


Barrista - Caffe Well-Served
Barrista - Caffe Well-Served

Lassner, C., Kappler, D., Kiefel, M., Gehler, P.

In ACM Multimedia Open Source Software Competition, ACM OSSC16, October 2016 (inproceedings)

Abstract
The caffe framework is one of the leading deep learning toolboxes in the machine learning and computer vision community. While it offers efficiency and configurability, it falls short of a full interface to Python. With increasingly involved procedures for training deep networks and reaching depths of hundreds of layers, creating configuration files and keeping them consistent becomes an error prone process. We introduce the barrista framework, offering full, pythonic control over caffe. It separates responsibilities and offers code to solve frequently occurring tasks for pre-processing, training and model inspection. It is compatible to all caffe versions since mid 2015 and can import and export .prototxt files. Examples are included, e.g., a deep residual network implemented in only 172 lines (for arbitrary depths), comparing to 2320 lines in the official implementation for the equivalent model.

am ps

pdf link (url) DOI Project Page [BibTex]

pdf link (url) DOI Project Page [BibTex]


no image
Multi-task logistic regression in brain-computer interfaces

Fiebig, K., Jayaram, V., Peters, J., Grosse-Wentrup, M.

6th Workshop on Brain-Machine Interface Systems at IEEE International Conference on Systems, Man, and Cybernetics (SMC 2016), pages: 002307-002312, IEEE, October 2016 (conference)

ei

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Active Tactile Object Exploration with Gaussian Processes

Yi, Z., Calandra, R., Veiga, F., van Hoof, H., Hermans, T., Zhang, Y., Peters, J.

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 4925-4930, IEEE, October 2016 (conference)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
On Version Space Compression

Ben-David, S., Urner, R.

Algorithmic Learning Theory - 27th International Conference (ALT), 9925, pages: 50-64, Lecture Notes in Computer Science, (Editors: Ortner, R., Simon, H. U., and Zilles, S.), September 2016 (conference)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Learning Probabilistic Features from EMG Data for Predicting Knee Abnormalities

Kohlschuetter, J., Peters, J., Rueckert, E.

XIV Mediterranean Conference on Medical and Biological Engineering and Computing (MEDICON), pages: 668-672, (Editors: Kyriacou, E., Christofides, S., and Pattichis, C. S.), September 2016 (conference)

ei

DOI [BibTex]

DOI [BibTex]


no image
Planning with Information-Processing Constraints and Model Uncertainty in Markov Decision Processes

Grau-Moya, J, Leibfried, F, Genewein, T, Braun, DA

Machine Learning and Knowledge Discovery in Databases, pages: 475-491, Lecture Notes in Computer Science; 9852, Springer, Cham, Switzerland, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery (ECML PKDD), September 2016 (conference)

Abstract
Information-theoretic principles for learning and acting have been proposed to solve particular classes of Markov Decision Problems. Mathematically, such approaches are governed by a variational free energy principle and allow solving MDP planning problems with information-processing constraints expressed in terms of a Kullback-Leibler divergence with respect to a reference distribution. Here we consider a generalization of such MDP planners by taking model uncertainty into account. As model uncertainty can also be formalized as an information-processing constraint, we can derive a unified solution from a single generalized variational principle. We provide a generalized value iteration scheme together with a convergence proof. As limit cases, this generalized scheme includes standard value iteration with a known model, Bayesian MDP planning, and robust planning. We demonstrate the benefits of this approach in a grid world simulation.

ei

DOI [BibTex]

DOI [BibTex]


Depth Estimation Through a Generative Model of Light Field Synthesis
Depth Estimation Through a Generative Model of Light Field Synthesis

Sajjadi, M. S. M., Köhler, R., Schölkopf, B., Hirsch, M.

Pattern Recognition - 38th German Conference (GCPR), 9796, pages: 426-438, Lecture Notes in Computer Science, (Editors: Rosenhahn, B. and Andres, B.), Springer International Publishing, September 2016 (conference)

ei

Arxiv Project link (url) DOI [BibTex]

Arxiv Project link (url) DOI [BibTex]


no image
Bidirektionale Interaktion zwischen Mensch und Roboter beim Bewegungslernen (BIMROB)

Kollegger, G., Ewerton, M., Peters, J., Wiemeyer, J.

11. Symposium der DVS Sportinformatik, September 2016 (conference)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
A Low-cost Sensor Glove with Vibrotactile Feedback and Multiple Finger Joint and Hand Motion Sensing for Human-Robot Interaction

Weber, P., Rueckert, E., Calandra, R., Peters, J., Beckerle, P.

25th IEEE International Symposium on Robot and Human Interactive Communication (RO-MAN), pages: 99-104, August 2016 (conference)

ei

DOI [BibTex]

DOI [BibTex]


no image
Experimental and causal view on information integration in autonomous agents

Geiger, P., Hofmann, K., Schölkopf, B.

Proceedings of the 6th International Workshop on Combinations of Intelligent Methods and Applications (CIMA), pages: 21-28, (Editors: Hatzilygeroudis, I. and Palade, V.), August 2016 (conference)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
Manifold Gaussian Processes for Regression

Calandra, R., Peters, J., Rasmussen, C. E., Deisenroth, M. P.

International Joint Conference on Neural Networks (IJCNN), pages: 3338-3345, IEEE, July 2016 (conference)

ei

DOI [BibTex]

DOI [BibTex]


Robust Gaussian Filtering using a Pseudo Measurement
Robust Gaussian Filtering using a Pseudo Measurement

Wüthrich, M., Garcia Cifuentes, C., Trimpe, S., Meier, F., Bohg, J., Issac, J., Schaal, S.

In Proceedings of the American Control Conference (ACC), Boston, MA, USA, July 2016 (inproceedings)

Abstract
Most widely-used state estimation algorithms, such as the Extended Kalman Filter and the Unscented Kalman Filter, belong to the family of Gaussian Filters (GF). Unfortunately, GFs fail if the measurement process is modelled by a fat-tailed distribution. This is a severe limitation, because thin-tailed measurement models, such as the analytically-convenient and therefore widely-used Gaussian distribution, are sensitive to outliers. In this paper, we show that mapping the measurements into a specific feature space enables any existing GF algorithm to work with fat-tailed measurement models. We find a feature function which is optimal under certain conditions. Simulation results show that the proposed method allows for robust filtering in both linear and nonlinear systems with measurements contaminated by fat-tailed noise.

am ics

Web link (url) DOI Project Page [BibTex]

Web link (url) DOI Project Page [BibTex]


no image
The Mondrian Kernel

Balog, M., Lakshminarayanan, B., Ghahramani, Z., Roy, D. M., Teh, Y. W.

Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence (UAI), (Editors: Ihler, Alexander T. and Janzing, Dominik), June 2016 (conference)

ei

Arxiv link (url) Project Page [BibTex]

Arxiv link (url) Project Page [BibTex]


no image
Recovery of non-linear cause-effect relationships from linearly mixed neuroimaging data

Weichwald, S., Gretton, A., Schölkopf, B., Grosse-Wentrup, M.

Proceedings of the 6th International Workshop on Pattern Recognition in NeuroImaging (PRNI 2016), June 2016 (conference)

ei

PDF Arxiv Code DOI Project Page [BibTex]

PDF Arxiv Code DOI Project Page [BibTex]


no image
Domain Adaptation with Conditional Transferable Components

Gong, M., Zhang, K., Liu, T., Tao, D., Glymour, C., Schölkopf, B.

Proceedings of the 33nd International Conference on Machine Learning (ICML), 48, pages: 2839-2848, JMLR Workshop and Conference Proceedings, (Editors: Balcan, M.-F. and Weinberger, K. Q.), June 2016 (conference)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
Learning Causal Interaction Network of Multivariate Hawkes Processes

Etesami, S., Kiyavash, N., Zhang, K., Singhal, K.

Proceedings of the 32nd Conference on Uncertainty in Artificial Intelligence (UAI), June 2016, poster presentation (conference)

ei

[BibTex]

[BibTex]


no image
Efficient Large-scale Approximate Nearest Neighbor Search on the GPU

Wieschollek, P., Wang, O., Sorkine-Hornung, A., Lensch, H. P. A.

29th IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages: 2027 - 2035, IEEE, June 2016 (conference)

ei

DOI [BibTex]

DOI [BibTex]


no image
On the Identifiability and Estimation of Functional Causal Models in the Presence of Outcome-Dependent Selection

Zhang, K., Zhang, J., Huang, B., Schölkopf, B., Glymour, C.

Proceedings of the 32nd Conference on Uncertainty in Artificial Intelligence (UAI), pages: 825-834, (Editors: Ihler, A. and Janzing, D.), AUAI Press, June 2016 (conference)

ei

link (url) [BibTex]

link (url) [BibTex]


Active Uncertainty Calibration in Bayesian ODE Solvers
Active Uncertainty Calibration in Bayesian ODE Solvers

Kersting, H., Hennig, P.

Proceedings of the 32nd Conference on Uncertainty in Artificial Intelligence (UAI), pages: 309-318, (Editors: Ihler, A. and Janzing, D.), AUAI Press, June 2016 (conference)

Abstract
There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al.~introduced a sampling-based class of methods that are `well-calibrated' in a specific sense. But the computational cost of these methods is significantly above that of classic methods. On the other hand, Schober et al.~pointed out a precise connection between classic Runge-Kutta ODE solvers and Gaussian filters, which gives only a rough probabilistic calibration, but at negligible cost overhead. By formulating the solution of ODEs as approximate inference in linear Gaussian SDEs, we investigate a range of probabilistic ODE solvers, that bridge the trade-off between computational cost and probabilistic calibration, and identify the inaccurate gradient measurement as the crucial source of uncertainty. We propose the novel filtering-based method Bayesian Quadrature filtering (BQF) which uses Bayesian quadrature to actively learn the imprecision in the gradient measurement by collecting multiple gradient evaluations.

ei pn

link (url) Project Page Project Page [BibTex]

link (url) Project Page Project Page [BibTex]


no image
The Arrow of Time in Multivariate Time Serie

Bauer, S., Schölkopf, B., Peters, J.

Proceedings of the 33rd International Conference on Machine Learning (ICML), 48, pages: 2043-2051, JMLR Workshop and Conference Proceedings, (Editors: Balcan, M. F. and Weinberger, K. Q.), JMLR, June 2016 (conference)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
A Kernel Test for Three-Variable Interactions with Random Processes

Rubenstein, P. K., Chwialkowski, K. P., Gretton, A.

Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence (UAI), (Editors: Ihler, Alexander T. and Janzing, Dominik), June 2016 (conference)

ei

PDF Supplement Arxiv [BibTex]

PDF Supplement Arxiv [BibTex]


no image
Continuous Deep Q-Learning with Model-based Acceleration

Gu, S., Lillicrap, T., Sutskever, I., Levine, S.

Proceedings of the 33nd International Conference on Machine Learning (ICML), 48, pages: 2829-2838, JMLR Workshop and Conference Proceedings, (Editors: Maria-Florina Balcan and Kilian Q. Weinberger), JMLR.org, June 2016 (conference)

ei

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Bounded Rational Decision-Making in Feedforward Neural Networks

Leibfried, F, Braun, D

Proceedings of the 32nd Conference on Uncertainty in Artificial Intelligence (UAI), pages: 407-416, June 2016 (conference)

Abstract
Bounded rational decision-makers transform sensory input into motor output under limited computational resources. Mathematically, such decision-makers can be modeled as information-theoretic channels with limited transmission rate. Here, we apply this formalism for the first time to multilayer feedforward neural networks. We derive synaptic weight update rules for two scenarios, where either each neuron is considered as a bounded rational decision-maker or the network as a whole. In the update rules, bounded rationality translates into information-theoretically motivated types of regularization in weight space. In experiments on the MNIST benchmark classification task for handwritten digits, we show that such information-theoretic regularization successfully prevents overfitting across different architectures and attains results that are competitive with other recent techniques like dropout, dropconnect and Bayes by backprop, for both ordinary and convolutional neural networks.

ei

[BibTex]

[BibTex]


Robot Arm Pose Estimation by Pixel-wise Regression of Joint Angles
Robot Arm Pose Estimation by Pixel-wise Regression of Joint Angles

Widmaier, F., Kappler, D., Schaal, S., Bohg, J.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2016, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

Abstract
To achieve accurate vision-based control with a robotic arm, a good hand-eye coordination is required. However, knowing the current configuration of the arm can be very difficult due to noisy readings from joint encoders or an inaccurate hand-eye calibration. We propose an approach for robot arm pose estimation that uses depth images of the arm as input to directly estimate angular joint positions. This is a frame-by-frame method which does not rely on good initialisation of the solution from the previous frames or knowledge from the joint encoders. For estimation, we employ a random regression forest which is trained on synthetically generated data. We compare different training objectives of the forest and also analyse the influence of prior segmentation of the arms on accuracy. We show that this approach improves previous work both in terms of computational complexity and accuracy. Despite being trained on synthetic data only, we demonstrate that the estimation also works on real depth images.

am

pdf DOI Project Page [BibTex]

pdf DOI Project Page [BibTex]


Optimizing for what matters: the Top Grasp Hypothesis
Optimizing for what matters: the Top Grasp Hypothesis

Kappler, D., Schaal, S., Bohg, J.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2016, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

Abstract
In this paper, we consider the problem of robotic grasping of objects when only partial and noisy sensor data of the environment is available. We are specifically interested in the problem of reliably selecting the best hypothesis from a whole set. This is commonly the case when trying to grasp an object for which we can only observe a partial point cloud from one viewpoint through noisy sensors. There will be many possible ways to successfully grasp this object, and even more which will fail. We propose a supervised learning method that is trained with a ranking loss. This explicitly encourages that the top-ranked training grasp in a hypothesis set is also positively labeled. We show how we adapt the standard ranking loss to work with data that has binary labels and explain the benefits of this formulation. Additionally, we show how we can efficiently optimize this loss with stochastic gradient descent. In quantitative experiments, we show that we can outperform previous models by a large margin.

am

pdf DOI Project Page [BibTex]

pdf DOI Project Page [BibTex]


Exemplar-based Prediction of Object Properties from Local Shape Similarity
Exemplar-based Prediction of Object Properties from Local Shape Similarity

Bohg, J., Kappler, D., Schaal, S.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2016, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

Abstract
We propose a novel method that enables a robot to identify a graspable object part of an unknown object given only noisy and partial information that is obtained from an RGB-D camera. Our method combines the benefits of local with the advantages of global methods. It learns a classifier that takes a local shape representation as input and outputs the probability that a grasp applied at this location will be successful. Given a query data point that is classified in this way, we can retrieve all the locally similar training data points and use them to predict latent global object shape. This information may help to further prune positively labeled grasp hypotheses based on, e.g. relation to the predicted average global shape or suitability for a specific task. This prediction can also guide scene exploration to prune object shape hypotheses. To learn the function that maps local shape to grasp stability we use a Random Forest Classifier. We show that our method reaches the same classification performance as the current state-of-the-art on this dataset which uses a Convolutional Neural Network. Additionally, we exploit the natural ability of the Random Forest to cluster similar data. For a positively predicted query data point, we retrieve all the locally similar training data points that are associated with the same leaf nodes of the Random Forest. The main insight from this work is that local object shape that affords a grasp is also a good predictor of global object shape. We empirically support this claim with quantitative experiments. Additionally, we demonstrate the predictive capability of the method on some real data examples.

am

pdf DOI Project Page [BibTex]

pdf DOI Project Page [BibTex]


Automatic {LQR} Tuning Based on {G}aussian Process Global Optimization
Automatic LQR Tuning Based on Gaussian Process Global Optimization

Marco, A., Hennig, P., Bohg, J., Schaal, S., Trimpe, S.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages: 270-277, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

Abstract
This paper proposes an automatic controller tuning framework based on linear optimal control combined with Bayesian optimization. With this framework, an initial set of controller gains is automatically improved according to a pre-defined performance objective evaluated from experimental data. The underlying Bayesian optimization algorithm is Entropy Search, which represents the latent objective as a Gaussian process and constructs an explicit belief over the location of the objective minimum. This is used to maximize the information gain from each experimental evaluation. Thus, this framework shall yield improved controllers with fewer evaluations compared to alternative approaches. A seven-degree- of-freedom robot arm balancing an inverted pole is used as the experimental demonstrator. Results of a two- and four- dimensional tuning problems highlight the method’s potential for automatic controller tuning on robotic platforms.

am ics pn

Video PDF DOI Project Page [BibTex]

Video PDF DOI Project Page [BibTex]


Depth-based Object Tracking Using a Robust Gaussian Filter
Depth-based Object Tracking Using a Robust Gaussian Filter

Issac, J., Wüthrich, M., Garcia Cifuentes, C., Bohg, J., Trimpe, S., Schaal, S.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2016, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

Abstract
We consider the problem of model-based 3D- tracking of objects given dense depth images as input. Two difficulties preclude the application of a standard Gaussian filter to this problem. First of all, depth sensors are characterized by fat-tailed measurement noise. To address this issue, we show how a recently published robustification method for Gaussian filters can be applied to the problem at hand. Thereby, we avoid using heuristic outlier detection methods that simply reject measurements if they do not match the model. Secondly, the computational cost of the standard Gaussian filter is prohibitive due to the high-dimensional measurement, i.e. the depth image. To address this problem, we propose an approximation to reduce the computational complexity of the filter. In quantitative experiments on real data we show how our method clearly outperforms the standard Gaussian filter. Furthermore, we compare its performance to a particle-filter-based tracking method, and observe comparable computational efficiency and improved accuracy and smoothness of the estimates.

am ics

Video Bayesian Object Tracking Library Bayesian Filtering Framework Object Tracking Dataset link (url) DOI Project Page [BibTex]

Video Bayesian Object Tracking Library Bayesian Filtering Framework Object Tracking Dataset link (url) DOI Project Page [BibTex]


Implications of Action-Oriented Paradigm Shifts in Cognitive Science
Implications of Action-Oriented Paradigm Shifts in Cognitive Science

Dominey, P. F., Prescott, T. J., Bohg, J., Engel, A. K., Gallagher, S., Heed, T., Hoffmann, M., Knoblich, G., Prinz, W., Schwartz, A.

In The Pragmatic Turn - Toward Action-Oriented Views in Cognitive Science, 18, pages: 333-356, 20, Strüngmann Forum Reports, vol. 18, J. Lupp, series editor, (Editors: Andreas K. Engel and Karl J. Friston and Danica Kragic), The MIT Press, 18th Ernst Strüngmann Forum, May 2016 (incollection) In press

Abstract
An action-oriented perspective changes the role of an individual from a passive observer to an actively engaged agent interacting in a closed loop with the world as well as with others. Cognition exists to serve action within a landscape that contains both. This chapter surveys this landscape and addresses the status of the pragmatic turn. Its potential influence on science and the study of cognition are considered (including perception, social cognition, social interaction, sensorimotor entrainment, and language acquisition) and its impact on how neuroscience is studied is also investigated (with the notion that brains do not passively build models, but instead support the guidance of action). A review of its implications in robotics and engineering includes a discussion of the application of enactive control principles to couple action and perception in robotics as well as the conceptualization of system design in a more holistic, less modular manner. Practical applications that can impact the human condition are reviewed (e.g. educational applications, treatment possibilities for developmental and psychopathological disorders, the development of neural prostheses). All of this foreshadows the potential societal implications of the pragmatic turn. The chapter concludes that an action-oriented approach emphasizes a continuum of interaction between technical aspects of cognitive systems and robotics, biology, psychology, the social sciences, and the humanities, where the individual is part of a grounded cultural system.

am

The Pragmatic Turn - Toward Action-Oriented Views in Cognitive Science 18th Ernst Strüngmann Forum Bibliography Chapter link (url) [BibTex]

The Pragmatic Turn - Toward Action-Oriented Views in Cognitive Science 18th Ernst Strüngmann Forum Bibliography Chapter link (url) [BibTex]


no image
Batch Bayesian Optimization via Local Penalization

González, J., Dai, Z., Hennig, P., Lawrence, N.

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), 51, pages: 648-657, JMLR Workshop and Conference Proceedings, (Editors: Gretton, A. and Robert, C. C.), May 2016 (conference)

ei pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
MuProp: Unbiased Backpropagation for Stochastic Neural Networks

Gu, S., Levine, S., Sutskever, I., Mnih, A.

4th International Conference on Learning Representations (ICLR), May 2016 (conference)

ei

Arxiv [BibTex]

Arxiv [BibTex]


no image
Communication Rate Analysis for Event-based State Estimation

(Best student paper finalist)

Ebner, S., Trimpe, S.

In Proceedings of the 13th International Workshop on Discrete Event Systems, May 2016 (inproceedings)

am ics

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
An Improved Cognitive Brain-Computer Interface for Patients with Amyotrophic Lateral Sclerosis

Hohmann, M. R., Fomina, T., Jayaram, V., Förster, C., Just, J., M., S., Schölkopf, B., Schöls, L., Grosse-Wentrup, M.

Proceedings of the Sixth International BCI Meeting, pages: 44, (Editors: Müller-Putz, G. R. and Huggins, J. E. and Steyrl, D.), BCI, May 2016 (conference)

ei

DOI [BibTex]

DOI [BibTex]


no image
Movement Primitives with Multiple Phase Parameters

Ewerton, M., Maeda, G., Neumann, G., Kisner, V., Kollegger, G., Wiemeyer, J., Peters, J.

IEEE International Conference on Robotics and Automation (ICRA), pages: 201-206, IEEE, May 2016 (conference)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
TerseSVM : A Scalable Approach for Learning Compact Models in Large-scale Classification

Babbar, R., Muandet, K., Schölkopf, B.

Proceedings of the 2016 SIAM International Conference on Data Mining (SDM), pages: 234-242, (Editors: Sanjay Chawla Venkatasubramanian and Wagner Meira), May 2016 (conference)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


A Lightweight Robotic Arm with Pneumatic Muscles for Robot Learning
A Lightweight Robotic Arm with Pneumatic Muscles for Robot Learning

Büchler, D., Ott, H., Peters, J.

Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages: 4086-4092, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (conference)

am ei

ICRA16final DOI Project Page [BibTex]

ICRA16final DOI Project Page [BibTex]


Probabilistic Approximate Least-Squares
Probabilistic Approximate Least-Squares

Bartels, S., Hennig, P.

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), 51, pages: 676-684, JMLR Workshop and Conference Proceedings, (Editors: Gretton, A. and Robert, C. C. ), May 2016 (conference)

Abstract
Least-squares and kernel-ridge / Gaussian process regression are among the foundational algorithms of statistics and machine learning. Famously, the worst-case cost of exact nonparametric regression grows cubically with the data-set size; but a growing number of approximations have been developed that estimate good solutions at lower cost. These algorithms typically return point estimators, without measures of uncertainty. Leveraging recent results casting elementary linear algebra operations as probabilistic inference, we propose a new approximate method for nonparametric least-squares that affords a probabilistic uncertainty estimate over the error between the approximate and exact least-squares solution (this is not the same as the posterior variance of the associated Gaussian process regressor). This allows estimating the error of the least-squares solution on a subset of the data relative to the full-data solution. The uncertainty can be used to control the computational effort invested in the approximation. Our algorithm has linear cost in the data-set size, and a simple formal form, so that it can be implemented with a few lines of code in programming languages with linear algebra functionality.

ei pn

link (url) Project Page Project Page [BibTex]

link (url) Project Page Project Page [BibTex]


no image
Drifting Gaussian Processes with Varying Neighborhood Sizes for Online Model Learning

Meier, F., Schaal, S.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2016, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

am

[BibTex]

[BibTex]


Learning Action-Perception Cycles in Robotics: A Question of Representations and Embodiment
Learning Action-Perception Cycles in Robotics: A Question of Representations and Embodiment

Bohg, J., Kragic, D.

In The Pragmatic Turn - Toward Action-Oriented Views in Cognitive Science, 18, pages: 309-320, 18, Strüngmann Forum Reports, vol. 18, J. Lupp, series editor, (Editors: Andreas K. Engel and Karl J. Friston and Danica Kragic), The MIT Press, 18th Ernst Strüngmann Forum, May 2016 (incollection) In press

Abstract
Since the 1950s, robotics research has sought to build a general-purpose agent capable of autonomous, open-ended interaction with realistic, unconstrained environments. Cognition is perceived to be at the core of this process, yet understanding has been challenged because cognition is referred to differently within and across research areas, and is not clearly defined. The classic robotics approach is decomposition into functional modules which perform planning, reasoning, and problem-solving or provide input to these mechanisms. Although advancements have been made and numerous success stories reported in specific niches, this systems-engineering approach has not succeeded in building such a cognitive agent. The emergence of an action-oriented paradigm offers a new approach: action and perception are no longer separable into functional modules but must be considered in a complete loop. This chapter reviews work on different mechanisms for action- perception learning and discusses the role of embodiment in the design of the underlying representations and learning. It discusses the evaluation of agents and suggests the development of a new embodied Turing Test. Appropriate scenarios need to be devised in addition to current competitions, so that abilities can be tested over long time periods.

am

18th Ernst Strüngmann Forum The Pragmatic Turn- Toward Action-Oriented Views in Cognitive Science Bibliography Chapter link (url) [BibTex]

18th Ernst Strüngmann Forum The Pragmatic Turn- Toward Action-Oriented Views in Cognitive Science Bibliography Chapter link (url) [BibTex]


no image
Learning soft task priorities for control of redundant robots

Modugno, V., Neumann, G., Rueckert, E., Oriolo, G., Peters, J., Ivaldi, S.

IEEE International Conference on Robotics and Automation (ICRA), pages: 221-226, IEEE, May 2016 (conference)

ei

DOI [BibTex]

DOI [BibTex]