Header logo is ei


2015


no image
Learning Motor Skills from Partially Observed Movements Executed at Different Speeds

Ewerton, M., Maeda, G., Peters, J., Neumann, G.

In Proceedings of the IEEE/RSJ Conference on Intelligent Robots and Systems, pages: 456-463, IROS, September 2015 (inproceedings)

link (url) DOI [BibTex]

2015

link (url) DOI [BibTex]


no image
Is Breathing Rate a Confounding Variable in Brain-Computer Interfaces (BCIs) Based on EEG Spectral Power?

Ibarra Chaoul, A., Grosse-Wentrup, M.

Proceedings of the 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, pages: 1079-1082, EMBC, August 2015 (conference)

DOI [BibTex]

DOI [BibTex]


no image
Retrospective motion correction of magnitude-input MR images

Loktyushin, A., Schuler, C., Scheffler, K., Schölkopf, B.

First International Workshop on Machine Learning Meets Medical Imaging (MLMMI 2015), held in conjunction with ICML 2015, 9487, pages: 3-12, Lecture Notes in Computer Science, (Editors: K. K. Bhatia and H. Lombaert), Springer, July 2015 (conference)

DOI [BibTex]

DOI [BibTex]


Thumb xl teaser
Permutohedral Lattice CNNs

Kiefel, M., Jampani, V., Gehler, P. V.

In ICLR Workshop Track, ICLR, May 2015 (inproceedings)

Abstract
This paper presents a convolutional layer that is able to process sparse input features. As an example, for image recognition problems this allows an efficient filtering of signals that do not lie on a dense grid (like pixel position), but of more general features (such as color values). The presented algorithm makes use of the permutohedral lattice data structure. The permutohedral lattice was introduced to efficiently implement a bilateral filter, a commonly used image processing operation. Its use allows for a generalization of the convolution type found in current (spatial) convolutional network architectures.

pdf link (url) [BibTex]

pdf link (url) [BibTex]


no image
Adaptive information-theoretic bounded rational decision-making with parametric priors

Grau-Moya, J, Braun, DA

pages: 1-4, NIPS Workshop on Bounded Optimality and Rational Metareasoning, December 2015 (conference)

Abstract
Deviations from rational decision-making due to limited computational resources have been studied in the field of bounded rationality, originally proposed by Herbert Simon. There have been a number of different approaches to model bounded rationality ranging from optimality principles to heuristics. Here we take an information-theoretic approach to bounded rationality, where information-processing costs are measured by the relative entropy between a posterior decision strategy and a given fixed prior strategy. In the case of multiple environments, it can be shown that there is an optimal prior rendering the bounded rationality problem equivalent to the rate distortion problem for lossy compression in information theory. Accordingly, the optimal prior and posterior strategies can be computed by the well-known Blahut-Arimoto algorithm which requires the computation of partition sums over all possible outcomes and cannot be applied straightforwardly to continuous problems. Here we derive a sampling-based alternative update rule for the adaptation of prior behaviors of decision-makers and we show convergence to the optimal prior predicted by rate distortion theory. Importantly, the update rule avoids typical infeasible operations such as the computation of partition sums. We show in simulations a proof of concept for discrete action and environment domains. This approach is not only interesting as a generic computational method, but might also provide a more realistic model of human decision-making processes occurring on a fast and a slow time scale.

[BibTex]

[BibTex]


no image
Inference of Cause and Effect with Unsupervised Inverse Regression

Sgouritsa, E., Janzing, D., Hennig, P., Schölkopf, B.

In Proceedings of the 18th International Conference on Artificial Intelligence and Statistics, 38, pages: 847-855, JMLR Workshop and Conference Proceedings, (Editors: Lebanon, G. and Vishwanathan, S.V.N.), JMLR.org, AISTATS, 2015 (inproceedings)

Web PDF [BibTex]

Web PDF [BibTex]


no image
Distinguishing Cause from Effect Based on Exogeneity

Zhang, K., Zhang, J., Schölkopf, B.

In Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, pages: 261-271, (Editors: Ramanujam, R.), TARK, 2015 (inproceedings)

[BibTex]

[BibTex]


no image
Identification of Time-Dependent Causal Model: A Gaussian Process Treatment

Huang, B., Zhang, K., Schölkopf, B.

In 24th International Joint Conference on Artificial Intelligence, Machine Learning Track, pages: 3561-3568, (Editors: Yang, Q. and Wooldridge, M.), AAAI Press, Palo Alto, California USA, IJCAI15, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Multi-Source Domain Adaptation: A Causal View

Zhang, K., Gong, M., Schölkopf, B.

In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pages: 3150-3157, AAAI Press, AAAI, 2015 (inproceedings)

Web PDF link (url) [BibTex]

Web PDF link (url) [BibTex]


no image
Learning of Non-Parametric Control Policies with High-Dimensional State Features

van Hoof, H., Peters, J., Neumann, G.

In Proceedings of the 18th International Conference on Artificial Intelligence and Statistics, 38, pages: 995–1003, (Editors: Lebanon, G. and Vishwanathan, S.V.N. ), JMLR, AISTATS, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Towards a Learning Theory of Cause-Effect Inference

Lopez-Paz, D., Muandet, K., Schölkopf, B., Tolstikhin, I.

In Proceedings of the 32nd International Conference on Machine Learning, 37, pages: 1452–1461, JMLR Workshop and Conference Proceedings, (Editors: F. Bach and D. Blei), JMLR, ICML, 2015 (inproceedings)

Web [BibTex]

Web [BibTex]


no image
BundleMAP: Anatomically Localized Features from dMRI for Detection of Disease

Khatami, M., Schmidt-Wilcke, T., Sundgren, P., Abbasloo, A., Schölkopf, B., Schultz, T.

In 6th International Workshop on Machine Learning in Medical Imaging, 9352, pages: 52-60, Lecture Notes in Computer Science, (Editors: L. Zhou, L. Wang, Q. Wang and Y. Shi), Springer, MLMI, 2015 (inproceedings)

DOI [BibTex]

DOI [BibTex]


no image
Hierarchical Label Queries with Data-Dependent Partitions

Kpotufe, S., Urner, R., Ben-David, S.

In Proceedings of the 28th Conference on Learning Theory, 40, pages: 1176-1189, (Editors: Grünwald, P. and Hazan, E. and Kale, S. ), JMLR, COLT, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Semi-Autonomous 3rd-Hand Robot

Lopes, M., Peters, J., Piater, J., Toussaint, M., Baisero, A., Busch, B., Erkent, O., Kroemer, O., Lioutikov, R., Maeda, G., Mollard, Y., Munzer, T., Shukla, D.

In Workshop on Cognitive Robotics in Future Manufacturing Scenarios, European Robotics Forum, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Neural Adaptive Sequential Monte Carlo

Gu, S., Ghahramani, Z., Turner, R. E.

Advances in Neural Information Processing Systems 28, pages: 2629-2637, (Editors: Corinna Cortes, Neil D. Lawrence, Daniel D. Lee, Masashi Sugiyama, and Roman Garnett), 29th Annual Conference on Neural Information Processing Systems (NIPS), 2015 (conference)

PDF Supplementary [BibTex]

PDF Supplementary [BibTex]


no image
Discovering Temporal Causal Relations from Subsampled Data

Gong, M., Zhang, K., Schölkopf, B., Tao, D., Geiger, P.

In Proceedings of the 32nd International Conference on Machine Learning, 37, pages: 1898–1906, JMLR Workshop and Conference Proceedings, (Editors: F. Bach and D. Blei), JMLR, ICML, 2015 (inproceedings)

PDF link (url) [BibTex]

PDF link (url) [BibTex]


no image
Active Nearest Neighbors in Changing Environments

Berlind, C., Urner, R.

In Proceedings of the 32nd International Conference on Machine Learning, 37, pages: 1870-1879, JMLR Workshop and Conference Proceedings, (Editors: Bach, F. and Blei, D. ), JMLR, ICML, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Learning Inverse Dynamics Models with Contacts

Calandra, R., Ivaldi, S., Deisenroth, M., Rückert, E., Peters, J.

In IEEE International Conference on Robotics and Automation, pages: 3186-3191, ICRA, 2015 (inproceedings)

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
A Probabilistic Framework for Semi-Autonomous Robots Based on Interaction Primitives with Phase Estimation

Maeda, G., Neumann, G., Ewerton, M., Lioutikov, R., Peters, J.

In Proceedings of the International Symposium of Robotics Research, ISRR, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


Thumb xl 2016 peer grading
Peer grading in a course on algorithms and data structures

Sajjadi, M. S. M., Alamgir, M., von Luxburg, U.

Workshop on Machine Learning for Education (ML4Ed) at the 32th International Conference on Machine Learning (ICML), 2015 (conference)

Arxiv [BibTex]

Arxiv [BibTex]


no image
Removing systematic errors for exoplanet search via latent causes

Schölkopf, B., Hogg, D., Wang, D., Foreman-Mackey, D., Janzing, D., Simon-Gabriel, C. J., Peters, J.

In Proceedings of The 32nd International Conference on Machine Learning, 37, pages: 2218–2226, JMLR Workshop and Conference Proceedings, (Editors: Bach, F. and Blei, D.), JMLR, ICML, 2015 (inproceedings)

Extended version on arXiv link (url) [BibTex]

Extended version on arXiv link (url) [BibTex]


no image
Causal Inference by Identification of Vector Autoregressive Processes with Hidden Components

Geiger, P., Zhang, K., Schölkopf, B., Gong, M., Janzing, D.

In Proceedings of the 32nd International Conference on Machine Learning, 37, pages: 1917–1925, JMLR Workshop and Conference Proceedings, (Editors: F. Bach and D. Blei), JMLR, ICML, 2015 (inproceedings)

PDF link (url) [BibTex]

PDF link (url) [BibTex]


no image
Brain-Computer Interfacing in Amyotrophic Lateral Sclerosis: Implications of a Resting-State EEG Analysis

Jayaram, V., Widmann, N., Förster, C., Fomina, T., Hohmann, M. R., Müller vom Hagen, J., Synofzik, M., Schölkopf, B., Schöls, L., Grosse-Wentrup, M.

In Proceedings of the 37th IEEE Conference for Engineering in Medicine and Biology, pages: 6979-6982, EMBC, 2015 (inproceedings)

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Identification of the Default Mode Network with Electroencephalography

Fomina, T., Hohmann, M. R., Schölkopf, B., Grosse-Wentrup, M.

In Proceedings of the 37th IEEE Conference for Engineering in Medicine and Biology, pages: 7566-7569, EMBC, 2015 (inproceedings)

DOI [BibTex]

DOI [BibTex]


no image
Towards Cognitive Brain-Computer Interfaces for Patients with Amyotrophic Lateral Sclerosis

Fomina, T., Schölkopf, B., Grosse-Wentrup, M.

In 7th Computer Science and Electronic Engineering Conference, pages: 77-80, Curran Associates, Inc., CEEC, 2015 (inproceedings)

DOI [BibTex]

DOI [BibTex]


no image
Towards Learning Hierarchical Skills for Multi-Phase Manipulation Tasks

Kroemer, O., Daniel, C., Neumann, G., van Hoof, H., Peters, J.

In IEEE International Conference on Robotics and Automation, pages: 1503 - 1510, ICRA, 2015 (inproceedings)

link (url) DOI [BibTex]

link (url) DOI [BibTex]


Thumb xl maren ls
Probabilistic Line Searches for Stochastic Optimization

Mahsereci, M., Hennig, P.

In Advances in Neural Information Processing Systems 28, pages: 181-189, (Editors: C. Cortes, N.D. Lawrence, D.D. Lee, M. Sugiyama and R. Garnett), Curran Associates, Inc., 29th Annual Conference on Neural Information Processing Systems (NIPS), 2015 (inproceedings)

Abstract
In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a probabilistic line search by combining the structure of existing deterministic methods with notions from Bayesian optimization. Our method retains a Gaussian process surrogate of the univariate optimization objective, and uses a probabilistic belief over the Wolfe conditions to monitor the descent. The algorithm has very low computational cost, and no user-controlled parameters. Experiments show that it effectively removes the need to define a learning rate for stochastic gradient descent. [You can find the matlab research code under `attachments' below. The zip-file contains a minimal working example. The docstring in probLineSearch.m contains additional information. A more polished implementation in C++ will be published here at a later point. For comments and questions about the code please write to mmahsereci@tue.mpg.de.]

Matlab research code link (url) [BibTex]

Matlab research code link (url) [BibTex]


no image
Cosmology from Cosmic Shear with DES Science Verification Data

Abbott, T., Abdalla, F. B., Allam, S., Amara, A., Annis, J., Armstrong, R., Bacon, D., Banerji, M., Bauer, A. H., Baxter, E., others,

arXiv preprint arXiv:1507.05552, 2015 (techreport)

link (url) [BibTex]

link (url) [BibTex]


no image
BACKSHIFT: Learning causal cyclic graphs from unknown shift interventions

Rothenhäusler, D., Heinze, C., Peters, J., Meinshausen, N.

Advances in Neural Information Processing Systems 28, pages: 1513-1521, (Editors: C. Cortes, N.D. Lawrence, D.D. Lee, M. Sugiyama and R. Garnett), Curran Associates, Inc., 29th Annual Conference on Neural Information Processing Systems (NIPS), 2015 (conference)

link (url) [BibTex]

link (url) [BibTex]


no image
Particle Gibbs for Infinite Hidden Markov Models

Tripuraneni*, N., Gu*, S., Ge, H., Ghahramani, Z.

Advances in Neural Information Processing Systems 28, pages: 2395-2403, (Editors: Corinna Cortes, Neil D. Lawrence, Daniel D. Lee, Masashi Sugiyama, and Roman Garnett), 29th Annual Conference on Neural Information Processing Systems (NIPS), 2015, *equal contribution (conference)

PDF [BibTex]

PDF [BibTex]


Thumb xl 2016 peer grading
Peer grading in a course on algorithms and data structures

Sajjadi, M. S. M., Alamgir, M., von Luxburg, U.

Workshop on Crowdsourcing and Machine Learning (CrowdML) Workshop on Machine Learning for Education (ML4Ed) at at the 32th International Conference on Machine Learning (ICML), 2015 (conference)

Arxiv [BibTex]

Arxiv [BibTex]


no image
A Random Riemannian Metric for Probabilistic Shortest-Path Tractography

Hauberg, S., Schober, M., Liptrot, M., Hennig, P., Feragen, A.

In 18th International Conference on Medical Image Computing and Computer Assisted Intervention, 9349, pages: 597-604, Lecture Notes in Computer Science, MICCAI, 2015 (inproceedings)

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Recent Methodological Advances in Causal Discovery and Inference

Spirtes, P., Zhang, K.

In 15th Conference on Theoretical Aspects of Rationality and Knowledge, pages: 23-35, (Editors: Ramanujam, R.), TARK, 2015 (inproceedings)

[BibTex]

[BibTex]


no image
Learning Optimal Striking Points for A Ping-Pong Playing Robot

Huang, Y., Schölkopf, B., Peters, J.

In IEEE/RSJ International Conference on Intelligent Robots and Systems, pages: 4587-4592, IROS, 2015 (inproceedings)

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Model-Based Relative Entropy Stochastic Search

Abdolmaleki, A., Peters, J., Neumann, G.

In Advances in Neural Information Processing Systems 28, pages: 3523-3531, (Editors: C. Cortes, N.D. Lawrence, D.D. Lee, M. Sugiyama and R. Garnett), Curran Associates, Inc., 29th Annual Conference on Neural Information Processing Systems (NIPS), 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Modeling Spatio-Temporal Variability in Human-Robot Interaction with Probabilistic Movement Primitives

Ewerton, M., Neumann, G., Lioutikov, R., Ben Amor, H., Peters, J., Maeda, G.

In Workshop on Machine Learning for Social Robotics, ICRA, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Extracting Low-Dimensional Control Variables for Movement Primitives

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

In IEEE International Conference on Robotics and Automation, pages: 1511-1518, ICRA, 2015 (inproceedings)

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Self-calibration of optical lenses

Hirsch, M., Schölkopf, B.

In IEEE International Conference on Computer Vision (ICCV 2015), pages: 612-620, IEEE, 2015 (inproceedings)

DOI [BibTex]

DOI [BibTex]


no image
The DES Science Verification Weak Lensing Shear Catalogs

Jarvis, M., Sheldon, E., Zuntz, J., Kacprzak, T., Bridle, S. L., Amara, A., Armstrong, R., Becker, M. R., Bernstein, G. M., Bonnett, C., others,

arXiv preprint arXiv:1507.05603, 2015 (techreport)

link (url) [BibTex]

link (url) [BibTex]


no image
Telling cause from effect in deterministic linear dynamical systems

Shajarisales, N., Janzing, D., Schölkopf, B., Besserve, M.

In Proceedings of the 32nd International Conference on Machine Learning, 37, pages: 285–294, JMLR Workshop and Conference Proceedings, (Editors: F. Bach and D. Blei), JMLR, ICML, 2015 (inproceedings)

PDF [BibTex]

PDF [BibTex]


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

Hohmann, M. R., Fomina, T., Jayaram, V., Widmann, N., Förster, C., Müller vom Hagen, J., Synofzik, M., Schölkopf, B., Schöls, L., Grosse-Wentrup, M.

In Proceedings of the 2015 IEEE International Conference on Systems, Man, and Cybernetics, pages: 3187-3191, SMC, 2015 (inproceedings)

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Efficient Learning of Linear Separators under Bounded Noise

Awasthi, P., Balcan, M., Haghtalab, N., Urner, R.

In Proceedings of the 28th Conference on Learning Theory, 40, pages: 167-190, (Editors: Grünwald, P. and Hazan, E. and Kale, S.), JMLR, COLT, 2015 (inproceedings)

link (url) [BibTex]

link (url) [BibTex]


no image
Learning multiple collaborative tasks with a mixture of Interaction Primitives

Ewerton, M., Neumann, G., Lioutikov, R., Ben Amor, H., Peters, J., Maeda, G.

In IEEE International Conference on Robotics and Automation, pages: 1535-1542, ICRA, 2015 (inproceedings)

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Subspace Alignement based Domain Adaptation for RCNN detector

Raj, A., V., N., Tuytelaars, T.

Proceedings of the 26th British Machine Vision Conference (BMVC 2015), pages: 166.1-166.11, (Editors: Xianghua Xie and Mark W. Jones and Gary K. L. Tam), 2015 (conference)

DOI [BibTex]

DOI [BibTex]


no image
Practical Probabilistic Programming with Monads

Ścibior, A., Ghahramani, Z., Gordon, A. D.

Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell, pages: 165-176, Haskell ’15, ACM, 2015 (conference)

DOI [BibTex]

DOI [BibTex]


no image
Developing neural networks with neurons competing for survival

Peng, Z, Braun, DA

pages: 152-153, IEEE, Piscataway, NJ, USA, 5th Joint IEEE International Conference on Development and Learning and on Epigenetic Robotics (IEEE ICDL-EPIROB), August 2015 (conference)

Abstract
We study developmental growth in a feedforward neural network model inspired by the survival principle in nature. Each neuron has to select its incoming connections in a way that allow it to fire, as neurons that are not able to fire over a period of time degenerate and die. In order to survive, neurons have to find reoccurring patterns in the activity of the neurons in the preceding layer, because each neuron requires more than one active input at any one time to have enough activation for firing. The sensory input at the lowest layer therefore provides the maximum amount of activation that all neurons compete for. The whole network grows dynamically over time depending on how many patterns can be found and how many neurons can maintain themselves accordingly. We show in simulations that this naturally leads to abstractions in higher layers that emerge in a unsupervised fashion. When evaluating the network in a supervised learning paradigm, it is clear that our network is not competitive. What is interesting though is that this performance was achieved by neurons that simply struggle for survival and do not know about performance error. In contrast to most studies on neural evolution that rely on a network-wide fitness function, our goal was to show that learning behaviour can appear in a system without being driven by any specific utility function or reward signal.

DOI [BibTex]

DOI [BibTex]

2014


Thumb xl fop
Human Pose Estimation with Fields of Parts

Kiefel, M., Gehler, P.

In Computer Vision – ECCV 2014, LNCS 8693, pages: 331-346, Lecture Notes in Computer Science, (Editors: Fleet, David and Pajdla, Tomas and Schiele, Bernt and Tuytelaars, Tinne), Springer, 13th European Conference on Computer Vision, September 2014 (inproceedings)

Abstract
This paper proposes a new formulation of the human pose estimation problem. We present the Fields of Parts model, a binary Conditional Random Field model designed to detect human body parts of articulated people in single images. The Fields of Parts model is inspired by the idea of Pictorial Structures, it models local appearance and joint spatial configuration of the human body. However the underlying graph structure is entirely different. The idea is simple: we model the presence and absence of a body part at every possible position, orientation, and scale in an image with a binary random variable. This results into a vast number of random variables, however, we show that approximate inference in this model is efficient. Moreover we can encode the very same appearance and spatial structure as in Pictorial Structures models. This approach allows us to combine ideas from segmentation and pose estimation into a single model. The Fields of Parts model can use evidence from the background, include local color information, and it is connected more densely than a kinematic chain structure. On the challenging Leeds Sports Poses dataset we improve over the Pictorial Structures counterpart by 5.5% in terms of Average Precision of Keypoints (APK).

website pdf DOI Project Page [BibTex]

2014

website pdf DOI Project Page [BibTex]


Thumb xl ps page panel
Probabilistic Progress Bars

Kiefel, M., Schuler, C., Hennig, P.

In Conference on Pattern Recognition (GCPR), 8753, pages: 331-341, Lecture Notes in Computer Science, (Editors: Jiang, X., Hornegger, J., and Koch, R.), Springer, GCPR, September 2014 (inproceedings)

Abstract
Predicting the time at which the integral over a stochastic process reaches a target level is a value of interest in many applications. Often, such computations have to be made at low cost, in real time. As an intuitive example that captures many features of this problem class, we choose progress bars, a ubiquitous element of computer user interfaces. These predictors are usually based on simple point estimators, with no error modelling. This leads to fluctuating behaviour confusing to the user. It also does not provide a distribution prediction (risk values), which are crucial for many other application areas. We construct and empirically evaluate a fast, constant cost algorithm using a Gauss-Markov process model which provides more information to the user.

website+code pdf DOI [BibTex]

website+code pdf DOI [BibTex]


no image
Seeing the Arrow of Time

Pickup, L., Zheng, P., Donglai, W., YiChang, S., Changshui, Z., Zisserman, A., Schölkopf, B., Freeman, W.

Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on, pages: 2043-2050, IEEE, CVPR, June 2014 (conference)

DOI [BibTex]

DOI [BibTex]


Thumb xl aistats2014
Probabilistic Solutions to Differential Equations and their Application to Riemannian Statistics

Hennig, P., Hauberg, S.

In Proceedings of the 17th International Conference on Artificial Intelligence and Statistics, 33, pages: 347-355, JMLR: Workshop and Conference Proceedings, (Editors: S Kaski and J Corander), Microtome Publishing, Brookline, MA, AISTATS, April 2014 (inproceedings)

Abstract
We study a probabilistic numerical method for the solution of both boundary and initial value problems that returns a joint Gaussian process posterior over the solution. Such methods have concrete value in the statistics on Riemannian manifolds, where non-analytic ordinary differential equations are involved in virtually all computations. The probabilistic formulation permits marginalising the uncertainty of the numerical solution such that statistics are less sensitive to inaccuracies. This leads to new Riemannian algorithms for mean value computations and principal geodesic analysis. Marginalisation also means results can be less precise than point estimates, enabling a noticeable speed-up over the state of the art. Our approach is an argument for a wider point that uncertainty caused by numerical calculations should be tracked throughout the pipeline of machine learning algorithms.

pdf Youtube Supplements Project page link (url) [BibTex]

pdf Youtube Supplements Project page link (url) [BibTex]