Header logo is

731 results (View BibTeX file of all listed publications)

2018

no image
Measurement of Spectral Functions of Ultracold Atoms in Disordered Potentials

Volchkov, V., Pasek, M., Denechaud, V., Mukhtar, M., Aspect, A., Delande, D., Josse, V.

Physical Review Letters, 120, pages: 060404, American Physical Society (APS), January 2018 (article)

Abstract
We report on the measurement of the spectral functions of noninteracting ultracold atoms in a three-dimensional disordered potential resulting from an optical speckle field. Varying the disorder strength by 2 orders of magnitude, we observe the crossover from the “quantum” perturbative regime of low disorder to the “classical” regime at higher disorder strength, and find an excellent agreement with numerical simulations. The method relies on the use of state-dependent disorder and the controlled transfer of atoms to create well-defined energy states. This opens new avenues for experimental investigations of three-dimensional Anderson localization.

sf

DOI [BibTex]

2018

sf Volchkov, V., Pasek, M., Denechaud, V., Mukhtar, M., Aspect, A., Delande, D., Josse, V. Measurement of Spectral Functions of Ultracold Atoms in Disordered Potentials Physical Review Letters, 120, pages: 060404, American Physical Society (APS), January 2018 (article)

DOI [BibTex]

Thumb xl us20180012693a1 20180111 d00000
Method of fabricating a shape-changeable magentic member, method of producing a shape changeable magnetic member and shape changeable magnetic member

Guo Zhan Lum, Z. Y. M. S.

US Patent Application US 2018/0012693 A1, January 2018 (patent)

Abstract
The present invention relates to a method of fabricating a shape-changeable magnetic member comprising a plurality of segments with each segment being able to be magnetized with a desired magnitude and orientation of magnetization, to a method of producing a shape changeable magnetic member composed of a plurality of segments and to a shape changeable magnetic member.

pi

US Patent Application Database US Patent Application (PDF) [BibTex]

Thumb xl despoina paper teaser
RayNet: Learning Volumetric 3D Reconstruction with Ray Potentials

Paschalidou, D., Ulusoy, A. O., Schmitt, C., Gool, L., Geiger, A.

In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

Abstract
In this paper, we consider the problem of reconstructing a dense 3D model using images captured from different views. Recent methods based on convolutional neural networks (CNN) allow learning the entire task from data. However, they do not incorporate the physics of image formation such as perspective geometry and occlusion. Instead, classical approaches based on Markov Random Fields (MRF) with ray-potentials explicitly model these physical processes, but they cannot cope with large surface appearance variations across different viewpoints. In this paper, we propose RayNet, which combines the strengths of both frameworks. RayNet integrates a CNN that learns view-invariant feature representations with an MRF that explicitly encodes the physics of perspective projection and occlusion. We train RayNet end-to-end using empirical risk minimization. We thoroughly evaluate our approach on challenging real-world datasets and demonstrate its benefits over a piece-wise trained baseline, hand-crafted models as well as other learning-based approaches.

avg

pdf suppmat Video Project Page code Poster Project Page [BibTex]

avg Paschalidou, D., Ulusoy, A. O., Schmitt, C., Gool, L., Geiger, A. RayNet: Learning Volumetric 3D Reconstruction with Ray Potentials In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

pdf suppmat Video Project Page code Poster Project Page [BibTex]

Thumb xl hmrteaser
End-to-end Recovery of Human Shape and Pose

Kanazawa, A., Black, M. J., Jacobs, D. W., Malik, J.

In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

Abstract
We describe Human Mesh Recovery (HMR), an end-to-end framework for reconstructing a full 3D mesh of a human body from a single RGB image. In contrast to most current methods that compute 2D or 3D joint locations, we produce a richer and more useful mesh representation that is parameterized by shape and 3D joint angles. The main objective is to minimize the reprojection loss of keypoints, which allows our model to be trained using in-the-wild images that only have ground truth 2D annotations. However, the reprojection loss alone is highly underconstrained. In this work we address this problem by introducing an adversary trained to tell whether human body shape and pose parameters are real or not using a large database of 3D human meshes. We show that HMR can be trained with and without using any paired 2D-to-3D supervision. We do not rely on intermediate 2D keypoint detections and infer 3D pose and shape parameters directly from image pixels. Our model runs in real-time given a bounding box containing the person. We demonstrate our approach on various images in-the-wild and out-perform previous optimization-based methods that output 3D meshes and show competitive results on tasks such as 3D joint location estimation and part segmentation.

ps

pdf code project video Project Page [BibTex]

ps Kanazawa, A., Black, M. J., Jacobs, D. W., Malik, J. End-to-end Recovery of Human Shape and Pose In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

pdf code project video Project Page [BibTex]

no image
Die kybernetische Revolution

Schölkopf, B.

15-Mar-2018, Süddeutsche Zeitung, 2018 (misc)

ei

link (url) [BibTex]

ei Schölkopf, B. Die kybernetische Revolution 15-Mar-2018, Süddeutsche Zeitung, 2018 (misc)

link (url) [BibTex]

no image
Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences

Kanagawa, M., Hennig, P., Sejdinovic, D., Sriperumbudur, B. K.

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

Abstract
This paper is an attempt to bridge the conceptual gaps between researchers working on the two widely used approaches based on positive definite kernels: Bayesian learning or inference using Gaussian processes on the one side, and frequentist kernel methods based on reproducing kernel Hilbert spaces on the other. It is widely known in machine learning that these two formalisms are closely related; for instance, the estimator of kernel ridge regression is identical to the posterior mean of Gaussian process regression. However, they have been studied and developed almost independently by two essentially separate communities, and this makes it difficult to seamlessly transfer results between them. Our aim is to overcome this potential difficulty. To this end, we review several old and new results and concepts from either side, and juxtapose algorithmic quantities from each framework to highlight close similarities. We also provide discussions on subtle philosophical and theoretical differences between the two approaches.

pn

arXiv [BibTex]

pn Kanagawa, M., Hennig, P., Sejdinovic, D., Sriperumbudur, B. K. Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences Arxiv e-prints, arXiv:1805.08845v1 [stat.ML], 2018 (article)

arXiv [BibTex]

no image
Functional Programming for Modular Bayesian Inference

Ścibior, A., Kammar, O., Ghahramani, Z.

Proceedings of the ACM on Functional Programming (ICFP), 2(Article No. 83):1-29, ACM, 2018 (conference)

ei

DOI Project Page [BibTex]

ei Ścibior, A., Kammar, O., Ghahramani, Z. Functional Programming for Modular Bayesian Inference Proceedings of the ACM on Functional Programming (ICFP), 2(Article No. 83):1-29, ACM, 2018 (conference)

DOI Project Page [BibTex]

no image
Detailed Dense Inference with Convolutional Neural Networks via Discrete Wavelet Transform

Ma, L., Stueckler, J., Wu, T., Cremers, D.

arxiv, 2018, arXiv:1808.01834 (techreport)

ev

[BibTex]

ev Ma, L., Stueckler, J., Wu, T., Cremers, D. Detailed Dense Inference with Convolutional Neural Networks via Discrete Wavelet Transform arxiv, 2018, arXiv:1808.01834 (techreport)

[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]

ei slt Shah*, N., Tabibian*, B., Muandet, K., Guyon, I., von Luxburg, U. Design and Analysis of the NIPS 2016 Review Process Journal of Machine Learning Research, 19(49):1-34, 2018, *equal contribution (article)

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

no image
Learning to select computations

Callaway, F., Gul, S., Krueger, P., Griffiths, T. L., Lieder, F.

In Uncertainty in Artificial Intelligence: Proceedings of the Thirty-Fourth Conference, 2018 (inproceedings)

re

Project Page [BibTex]

re Callaway, F., Gul, S., Krueger, P., Griffiths, T. L., Lieder, F. Learning to select computations In Uncertainty in Artificial Intelligence: Proceedings of the Thirty-Fourth Conference, 2018 (inproceedings)

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]

ei Zafar, M. B., Valera, I., Gomez Rodriguez, M., Gummadi, K. A Flexible Approach for Fair Classification Journal of Machine Learning, 2018 (article) Accepted

Project Page [BibTex]

no image
Automatic Bayesian Density Analysis

Vergari, A., Molina, A., Peharz, R., Ghahramani, Z., Kersting, K., Valera, I.

2018 (conference) Submitted

ei

arXiv [BibTex]

ei Vergari, A., Molina, A., Peharz, R., Ghahramani, Z., Kersting, K., Valera, I. Automatic Bayesian Density Analysis 2018 (conference) Submitted

arXiv [BibTex]

no image
A virtual reality environment for experiments in assistive robotics and neural interfaces

Bustamante, S.

Graduate School of Neural Information Processing, Eberhard Karls Universität Tübingen, Germany, 2018 (mastersthesis)

ei

PDF [BibTex]

ei Bustamante, S. A virtual reality environment for experiments in assistive robotics and neural interfaces Graduate School of Neural Information Processing, Eberhard Karls Universität Tübingen, Germany, 2018 (mastersthesis)

PDF [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]

ei Janzing, D., Wocjan, P. Does universal controllability of physical systems prohibit thermodynamic cycles? Open Systems and Information Dynamics, 25(3):1850016, 2018 (article)

PDF DOI [BibTex]

no image
Foundations of Comparison-Based Hierarchical Clustering

Ghoshdastidar, D., Perrot, M., von Luxburg, U.

2018, arXiv preprint (arXiv:1811.00928) (article)

slt

Project Page [BibTex]

slt Ghoshdastidar, D., Perrot, M., von Luxburg, U. Foundations of Comparison-Based Hierarchical Clustering 2018, arXiv preprint (arXiv:1811.00928) (article)

Project Page [BibTex]

no image
Optimal Trajectory Generation and Learning Control for Robot Table Tennis

Koc, O.

Technical University Darmstadt, Germany, 2018 (phdthesis)

ei

[BibTex]

ei Koc, O. Optimal Trajectory Generation and Learning Control for Robot Table Tennis Technical University Darmstadt, Germany, 2018 (phdthesis)

[BibTex]

no image
Enhanced Non-Steady Gliding Performance of the MultiMo-Bat through Optimal Airfoil Configuration and Control Strategy

Kim, H., Woodward, M. A., Sitti, M.

In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 1382-1388, 2018 (inproceedings)

pi

[BibTex]

pi Kim, H., Woodward, M. A., Sitti, M. Enhanced Non-Steady Gliding Performance of the MultiMo-Bat through Optimal Airfoil Configuration and Control Strategy In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 1382-1388, 2018 (inproceedings)

[BibTex]

no image
Analysis of Magnetic Interaction in Remotely Controlled Magnetic Devices and Its Application to a Capsule Robot for Drug Delivery

Munoz, F., Alici, G., Zhou, H., Li, W., M. Sitti,

IEEE Transactions on Magnetics, 23(1):298-310, 2018 (article)

pi

[BibTex]

pi Munoz, F., Alici, G., Zhou, H., Li, W., M. Sitti, Analysis of Magnetic Interaction in Remotely Controlled Magnetic Devices and Its Application to a Capsule Robot for Drug Delivery IEEE Transactions on Magnetics, 23(1):298-310, 2018 (article)

[BibTex]

no image
Numerical Quadrature for Probabilistic Policy Search

Vinogradska, J., Bischoff, B., Achterhold, J., Koller, T., Peters, J.

IEEE Transactions on Pattern Analysis and Machine Intelligence, pages: 1-1, 2018 (article)

ev

DOI [BibTex]

ev Vinogradska, J., Bischoff, B., Achterhold, J., Koller, T., Peters, J. Numerical Quadrature for Probabilistic Policy Search IEEE Transactions on Pattern Analysis and Machine Intelligence, pages: 1-1, 2018 (article)

DOI [BibTex]

no image
Transmission x-ray microscopy at low temperatures: Irregular supercurrent flow at small length scales

Simmendinger, J., Ruoss, S., Stahl, C., Weigand, M., Gräfe, J., Schütz, G., Albrecht, J.

{Physical Review B}, 97(13), American Physical Society, Woodbury, NY, 2018 (article)

mms

DOI [BibTex]

mms Simmendinger, J., Ruoss, S., Stahl, C., Weigand, M., Gräfe, J., Schütz, G., Albrecht, J. Transmission x-ray microscopy at low temperatures: Irregular supercurrent flow at small length scales {Physical Review B}, 97(13), American Physical Society, Woodbury, NY, 2018 (article)

DOI [BibTex]

no image
On Time Optimization of Centroidal Momentum Dynamics

Ponton, B., Herzog, A., Del Prete, A., Schaal, S., Righetti, L.

In 2018 IEEE International Conference on Robotics and Automation (ICRA), pages: 5776-5782, IEEE, Brisbane, Australia, 2018 (inproceedings)

Abstract
Recently, the centroidal momentum dynamics has received substantial attention to plan dynamically consistent motions for robots with arms and legs in multi-contact scenarios. However, it is also non convex which renders any optimization approach difficult and timing is usually kept fixed in most trajectory optimization techniques to not introduce additional non convexities to the problem. But this can limit the versatility of the algorithms. In our previous work, we proposed a convex relaxation of the problem that allowed to efficiently compute momentum trajectories and contact forces. However, our approach could not minimize a desired angular momentum objective which seriously limited its applicability. Noticing that the non-convexity introduced by the time variables is of similar nature as the centroidal dynamics one, we propose two convex relaxations to the problem based on trust regions and soft constraints. The resulting approaches can compute time-optimized dynamically consistent trajectories sufficiently fast to make the approach realtime capable. The performance of the algorithm is demonstrated in several multi-contact scenarios for a humanoid robot. In particular, we show that the proposed convex relaxation of the original problem finds solutions that are consistent with the original non-convex problem and illustrate how timing optimization allows to find motion plans that would be difficult to plan with fixed timing † †Implementation details and demos can be found in the source code available at https://git-amd.tuebingen.mpg.de/bponton/timeoptimization.

am mg

link (url) DOI [BibTex]

am mg Ponton, B., Herzog, A., Del Prete, A., Schaal, S., Righetti, L. On Time Optimization of Centroidal Momentum Dynamics In 2018 IEEE International Conference on Robotics and Automation (ICRA), pages: 5776-5782, IEEE, Brisbane, Australia, 2018 (inproceedings)

link (url) DOI [BibTex]

Thumb xl img
Combining learned and analytical models for predicting action effects

Kloss, A., Schaal, S., Bohg, J.

arXiv, 2018 (article) Submitted

Abstract
One of the most basic skills a robot should possess is predicting the effect of physical interactions with objects in the environment. This enables optimal action selection to reach a certain goal state. Traditionally, dynamics are approximated by physics-based analytical models. These models rely on specific state representations that may be hard to obtain from raw sensory data, especially if no knowledge of the object shape is assumed. More recently, we have seen learning approaches that can predict the effect of complex physical interactions directly from sensory input. It is however an open question how far these models generalize beyond their training data. In this work, we investigate the advantages and limitations of neural network based learning approaches for predicting the effects of actions based on sensory input and show how analytical and learned models can be combined to leverage the best of both worlds. As physical interaction task, we use planar pushing, for which there exists a well-known analytical model and a large real-world dataset. We propose to use a convolutional neural network to convert raw depth images or organized point clouds into a suitable representation for the analytical model and compare this approach to using neural networks for both, perception and prediction. A systematic evaluation of the proposed approach on a very large real-world dataset shows two main advantages of the hybrid architecture. Compared to a pure neural network, it significantly (i) reduces required training data and (ii) improves generalization to novel physical interaction.

am

arXiv pdf link (url) [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]

ei Zhang, K., Schölkopf, B., Spirtes, P., Glymour, C. Learning Causality and Causality-Related Learning: Some Recent Progress National Science Review, 5(1):26-29, 2018 (article)

DOI [BibTex]

Thumb xl tease pic
Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradients

Balles, L., Hennig, P.

In Proceedings of the 35th International Conference on Machine Learning (ICML), 2018 (inproceedings) Accepted

Abstract
The ADAM optimizer is exceedingly popular in the deep learning community. Often it works very well, sometimes it doesn't. Why? We interpret ADAM as a combination of two aspects: for each weight, the update direction is determined by the sign of stochastic gradients, whereas the update magnitude is determined by an estimate of their relative variance. We disentangle these two aspects and analyze them in isolation, gaining insight into the mechanisms underlying ADAM. This analysis also extends recent results on adverse effects of ADAM on generalization, isolating the sign aspect as the problematic one. Transferring the variance adaptation to SGD gives rise to a novel method, completing the practitioner's toolbox for problems where ADAM fails.

pn

link (url) Project Page [BibTex]

pn Balles, L., Hennig, P. Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradients In Proceedings of the 35th International Conference on Machine Learning (ICML), 2018 (inproceedings) Accepted

link (url) Project Page [BibTex]

Thumb xl yiyi paper teaser
Deep Marching Cubes: Learning Explicit Surface Representations

Liao, Y., Donne, S., Geiger, A.

In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

Abstract
Existing learning based solutions to 3D surface prediction cannot be trained end-to-end as they operate on intermediate representations (eg, TSDF) from which 3D surface meshes must be extracted in a post-processing step (eg, via the marching cubes algorithm). In this paper, we investigate the problem of end-to-end 3D surface prediction. We first demonstrate that the marching cubes algorithm is not differentiable and propose an alternative differentiable formulation which we insert as a final layer into a 3D convolutional neural network. We further propose a set of loss functions which allow for training our model with sparse point supervision. Our experiments demonstrate that the model allows for predicting sub-voxel accurate 3D shapes of arbitrary topology. Additionally, it learns to complete shapes and to separate an object's inside from its outside even in the presence of sparse and incomplete ground truth. We investigate the benefits of our approach on the task of inferring shapes from 3D point clouds. Our model is flexible and can be combined with a variety of shape encoder and shape inference techniques.

avg

pdf suppmat Video Project Page Poster Project Page [BibTex]

avg Liao, Y., Donne, S., Geiger, A. Deep Marching Cubes: Learning Explicit Surface Representations In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

pdf suppmat Video Project Page Poster Project Page [BibTex]

Thumb xl teaser andreas
Semantic Visual Localization

Schönberger, J., Pollefeys, M., Geiger, A., Sattler, T.

In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

Abstract
Robust visual localization under a wide range of viewing conditions is a fundamental problem in computer vision. Handling the difficult cases of this problem is not only very challenging but also of high practical relevance, eg, in the context of life-long localization for augmented reality or autonomous robots. In this paper, we propose a novel approach based on a joint 3D geometric and semantic understanding of the world, enabling it to succeed under conditions where previous approaches failed. Our method leverages a novel generative model for descriptor learning, trained on semantic scene completion as an auxiliary task. The resulting 3D descriptors are robust to missing observations by encoding high-level 3D geometric and semantic information. Experiments on several challenging large-scale localization datasets demonstrate reliable localization under extreme viewpoint, illumination, and geometry changes.

avg

pdf suppmat Poster Project Page [BibTex]

avg Schönberger, J., Pollefeys, M., Geiger, A., Sattler, T. Semantic Visual Localization In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE Computer Society, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) 2018, 2018 (inproceedings)

pdf suppmat Poster Project Page [BibTex]

Thumb xl hassan teaser paper
Augmented Reality Meets Computer Vision: Efficient Data Generation for Urban Driving Scenes

Alhaija, H., Mustikovela, S., Mescheder, L., Geiger, A., Rother, C.

International Journal of Computer Vision (IJCV), 2018, 2018 (article)

Abstract
The success of deep learning in computer vision is based on the availability of large annotated datasets. To lower the need for hand labeled images, virtually rendered 3D worlds have recently gained popularity. Unfortunately, creating realistic 3D content is challenging on its own and requires significant human effort. In this work, we propose an alternative paradigm which combines real and synthetic data for learning semantic instance segmentation and object detection models. Exploiting the fact that not all aspects of the scene are equally important for this task, we propose to augment real-world imagery with virtual objects of the target category. Capturing real-world images at large scale is easy and cheap, and directly provides real background appearances without the need for creating complex 3D models of the environment. We present an efficient procedure to augment these images with virtual objects. In contrast to modeling complete 3D environments, our data augmentation approach requires only a few user interactions in combination with 3D models of the target object category. Leveraging our approach, we introduce a novel dataset of augmented urban driving scenes with 360 degree images that are used as environment maps to create realistic lighting and reflections on rendered objects. We analyze the significance of realistic object placement by comparing manual placement by humans to automatic methods based on semantic scene analysis. This allows us to create composite images which exhibit both realistic background appearance as well as a large number of complex object arrangements. Through an extensive set of experiments, we conclude the right set of parameters to produce augmented data which can maximally enhance the performance of instance segmentation models. Further, we demonstrate the utility of the proposed approach on training standard deep models for semantic instance segmentation and object detection of cars in outdoor driving scenarios. We test the models trained on our augmented data on the KITTI 2015 dataset, which we have annotated with pixel-accurate ground truth, and on the Cityscapes dataset. Our experiments demonstrate that the models trained on augmented imagery generalize better than those trained on fully synthetic data or models trained on limited amounts of annotated real data.

avg

pdf Project Page [BibTex]

avg Alhaija, H., Mustikovela, S., Mescheder, L., Geiger, A., Rother, C. Augmented Reality Meets Computer Vision: Efficient Data Generation for Urban Driving Scenes International Journal of Computer Vision (IJCV), 2018, 2018 (article)

pdf Project Page [BibTex]

no image
Immersive Low-Cost Virtual Reality Treatment for Phantom Limb Pain: Evidence from Two Cases

Ambron, E., Miller, A., Kuchenbecker, K. J., Buxbaum, L. J., Coslett, H. B.

Frontiers in Neurology, 9(67):1-7, 2018 (article)

hi

DOI Project Page [BibTex]

hi Ambron, E., Miller, A., Kuchenbecker, K. J., Buxbaum, L. J., Coslett, H. B. Immersive Low-Cost Virtual Reality Treatment for Phantom Limb Pain: Evidence from Two Cases Frontiers in Neurology, 9(67):1-7, 2018 (article)

DOI Project Page [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]

ei Koc, O., Maeda, G., Peters, J. Online optimal trajectory generation for robot table tennis Robotics and Autonomous Systems, 105, pages: 121-137, 2018 (article)

PDF link (url) DOI Project Page [BibTex]

no image
Comparison-Based Random Forests

Siavash Haghiri, Damien Garreau, Ulrike von Luxburg

ICML, 2018 (conference)

[BibTex]

Siavash Haghiri, Damien Garreau, Ulrike von Luxburg Comparison-Based Random Forests ICML, 2018 (conference)

[BibTex]

no image
Dynamics of the knowledge instinct: Effects of incoherence on the cognitive system

Schoeller, F., Eskinazi, M., Garreau, D.

Cognitive Systems Research, 2018 (article)

link (url) [BibTex]

Schoeller, F., Eskinazi, M., Garreau, D. Dynamics of the knowledge instinct: Effects of incoherence on the cognitive system Cognitive Systems Research, 2018 (article)

link (url) [BibTex]

Thumb xl eigval gradpen
Which Training Methods for GANs do actually Converge?

Mescheder, L., Geiger, A., Nowozin, S.

International Conference on Machine learning (ICML), 2018 (conference)

Abstract
Recent work has shown local convergence of GAN training for absolutely continuous data and generator distributions. In this paper, we show that the requirement of absolute continuity is necessary: we describe a simple yet prototypical counterexample showing that in the more realistic case of distributions that are not absolutely continuous, unregularized GAN training is not always convergent. Furthermore, we discuss regularization strategies that were recently proposed to stabilize GAN training. Our analysis shows that GAN training with instance noise or zero-centered gradient penalties converges. On the other hand, we show that Wasserstein-GANs and WGAN-GP with a finite number of discriminator updates per generator update do not always converge to the equilibrium point. We discuss these results, leading us to a new explanation for the stability problems of GAN training. Based on our analysis, we extend our convergence results to more general GANs and prove local convergence for simplified gradient penalties even if the generator and data distributions lie on lower dimensional manifolds. We find these penalties to work well in practice and use them to learn high-resolution generative image models for a variety of datasets with little hyperparameter tuning.

avg

code video paper supplement slides poster 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]

ei pn Muandet, K., Kanagawa, M., Saengkyongam, S., Marukata, S. Counterfactual Mean Embedding: A Kernel Method for Nonparametric Causal Inference Arxiv e-prints, arXiv:1805.08845v1 [stat.ML], 2018 (article)

arXiv [BibTex]

no image
Model-based Kernel Sum Rule: Kernel Bayesian Inference with Probabilistic Models

Nishiyama, Y., Kanagawa, M., Gretton, A., Fukumizu, K.

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

Abstract
Kernel Bayesian inference is a powerful nonparametric approach to performing Bayesian inference in reproducing kernel Hilbert spaces or feature spaces. In this approach, kernel means are estimated instead of probability distributions, and these estimates can be used for subsequent probabilistic operations (as for inference in graphical models) or in computing the expectations of smooth functions, for instance. Various algorithms for kernel Bayesian inference have been obtained by combining basic rules such as the kernel sum rule (KSR), kernel chain rule, kernel product rule and kernel Bayes' rule. However, the current framework only deals with fully nonparametric inference (i.e., all conditional relations are learned nonparametrically), and it does not allow for flexible combinations of nonparametric and parametric inference, which are practically important. Our contribution is in providing a novel technique to realize such combinations. We introduce a new KSR referred to as the model-based KSR (Mb-KSR), which employs the sum rule in feature spaces under a parametric setting. Incorporating the Mb-KSR into existing kernel Bayesian framework provides a richer framework for hybrid (nonparametric and parametric) kernel Bayesian inference. As a practical application, we propose a novel filtering algorithm for state space models based on the Mb-KSR, which combines the nonparametric learning of an observation process using kernel mean embedding and the additive Gaussian noise model for a state transition process. While we focus on additive Gaussian noise models in this study, the idea can be extended to other noise models, such as the Cauchy and alpha-stable noise models.

pn

arXiv [BibTex]

pn Nishiyama, Y., Kanagawa, M., Gretton, A., Fukumizu, K. Model-based Kernel Sum Rule: Kernel Bayesian Inference with Probabilistic Models Arxiv e-prints, arXiv:1409.5178v2 [stat.ML], 2018 (article)

arXiv [BibTex]

no image
L4: Practical loss-based stepsize adaptation for deep learning

Rolinek, M., Martius, G.

In Advances in Neural Information Processing Systems 31 (NeurIPS 2018), pages: 6434-6444, (Editors: S. Bengio and H. Wallach and H. Larochelle and K. Grauman and N. Cesa-Bianchi and R. Garnett), Curran Associates, Inc., 2018 (inproceedings)

al

Github link (url) Project Page [BibTex]

al Rolinek, M., Martius, G. L4: Practical loss-based stepsize adaptation for deep learning In Advances in Neural Information Processing Systems 31 (NeurIPS 2018), pages: 6434-6444, (Editors: S. Bengio and H. Wallach and H. Larochelle and K. Grauman and N. Cesa-Bianchi and R. Garnett), Curran Associates, Inc., 2018 (inproceedings)

Github link (url) Project Page [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
k–SVRG: Variance Reduction for Large Scale Optimization

Raj, A., Stich, S.

In 2018 (inproceedings) Submitted

ei

[BibTex]

ei Raj, A., Stich, S. k–SVRG: Variance Reduction for Large Scale Optimization In 2018 (inproceedings) Submitted

[BibTex]

no image
Distribution-Dissimilarities in Machine Learning

Simon-Gabriel, C. J.

Eberhard Karls Universität Tübingen, Germany, 2018 (phdthesis)

ei

[BibTex]

ei Simon-Gabriel, C. J. Distribution-Dissimilarities in Machine Learning Eberhard Karls Universität Tübingen, Germany, 2018 (phdthesis)

[BibTex]

no image
Anisotropic Gold Nanostructures: Optimization via in Silico Modeling for Hyperthermia

Singh, A., Jahnke, T., Wang, S., Xiao, Y., Alapan, Y., Kharratian, S., Onbasli, M. C., Kozielski, K., David, H., Richter, G., Bill, J., Laux, P., Luch, A., Sitti, M.

ACS Applied Nano Materials, 1(11):6205-6216, 2018 (article)

pi

[BibTex]

pi Singh, A., Jahnke, T., Wang, S., Xiao, Y., Alapan, Y., Kharratian, S., Onbasli, M. C., Kozielski, K., David, H., Richter, G., Bill, J., Laux, P., Luch, A., Sitti, M. Anisotropic Gold Nanostructures: Optimization via in Silico Modeling for Hyperthermia ACS Applied Nano Materials, 1(11):6205-6216, 2018 (article)

[BibTex]

no image
Collectives of Spinning Mobile Microrobots for Navigation and Object Manipulation at the Air-Water Interface

Wang, W., Kishore, V., Koens, L., Lauga, E., Sitti, M.

In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 1-9, 2018 (inproceedings)

pi

[BibTex]

pi Wang, W., Kishore, V., Koens, L., Lauga, E., Sitti, M. Collectives of Spinning Mobile Microrobots for Navigation and Object Manipulation at the Air-Water Interface In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 1-9, 2018 (inproceedings)

[BibTex]

no image
Probabilistic Deep Learning using Random Sum-Product Networks

Peharz, R., Vergari, A., Stelzner, K., Molina, A., Trapp, M., Kersting, K., Ghahramani, Z.

2018 (conference) Submitted

ei

arXiv [BibTex]

ei Peharz, R., Vergari, A., Stelzner, K., Molina, A., Trapp, M., Kersting, K., Ghahramani, Z. Probabilistic Deep Learning using Random Sum-Product Networks 2018 (conference) Submitted

arXiv [BibTex]

no image
Assessment methodology of promising porous materials for near ambient temperature hydrogen storage applications

Minuto, F. D., Balderas-Xicohténcatl, R., Policicchio, A., Hirscher, M., Agostino, R. G.

{International Journal of Hydrogen Energy}, 43(31):14550-14556, Elsevier, Amsterdam, 2018 (article)

mms

DOI [BibTex]

mms Minuto, F. D., Balderas-Xicohténcatl, R., Policicchio, A., Hirscher, M., Agostino, R. G. Assessment methodology of promising porous materials for near ambient temperature hydrogen storage applications {International Journal of Hydrogen Energy}, 43(31):14550-14556, Elsevier, Amsterdam, 2018 (article)

DOI [BibTex]

Thumb xl hp teaser
A probabilistic model for the numerical solution of initial value problems

Schober, M., Särkkä, S., Philipp Hennig,

Statistics and Computing, Springer US, 2018 (article)

Abstract
We study connections between ordinary differential equation (ODE) solvers and probabilistic regression methods in statistics. We provide a new view of probabilistic ODE solvers as active inference agents operating on stochastic differential equation models that estimate the unknown initial value problem (IVP) solution from approximate observations of the solution derivative, as provided by the ODE dynamics. Adding to this picture, we show that several multistep methods of Nordsieck form can be recast as Kalman filtering on q-times integrated Wiener processes. Doing so provides a family of IVP solvers that return a Gaussian posterior measure, rather than a point estimate. We show that some such methods have low computational overhead, nontrivial convergence order, and that the posterior has a calibrated concentration rate. Additionally, we suggest a step size adaptation algorithm which completes the proposed method to a practically useful implementation, which we experimentally evaluate using a representative set of standard codes in the DETEST benchmark set.

pn

PDF Code 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]

ei Loktyushin, A., Ehses, P., Schölkopf, B., Scheffler, K. Autofocusing-based phase correction Magnetic Resonance in Medicine, 80(3):958-968, 2018 (article)

DOI [BibTex]