Header logo is


2018


no image
Parallel and functionally segregated processing of task phase and conscious content in the prefrontal cortex

Kapoor, V., Besserve, M., Logothetis, N. K., Panagiotaropoulos, T. I.

Communications Biology, 1(215):1-12, December 2018 (article)

ei

link (url) DOI Project Page [BibTex]

2018


link (url) DOI Project Page [BibTex]


Thumb xl screen shot 2019 01 07 at 12.05.00
Control of Musculoskeletal Systems using Learned Dynamics Models

Büchler, D., Calandra, R., Schölkopf, B., Peters, J.

IEEE Robotics and Automation Letters, Robotics and Automation Letters, 3(4):3161-3168, IEEE, 2018 (article)

Abstract
Controlling musculoskeletal systems, especially robots actuated by pneumatic artificial muscles, is a challenging task due to nonlinearities, hysteresis effects, massive actuator de- lay and unobservable dependencies such as temperature. Despite such difficulties, muscular systems offer many beneficial prop- erties to achieve human-comparable performance in uncertain and fast-changing tasks. For example, muscles are backdrivable and provide variable stiffness while offering high forces to reach high accelerations. In addition, the embodied intelligence deriving from the compliance might reduce the control demands for specific tasks. In this paper, we address the problem of how to accurately control musculoskeletal robots. To address this issue, we propose to learn probabilistic forward dynamics models using Gaussian processes and, subsequently, to employ these models for control. However, Gaussian processes dynamics models cannot be set-up for our musculoskeletal robot as for traditional motor- driven robots because of unclear state composition etc. We hence empirically study and discuss in detail how to tune these approaches to complex musculoskeletal robots and their specific challenges. Moreover, we show that our model can be used to accurately control an antagonistic pair of pneumatic artificial muscles for a trajectory tracking task while considering only one- step-ahead predictions of the forward model and incorporating model uncertainty.

ei

RAL18final link (url) DOI Project Page [BibTex]

RAL18final link (url) DOI Project Page [BibTex]


no image
Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation

Ruiz, F. J. R., Valera, I., Svensson, L., Perez-Cruz, F.

IEEE Transactions on Cognitive Communications and Networking, 4(2):177-191, June 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Assisting Movement Training and Execution With Visual and Haptic Feedback

Ewerton, M., Rother, D., Weimar, J., Kollegger, G., Wiemeyer, J., Peters, J., Maeda, G.

Frontiers in Neurorobotics, 12, May 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Mixture of Attractors: A Novel Movement Primitive Representation for Learning Motor Skills From Demonstrations

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

IEEE Robotics and Automation Letters, 3(2):926-933, April 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Probabilistic movement primitives under unknown system dynamics

Paraschos, A., Rueckert, E., Peters, J., Neumann, G.

Advanced Robotics, 32(6):297-310, April 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
An Algorithmic Perspective on Imitation Learning

Osa, T., Pajarinen, J., Neumann, G., Bagnell, J., Abbeel, P., Peters, J.

Foundations and Trends in Robotics, 7(1-2):1-179, March 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Using Probabilistic Movement Primitives in Robotics

Paraschos, A., Daniel, C., Peters, J., Neumann, G.

Autonomous Robots, 42(3):529-551, March 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
A kernel-based approach to learning contact distributions for robot manipulation tasks

Kroemer, O., Leischnig, S., Luettgen, S., Peters, J.

Autonomous Robots, 42(3):581-600, March 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Approximate Value Iteration Based on Numerical Quadrature

Vinogradska, J., Bischoff, B., Peters, J.

IEEE Robotics and Automation Letters, 3(2):1330-1337, January 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Biomimetic Tactile Sensors and Signal Processing with Spike Trains: A Review

Yi, Z., Zhang, Y., Peters, J.

Sensors and Actuators A: Physical, 269, pages: 41-52, January 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Design and Analysis of the NIPS 2016 Review Process

Shah*, N., Tabibian*, B., Muandet, K., Guyon, I., von Luxburg, U.

Journal of Machine Learning Research, 19(49):1-34, 2018, *equal contribution (article)

ei slt

arXiv link (url) Project Page Project Page [BibTex]

arXiv link (url) Project Page Project Page [BibTex]


no image
A Flexible Approach for Fair Classification

Zafar, M. B., Valera, I., Gomez Rodriguez, M., Gummadi, K.

Journal of Machine Learning, 2018 (article) Accepted

ei

Project Page [BibTex]

Project Page [BibTex]


no image
Does universal controllability of physical systems prohibit thermodynamic cycles?

Janzing, D., Wocjan, P.

Open Systems and Information Dynamics, 25(3):1850016, 2018 (article)

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Learning Causality and Causality-Related Learning: Some Recent Progress

Zhang, K., Schölkopf, B., Spirtes, P., Glymour, C.

National Science Review, 5(1):26-29, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Online optimal trajectory generation for robot table tennis

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

Robotics and Autonomous Systems, 105, pages: 121-137, 2018 (article)

ei

PDF link (url) DOI Project Page [BibTex]

PDF link (url) DOI Project Page [BibTex]


no image
Counterfactual Mean Embedding: A Kernel Method for Nonparametric Causal Inference

Muandet, K., Kanagawa, M., Saengkyongam, S., Marukata, S.

Arxiv e-prints, arXiv:1805.08845v1 [stat.ML], 2018 (article)

Abstract
This paper introduces a novel Hilbert space representation of a counterfactual distribution---called counterfactual mean embedding (CME)---with applications in nonparametric causal inference. Counterfactual prediction has become an ubiquitous tool in machine learning applications, such as online advertisement, recommendation systems, and medical diagnosis, whose performance relies on certain interventions. To infer the outcomes of such interventions, we propose to embed the associated counterfactual distribution into a reproducing kernel Hilbert space (RKHS) endowed with a positive definite kernel. Under appropriate assumptions, the CME allows us to perform causal inference over the entire landscape of the counterfactual distribution. The CME can be estimated consistently from observational data without requiring any parametric assumption about the underlying distributions. We also derive a rate of convergence which depends on the smoothness of the conditional mean and the Radon-Nikodym derivative of the underlying marginal distributions. Our framework can deal with not only real-valued outcome, but potentially also more complex and structured outcomes such as images, sequences, and graphs. Lastly, our experimental results on off-policy evaluation tasks demonstrate the advantages of the proposed estimator.

ei pn

arXiv [BibTex]

arXiv [BibTex]


no image
Hierarchical Reinforcement Learning of Multiple Grasping Strategies with Human Instructions

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

Advanced Robotics, 32(18):955-968, 2018 (article)

ei

DOI Project Page [BibTex]


no image
Autofocusing-based phase correction

Loktyushin, A., Ehses, P., Schölkopf, B., Scheffler, K.

Magnetic Resonance in Medicine, 80(3):958-968, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Case series: Slowing alpha rhythm in late-stage ALS patients

Hohmann, M. R., Fomina, T., Jayaram, V., Emde, T., Just, J., Synofzik, M., Schölkopf, B., Schöls, L., Grosse-Wentrup, M.

Clinical Neurophysiology, 129(2):406-408, 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Inverse Reinforcement Learning via Nonparametric Spatio-Temporal Subgoal Modeling

Šošić, A., Rueckert, E., Peters, J., Zoubir, A., Koeppl, H.

Journal of Machine Learning Research, 19(69):1-45, 2018 (article)

ei

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Grip Stabilization of Novel Objects using Slip Prediction

Veiga, F., Peters, J., Hermans, T.

IEEE Transactions on Haptics, 2018 (article) In press

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Electrophysiological correlates of neurodegeneration in motor and non-motor brain regions in amyotrophic lateral sclerosis—implications for brain–computer interfacing

Kellmeyer, P., Grosse-Wentrup, M., Schulze-Bonhage, A., Ziemann, U., Ball, T.

Journal of Neural Engineering, 15(4):041003, IOP Publishing, 2018 (article)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
Quantum machine learning: a classical perspective

Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., Wossnig, L.

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 474(2209):20170551, 2018 (article)

ei

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Kernel-based tests for joint independence

Pfister, N., Bühlmann, P., Schölkopf, B., Peters, J.

Journal of the Royal Statistical Society: Series B (Statistical Methodology), 80(1):5-31, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Prediction of Glucose Tolerance without an Oral Glucose Tolerance Test

Babbar, R., Heni, M., Peter, A., Hrabě de Angelis, M., Häring, H., Fritsche, A., Preissl, H., Schölkopf, B., Wagner, R.

Frontiers in Endocrinology, 9, pages: 82, 2018 (article)

ei

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Invariant Models for Causal Transfer Learning

Rojas-Carulla, M., Schölkopf, B., Turner, R., Peters, J.

Journal of Machine Learning Research, 19(36):1-34, 2018 (article)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
MOABB: Trustworthy algorithm benchmarking for BCIs

Jayaram, V., Barachant, A.

Journal of Neural Engineering, 15(6):066011, 2018 (article)

ei

link (url) DOI Project Page [BibTex]

link (url) DOI Project Page [BibTex]


no image
f-Divergence constrained policy improvement

Belousov, B., Peters, J.

Journal of Machine Learning Research, 2018 (article) Submitted

ei

Project Page [BibTex]

Project Page [BibTex]


no image
Phylogenetic convolutional neural networks in metagenomics

Fioravanti*, D., Giarratano*, Y., Maggio*, V., Agostinelli, C., Chierici, M., Jurman, G., Furlanello, C.

BMC Bioinformatics, 19(2):49 pages, 2018, *equal contribution (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Food specific inhibitory control under negative mood in binge-eating disorder: Evidence from a multimethod approach

Leehr, E. J., Schag, K., Dresler, T., Grosse-Wentrup, M., Hautzinger, M., Fallgatter, A. J., Zipfel, S., Giel, K. E., Ehlis, A.

International Journal of Eating Disorders, 51(2):112-123, Wiley Online Library, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Linking imaging to omics utilizing image-guided tissue extraction

Disselhorst, J. A., Krueger, M. A., Ud-Dean, S. M. M., Bezrukov, I., Jarboui, M. A., Trautwein, C., Traube, A., Spindler, C., Cotton, J. M., Leibfritz, D., Pichler, B. J.

Proceedings of the National Academy of Sciences, 115(13):E2980-E2987, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Discriminative Transfer Learning for General Image Restoration

Xiao, L., Heide, F., Heidrich, W., Schölkopf, B., Hirsch, M.

IEEE Transactions on Image Processing, 27(8):4091-4104, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Dissecting the synapse- and frequency-dependent network mechanisms of in vivo hippocampal sharp wave-ripples

Ramirez-Villegas, J. F., Willeke, K. F., Logothetis, N. K., Besserve, M.

Neuron, 100(5):1224-1240, 2018 (article)

ei

link (url) DOI Project Page [BibTex]

link (url) DOI Project Page [BibTex]


no image
In-Hand Object Stabilization by Independent Finger Control

Veiga, F. F., Edin, B. B., Peters, J.

IEEE Transactions on Robotics, 2018 (article) Submitted

ei

Project Page [BibTex]

Project Page [BibTex]


no image
Visualizing and understanding Sum-Product Networks

Vergari, A., Di Mauro, N., Esposito, F.

Machine Learning, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Geckos Race across Water using Multiple Mechanisms

Nirody, J., Jinn, J., Libby, T., Lee, T., Jusufi, A., Hu, D., Full, R.

Current Biology, 2018 (article)

bio

[BibTex]

[BibTex]


no image
Non-Equilibrium Relations for Bounded Rational Decision-Making in Changing Environments

Grau-Moya, J, Krüger, M, Braun, DA

Entropy, 20(1:1):1-28, January 2018 (article)

Abstract
Living organisms from single cells to humans need to adapt continuously to respond to changes in their environment. The process of behavioural adaptation can be thought of as improving decision-making performance according to some utility function. Here, we consider an abstract model of organisms as decision-makers with limited information-processing resources that trade off between maximization of utility and computational costs measured by a relative entropy, in a similar fashion to thermodynamic systems undergoing isothermal transformations. Such systems minimize the free energy to reach equilibrium states that balance internal energy and entropic cost. When there is a fast change in the environment, these systems evolve in a non-equilibrium fashion because they are unable to follow the path of equilibrium distributions. Here, we apply concepts from non-equilibrium thermodynamics to characterize decision-makers that adapt to changing environments under the assumption that the temporal evolution of the utility function is externally driven and does not depend on the decision-maker’s action. This allows one to quantify performance loss due to imperfect adaptation in a general manner and, additionally, to find relations for decision-making similar to Crooks’ fluctuation theorem and Jarzynski’s equality. We provide simulations of several exemplary decision and inference problems in the discrete and continuous domains to illustrate the new relations.

ei

DOI [BibTex]

DOI [BibTex]

2013


no image
Studying large-scale brain networks: electrical stimulation and neural-event-triggered fMRI

Logothetis, N., Eschenko, O., Murayama, Y., Augath, M., Steudel, T., Evrard, H., Besserve, M., Oeltermann, A.

Twenty-Second Annual Computational Neuroscience Meeting (CNS*2013), July 2013, journal = {BMC Neuroscience}, year = {2013}, month = {7}, volume = {14}, number = {Supplement 1}, pages = {A1}, (talk)

ei

Web [BibTex]

2013


Web [BibTex]


no image
Correlation of Simultaneously Acquired Diffusion-Weighted Imaging and 2-Deoxy-[18F] fluoro-2-D-glucose Positron Emission Tomography of Pulmonary Lesions in a Dedicated Whole-Body Magnetic Resonance/Positron Emission Tomography System

Schmidt, H., Brendle, C., Schraml, C., Martirosian, P., Bezrukov, I., Hetzel, J., Müller, M., Sauter, A., Claussen, C., Pfannenberg, C., Schwenzer, N.

Investigative Radiology, 48(5):247-255, May 2013 (article)

ei

Web [BibTex]

Web [BibTex]


no image
Replacing Causal Faithfulness with Algorithmic Independence of Conditionals

Lemeire, J., Janzing, D.

Minds and Machines, 23(2):227-249, May 2013 (article)

Abstract
Independence of Conditionals (IC) has recently been proposed as a basic rule for causal structure learning. If a Bayesian network represents the causal structure, its Conditional Probability Distributions (CPDs) should be algorithmically independent. In this paper we compare IC with causal faithfulness (FF), stating that only those conditional independences that are implied by the causal Markov condition hold true. The latter is a basic postulate in common approaches to causal structure learning. The common spirit of FF and IC is to reject causal graphs for which the joint distribution looks ‘non-generic’. The difference lies in the notion of genericity: FF sometimes rejects models just because one of the CPDs is simple, for instance if the CPD describes a deterministic relation. IC does not behave in this undesirable way. It only rejects a model when there is a non-generic relation between different CPDs although each CPD looks generic when considered separately. Moreover, it detects relations between CPDs that cannot be captured by conditional independences. IC therefore helps in distinguishing causal graphs that induce the same conditional independences (i.e., they belong to the same Markov equivalence class). The usual justification for FF implicitly assumes a prior that is a probability density on the parameter space. IC can be justified by Solomonoff’s universal prior, assigning non-zero probability to those points in parameter space that have a finite description. In this way, it favours simple CPDs, and therefore respects Occam’s razor. Since Kolmogorov complexity is uncomputable, IC is not directly applicable in practice. We argue that it is nevertheless helpful, since it has already served as inspiration and justification for novel causal inference algorithms.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
What can neurons do for their brain? Communicate selectivity with bursts

Balduzzi, D., Tononi, G.

Theory in Biosciences , 132(1):27-39, Springer, March 2013 (article)

Abstract
Neurons deep in cortex interact with the environment extremely indirectly; the spikes they receive and produce are pre- and post-processed by millions of other neurons. This paper proposes two information-theoretic constraints guiding the production of spikes, that help ensure bursting activity deep in cortex relates meaningfully to events in the environment. First, neurons should emphasize selective responses with bursts. Second, neurons should propagate selective inputs by burst-firing in response to them. We show the constraints are necessary for bursts to dominate information-transfer within cortex, thereby providing a substrate allowing neurons to distribute credit amongst themselves. Finally, since synaptic plasticity degrades the ability of neurons to burst selectively, we argue that homeostatic regulation of synaptic weights is necessary, and that it is best performed offline during sleep.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Apprenticeship Learning with Few Examples

Boularias, A., Chaib-draa, B.

Neurocomputing, 104, pages: 83-96, March 2013 (article)

Abstract
We consider the problem of imitation learning when the examples, provided by an expert human, are scarce. Apprenticeship learning via inverse reinforcement learning provides an efficient tool for generalizing the examples, based on the assumption that the expert's policy maximizes a value function, which is a linear combination of state and action features. Most apprenticeship learning algorithms use only simple empirical averages of the features in the demonstrations as a statistics of the expert's policy. However, this method is efficient only when the number of examples is sufficiently large to cover most of the states, or the dynamics of the system is nearly deterministic. In this paper, we show that the quality of the learned policies is sensitive to the error in estimating the averages of the features when the dynamics of the system is stochastic. To reduce this error, we introduce two new approaches for bootstrapping the demonstrations by assuming that the expert is near-optimal and the dynamics of the system is known. In the first approach, the expert's examples are used to learn a reward function and to generate furthermore examples from the corresponding optimal policy. The second approach uses a transfer technique, known as graph homomorphism, in order to generalize the expert's actions to unvisited regions of the state space. Empirical results on simulated robot navigation problems show that our approach is able to learn sufficiently good policies from a significantly small number of examples.

ei

Web DOI [BibTex]

Web DOI [BibTex]


Thumb xl thumb hennigk2012 2
Quasi-Newton Methods: A New Direction

Hennig, P., Kiefel, M.

Journal of Machine Learning Research, 14(1):843-865, March 2013 (article)

Abstract
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained numerical optimization. Although not usually interpreted thus, these are learning algorithms that fit a local quadratic approximation to the objective function. We show that many, including the most popular, quasi-Newton methods can be interpreted as approximations of Bayesian linear regression under varying prior assumptions. This new notion elucidates some shortcomings of classical algorithms, and lights the way to a novel nonparametric quasi-Newton method, which is able to make more efficient use of available information at computational cost similar to its predecessors.

ei ps pn

website+code pdf link (url) [BibTex]

website+code pdf link (url) [BibTex]


no image
Regional effects of magnetization dispersion on quantitative perfusion imaging for pulsed and continuous arterial spin labeling

Cavusoglu, M., Pohmann, R., Burger, H. C., Uludag, K.

Magnetic Resonance in Medicine, 69(2):524-530, Febuary 2013 (article)

Abstract
Most experiments assume a global transit delay time with blood flowing from the tagging region to the imaging slice in plug flow without any dispersion of the magnetization. However, because of cardiac pulsation, nonuniform cross-sectional flow profile, and complex vessel networks, the transit delay time is not a single value but follows a distribution. In this study, we explored the regional effects of magnetization dispersion on quantitative perfusion imaging for varying transit times within a very large interval from the direct comparison of pulsed, pseudo-continuous, and dual-coil continuous arterial spin labeling encoding schemes. Longer distances between tagging and imaging region typically used for continuous tagging schemes enhance the regional bias on the quantitative cerebral blood flow measurement causing an underestimation up to 37% when plug flow is assumed as in the standard model.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
The multivariate Watson distribution: Maximum-likelihood estimation and other aspects

Sra, S., Karp, D.

Journal of Multivariate Analysis, 114, pages: 256-269, February 2013 (article)

Abstract
This paper studies fundamental aspects of modelling data using multivariate Watson distributions. Although these distributions are natural for modelling axially symmetric data (i.e., unit vectors where View the MathML source are equivalent), for high-dimensions using them can be difficult—largely because for Watson distributions even basic tasks such as maximum-likelihood are numerically challenging. To tackle the numerical difficulties some approximations have been derived. But these are either grossly inaccurate in high-dimensions [K.V. Mardia, P. Jupp, Directional Statistics, second ed., John Wiley & Sons, 2000] or when reasonably accurate [A. Bijral, M. Breitenbach, G.Z. Grudic, Mixture of Watson distributions: a generative model for hyperspherical embeddings, in: Artificial Intelligence and Statistics, AISTATS 2007, 2007, pp. 35–42], they lack theoretical justification. We derive new approximations to the maximum-likelihood estimates; our approximations are theoretically well-defined, numerically accurate, and easy to compute. We build on our parameter estimation and discuss mixture-modelling with Watson distributions; here we uncover a hitherto unknown connection to the “diametrical clustering” algorithm of Dhillon et al. [I.S. Dhillon, E.M. Marcotte, U. Roshan, Diametrical clustering for identifying anticorrelated gene clusters, Bioinformatics 19 (13) (2003) 1612–1619].

ei

Web DOI [BibTex]

Web DOI [BibTex]