Header logo is



no image
Analytical probabilistic modeling of RBE-weighted dose for ion therapy

Wieser, H., Hennig, P., Wahl, N., Bangert, M.

Physics in Medicine and Biology (PMB), 62(23):8959-8982, 2017 (article)

pn

link (url) [BibTex]

link (url) [BibTex]


no image
On Maximum Entropy and Inference

Gresele, L., Marsili, M.

Entropy, 19(12):article no. 642, 2017 (article)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
Towards Engagement Models that Consider Individual Factors in HRI: On the Relation of Extroversion and Negative Attitude Towards Robots to Gaze and Speech During a Human-Robot Assembly Task

Ivaldi, S., Lefort, S., Peters, J., Chetouani, M., Provasi, J., Zibetti, E.

International Journal of Social Robotics, 9(1):63-86, 2017 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Non-parametric Policy Search with Limited Information Loss

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

Journal of Machine Learning Research , 18(73):1-46, 2017 (article)

ei

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Stability of Controllers for Gaussian Process Dynamics

Vinogradska, J., Bischoff, B., Nguyen-Tuong, D., Peters, J.

Journal of Machine Learning Research, 18(100):1-37, 2017 (article)

ei

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Two-sample tests for large random graphs using network statistics

Ghoshdastidar, D., Gutzeit, M., Carpentier, A., von Luxburg, U.

In Conference on Computational Learning Theory (COLT), Conference on Computational Learning Theory (COLT), 2017 (inproceedings)

slt

Project Page [BibTex]

Project Page [BibTex]


no image
SUV-quantification of physiological lung tissue in an integrated PET/MR-system: Impact of lung density and bone tissue

Seith, F., Schmidt, H., Gatidis, S., Bezrukov, I., Schraml, C., Pfannenberg, C., la Fougère, C., Nikolaou, K., Schwenzer, N.

PLOS ONE, 12(5):1-13, 2017 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Corrosion-protected hybrid nanoparticles

Jeong, H., Alarcón-Correa, M., Mark, A. G., Son, K., Lee, T., Fischer, P.

{Advanced Science}, 4(12), Wiley-VCH, Weinheim, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Investigation of the Dzyaloshinskii-Moriya interaction and room temperature skyrmions in W/CoFeB/MgO thin films and microwires

Jaiswal, S., Litzius, K., Lemesh, I., Büttner, F., Finizio, S., Raabe, J., Weigand, M., Lee, K., Langer, J., Ocker, B., Jakob, G., Beach, G. S. D., Kläui, M.

{Applied Physics Letters}, 111(2), American Institute of Physics, Melville, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Ultrafast demagnetization after femtosecond laser pulses: Transfer of angular momentum from the electronic system to magnetoelastic spin-phonon modes

Fähnle, M., Tsatsoulis, T., Illg, C., Haag, M., Müller, B. Y., Zhang, L.

{Journal of Superconductivity and Novel Magnetism}, 30(5):1381-1387, Springer Science + Business Media B.V., New York, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Magnetic behavior of single chain magnets in metal organic frameworks CPO-27-Co

Son, K., Goering, E., Hirscher, M., Oh, H.

{Journal of Nanoscience and Nanotechnology}, 17(10):7541-7546, American Scientific Publishers, Stevenson Ranch, Calif., 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Switching by domain-wall automotion in asymmetric ferromagnetic rings

Mawass, M., Richter, K., Bisig, A., Reeve, R. M., Krüger, B., Weigand, M., Stoll, H., Krone, A., Kronast, F., Schütz, G., Kläui, M.

{Physical Review Applied}, 7(4), American Physical Society, College Park, Md. [u.a.], 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Pattern Generation for Walking on Slippery Terrains

Khadiv, M., Moosavian, S. A. A., Herzog, A., Righetti, L.

In 2017 5th International Conference on Robotics and Mechatronics (ICROM), Iran, August 2017 (inproceedings)

Abstract
In this paper, we extend state of the art Model Predictive Control (MPC) approaches to generate safe bipedal walking on slippery surfaces. In this setting, we formulate walking as a trade off between realizing a desired walking velocity and preserving robust foot-ground contact. Exploiting this for- mulation inside MPC, we show that safe walking on various flat terrains can be achieved by compromising three main attributes, i. e. walking velocity tracking, the Zero Moment Point (ZMP) modulation, and the Required Coefficient of Friction (RCoF) regulation. Simulation results show that increasing the walking velocity increases the possibility of slippage, while reducing the slippage possibility conflicts with reducing the tip-over possibility of the contact and vice versa.

mg

link (url) [BibTex]

link (url) [BibTex]


no image
A neutral atom moving in an external magnetic field does not feel a Lorentz force

Fähnle, M.

{American Journal of Modern Physics}, 6(6):153-155, Science Publishing Group, New York, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Temperature-dependent first-order reversal curve measurements on unusually hard magnetic low-temperature phase of MnBi

Muralidhar, S., Gräfe, J., Chen, Y., Etter, M., Gregori, G., Ener, S., Sawatzki, S., Hono, K., Gutfleisch, O., Kronmüller, H., Schütz, G., Goering, E. J.

{Physical Review B}, 95(2), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Smooth and rapid microwave synthesis of MIL-53(Fe) including superparamagnetic \textlessgamma\textgreater-Fe2O3 nanoparticles

Wengert, S., Albrecht, J., Ruoß, S., Stahl, C., Schütz, G., Schäfer, R.

{Journal of Magnetism and Magnetic Materials}, 444, pages: 168-172, NH, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Characterization and differentiation of rock varnish types from different environments by microanalytical techniques

Macholdt, D. S., Jochum, K. P., Pöhlker, C., Arangio, A., Förster, J., Stoll, B., Weis, U., Weber, B., Müller, M., Kappl, M., Shiraiwa, M., Kilcoyne, A. L. D., Weigand, M., Scholz, D., Haug, G. H., Al-Amri, A., Andreae, M. O.

{Chemical Geology}, 459, pages: 91-118, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Skyrmion Hall effect revealed by direct time-resolved X-ray microscopy

Litzius, K., Lemesh, I., Krüger, B., Bassirian, P., Caretta, L., Richter, K., Büttner, F., Sato, K., Tretiakov, O. A., Förster, J., Reeve, R. M., Weigand, M., Bykova, I., Stoll, H., Schütz, G., Beach, G. S. D., Kläui, M.

{Nature Physics}, 13(2):170-175, Nature Pub. Group, London, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Is Growing Good for Learning?

Heim, Steve, Spröwitz, Alexander

In Proceedings of the 8th International Symposium on Adaptive Motion of Animals and Machines AMAM2017, Hokkaido, Japan, 2017 (inproceedings)

[BibTex]

[BibTex]


no image
Comment on magnonic black holes

Fähnle, M., Schütz, G.

{Journal of Magnetism and Magnetic Materials}, 444, pages: 146-146, NH, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Cr-Substitution in Ba2In2O5 \mbox⋅ (H2O)x (x \textequals 0.16, 0.74)

Yoon, S., Son, K., Hagemann, H., Widenmeyer, M., Weidenkaff, A.

{Solid State Sciences}, 73, pages: 1-6, Elsevier Masson SAS, Paris, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Comment on half-integer quantum numbers for the total angular momentum of photons in light beams with finite lateral extensions

Fähnle, M.

{American Journal of Modern Physics}, 6(5):88-90, Science Publishing Group, New York, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Advanced magneto-optical Kerr effect measurements of superconductors at low temperatures

Stahl, C., Gräfe, J., Ruoß, S., Zahn, P., Bayer, J., Simmendinger, J., Schütz, G., Albrecht, J.

{AIP Advances}, 7(10), 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Unifying ultrafast demagnetization and intrinsic Gilbert damping in Co/Ni bilayers with electronic relaxation near the Fermi surface

Zhang, W., He, W., Zhang, X.-Q., Cheng, Z.-H., Teng, J., Fähnle, M.

{Physical Review B}, 96(22), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Influence of the skin barrier on the penetration of topically-applied dexamethasone probed by soft X-ray spectromicroscopy

Yamamoto, K., Klossek, A., Flesch, R., Rancan, F., Weigand, M., Bykova, I., Bechtel, M., Ahlberg, S., Vogt, A., Blume-Peytavi, U., Schrade, P., Bachmann, S., Hedtrich, S., Schäfer-Korting, M., Rühl, E.

{European Journal of Pharmaceutics and Biopharmaceutics}, 118, pages: 30-37, Elsevier, Amsterdam, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Capture of heavy hydrogen isotopes in a metal-organic framework with active Cu(I) sites

Weinrauch, I., Savchenko, I., Denysenko, D., Souliou, S. M., Kim, H., Le Tacon, M., Daemen, L. L., Cheng, Y., Mavrandonakis, A., Ramirez-Cuesta, A. J., Volkmer, D., Schütz, G., Hirscher, M., Heine, T.

{Nature Communications}, 8, Nature Publishing Group, London, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Multiscale simulations of topological transformations in magnetic-skyrmion spin structures

De Lucia, A., Litzius, K., Krüger, B., Tretiakov, O. A., Kläui, M.

{Physical Review B}, 96(2), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Unexpectedly marginal effect of electronic correlations on ultrafast demagnetization after femtosecond laser-pulse excitation

Weng, W., Huang, Haonan, Briones Paz, J. Z., Teeny, N., Müller, B. Y., Haag, M., Kuhn, T., Fähnle, M.

{Physical Review B}, 95(22), American Physical Society, Woodbury, NY, 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Black manganese-rich crusts on a Gothic cathedral

Macholdt, D. S., Herrmann, S., Jochum, K. P., Kilcoyne, A. L. D., Laubscher, T., Pfisterer, H. K., Pöhlker, C., Schwager, B., Weber, B., Weigand, M., Domke, K. F., Andreae, M. O.

{Atmospheric Environment}, 171, pages: 205-220, Elsevier, Amsterdam [u.a.], 2017 (article)

mms

DOI [BibTex]

DOI [BibTex]

2006


no image
Conformal Multi-Instance Kernels

Blaschko, M., Hofmann, T.

In NIPS 2006 Workshop on Learning to Compare Examples, pages: 1-6, NIPS Workshop on Learning to Compare Examples, December 2006 (inproceedings)

Abstract
In the multiple instance learning setting, each observation is a bag of feature vectors of which one or more vectors indicates membership in a class. The primary task is to identify if any vectors in the bag indicate class membership while ignoring vectors that do not. We describe here a kernel-based technique that defines a parametric family of kernels via conformal transformations and jointly learns a discriminant function over bags together with the optimal parameter settings of the kernel. Learning a conformal transformation effectively amounts to weighting regions in the feature space according to their contribution to classification accuracy; regions that are discriminative will be weighted higher than regions that are not. This allows the classifier to focus on regions contributing to classification accuracy while ignoring regions that correspond to vectors found both in positive and in negative bags. We show how parameters of this transformation can be learned for support vector machines by posing the problem as a multiple kernel learning problem. The resulting multiple instance classifier gives competitive accuracy for several multi-instance benchmark datasets from different domains.

ei

PDF Web [BibTex]

2006


PDF Web [BibTex]


no image
Structure validation of the Josephin domain of ataxin-3: Conclusive evidence for an open conformation

Nicastro, G., Habeck, M., Masino, L., Svergun, DI., Pastore, A.

Journal of Biomolecular NMR, 36(4):267-277, December 2006 (article)

Abstract
The availability of new and fast tools in structure determination has led to a more than exponential growth of the number of structures solved per year. It is therefore increasingly essential to assess the accuracy of the new structures by reliable approaches able to assist validation. Here, we discuss a specific example in which the use of different complementary techniques, which include Bayesian methods and small angle scattering, resulted essential for validating the two currently available structures of the Josephin domain of ataxin-3, a protein involved in the ubiquitin/proteasome pathway and responsible for neurodegenerative spinocerebellar ataxia of type 3. Taken together, our results demonstrate that only one of the two structures is compatible with the experimental information. Based on the high precision of our refined structure, we show that Josephin contains an open cleft which could be directly implicated in the interaction with polyubiquitin chains and other partners.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
A Unifying View of Wiener and Volterra Theory and Polynomial Kernel Regression

Franz, M., Schölkopf, B.

Neural Computation, 18(12):3097-3118, December 2006 (article)

Abstract
Volterra and Wiener series are perhaps the best understood nonlinear system representations in signal processing. Although both approaches have enjoyed a certain popularity in the past, their application has been limited to rather low-dimensional and weakly nonlinear systems due to the exponential growth of the number of terms that have to be estimated. We show that Volterra and Wiener series can be represented implicitly as elements of a reproducing kernel Hilbert space by utilizing polynomial kernels. The estimation complexity of the implicit representation is linear in the input dimensionality and independent of the degree of nonlinearity. Experiments show performance advantages in terms of convergence, interpretability, and system sizes that can be handled.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Adapting Spatial Filter Methods for Nonstationary BCIs

Tomioka, R., Hill, J., Blankertz, B., Aihara, K.

In IBIS 2006, pages: 65-70, 2006 Workshop on Information-Based Induction Sciences, November 2006 (inproceedings)

Abstract
A major challenge in applying machine learning methods to Brain-Computer Interfaces (BCIs) is to overcome the possible nonstationarity in the data from the datablock the method is trained on and that the method is applied to. Assuming the joint distributions of the whitened signal and the class label to be identical in two blocks, where the whitening is done in each block independently, we propose a simple adaptation formula that is applicable to a broad class of spatial filtering methods including ICA, CSP, and logistic regression classifiers. We characterize the class of linear transformations for which the above assumption holds. Experimental results on 60 BCI datasets show improved classification accuracy compared to (a) fixed spatial filter approach (no adaptation) and (b) fixed spatial pattern approach (proposed by Hill et al., 2006 [1]).

ei

PDF [BibTex]

PDF [BibTex]


no image
Statistical Analysis of Slow Crack Growth Experiments

Pfingsten, T., Glien, K.

Journal of the European Ceramic Society, 26(15):3061-3065, November 2006 (article)

Abstract
A common approach for the determination of Slow Crack Growth (SCG) parameters are the static and dynamic loading method. Since materials with small Weibull module show a large variability in strength, a correct statistical analysis of the data is indispensable. In this work we propose the use of the Maximum Likelihood method and a Baysian analysis, which, in contrast to the standard procedures, take into account that failure strengths are Weibull distributed. The analysis provides estimates for the SCG parameters, the Weibull module, and the corresponding confidence intervals and overcomes the necessity of manual differentiation between inert and fatigue strength data. We compare the methods to a Least Squares approach, which can be considered the standard procedure. The results for dynamic loading data from the glass sealing of MEMS devices show that the assumptions inherent to the standard approach lead to significantly different estimates.

ei

PDF PDF DOI [BibTex]

PDF PDF DOI [BibTex]


no image
Mining frequent stem patterns from unaligned RNA sequences

Hamada, M., Tsuda, K., Kudo, T., Kin, T., Asai, K.

Bioinformatics, 22(20):2480-2487, October 2006 (article)

Abstract
Motivation: In detection of non-coding RNAs, it is often necessary to identify the secondary structure motifs from a set of putative RNA sequences. Most of the existing algorithms aim to provide the best motif or few good motifs, but biologists often need to inspect all the possible motifs thoroughly. Results: Our method RNAmine employs a graph theoretic representation of RNA sequences, and detects all the possible motifs exhaustively using a graph mining algorithm. The motif detection problem boils down to finding frequently appearing patterns in a set of directed and labeled graphs. In the tasks of common secondary structure prediction and local motif detection from long sequences, our method performed favorably both in accuracy and in efficiency with the state-of-the-art methods such as CMFinder.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Large-Scale Gene Expression Profiling Reveals Major Pathogenetic Pathways of Cartilage Degeneration in Osteoarthritis

Aigner, T., Fundel, K., Saas, J., Gebhard, P., Haag, J., Weiss, T., Zien, A., Obermayr, F., Zimmer, R., Bartnik, E.

Arthritis and Rheumatism, 54(11):3533-3544, October 2006 (article)

Abstract
Objective. Despite many research efforts in recent decades, the major pathogenetic mechanisms of osteo- arthritis (OA), including gene alterations occurring during OA cartilage degeneration, are poorly under- stood, and there is no disease-modifying treatment approach. The present study was therefore initiated in order to identify differentially expressed disease-related genes and potential therapeutic targets. Methods. This investigation consisted of a large gene expression profiling study performed based on 78 normal and disease samples, using a custom-made complementar y DNA array covering >4,000 genes. Results. Many differentially expressed genes were identified, including the expected up-regulation of ana- bolic and catabolic matrix genes. In particular, the down-regulation of important oxidative defense genes, i.e., the genes for superoxide dismutases 2 and 3 and glutathione peroxidase 3, was prominent. This indicates that continuous oxidative stress to the cells and the matrix is one major underlying pathogenetic mecha- nism in OA. Also, genes that are involved in the phenot ypic stabilit y of cells, a feature that is greatly reduced in OA cartilage, appeared to be suppressed. Conclusion. Our findings provide a reference data set on gene alterations in OA cartilage and, importantly, indicate major mechanisms underlying central cell bio- logic alterations that occur during the OA disease process. These results identify molecular targets that can be further investigated in the search for therapeutic interventions.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
A Linear Programming Approach for Molecular QSAR analysis

Saigo, H., Kadowaki, T., Tsuda, K.

In MLG 2006, pages: 85-96, (Editors: Gärtner, T. , G. C. Garriga, T. Meinl), International Workshop on Mining and Learning with Graphs, September 2006, Best Paper Award (inproceedings)

Abstract
Small molecules in chemistry can be represented as graphs. In a quantitative structure-activity relationship (QSAR) analysis, the central task is to find a regression function that predicts the activity of the molecule in high accuracy. Setting a QSAR as a primal target, we propose a new linear programming approach to the graph-based regression problem. Our method extends the graph classification algorithm by Kudo et al. (NIPS 2004), which is a combination of boosting and graph mining. Instead of sequential multiplicative updates, we employ the linear programming boosting (LP) for regression. The LP approach allows to include inequality constraints for the parameter vector, which turns out to be particularly useful in QSAR tasks where activity values are sometimes unavailable. Furthermore, the efficiency is improved significantly by employing multiple pricing.

ei

PDF PDF [BibTex]

PDF PDF [BibTex]


no image
Incremental Aspect Models for Mining Document Streams

Surendran, A., Sra, S.

In PKDD 2006, pages: 633-640, (Editors: Fürnkranz, J. , T. Scheffer, M. Spiliopoulou), Springer, Berlin, Germany, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, September 2006 (inproceedings)

Abstract
In this paper we introduce a novel approach for incrementally building aspect models, and use it to dynamically discover underlying themes from document streams. Using the new approach we present an application which we call “query-line tracking” i.e., we automatically discover and summarize different themes or stories that appear over time, and that relate to a particular query. We present evaluation on news corpora to demonstrate the strength of our method for both query-line tracking, online indexing and clustering.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
Implicit Surface Modelling with a Globally Regularised Basis of Compact Support

Walder, C., Schölkopf, B., Chapelle, O.

Computer Graphics Forum, 25(3):635-644, September 2006 (article)

Abstract
We consider the problem of constructing a globally smooth analytic function that represents a surface implicitly by way of its zero set, given sample points with surface normal vectors. The contributions of the paper include a novel means of regularising multi-scale compactly supported basis functions that leads to the desirable interpolation properties previously only associated with fully supported bases. We also provide a regularisation framework for simpler and more direct treatment of surface normals, along with a corresponding generalisation of the representer theorem lying at the core of kernel-based machine learning methods. We demonstrate the techniques on 3D problems of up to 14 million data points, as well as 4D time series data and four-dimensional interpolation between three-dimensional shapes.

ei

PDF GZIP DOI [BibTex]


no image
PALMA: Perfect Alignments using Large Margin Algorithms

Rätsch, G., Hepp, B., Schulze, U., Ong, C.

In GCB 2006, pages: 104-113, (Editors: Huson, D. , O. Kohlbacher, A. Lupas, K. Nieselt, A. Zell), Gesellschaft für Informatik, Bonn, Germany, German Conference on Bioinformatics, September 2006 (inproceedings)

Abstract
Despite many years of research on how to properly align sequences in the presence of sequencing errors, alternative splicing and micro-exons, the correct alignment of mRNA sequences to genomic DNA is still a challenging task. We present a novel approach based on large margin learning that combines kernel based splice site predictions with common sequence alignment techniques. By solving a convex optimization problem, our algorithm -- called PALMA -- tunes the parameters of the model such that the true alignment scores higher than all other alignments. In an experimental study on the alignments of mRNAs containing artificially generated micro-exons, we show that our algorithm drastically outperforms all other methods: It perfectly aligns all 4358 sequences on an hold-out set, while the best other method misaligns at least 90 of them. Moreover, our algorithm is very robust against noise in the query sequence: when deleting, inserting, or mutating up to 50% of the query sequence, it still aligns 95% of all sequences correctly, while other methods achieve less than 36% accuracy. For datasets, additional results and a stand-alone alignment tool see http://www.fml.mpg.de/raetsch/projects/palma.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Graph Based Semi-Supervised Learning with Sharper Edges

Shin, H., Hill, N., Rätsch, G.

In ECML 2006, pages: 401-412, (Editors: Fürnkranz, J. , T. Scheffer, M. Spiliopoulou), Springer, Berlin, Germany, 17th European Conference on Machine Learning (ECML), September 2006 (inproceedings)

Abstract
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points‘ (often symmetric)relationships in input space, without considering directionality. However, relationships may be more informative in one direction (e.g. from labelled to unlabelled) than in the reverse direction, and some relationships (e.g. strong weights between oppositely labelled points) are unhelpful in either direction. Undesirable edges may reduce the amount of influence an informative point can propagate to its neighbours -- the point and its outgoing edges have been ``blunted.‘‘ We present an approach to ``sharpening‘‘ in which weights are adjusted to meet an optimization criterion wherever they are directed towards labelled points. This principle can be applied to a wide variety of algorithms. In the current paper, we present one ad hoc solution satisfying the principle, in order to show that it can improve performance on a number of publicly available benchmark data sets.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Finite-Horizon Optimal State-Feedback Control of Nonlinear Stochastic Systems Based on a Minimum Principle

Deisenroth, MP., Ohtsuka, T., Weissel, F., Brunn, D., Hanebeck, UD.

In MFI 2006, pages: 371-376, (Editors: Hanebeck, U. D.), IEEE Service Center, Piscataway, NJ, USA, 6th IEEE International Conference on Multisensor Fusion and Integration, September 2006 (inproceedings)

Abstract
In this paper, an approach to the finite-horizon optimal state-feedback control problem of nonlinear, stochastic, discrete-time systems is presented. Starting from the dynamic programming equation, the value function will be approximated by means of Taylor series expansion up to second-order derivatives. Moreover, the problem will be reformulated, such that a minimum principle can be applied to the stochastic problem. Employing this minimum principle, the optimal control problem can be rewritten as a two-point boundary-value problem to be solved at each time step of a shrinking horizon. To avoid numerical problems, the two-point boundary-value problem will be solved by means of a continuation method. Thus, the curse of dimensionality of dynamic programming is avoided, and good candidates for the optimal state-feedback controls are obtained. The proposed approach will be evaluated by means of a scalar example system.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Uniform Convergence of Adaptive Graph-Based Regularization

Hein, M.

In COLT 2006, pages: 50-64, (Editors: Lugosi, G. , H.-U. Simon), Springer, Berlin, Germany, 19th Annual Conference on Learning Theory, September 2006 (inproceedings)

Abstract
The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying manifold structure and second to the density of the data-generating probability measure. We identify in this paper the limit of the regularizer and show uniform convergence over the space of Hoelder functions. As an intermediate step we derive upper bounds on the covering numbers of Hoelder functions on compact Riemannian manifolds, which are of independent interest for the theoretical analysis of manifold-based learning methods.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Regularised CSP for Sensor Selection in BCI

Farquhar, J., Hill, N., Lal, T., Schölkopf, B.

In Proceedings of the 3rd International Brain-Computer Interface Workshop and Training Course 2006, pages: 14-15, (Editors: GR Müller-Putz and C Brunner and R Leeb and R Scherer and A Schlögl and S Wriessnegger and G Pfurtscheller), Verlag der Technischen Universität Graz, Graz, Austria, 3rd International Brain-Computer Interface Workshop and Training Course, September 2006 (inproceedings)

Abstract
The Common Spatial Pattern (CSP) algorithm is a highly successful method for efficiently calculating spatial filters for brain signal classification. Spatial filtering can improve classification performance considerably, but demands that a large number of electrodes be mounted, which is inconvenient in day-to-day BCI usage. The CSP algorithm is also known for its tendency to overfit, i.e. to learn the noise in the training set rather than the signal. Both problems motivate an approach in which spatial filters are sparsified. We briefly sketch a reformulation of the problem which allows us to do this, using 1-norm regularisation. Focusing on the electrode selection issue, we present preliminary results on EEG data sets that suggest that effective spatial filters may be computed with as few as 10--20 electrodes, hence offering the potential to simplify the practical realisation of BCI systems significantly.

ei

PDF PDF [BibTex]

PDF PDF [BibTex]


no image
Time-Dependent Demixing of Task-Relevant EEG Signals

Hill, N., Farquhar, J., Lal, T., Schölkopf, B.

In Proceedings of the 3rd International Brain-Computer Interface Workshop and Training Course 2006, pages: 20-21, (Editors: GR Müller-Putz and C Brunner and R Leeb and R Scherer and A Schlögl and S Wriessnegger and G Pfurtscheller), Verlag der Technischen Universität Graz, Graz, Austria, 3rd International Brain-Computer Interface Workshop and Training Course, September 2006 (inproceedings)

Abstract
Given a spatial filtering algorithm that has allowed us to identify task-relevant EEG sources, we present a simple approach for monitoring the activity of these sources while remaining relatively robust to changes in other (task-irrelevant) brain activity. The idea is to keep spatial *patterns* fixed rather than spatial filters, when transferring from training to test sessions or from one time window to another. We show that a fixed spatial pattern (FSP) approach, using a moving-window estimate of signal covariances, can be more robust to non-stationarity than a fixed spatial filter (FSF) approach.

ei

PDF PDF [BibTex]

PDF PDF [BibTex]


no image
A Sober Look at Clustering Stability

Ben-David, S., von Luxburg, U., Pal, D.

In COLT 2006, pages: 5-19, (Editors: Lugosi, G. , H.-U. Simon), Springer, Berlin, Germany, 19th Annual Conference on Learning Theory, September 2006 (inproceedings)

Abstract
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clusters. In spite of the popularity of stability in practical applications, there has been very little theoretical analysis of this notion. In this paper we provide a formal definition of stability and analyze some of its basic properties. Quite surprisingly, the conclusion of our analysis is that for large sample size, stability is fully determined by the behavior of the objective function which the clustering algorithm is aiming to minimize. If the objective function has a unique global minimizer, the algorithm is stable, otherwise it is unstable. In particular we conclude that stability is not a well-suited tool to determine the number of clusters - it is determined by the symmetries of the data which may be unrelated to clustering parameters. We prove our results for center-based clusterings and for spectral clustering, and support our conclusions by many examples in which the behavior of stability is counter-intuitive.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Information Marginalization on Subgraphs

Huang, J., Zhu, T., Rereiner, R., Zhou, D., Schuurmans, D.

In ECML/PKDD 2006, pages: 199-210, (Editors: Fürnkranz, J. , T. Scheffer, M. Spiliopoulou), Springer, Berlin, Germany, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, September 2006 (inproceedings)

Abstract
Real-world data often involves objects that exhibit multiple relationships; for example, ‘papers’ and ‘authors’ exhibit both paper-author interactions and paper-paper citation relationships. A typical learning problem requires one to make inferences about a subclass of objects (e.g. ‘papers’), while using the remaining objects and relations to provide relevant information. We present a simple, unified mechanism for incorporating information from multiple object types and relations when learning on a targeted subset. In this scheme, all sources of relevant information are marginalized onto the target subclass via random walks. We show that marginalized random walks can be used as a general technique for combining multiple sources of information in relational data. With this approach, we formulate new algorithms for transduction and ranking in relational data, and quantify the performance of new schemes on real world data—achieving good results in many problems.

ei

Web DOI [BibTex]

Web DOI [BibTex]