Header logo is


2008


no image
Colloidal cobalt-doped ZnO nanorods: synthesis, structural, and magnetic properties

Büsgen, T., Hilgendorff, M., Irsen, S., Wilhelm, F., Rogalev, A., Goll, D., Giersig, M.

{Journal of Physical Chemistry C}, 112(7):2412-2417, 2008 (article)

mms

DOI [BibTex]

2008


DOI [BibTex]


no image
Raman studies of hydrogen adsorbed on nanostructured porous materials

Panella, B., Hirscher, M.

{Physical Chemistry Chemical Physics}, 10, pages: 2910-2917, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Thermal evolution and grain boundary phase transformations in severely deformed nanograined Al-Zn alloys

Straumal, B., Valiev, R., Kogtenkova, O., Zieba, P., Czeppe, T., Bielanska, E., Faryna, M.

{Acta Materialia}, 56(20):6123-6131, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Hydrogen storage properties of Pd nanoparticle/carbon template composites

Campesi, R., Cuevas, F., Gadiou, R., Leroy, E., Hirscher, M., Vix-Guterl, C., Latroche, M.

{Carbon}, 46, pages: 206-214, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Reversible transformation of a grain-boundary facet into a rough-to-rough ridge in zinc

Straumal, B. B., Gornakova, A. S., Sursaeva, V. G.

{Philosophical Magazine Letters}, 88(1):27-36, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Efficient inverse kinematics algorithms for highdimensional movement systems

Tevatia, G., Schaal, S.

CLMC Technical Report: TR-CLMC-2008-1, 2008, clmc (techreport)

Abstract
Real-time control of the endeffector of a humanoid robot in external coordinates requires computationally efficient solutions of the inverse kinematics problem. In this context, this paper investigates methods of resolved motion rate control (RMRC) that employ optimization criteria to resolve kinematic redundancies. In particular we focus on two established techniques, the pseudo inverse with explicit optimization and the extended Jacobian method. We prove that the extended Jacobian method includes pseudo-inverse methods as a special solution. In terms of computational complexity, however, pseudo-inverse and extended Jacobian differ significantly in favor of pseudo-inverse methods. Employing numerical estimation techniques, we introduce a computationally efficient version of the extended Jacobian with performance comparable to the original version. Our results are illustrated in simulation studies with a multiple degree-offreedom robot, and were evaluated on an actual 30 degree-of-freedom full-body humanoid robot.

am

link (url) [BibTex]

link (url) [BibTex]


no image
A library for locally weighted projection regression

Klanke, S., Vijayakumar, S., Schaal, S.

Journal of Machine Learning Research, 9, pages: 623-626, 2008, clmc (article)

Abstract
In this paper we introduce an improved implementation of locally weighted projection regression (LWPR), a supervised learning algorithm that is capable of handling high-dimensional input data. As the key features, our code supports multi-threading, is available for multiple platforms, and provides wrappers for several programming languages.

am

link (url) [BibTex]

link (url) [BibTex]


no image
Preface to the Journal of Micro-Nano Mechatronics

Dario, P., Fukuda, T., Sitti, M.

Journal of Micro-Nano Mechatronics, 4(1-2):1-1, Springer-Verlag, 2008 (article)

pi

[BibTex]

[BibTex]


no image
A legged anchoring mechanism for capsule endoscopes using micropatterned adhesives

Glass, P., Cheung, E., Sitti, M.

IEEE Transactions on Biomedical Engineering, 55(12):2759-2767, IEEE, 2008 (article)

pi

Project Page [BibTex]

Project Page [BibTex]


no image
The hole is important! The quest for ferromagnetism in doped ZnO

Tietze, T., Gacic, M., Schütz, G., Jakob, G., Brück, S., Goering, E.

{BESSY Highlights 2007}, pages: 14-15, 2008 (article)

mms

[BibTex]

[BibTex]


no image
Limitations of a simple quantum mechanical model: Magnetic dichroism in a relativistic one-electron atom

Rodr\’\iguez, J. C., Kostoglou, C., Singer, R., Seib, J., Fähnle, M.

{Physica Status Solidi (B)}, 245(4):735-739, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Impact of irradiation-induced point defects on electronically and ionically induced magnetic relaxation mechanisms in titano-magnetites

Walz, F., Brabers, V. A. M., Kronmüller, H.

{Physica Status Solidi (A)}, 205(12):2934-2942, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Polarization selective magnetic vortex dynamics and core reversal in rotating magnetic fields

Curcic, M., van Waeyenberge, B., Vansteenkiste, A., Weigand, M., Sackmann, V., Stoll, H., Fähnle, M., Tyliszczak, T., Woltersdorf, G., Back, C. H., Schütz, G.

{Physical Review Letters}, 101, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
X-ray spectroscopic investigations of Zn0.94Co0.06O thin films

Mayer, G., Fonin, M., Voss, S., Rüdiger, U., Goering, E.

{IEEE Transactions on Magnetics}, 44(11):2700-2703, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Experimental realization of graded L10-FePt/Fe composite media with perpendicular magnetization

Goll, D., Breitling, A., Gu, L., van Aken, P. A., Sigle, W.

{Journal of Applied Physics}, 104, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Hard magnetic L10 FePt thin films and nanopatterns

Breitling, A., Goll, D.

{Journal of Magnetism and Magnetic Materials}, 320, pages: 1449-1456, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Ma\ssgeschneiderte Speichermaterialien

Hirscher, M.

In Von Brennstoffzellen bis Leuchtdioden (Energie und Chemie - Ein Bündnis für die Zukunft), pages: 31-33, Deutsche Bunsen-Gesellschaft für Physikalische Chemie e.V., Frankfurt am Main, 2008 (incollection)

mms

[BibTex]

[BibTex]


no image
Spin-reorientation transition in Co/Pt multilayers on nanospheres

Eimüller, T., Ulbrich, T. C., Amaladass, E., Guhr, I. L., Tyliszczak, T., Albrecht, M.

{Physical Review B}, 77, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Non-destructive compositional analysis of historic organ reed pipes

Manescu, A., Fiori, F., Giuliani, A., Kardjilov, N., Kasztovszky, Z., Rustichelli, F., Straumal, B.

{Journal of Physics: Condensed Matter}, 20, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
An advanced magnetic reflectometer

Brück, S., Bauknecht, S., Ludescher, B., Goering, E., Schütz, G.

{Review of Scientific Instruments}, 79, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Optimization strategies in human reinforcement learning

Hoffmann, H., Theodorou, E., Schaal, S.

Advances in Computational Motor Control VII, Symposium at the Society for Neuroscience Meeting, Washington DC, 2008, 2008, clmc (article)

am

PDF [BibTex]

PDF [BibTex]


no image
Dynamic modeling of stick slip motion in an untethered magnetic microrobot

Pawashe, C., Floyd, S., Sitti, M.

Proceedings of Robotics: Science and Systems IV, Zurich, Switzerland, 2008 (article)

pi

[BibTex]

[BibTex]


no image
Frequency analysis with coupled nonlinear oscillators

Buchli, J., Righetti, L., Ijspeert, A.

Physica D: Nonlinear Phenomena, 237(13):1705-1718, August 2008 (article)

Abstract
We present a method to obtain the frequency spectrum of a signal with a nonlinear dynamical system. The dynamical system is composed of a pool of adaptive frequency oscillators with negative mean-field coupling. For the frequency analysis, the synchronization and adaptation properties of the component oscillators are exploited. The frequency spectrum of the signal is reflected in the statistics of the intrinsic frequencies of the oscillators. The frequency analysis is completely embedded in the dynamics of the system. Thus, no pre-processing or additional parameters, such as time windows, are needed. Representative results of the numerical integration of the system are presented. It is shown, that the oscillators tune to the correct frequencies for both discrete and continuous spectra. Due to its dynamic nature the system is also capable to track non-stationary spectra. Further, we show that the system can be modeled in a probabilistic manner by means of a nonlinear Fokker–Planck equation. The probabilistic treatment is in good agreement with the numerical results, and provides a useful tool to understand the underlying mechanisms leading to convergence.

mg

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
In situ observation of cracks in gold nano-interconnects on flexible substrates

Olliges, S., Gruber, P. A., Orso, S., Auzelyte, V., Ekinci, Y., Solak, H. H., Spolenak, R.

{Scripta Materialia}, 58(3):175-178, 2008 (article)

mms

[BibTex]

[BibTex]


no image
Transmission electron microscopy study of the intermixing of Fe-Pt multilayers

Kaiser, T., Sigle, W., Goll, D., Goo, N. H., Srot, V., van Aken, P. A., Detemple, E., Jäger, W.

{Journal of Applied Physics}, 103, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Spin state and orbita moments across the metal-insulator-transition of REBaCo2O5.5 investigated by XMCD

Lafkioti, M., Goering, E., Gold, S., Schütz, G., Barilo, S. N., Shiryaev, S. V., Bychkov, G. L., Lemmens, P., Hinkov, V., Deisenhofer, J., Loidl, A.

{New Journal of Physics}, 10, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
A crucial role for primary cilia in cortical morphogenesis

Willaredt, M. A., Hasenpusch-Theil, K., Gardner, H. A. R., Kitanovic, I., Hirschfeld-Warneken, V. C., Gojak, C. P., Gorgas, K., Bradford, C. L., Spatz, J. P., Wölfl, S., Theil, T., Tucker, K. L.

{The Journal of Neuroscience}, 28(48):12887-12900, 2008 (article)

mms

[BibTex]

[BibTex]


no image
Exchange coupled composite layers for magnetic recording

Goll, D., Macke, S., Kronmüller, H.

{Physica B}, 403, pages: 338-341, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
XMCD studies on Co and Li doped ZnO magnetic semiconductors

Tietze, T., Gacic, M., Schütz, G., Jakob, G., Brück, S., Goering, E.

{New Journal of Physics}, 10, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Desorption studies of hydrogen in metal-organic frameworks

Panella, B., Hönes, K., Müller, U., Trukhan, N., Schubert, M., Pütter, H., Hirscher, M.

{Angewandte Chemie International Edition}, 47, pages: 2138-2142, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Wetting transition of grain-boundary triple junctions

Straumal, B. B., Kogtenkova, O., Zieba, P.

{Acta Materialia}, 56, pages: 925-933, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Time-resolved X-ray microscopy of spin-torque-induced magnetic vortex gyration

Bolte, M., Meier, G., Krüger, B., Drews, A., Eiselt, R., Bocklage, L., Bohlens, S., Tyliszczak, T., Vansteenkiste, A., Van Waeyenberge, B., Chou, K. W., Puzic, A., Stoll, H.

{Physical Review Letters}, 100, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
The Gilbert equation revisited: anisotropic and nonlocal damping of magnetization dynamics

Fähnle, M., Steiauf, D., Seib, J.

{Journal of Physics D}, 41, 2008 (article)

mms

DOI [BibTex]

DOI [BibTex]

2007


no image
A Tutorial on Spectral Clustering

von Luxburg, U.

Statistics and Computing, 17(4):395-416, December 2007 (article)

Abstract
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. On the first glance spectral clustering appears slightly mysterious, and it is not obvious to see why it works at all and what it really does. The goal of this tutorial is to give some intuition on those questions. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.

ei

PDF PDF DOI [BibTex]

2007


PDF PDF DOI [BibTex]


no image
A Tutorial on Kernel Methods for Categorization

Jäkel, F., Schölkopf, B., Wichmann, F.

Journal of Mathematical Psychology, 51(6):343-358, December 2007 (article)

Abstract
The abilities to learn and to categorize are fundamental for cognitive systems, be it animals or machines, and therefore have attracted attention from engineers and psychologists alike. Modern machine learning methods and psychological models of categorization are remarkably similar, partly because these two fields share a common history in artificial neural networks and reinforcement learning. However, machine learning is now an independent and mature field that has moved beyond psychologically or neurally inspired algorithms towards providing foundations for a theory of learning that is rooted in statistics and functional analysis. Much of this research is potentially interesting for psychological theories of learning and categorization but also hardly accessible for psychologists. Here, we provide a tutorial introduction to a popular class of machine learning tools, called kernel methods. These methods are closely related to perceptrons, radial-basis-function neural networks and exemplar theories of catego rization. Recent theoretical advances in machine learning are closely tied to the idea that the similarity of patterns can be encapsulated in a positive definite kernel. Such a positive definite kernel can define a reproducing kernel Hilbert space which allows one to use powerful tools from functional analysis for the analysis of learning algorithms. We give basic explanations of some key concepts—the so-called kernel trick, the representer theorem and regularization—which may open up the possibility that insights from machine learning can feed back into psychology.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Accurate Splice site Prediction Using Support Vector Machines

Sonnenburg, S., Schweikert, G., Philips, P., Behr, J., Rätsch, G.

BMC Bioinformatics, 8(Supplement 10):1-16, December 2007 (article)

Abstract
Background: For splice site recognition, one has to solve two classification problems: discriminating true from decoy splice sites for both acceptor and donor sites. Gene finding systems typically rely on Markov Chains to solve these tasks. Results: In this work we consider Support Vector Machines for splice site recognition. We employ the so-called weighted degree kernel which turns out well suited for this task, as we will illustrate in several experiments where we compare its prediction accuracy with that of recently proposed systems. We apply our method to the genome-wide recognition of splice sites in Caenorhabditis elegans, Drosophila melanogaster, Arabidopsis thaliana, Danio rerio, and Homo sapiens. Our performance estimates indicate that splice sites can be recognized very accurately in these genomes and that our method outperforms many other methods including Markov Chains, GeneSplicer and SpliceMachine. We provide genome-wide predictions of splice sites and a stand-alone prediction tool ready to be used for incorporation in a gene finder. Availability: Data, splits, additional information on the model selection, the whole genome predictions, as well as the stand-alone prediction tool are available for download at http:// www.fml.mpg.de/raetsch/projects/splice.

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
A unifying framework for robot control with redundant DOFs

Peters, J., Mistry, M., Udwadia, F., Nakanishi, J., Schaal, S.

Autonomous Robots, 24(1):1-12, October 2007 (article)

Abstract
Recently, Udwadia (Proc. R. Soc. Lond. A 2003:1783–1800, 2003) suggested to derive tracking controllers for mechanical systems with redundant degrees-of-freedom (DOFs) using a generalization of Gauss’ principle of least constraint. This method allows reformulating control problems as a special class of optimal controllers. In this paper, we take this line of reasoning one step further and demonstrate that several well-known and also novel nonlinear robot control laws can be derived from this generic methodology. We show experimental verifications on a Sarcos Master Arm robot for some of the derived controllers. The suggested approach offers a promising unification and simplification of nonlinear control law design for robots obeying rigid body dynamics equations, both with or without external constraints, with over-actuation or underactuation, as well as open-chain and closed-chain kinematics.

ei

PDF PDF DOI [BibTex]

PDF PDF DOI [BibTex]


no image
The Need for Open Source Software in Machine Learning

Sonnenburg, S., Braun, M., Ong, C., Bengio, S., Bottou, L., Holmes, G., LeCun, Y., Müller, K., Pereira, F., Rasmussen, C., Rätsch, G., Schölkopf, B., Smola, A., Vincent, P., Weston, J., Williamson, R.

Journal of Machine Learning Research, 8, pages: 2443-2466, October 2007 (article)

Abstract
Open source tools have recently reached a level of maturity which makes them suitable for building large-scale real-world systems. At the same time, the field of machine learning has developed a large body of powerful learning algorithms for diverse applications. However, the true potential of these methods is not realized, since existing implementations are not openly shared, resulting in software with low usability, and weak interoperability. We argue that this situation can be significantly improved by increasing incentives for researchers to publish their software under an open source model. Additionally, we outline the problems authors are faced with when trying to publish algorithmic implementations of machine learning methods. We believe that a resource of peer reviewed software accompanied by short articles would be highly valuable to both the machine learning and the general scientific community.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Some observations on the masking effects of Mach bands

Curnow, T., Cowie, DA., Henning, GB., Hill, NJ.

Journal of the Optical Society of America A, 24(10):3233-3241, October 2007 (article)

Abstract
There are 8 cycle / deg ripples or oscillations in performance as a function of location near Mach bands in experiments measuring Mach bands’ masking effects on random polarity signal bars. The oscillations with increments are 180 degrees out of phase with those for decrements. The oscillations, much larger than the measurement error, appear to relate to the weighting function of the spatial-frequency-tuned channel detecting the broad- band signals. The ripples disappear with step maskers and become much smaller at durations below 25 ms, implying either that the site of masking has changed or that the weighting function and hence spatial-frequency tuning is slow to develop.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Support Vector Machine Learning for Interdependent and Structured Output Spaces

Altun, Y., Hofmann, T., Tsochantaridis, I.

In Predicting Structured Data, pages: 85-104, Advances in neural information processing systems, (Editors: Bakir, G. H. , T. Hofmann, B. Schölkopf, A. J. Smola, B. Taskar, S. V. N. Vishwanathan), MIT Press, Cambridge, MA, USA, September 2007 (inbook)

ei

Web [BibTex]

Web [BibTex]


no image
Brisk Kernel ICA

Jegelka, S., Gretton, A.

In Large Scale Kernel Machines, pages: 225-250, Neural Information Processing, (Editors: Bottou, L. , O. Chapelle, D. DeCoste, J. Weston), MIT Press, Cambridge, MA, USA, September 2007 (inbook)

Abstract
Recent approaches to independent component analysis have used kernel independence measures to obtain very good performance in ICA, particularly in areas where classical methods experience difficulty (for instance, sources with near-zero kurtosis). In this chapter, we compare two efficient extensions of these methods for large-scale problems: random subsampling of entries in the Gram matrices used in defining the independence measures, and incomplete Cholesky decomposition of these matrices. We derive closed-form, efficiently computable approximations for the gradients of these measures, and compare their performance on ICA using both artificial and music data. We show that kernel ICA can scale up to much larger problems than yet attempted, and that incomplete Cholesky decomposition performs better than random sampling.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Predicting Structured Data

Bakir, G., Hofmann, T., Schölkopf, B., Smola, A., Taskar, B., Vishwanathan, S.

pages: 360, Advances in neural information processing systems, MIT Press, Cambridge, MA, USA, September 2007 (book)

Abstract
Machine learning develops intelligent computer systems that are able to generalize from previously seen examples. A new domain of machine learning, in which the prediction must satisfy the additional constraints found in structured data, poses one of machine learning’s greatest challenges: learning functional dependencies between arbitrary input and output domains. This volume presents and analyzes the state of the art in machine learning algorithms and theory in this novel field. The contributors discuss applications as diverse as machine translation, document markup, computational biology, and information extraction, among others, providing a timely overview of an exciting field.

ei

Web [BibTex]

Web [BibTex]


no image
Mining complex genotypic features for predicting HIV-1 drug resistance

Saigo, H., Uno, T., Tsuda, K.

Bioinformatics, 23(18):2455-2462, September 2007 (article)

Abstract
Human immunodeficiency virus type 1 (HIV-1) evolves in human body, and its exposure to a drug often causes mutations that enhance the resistance against the drug. To design an effective pharmacotherapy for an individual patient, it is important to accurately predict the drug resistance based on genotype data. Notably, the resistance is not just the simple sum of the effects of all mutations. Structural biological studies suggest that the association of mutations is crucial: Even if mutations A or B alone do not affect the resistance, a significant change might happen when the two mutations occur together. Linear regression methods cannot take the associations into account, while decision tree methods can reveal only limited associations. Kernel methods and neural networks implicitly use all possible associations for prediction, but cannot select salient associations explicitly. Our method, itemset boosting, performs linear regression in the complete space of power sets of mutations. It implements a forward feature selection procedure where, in each iteration, one mutation combination is found by an efficient branch-and-bound search. This method uses all possible combinations, and salient associations are explicitly shown. In experiments, our method worked particularly well for predicting the resistance of nucleotide reverse transcriptase inhibitors (NRTIs). Furthermore, it successfully recovered many mutation associations known in biological literature.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
Training a Support Vector Machine in the Primal

Chapelle, O.

In Large Scale Kernel Machines, pages: 29-50, Neural Information Processing, (Editors: Bottou, L. , O. Chapelle, D. DeCoste, J. Weston), MIT Press, Cambridge, MA, USA, September 2007, This is a slightly updated version of the Neural Computation paper (inbook)

Abstract
Most literature on Support Vector Machines (SVMs) concentrate on the dual optimization problem. In this paper, we would like to point out that the primal problem can also be solved efficiently, both for linear and non-linear SVMs, and that there is no reason to ignore this possibility. On the contrary, from the primal point of view new families of algorithms for large scale SVM training can be investigated.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Approximation Methods for Gaussian Process Regression

Quiñonero-Candela, J., Rasmussen, CE., Williams, CKI.

In Large-Scale Kernel Machines, pages: 203-223, Neural Information Processing, (Editors: Bottou, L. , O. Chapelle, D. DeCoste, J. Weston), MIT Press, Cambridge, MA, USA, September 2007 (inbook)

Abstract
A wealth of computationally efficient approximation methods for Gaussian process regression have been recently proposed. We give a unifying overview of sparse approximations, following Quiñonero-Candela and Rasmussen (2005), and a brief review of approximate matrix-vector multiplication methods.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Learning with Transformation Invariant Kernels

Walder, C., Chapelle, O.

(165), Max Planck Institute for Biological Cybernetics, Tübingen, Germany, September 2007 (techreport)

Abstract
Abstract. This paper considers kernels invariant to translation, rotation and dilation. We show that no non-trivial positive definite (p.d.) kernels exist which are radial and dilation invariant, only conditionally positive definite (c.p.d.) ones. Accordingly, we discuss the c.p.d. case and provide some novel analysis, including an elementary derivation of a c.p.d. representer theorem. On the practical side, we give a support vector machine (s.v.m.) algorithm for arbitrary c.p.d. kernels. For the thin-plate kernel this leads to a classifier with only one parameter (the amount of regularisation), which we demonstrate to be as effective as an s.v.m. with the Gaussian kernel, even though the Gaussian involves a second parameter (the length scale).

ei

PDF [BibTex]

PDF [BibTex]


no image
Advances in Neural Information Processing Systems 19: Proceedings of the 2006 Conference

Schölkopf, B., Platt, J., Hofmann, T.

Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems (NIPS 2006), pages: 1690, MIT Press, Cambridge, MA, USA, 20th Annual Conference on Neural Information Processing Systems (NIPS), September 2007 (proceedings)

Abstract
The annual Neural Information Processing Systems (NIPS) conference is the flagship meeting on neural computation and machine learning. It draws a diverse group of attendees--physicists, neuroscientists, mathematicians, statisticians, and computer scientists--interested in theoretical and applied aspects of modeling, simulating, and building neural-like or intelligent systems. The presentations are interdisciplinary, with contributions in algorithms, learning theory, cognitive science, neuroscience, brain imaging, vision, speech and signal processing, reinforcement learning, and applications. Only twenty-five percent of the papers submitted are accepted for presentation at NIPS, so the quality is exceptionally high. This volume contains the papers presented at the December 2006 meeting, held in Vancouver.

ei

Web [BibTex]

Web [BibTex]


no image
Trading Convexity for Scalability

Collobert, R., Sinz, F., Weston, J., Bottou, L.

In Large Scale Kernel Machines, pages: 275-300, Neural Information Processing, (Editors: Bottou, L. , O. Chapelle, D. DeCoste, J. Weston), MIT Press, Cambridge, MA, USA, September 2007 (inbook)

Abstract
Convex learning algorithms, such as Support Vector Machines (SVMs), are often seen as highly desirable because they offer strong practical properties and are amenable to theoretical analysis. However, in this work we show how nonconvexity can provide scalability advantages over convexity. We show how concave-convex programming can be applied to produce (i) faster SVMs where training errors are no longer support vectors, and (ii) much faster Transductive SVMs.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Scalable Semidefinite Programming using Convex Perturbations

Kulis, B., Sra, S., Jegelka, S.

(TR-07-47), University of Texas, Austin, TX, USA, September 2007 (techreport)

Abstract
Several important machine learning problems can be modeled and solved via semidefinite programs. Often, researchers invoke off-the-shelf software for the associated optimization, which can be inappropriate for many applications due to computational and storage requirements. In this paper, we introduce the use of convex perturbations for semidefinite programs (SDPs). Using a particular perturbation function, we arrive at an algorithm for SDPs that has several advantages over existing techniques: a) it is simple, requiring only a few lines of MATLAB, b) it is a first-order method which makes it scalable, c) it can easily exploit the structure of a particular SDP to gain efficiency (e.g., when the constraint matrices are low-rank). We demonstrate on several machine learning applications that the proposed algorithm is effective in finding fast approximations to large-scale SDPs.

ei

PDF [BibTex]

PDF [BibTex]