Header logo is ei


2015


no image
Correlation matrix nearness and completion under observation uncertainty

Alaíz, C. M., Dinuzzo, F., Sra, S.

IMA Journal of Numerical Analysis, 35(1):325-340, 2015 (article)

DOI [BibTex]

2015

DOI [BibTex]


no image
Quantitative evaluation of segmentation- and atlas- based attenuation correction for PET/MR on pediatric patients

Bezrukov, I., Schmidt, H., Gatidis, S., Mantlik, F., Schäfer, J. F., Schwenzer, N., Pichler, B. J.

Journal of Nuclear Medicine, 56(7):1067-1074, 2015 (article)

DOI [BibTex]

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
Sequential Image Deconvolution Using Probabilistic Linear Algebra

Gao, M.

Technical University of Munich, Germany, 2015 (mastersthesis)

[BibTex]

[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
Probabilistic numerics and uncertainty in computations

Hennig, P., Osborne, M. A., Girolami, M.

Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, 471(2179), 2015 (article)

Abstract
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such uncertainties, arising from the loss of precision induced by numerical calculation with limited time or hardware, are important for much contemporary science and industry. Within applications such as climate science and astrophysics, the need to make decisions on the basis of computations with large and complex data have led to a renewed focus on the management of numerical uncertainty. We describe how several seminal classic numerical methods can be interpreted naturally as probabilistic inference. We then show that the probabilistic view suggests new algorithms that can flexibly be adapted to suit application specifics, while delivering improved empirical performance. We provide concrete illustrations of the benefits of probabilistic numeric algorithms on real scientific problems from astrometry and astronomical imaging, while highlighting open problems with these new algorithms. Finally, we describe how probabilistic numerical methods provide a coherent framework for identifying the uncertainty in calculations performed with a combination of numerical algorithms (e.g. both numerical optimizers and differential equation solvers), potentially allowing the diagnosis (and control) of error sources in computations.

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
Disparity estimation from a generative light field model

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

IEEE International Conference on Computer Vision (ICCV 2015), Workshop on Inverse Rendering, 2015, Note: This work has been presented as a poster and is not included in the workshop proceedings. (poster)

[BibTex]

[BibTex]


no image
Mass and galaxy distributions of four massive galaxy clusters from Dark Energy Survey Science Verification data

Melchior, P., Suchyta, E., Huff, E., Hirsch, M., Kacprzak, T., Rykoff, E., Gruen, D., Armstrong, R., Bacon, D., Bechtol, K., others,

Monthly Notices of the Royal Astronomical Society, 449(3):2219-2238, Oxford University Press, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Causal Inference in Neuroimaging

Casarsa de Azevedo, L.

Graduate Training Centre of Neuroscience, University of Tübingen, Germany, 2015 (mastersthesis)

[BibTex]

[BibTex]


no image
The effect of frowning on attention

Ibarra Chaoul, A.

Graduate Training Centre of Neuroscience, University of Tübingen, Germany, 2015 (mastersthesis)

[BibTex]

[BibTex]


no image
Justifying Information-Geometric Causal Inference

Janzing, D., Steudel, B., Shajarisales, N., Schölkopf, B.

In Measures of Complexity: Festschrift for Alexey Chervonenkis, pages: 253-265, 18, (Editors: Vovk, V., Papadopoulos, H. and Gammerman, A.), Springer, 2015 (inbook)

DOI [BibTex]

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
The search for single exoplanet transits in the Kepler light curves

Foreman-Mackey, D., Hogg, D. W., Schölkopf, B.

IAU General Assembly, 22, pages: 2258352, 2015 (talk)

link (url) [BibTex]

link (url) [BibTex]


no image
Entropic Movement Complexity Reflects Subjective Creativity Rankings of Visualized Hand Motion Trajectories

Peng, Z, Braun, DA

Frontiers in Psychology, 6(1879):1-13, December 2015 (article)

Abstract
In a previous study we have shown that human motion trajectories can be characterized by translating continuous trajectories into symbol sequences with well-defined complexity measures. Here we test the hypothesis that the motion complexity individuals generate in their movements might be correlated to the degree of creativity assigned by a human observer to the visualized motion trajectories. We asked participants to generate 55 novel hand movement patterns in virtual reality, where each pattern had to be repeated 10 times in a row to ensure reproducibility. This allowed us to estimate a probability distribution over trajectories for each pattern. We assessed motion complexity not only by the previously proposed complexity measures on symbolic sequences, but we also propose two novel complexity measures that can be directly applied to the distributions over trajectories based on the frameworks of Gaussian Processes and Probabilistic Movement Primitives. In contrast to previous studies, these new methods allow computing complexities of individual motion patterns from very few sample trajectories. We compared the different complexity measures to how a group of independent jurors rank ordered the recorded motion trajectories according to their personal creativity judgment. We found three entropic complexity measures that correlate significantly with human creativity judgment and discuss differences between the measures. We also test whether these complexity measures correlate with individual creativity in divergent thinking tasks, but do not find any consistent correlation. Our results suggest that entropic complexity measures of hand motion may reveal domain-specific individual differences in kinesthetic creativity.

DOI [BibTex]

DOI [BibTex]


no image
Bounded rationality, abstraction and hierarchical decision-making: an information-theoretic optimality principle

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

Frontiers in Robotics and AI, 2(27):1-24, October 2015 (article)

Abstract
Abstraction and hierarchical information-processing are hallmarks of human and animal intelligence underlying the unrivaled flexibility of behavior in biological systems. Achieving such a flexibility in artificial systems is challenging, even with more and more computational power. Here we investigate the hypothesis that abstraction and hierarchical information-processing might in fact be the consequence of limitations in information-processing power. In particular, we study an information-theoretic framework of bounded rational decision-making that trades off utility maximization against information-processing costs. We apply the basic principle of this framework to perception-action systems with multiple information-processing nodes and derive bounded optimal solutions. We show how the formation of abstractions and decision-making hierarchies depends on information-processing costs. We illustrate the theoretical ideas with example simulations and conclude by formalizing a mathematically unifying optimization principle that could potentially be extended to more complex systems.

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]


no image
Signaling equilibria in sensorimotor interactions

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

Cognition, 141, pages: 73-86, August 2015 (article)

Abstract
Although complex forms of communication like human language are often assumed to have evolved out of more simple forms of sensorimotor signaling, less attention has been devoted to investigate the latter. Here, we study communicative sensorimotor behavior of humans in a two-person joint motor task where each player controls one dimension of a planar motion. We designed this joint task as a game where one player (the sender) possesses private information about a hidden target the other player (the receiver) wants to know about, and where the sender's actions are costly signals that influence the receiver's control strategy. We developed a game-theoretic model within the framework of signaling games to investigate whether subjects' behavior could be adequately described by the corresponding equilibrium solutions. The model predicts both separating and pooling equilibria, in which signaling does and does not occur respectively. We observed both kinds of equilibria in subjects and found that, in line with model predictions, the propensity of signaling decreased with increasing signaling costs and decreasing uncertainty on the part of the receiver. Our study demonstrates that signaling games, which have previously been applied to economic decision-making and animal communication, provide a framework for human signaling behavior arising during sensorimotor interactions in continuous and dynamic environments.

DOI [BibTex]

DOI [BibTex]


no image
Structure Learning in Bayesian Sensorimotor Integration

Genewein, T, Hez, E, Razzaghpanah, Z, Braun, DA

PLoS Computational Biology, 11(8):1-27, August 2015 (article)

Abstract
Previous studies have shown that sensorimotor processing can often be described by Bayesian learning, in particular the integration of prior and feedback information depending on its degree of reliability. Here we test the hypothesis that the integration process itself can be tuned to the statistical structure of the environment. We exposed human participants to a reaching task in a three-dimensional virtual reality environment where we could displace the visual feedback of their hand position in a two dimensional plane. When introducing statistical structure between the two dimensions of the displacement, we found that over the course of several days participants adapted their feedback integration process in order to exploit this structure for performance improvement. In control experiments we found that this adaptation process critically depended on performance feedback and could not be induced by verbal instructions. Our results suggest that structural learning is an important meta-learning component of Bayesian sensorimotor integration.

DOI [BibTex]

DOI [BibTex]


no image
A Reward-Maximizing Spiking Neuron as a Bounded Rational Decision Maker

Leibfried, F, Braun, DA

Neural Computation, 27(8):1686-1720, July 2015 (article)

Abstract
Rate distortion theory describes how to communicate relevant information most efficiently over a channel with limited capacity. One of the many applications of rate distortion theory is bounded rational decision making, where decision makers are modeled as information channels that transform sensory input into motor output under the constraint that their channel capacity is limited. Such a bounded rational decision maker can be thought to optimize an objective function that trades off the decision maker's utility or cumulative reward against the information processing cost measured by the mutual information between sensory input and motor output. In this study, we interpret a spiking neuron as a bounded rational decision maker that aims to maximize its expected reward under the computational constraint that the mutual information between the neuron's input and output is upper bounded. This abstract computational constraint translates into a penalization of the deviation between the neuron's instantaneous and average firing behavior. We derive a synaptic weight update rule for such a rate distortion optimizing neuron and show in simulations that the neuron efficiently extracts reward-relevant information from the input by trading off its synaptic strengths against the collected reward.

DOI [BibTex]

DOI [BibTex]


no image
What is epistemic value in free energy models of learning and acting? A bounded rationality perspective

Ortega, PA, Braun, DA

Cognitive Neuroscience, 6(4):215-216, December 2015 (article)

Abstract
Free energy models of learning and acting do not only care about utility or extrinsic value, but also about intrinsic value, that is, the information value stemming from probability distributions that represent beliefs or strategies. While these intrinsic values can be interpreted as epistemic values or exploration bonuses under certain conditions, the framework of bounded rationality offers a complementary interpretation in terms of information-processing costs that we discuss here.

DOI [BibTex]

DOI [BibTex]

2012


no image
Support Vector Machines, Support Measure Machines, and Quasar Target Selection

Muandet, K.

Center for Cosmology and Particle Physics (CCPP), New York University, December 2012 (talk)

[BibTex]

2012

[BibTex]


no image
Hilbert Space Embedding for Dirichlet Process Mixtures

Muandet, K.

NIPS Workshop on Confluence between Kernel Methods and Graphical Models, December 2012 (talk)

[BibTex]

[BibTex]


no image
Jensen-Bregman LogDet Divergence with Application to Efficient Similarity Search for Covariance Matrices

Cherian, A., Sra, S., Banerjee, A., Papanikolopoulos, N.

IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(9):2161-2174, December 2012 (article)

DOI [BibTex]

DOI [BibTex]


no image
Hippocampal-Cortical Interaction during Periods of Subcortical Silence

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

Nature, 491, pages: 547-553, November 2012 (article)

Abstract
Hippocampal ripples, episodic high-frequency field-potential oscillations primarily occurring during sleep and calmness, have been described in mice, rats, rabbits, monkeys and humans, and so far they have been associated with retention of previously acquired awake experience. Although hippocampal ripples have been studied in detail using neurophysiological methods, the global effects of ripples on the entire brain remain elusive, primarily owing to a lack of methodologies permitting concurrent hippocampal recordings and whole-brain activity mapping. By combining electrophysiological recordings in hippocampus with ripple-triggered functional magnetic resonance imaging, here we show that most of the cerebral cortex is selectively activated during the ripples, whereas most diencephalic, midbrain and brainstem regions are strongly and consistently inhibited. Analysis of regional temporal response patterns indicates that thalamic activity suppression precedes the hippocampal population burst, which itself is temporally bounded by massive activations of association and primary cortical areas. These findings suggest that during off-line memory consolidation, synergistic thalamocortical activity may be orchestrating a privileged interaction state between hippocampus and cortex by silencing the output of subcortical centres involved in sensory processing or potentially mediating procedural learning. Such a mechanism would cause minimal interference, enabling consolidation of hippocampus-dependent memory.

Web DOI [BibTex]

Web DOI [BibTex]


no image
Scalable graph kernels

Shervashidze, N.

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

Web [BibTex]

Web [BibTex]


no image
Probabilistic Modelling of Expression Variation in Modern eQTL Studies

Zwießele, M.

Eberhard Karls Universität Tübingen, Germany, October 2012 (mastersthesis)

[BibTex]

[BibTex]


no image
Thermodynamic limits of dynamic cooling

Allahverdyan, A., Hovhannisyan, K., Janzing, D., Mahler, G.

Physical Review E, 84(4):16, October 2012 (article)

Abstract
We study dynamic cooling, where an externally driven two-level system is cooled via reservoir, a quantum system with initial canonical equilibrium state. We obtain explicitly the minimal possible temperature Tmin>0 reachable for the two-level system. The minimization goes over all unitary dynamic processes operating on the system and reservoir and over the reservoir energy spectrum. The minimal work needed to reach Tmin grows as 1/Tmin. This work cost can be significantly reduced, though, if one is satisfied by temperatures slightly above Tmin. Our results on Tmin>0 prove unattainability of the absolute zero temperature without ambiguities that surround its derivation from the entropic version of the third law. We also study cooling via a reservoir consisting of N≫1 identical spins. Here we show that Tmin∝1/N and find the maximal cooling compatible with the minimal work determined by the free energy. Finally we discuss cooling by reservoir with an initially microcanonic state and show that although a purely microcanonic state can yield the zero temperature, the unattainability is recovered when taking into account imperfections in preparing the microcanonic state.

Web DOI [BibTex]

Web DOI [BibTex]


no image
GLIDE: GPU-Based Linear Regression for Detection of Epistasis

Kam-Thong, T., Azencott, C., Cayton, L., Pütz, B., Altmann, A., Karbalai, N., Sämann, P., Schölkopf, B., Müller-Myhsok, B., Borgwardt, K.

Human Heredity, 73(4):220-236, September 2012 (article)

Abstract
Due to recent advances in genotyping technologies, mapping phenotypes to single loci in the genome has become a standard technique in statistical genetics. However, one-locus mapping fails to explain much of the phenotypic variance in complex traits. Here, we present GLIDE, which maps phenotypes to pairs of genetic loci and systematically searches for the epistatic interactions expected to reveal part of this missing heritability. GLIDE makes use of the computational power of consumer-grade graphics cards to detect such interactions via linear regression. This enabled us to conduct a systematic two-locus mapping study on seven disease data sets from the Wellcome Trust Case Control Consortium and on in-house hippocampal volume data in 6 h per data set, while current single CPU-based approaches require more than a year’s time to complete the same task.

Web [BibTex]

Web [BibTex]


no image
Fast projection onto mixed-norm balls with applications

Sra, S.

Minining and Knowledge Discovery (DMKD), 25(2):358-377, September 2012 (article)

DOI [BibTex]

DOI [BibTex]


no image
Bayesian estimation of free energies from equilibrium simulations

Habeck, M.

Physical Review Letters, 109(10):5, September 2012 (article)

Abstract
Free energy calculations are an important tool in statistical physics and biomolecular simulation. This Letter outlines a Bayesian method to estimate free energies from equilibrium Monte Carlo simulations. A Gibbs sampler is developed that allows efficient sampling of free energies and the density of states. The Gibbs sampling output can be used to estimate expected free energy differences and their uncertainties. The probabilistic formulation offers a unifying framework for existing methods such as the weighted histogram analysis method and the multistate Bennett acceptance ratio; both are shown to be approximate versions of the full probabilistic treatment.

Web DOI [BibTex]

Web DOI [BibTex]


no image
Influence Maximization in Continuous Time Diffusion Networks

Gomez Rodriguez, M., Schölkopf, B.

In Proceedings of the 29th International Conference on Machine Learning, pages: 313-320, (Editors: J, Langford and J, Pineau), Omnipress, New York, NY, USA, ICML, July 2012 (inproceedings)

Web [BibTex]

Web [BibTex]


no image
Submodular Inference of Diffusion Networks from Multiple Trees

Gomez Rodriguez, M., Schölkopf, B.

In Proceedings of the 29th International Conference on Machine Learning , pages: 489-496, (Editors: J Langford, and J Pineau), Omnipress, New York, NY, USA, ICML, July 2012 (inproceedings)

Web [BibTex]

Web [BibTex]


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

Hennig, P., Kiefel, M.

In Proceedings of the 29th International Conference on Machine Learning, pages: 25-32, ICML ’12, (Editors: John Langford and Joelle Pineau), Omnipress, New York, NY, USA, ICML, July 2012 (inproceedings)

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.

website+code pdf link (url) [BibTex]

website+code pdf link (url) [BibTex]


no image
Image denoising: Can plain Neural Networks compete with BM3D?

Burger, H., Schuler, C., Harmeling, S.

In pages: 2392 - 2399, 25th IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2012 (inproceedings)

Abstract
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with cleverly engineered algorithms. In this work we attempt to learn this mapping directly with a plain multi layer perceptron (MLP) applied to image patches. While this has been done before, we will show that by training on large image databases we are able to compete with the current state-of-the-art image denoising methods. Furthermore, our approach is easily adapted to less extensively studied types of noise (by merely exchanging the training data), for which we achieve excellent results as well.

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
PAC-Bayesian Inequalities for Martingales

Seldin, Y., Laviolette, F., Cesa-Bianchi, N., Shawe-Taylor, J., Auer, P.

IEEE Transactions on Information Theory, 58(12):7086-7093, June 2012 (article)

Abstract
We present a set of high-probability inequalities that control the concentration of weighted averages of multiple (possibly uncountably many) simultaneously evolving and interdependent martingales. We also present a comparison inequality that bounds expectation of a convex function of martingale difference type variables by expectation of the same function of independent Bernoulli variables. This inequality is applied to derive a tighter analog of Hoeffding-Azuma inequality.

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Climate classifications: the value of unsupervised clustering

Zscheischler, J., Mahecha, M., Harmeling, S.

In Proceedings of the International Conference on Computational Science , 9, pages: 897-906, Procedia Computer Science, (Editors: H. Ali, Y. Shi, D. Khazanchi, M. Lees, G.D. van Albada, J. Dongarra, P.M.A. Sloot, J. Dongarra), Elsevier, Amsterdam, Netherlands, ICCS, June 2012 (inproceedings)

Abstract
Classifying the land surface according to di erent climate zones is often a prerequisite for global diagnostic or predictive modelling studies. Classical classifications such as the prominent K¨oppen–Geiger (KG) approach rely on heuristic decision rules. Although these heuristics may transport some process understanding, such a discretization may appear “arbitrary” from a data oriented perspective. In this contribution we compare the precision of a KG classification to an unsupervised classification (k-means clustering). Generally speaking, we revisit the problem of “climate classification” by investigating the inherent patterns in multiple data streams in a purely data driven way. One question is whether we can reproduce the KG boundaries by exploring di erent combinations of climate and remotely sensed vegetation variables. In this context we also investigate whether climate and vegetation variables build similar clusters. In terms of statistical performances, k-means clearly outperforms classical climate classifications. However, a subsequent stability analysis only reveals a meaningful number of clusters if both climate and vegetation data are considered in the analysis. This is a setback for the hope to explain vegetation by means of climate alone. Clearly, classification schemes like K¨oppen-Geiger will play an important role in the future. However, future developments in this area need to be assessed based on data driven approaches.

Web DOI [BibTex]

Web DOI [BibTex]


Thumb xl screen shot 2017 09 21 at 00.54.33
Entropy Search for Information-Efficient Global Optimization

Hennig, P., Schuler, C.

Journal of Machine Learning Research, 13, pages: 1809-1837, -, June 2012 (article)

Abstract
Contemporary global optimization algorithms are based on local measures of utility, rather than a probability measure over location and value of the optimum. They thus attempt to collect low function values, not to learn about the optimum. The reason for the absence of probabilistic global optimizers is that the corresponding inference problem is intractable in several ways. This paper develops desiderata for probabilistic optimization algorithms, then presents a concrete algorithm which addresses each of the computational intractabilities with a sequence of approximations and explicitly adresses the decision problem of maximizing information gain from each evaluation.

PDF Web Project Page [BibTex]

PDF Web Project Page [BibTex]


no image
Kernels for identifying patterns in datasets containing noise or transformation invariances

Schölkopf, B., Chapelle, C.

United States Patent, No. 8209269, June 2012 (patent)

[BibTex]


no image
A Neuromorphic Architecture for Object Recognition and Motion Anticipation Using Burst-STDP

Nere, A., Olcese, U., Balduzzi, D., Tononi, G.

PLoS ONE, 7(5):17, May 2012 (article)

Abstract
In this work we investigate the possibilities offered by a minimal framework of artificial spiking neurons to be deployed in silico. Here we introduce a hierarchical network architecture of spiking neurons which learns to recognize moving objects in a visual environment and determine the correct motor output for each object. These tasks are learned through both supervised and unsupervised spike timing dependent plasticity (STDP). STDP is responsible for the strengthening (or weakening) of synapses in relation to pre- and post-synaptic spike times and has been described as a Hebbian paradigm taking place both in vitro and in vivo. We utilize a variation of STDP learning, called burst-STDP, which is based on the notion that, since spikes are expensive in terms of energy consumption, then strong bursting activity carries more information than single (sparse) spikes. Furthermore, this learning algorithm takes advantage of homeostatic renormalization, which has been hypothesized to promote memory consolidation during NREM sleep. Using this learning rule, we design a spiking neural network architecture capable of object recognition, motion detection, attention towards important objects, and motor control outputs. We demonstrate the abilities of our design in a simple environment with distractor objects, multiple objects moving concurrently, and in the presence of noise. Most importantly, we show how this neural network is capable of performing these tasks using a simple leaky-integrate-and-fire (LIF) neuron model with binary synapses, making it fully compatible with state-of-the-art digital neuromorphic hardware designs. As such, the building blocks and learning rules presented in this paper appear promising for scalable fully neuromorphic systems to be implemented in hardware chips.

PDF Web DOI [BibTex]


no image
Simultaneous small animal PET/MR in activated and resting state reveals multiple brain networks

Wehrl, H., Lankes, K., Hossain, M., Bezrukov, I., Liu, C., Martirosian, P., Schick, F., Pichler, B.

20th Annual Meeting and Exhibition of the International Society for Magnetic Resonance in Medicine (ISMRM), May 2012 (talk)

Web [BibTex]

Web [BibTex]


no image
Online Kernel-based Learning for Task-Space Tracking Robot Control

Nguyen-Tuong, D., Peters, J.

IEEE Transactions on Neural Networks and Learning Systems, 23(9):1417-1425, May 2012 (article)

Abstract
Abstract—Task-space control of redundant robot systems based on analytical models is known to be susceptive to modeling errors. Here, data driven model learning methods may present an interesting alternative approach. However, learning models for task-space tracking control from sampled data is an illposed problem. In particular, the same input data point can yield many different output values, which can form a non-convex solution space. Because the problem is ill-posed, models cannot be learned from such data using common regression methods. While learning of task-space control mappings is globally illposed, it has been shown in recent work that it is locally a well-defined problem. In this paper, we use this insight to formulate a local, kernel-based learning approach for online model learning for task-space tracking control. We propose a parametrization for the local model which makes an application in task-space tracking control of redundant robots possible. The model parametrization further allows us to apply the kerneltrick and, therefore, enables a formulation within the kernel learning framework. For evaluations, we show the ability of the method for online model learning for task-space tracking control of redundant robots.

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Blind Retrospective Motion Correction of MR Images

Loktyushin, A., Nickisch, H., Pohmann, R., Schölkopf, B.

20th Annual Scientific Meeting ISMRM, May 2012 (poster)

Abstract
Patient motion in the scanner is one of the most challenging problems in MRI. We propose a new retrospective motion correction method for which no tracking devices or specialized sequences are required. We seek the motion parameters such that the image gradients in the spatial domain become sparse. We then use these parameters to invert the motion and recover the sharp image. In our experiments we acquired 2D TSE images and 3D FLASH/MPRAGE volumes of the human head. Major quality improvements are possible in the 2D case and substantial improvements in the 3D case.

Web [BibTex]

Web [BibTex]


no image
Information-geometric approach to inferring causal directions

Janzing, D., Mooij, J., Zhang, K., Lemeire, J., Zscheischler, J., Daniušis, P., Steudel, B., Schölkopf, B.

Artificial Intelligence, 182-183, pages: 1-31, May 2012 (article)

Abstract
While conventional approaches to causal inference are mainly based on conditional (in)dependences, recent methods also account for the shape of (conditional) distributions. The idea is that the causal hypothesis “X causes Y” imposes that the marginal distribution PX and the conditional distribution PY|X represent independent mechanisms of nature. Recently it has been postulated that the shortest description of the joint distribution PX,Y should therefore be given by separate descriptions of PX and PY|X. Since description length in the sense of Kolmogorov complexity is uncomputable, practical implementations rely on other notions of independence. Here we define independence via orthogonality in information space. This way, we can explicitly describe the kind of dependence that occurs between PY and PX|Y making the causal hypothesis “Y causes X” implausible. Remarkably, this asymmetry between cause and effect becomes particularly simple if X and Y are deterministically related. We present an inference method that works in this case. We also discuss some theoretical results for the non-deterministic case although it is not clear how to employ them for a more general inference method.

Web DOI [BibTex]

Web DOI [BibTex]