Header logo is ei


2015


no image
Quantifying changes in climate variability and extremes: Pitfalls and their overcoming

Sippel, S., Zscheischler, J., Heimann, M., Otto, F. E. L., Peters, J., Mahecha, M. D.

Geophysical Research Letters, 42(22):9990-9998, November 2015 (article)

DOI [BibTex]

2015

DOI [BibTex]


no image
Diversity of sharp wave-ripple LFP signatures reveals differentiated brain-wide dynamical events

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

Proceedings of the National Academy of Sciences U.S.A, 112(46):E6379-E6387, November 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Noise masking of White’s illusion exposes the weakness of current spatial filtering models of lightness perception

Betz, T., Shapley, R. M., Wichmann, F. A., Maertens, M.

Journal of Vision, 15(14):1-17, October 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Shifts of Gamma Phase across Primary Visual Cortical Sites Reflect Dynamic Stimulus-Modulated Information Transfer

Besserve, M., Lowe, S. C., Logothetis, N. K., Schölkopf, B., Panzeri, S.

PLOS Biology, 13(9):e1002257, September 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Semi-Supervised Interpolation in an Anticausal Learning Scenario

Janzing, D., Schölkopf, B.

Journal of Machine Learning Research, 16, pages: 1923-1948, September 2015 (article)

link (url) [BibTex]

link (url) [BibTex]


no image
Testing the role of luminance edges in White’s illusion with contour adaptation

Betz, T., Shapley, R. M., Wichmann, F. A., Maertens, M.

Journal of Vision, 15(11):1-16, August 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Blind multirigid retrospective motion correction of MR images

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

Magnetic Resonance in Medicine, 73(4):1457-1468, April 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
A quantum advantage for inferring causal structure

Ried, K., Agnew, M., Vermeyden, L., Janzing, D., Spekkens, R. W., Resch, K. J.

Nature Physics, 11(5):414-420, March 2015 (article)

Abstract
The problem of inferring causal relations from observed correlations is relevant to a wide variety of scientific disciplines. Yet given the correlations between just two classical variables, it is impossible to determine whether they arose from a causal influence of one on the other or a common cause influencing both. Only a randomized trial can settle the issue. Here we consider the problem of causal inference for quantum variables. We show that the analogue of a randomized trial, causal tomography, yields a complete solution. We also show that, in contrast to the classical case, one can sometimes infer the causal structure from observations alone. We implement a quantum-optical experiment wherein we control the causal relation between two optical modes, and two measurement schemes—with and without randomization—that extract this relation from the observed correlations. Our results show that entanglement and quantum coherence provide an advantage for causal inference.

DOI [BibTex]

DOI [BibTex]


no image
Positive definite matrices and the S-divergence

Sra, S.

Proceedings of the American Mathematical Society, 2015, Published electronically: October 22, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Structural Intervention Distance (SID) for Evaluating Causal Graphs

Peters, J., Bühlmann, P.

Neural Computation , 27(3):771-799, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Likelihood and Consilience: On Forster’s Counterexamples to the Likelihood Theory of Evidence

Zhang, J., Zhang, K.

Philosophy of Science, Supplementary Volume 2015, 82(5):930-940, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Crowdsourced analysis of clinical trial data to predict amyotrophic lateral sclerosis progression

Küffner, R., Zach, N., Norel, R., Hawe, J., Schoenfeld, D., Wang, L., Li, G., Fang, L., Mackey, L., Hardiman, O., Cudkowicz, M., Sherman, A., Ertaylan, G., Grosse-Wentrup, M., Hothorn, T., van Ligtenberg, J., Macke, J., Meyer, T., Schölkopf, B., Tran, L., Vaughan, R., Stolovitzky, G., Leitner, M.

Nature Biotechnology, 33, pages: 51-57, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Probabilistic Interpretation of Linear Solvers

Hennig, P.

SIAM Journal on Optimization, 25(1):234-260, 2015 (article)

Web PDF link (url) DOI [BibTex]

Web PDF link (url) DOI [BibTex]


no image
Developing biorobotics for veterinary research into cat movements

Mariti, C., Muscolo, G., Peters, J., Puig, D., Recchiuto, C., Sighieri, C., Solanas, A., von Stryk, O.

Journal of Veterinary Behavior: Clinical Applications and Research, 10(3):248-254, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Spatial statistics and attentional dynamics in scene viewing

Engbert, R., Trukenbrod, H., Barthelmé, S., Wichmann, F.

Journal of Vision, 15(1):1-17, 2015 (article)

Web PDF link (url) DOI [BibTex]

Web PDF link (url) DOI [BibTex]


no image
The Randomized Causation Coefficient

Lopez-Paz, D., Muandet, K., Recht, B.

Journal of Machine Learning, 16, pages: 2901-2907, 2015 (article)

link (url) [BibTex]

link (url) [BibTex]


no image
Towards denoising XMCD movies of fast magnetization dynamics using extended Kalman filter

Kopp, M., Harmeling, S., Schütz, G., Schölkopf, B., Fähnle, M.

Ultramicroscopy, 148, pages: 115-122, 2015 (article)

Abstract
The Kalman filter is a well-established approach to get information on the time-dependent state of a system from noisy observations. It was developed in the context of the Apollo project to see the deviation of the true trajectory of a rocket from the desired trajectory. Afterwards it was applied to many different systems with small numbers of components of the respective state vector (typically about 10). In all cases the equation of motion for the state vector was known exactly. The fast dissipative magnetization dynamics is often investigated by x-ray magnetic circular dichroism movies (XMCD movies), which are often very noisy. In this situation the number of components of the state vector is extremely large (about 105), and the equation of motion for the dissipative magnetization dynamics (especially the values of the material parameters of this equation) is not well known. In the present paper it is shown by theoretical considerations that – nevertheless – there is no principle problem for the use of the Kalman filter to denoise XMCD movies of fast dissipative magnetization dynamics.

Web DOI [BibTex]

Web DOI [BibTex]


no image
Artificial intelligence: Learning to see and act

Schölkopf, B.

Nature, News & Views, 518(7540):486-487, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Context affects lightness at the level of surfaces

Maertens, M., Wichmann, F., Shapley, R.

Journal of Vision, 15(1):1-15, 2015 (article)

Web PDF link (url) DOI [BibTex]

Web PDF link (url) DOI [BibTex]


no image
Genome-wide analysis of local chromatin packing in Arabidopsis thaliana

Wang, C., Liu, C., Roqueiro, D., Grimm, D., Schwab, R., Becker, C., Lanz, C., Weigel, D.

Genome Research, 25(2):246-256, 2015 (article)

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Segmentation-based attenuation correction in positron emission tomography/magnetic resonance: erroneous tissue identification and its impact on positron emission tomography interpretation

Brendle, C., Schmidt, H., Oergel, A., Bezrukov, I., Mueller, M., Schraml, C., Pfannenberg, C., la Fougère, C., Nikolaou, K., Schwenzer, N.

Investigative Radiology, 50(5):339-346, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Active Reward Learning with a Novel Acquisition Function

Daniel, C., Kroemer, O., Viering, M., Metz, J., Peters, J.

Autonomous Robots, 39(3):389-405, 2015 (article)

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
A systematic search for transiting planets in the K2 data

Foreman-Mackey, D., Montet, B., Hogg, D., Morton, T., Wang, D., Schölkopf, B.

The Astrophysical Journal, 806(2), 2015 (article)

Abstract
Photometry of stars from the K2 extension of NASA’s Kepler mission is afflicted by systematic effects caused by small (few-pixel) drifts in the telescope pointing and other spacecraft issues. We present a method for searching K2 light curves for evidence of exoplanets by simultaneously fitting for these systematics and the transit signals of interest. This method is more computationally expensive than standard search algorithms but we demonstrate that it can be efficiently implemented and used to discover transit signals. We apply this method to the full Campaign 1 data set and report a list of 36 planet candidates transiting 31 stars, along with an analysis of the pipeline performance and detection efficiency based on artificial signal injections and recoveries. For all planet candidates, we present posterior distributions on the properties of each system based strictly on the transit observables.

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Learning Movement Primitive Attractor Goals and Sequential Skills from Kinesthetic Demonstrations

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

Robotics and Autonomous Systems, 74, Part A, pages: 97-107, 2015 (article)

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Bayesian Optimization for Learning Gaits under Uncertainty

Calandra, R., Seyfarth, A., Peters, J., Deisenroth, M.

Annals of Mathematics and Artificial Intelligence, pages: 1-19, 2015 (article)

DOI [BibTex]

DOI [BibTex]


no image
Assessment of murine brain tissue shrinkage caused by different histological fixatives using magnetic resonance and computed tomography imaging

Wehrl, H. F., Bezrukov, I., Wiehr, S., Lehnhoff, M., Fuchs, K., Mannheim, J. G., Quintanilla-Martinez, L., Kneilling, M., Pichler, B. J., Sauter, A. W.

Histology and Histopathology, 30(5):601-613, 2015 (article)

[BibTex]

[BibTex]


no image
Improved Bayesian Information Criterion for Mixture Model Selection

Mehrjou, A., Hosseini, R., Araabi, B.

Pattern Recognition Letters, 69, pages: 22-27, 2015 (article)

DOI [BibTex]

DOI [BibTex]


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]

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

2004


no image
On the representation, learning and transfer of spatio-temporal movement characteristics

Ilg, W., Bakir, GH., Mezger, J., Giese, M.

International Journal of Humanoid Robotics, 1(4):613-636, December 2004 (article)

[BibTex]

2004

[BibTex]


no image
Insect-inspired estimation of egomotion

Franz, MO., Chahl, JS., Krapp, HG.

Neural Computation, 16(11):2245-2260, November 2004 (article)

Abstract
Tangential neurons in the fly brain are sensitive to the typical optic flow patterns generated during egomotion. In this study, we examine whether a simplified linear model based on the organization principles in tangential neurons can be used to estimate egomotion from the optic flow. We present a theory for the construction of an estimator consisting of a linear combination of optic flow vectors that incorporates prior knowledge both about the distance distribution of the environment, and about the noise and egomotion statistics of the sensor. The estimator is tested on a gantry carrying an omnidirectional vision sensor. The experiments show that the proposed approach leads to accurate and robust estimates of rotation rates, whereas translation estimates are of reasonable quality, albeit less reliable.

PDF PostScript Web DOI [BibTex]

PDF PostScript Web DOI [BibTex]


no image
Efficient face detection by a cascaded support-vector machine expansion

Romdhani, S., Torr, P., Schölkopf, B., Blake, A.

Proceedings of The Royal Society of London A, 460(2501):3283-3297, A, November 2004 (article)

Abstract
We describe a fast system for the detection and localization of human faces in images using a nonlinear ‘support-vector machine‘. We approximate the decision surface in terms of a reduced set of expansion vectors and propose a cascaded evaluation which has the property that the full support-vector expansion is only evaluated on the face-like parts of the image, while the largest part of typical images is classified using a single expansion vector (a simpler and more efficient classifier). As a result, only three reduced-set vectors are used, on average, to classify an image patch. Hence, the cascaded evaluation, presented in this paper, offers a thirtyfold speed-up over an evaluation using the full set of reduced-set vectors, which is itself already thirty times faster than classification using all the support vectors.

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Kernel Methods in Computational Biology

Schölkopf, B., Tsuda, K., Vert, J.

pages: 410, Computational Molecular Biology, MIT Press, Cambridge, MA, USA, August 2004 (book)

Abstract
Modern machine learning techniques are proving to be extremely valuable for the analysis of data in computational biology problems. One branch of machine learning, kernel methods, lends itself particularly well to the difficult aspects of biological data, which include high dimensionality (as in microarray measurements), representation as discrete and structured data (as in DNA or amino acid sequences), and the need to combine heterogeneous sources of information. This book provides a detailed overview of current research in kernel methods and their applications to computational biology. Following three introductory chapters—an introduction to molecular and computational biology, a short review of kernel methods that focuses on intuitive concepts rather than technical details, and a detailed survey of recent applications of kernel methods in computational biology—the book is divided into three sections that reflect three general trends in current research. The first part presents different ideas for the design of kernel functions specifically adapted to various biological data; the second part covers different approaches to learning from heterogeneous data; and the third part offers examples of successful applications of support vector machine methods.

Web [BibTex]

Web [BibTex]


no image
Learning kernels from biological networks by maximizing entropy

Tsuda, K., Noble, W.

Bioinformatics, 20(Suppl. 1):i326-i333, August 2004 (article)

Abstract
Motivation: The diffusion kernel is a general method for computing pairwise distances among all nodes in a graph, based on the sum of weighted paths between each pair of nodes. This technique has been used successfully, in conjunction with kernel-based learning methods, to draw inferences from several types of biological networks. Results: We show that computing the diffusion kernel is equivalent to maximizing the von Neumann entropy, subject to a global constraint on the sum of the Euclidean distances between nodes. This global constraint allows for high variance in the pairwise distances. Accordingly, we propose an alternative, locally constrained diffusion kernel, and we demonstrate that the resulting kernel allows for more accurate support vector machine prediction of protein functional classifications from metabolic and protein–protein interaction networks.

PDF Web [BibTex]

PDF Web [BibTex]


no image
Masking effect produced by Mach bands on the detection of narrow bars of random polarity

Henning, GB., Hoddinott, KT., Wilson-Smith, ZJ., Hill, NJ.

Journal of the Optical Society of America, 21(8):1379-1387, A, August 2004 (article)

[BibTex]

[BibTex]


no image
Support Vector Channel Selection in BCI

Lal, T., Schröder, M., Hinterberger, T., Weston, J., Bogdan, M., Birbaumer, N., Schölkopf, B.

IEEE Transactions on Biomedical Engineering, 51(6):1003-1010, June 2004 (article)

Abstract
Designing a Brain Computer Interface (BCI) system one can choose from a variety of features that may be useful for classifying brain activity during a mental task. For the special case of classifying EEG signals we propose the usage of the state of the art feature selection algorithms Recursive Feature Elimination and Zero-Norm Optimization which are based on the training of Support Vector Machines (SVM). These algorithms can provide more accurate solutions than standard filter methods for feature selection. We adapt the methods for the purpose of selecting EEG channels. For a motor imagery paradigm we show that the number of used channels can be reduced significantly without increasing the classification error. The resulting best channels agree well with the expected underlying cortical activity patterns during the mental tasks. Furthermore we show how time dependent task specific information can be visualized.

DOI [BibTex]

DOI [BibTex]


no image
Distance-Based Classification with Lipschitz Functions

von Luxburg, U., Bousquet, O.

Journal of Machine Learning Research, 5, pages: 669-695, June 2004 (article)

Abstract
The goal of this article is to develop a framework for large margin classification in metric spaces. We want to find a generalization of linear decision functions for metric spaces and define a corresponding notion of margin such that the decision function separates the training points with a large margin. It will turn out that using Lipschitz functions as decision functions, the inverse of the Lipschitz constant can be interpreted as the size of a margin. In order to construct a clean mathematical setup we isometrically embed the given metric space into a Banach space and the space of Lipschitz functions into its dual space. To analyze the resulting algorithm, we prove several representer theorems. They state that there always exist solutions of the Lipschitz classifier which can be expressed in terms of distance functions to training points. We provide generalization bounds for Lipschitz classifiers in terms of the Rademacher complexities of some Lipschitz function classes. The generality of our approach can be seen from the fact that several well-known algorithms are special cases of the Lipschitz classifier, among them the support vector machine, the linear programming machine, and the 1-nearest neighbor classifier.

PDF PostScript PDF [BibTex]

PDF PostScript PDF [BibTex]


no image
cDNA-Microarray Technology in Cartilage Research - Functional Genomics of Osteoarthritis [in German]

Aigner, T., Finger, F., Zien, A., Bartnik, E.

Zeitschrift f{\"u}r Orthop{\"a}die und ihre Grenzgebiete, 142(2):241-247, April 2004 (article)

Abstract
Functional genomics represents a new challenging approach in order to analyze complex diseases such as osteoarthritis on a molecular level. The characterization of the molecular changes of the cartilage cells, the chondrocytes, enables a better understanding of the pathomechanisms of the disease. In particular, the identification and characterization of new target molecules for therapeutic intervention is of interest. Also, potential molecular markers for diagnosis and monitoring of osteoarthritis contribute to a more appropriate patient management. The DNA-microarray technology complements (but does not replace) biochemical and biological research in new disease-relevant genes. Large-scale functional genomics will identify molecular networks such as yet identified players in the anabolic-catabolic balance of articular cartilage as well as disease-relevant intracellular signaling cascades so far rather unknown in articular chondrocytes. However, at the moment it is also important to recognize the limitations of the microarray technology in order to avoid over-interpretation of the results. This might lead to misleading results and prevent to a significant extent a proper use of the potential of this technology in the field of osteoarthritis.

[BibTex]

[BibTex]


no image
A Compression Approach to Support Vector Model Selection

von Luxburg, U., Bousquet, O., Schölkopf, B.

Journal of Machine Learning Research, 5, pages: 293-323, April 2004 (article)

Abstract
In this paper we investigate connections between statistical learning theory and data compression on the basis of support vector machine (SVM) model selection. Inspired by several generalization bounds we construct "compression coefficients" for SVMs which measure the amount by which the training labels can be compressed by a code built from the separating hyperplane. The main idea is to relate the coding precision to geometrical concepts such as the width of the margin or the shape of the data in the feature space. The so derived compression coefficients combine well known quantities such as the radius-margin term R^2/rho^2, the eigenvalues of the kernel matrix, and the number of support vectors. To test whether they are useful in practice we ran model selection experiments on benchmark data sets. As a result we found that compression coefficients can fairly accurately predict the parameters for which the test error is minimized.

PDF [BibTex]

PDF [BibTex]