Header logo is


2011


no image
Cue Combination: Beyond Optimality

Rosas, P., Wichmann, F.

In Sensory Cue Integration, pages: 144-152, (Editors: Trommershäuser, J., Körding, K. and Landy, M. S.), Oxford University Press, 2011 (inbook)

ei

[BibTex]

2011


[BibTex]


no image
Generalized Dictionary Learning for Symmetric Positive Definite Matrices with Application to Nearest Neighbor Retrieval

Sra, S., Cherian, A.

In Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2011, LNCS vol 6913, Part III, pages: 318-332, (Editors: D Gunopulos and T Hofmann and D Malerba and M Vazirgiannis), Springer, 22th European Conference on Machine Learning (ECML), 2011 (inproceedings)

ei

DOI [BibTex]

DOI [BibTex]


no image
Nonconvex proximal splitting: batch and incremental algorithms

Sra, S.

(2), Max Planck Institute for Intelligent Systems, Tübingen, Germany, 2011 (techreport)

Abstract
Within the unmanageably large class of nonconvex optimization, we consider the rich subclass of nonsmooth problems having composite objectives (this includes the extensively studied convex, composite objective problems as a special case). For this subclass, we introduce a powerful, new framework that permits asymptotically non-vanishing perturbations. In particular, we develop perturbation-based batch and incremental (online like) nonconvex proximal splitting algorithms. To our knowledge, this is the rst time that such perturbation-based nonconvex splitting algorithms are being proposed and analyzed. While the main contribution of the paper is the theoretical framework, we complement our results by presenting some empirical results on matrix factorization.

ei

PDF [BibTex]

PDF [BibTex]


no image
Restricted boltzmann machines as useful tool for detecting oscillatory eeg components

Balderas, D., Zander, TO., Bachl, F., Neuper, C., Scherer, R.

In Proceedings of the 5th International Brain–Computer Interface Conference, pages: 68-71, (Editors: GR Müller-Putz and R Scherer and M Billinger and A Kkreilinger and V Kaiser and C Neuper), Graz: Verlag der Technischen Universität, 2011 (inproceedings)

ei

[BibTex]

[BibTex]


no image
Hierarchical Multitask Structured Output Learning for Large-scale Sequence Segmentation

Görnitz, N., Widmer, C., Zeller, G., Kahles, A., Sonnenburg, S., Rätsch, G.

In Advances in Neural Information Processing Systems 24, pages: 2690-2698, (Editors: J Shawe-Taylor and RS Zemel and P Bartlett and FCN Pereira and KQ Weinberger), Curran Associates, Inc., Red Hook, NY, USA, Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

ei

PDF [BibTex]

PDF [BibTex]


no image
Phase transition in the family of p-resistances

Alamgir, M., von Luxburg, U.

In Advances in Neural Information Processing Systems 24, pages: 379-387, (Editors: J Shawe-Taylor and RS Zemel and P Bartlett and F Pereira and KQ Weinberger), Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

Abstract
We study the family of p-resistances on graphs for p ≥ 1. This family generalizes the standard resistance distance. We prove that for any fixed graph, for p=1, the p-resistance coincides with the shortest path distance, for p=2 it coincides with the standard resistance distance, and for p → ∞ it converges to the inverse of the minimal s-t-cut in the graph. Secondly, we consider the special case of random geometric graphs (such as k-nearest neighbor graphs) when the number n of vertices in the graph tends to infinity. We prove that an interesting phase-transition takes place. There exist two critical thresholds p^* and p^** such that if p < p^*, then the p-resistance depends on meaningful global properties of the graph, whereas if p > p^**, it only depends on trivial local quantities and does not convey any useful information. We can explicitly compute the critical values: p^* = 1 + 1/(d-1) and p^** = 1 + 1/(d-2) where d is the dimension of the underlying space (we believe that the fact that there is a small gap between p^* and p^** is an artifact of our proofs. We also relate our findings to Laplacian regularization and suggest to use q-Laplacians as regularizers, where q satisfies 1/p^* + 1/q = 1.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
On Fast Approximate Submodular Minimization

Jegelka, S., Lin, H., Bilmes, J.

In Advances in Neural Information Processing Systems 24, pages: 460-468, (Editors: J Shawe-Taylor and RS Zemel and P Bartlett and F Pereira and KQ Weinberger), Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

Abstract
We are motivated by an application to extract a representative subset of machine learning training data and by the poor empirical performance we observe of the popular minimum norm algorithm. In fact, for our application, minimum norm can have a running time of about O(n7) (O(n5) oracle calls). We therefore propose a fast approximate method to minimize arbitrary submodular functions. For a large sub-class of submodular functions, the algorithm is exact. Other submodular functions are iteratively approximated by tight submodular upper bounds, and then repeatedly optimized. We show theoretical properties, and empirical results suggest significant speedups over minimum norm while retaining higher accuracies.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
PAC-Bayesian Analysis of Contextual Bandits

Seldin, Y., Auer, P., Laviolette, F., Shawe-Taylor, J., Ortner, R.

In Advances in Neural Information Processing Systems 24, pages: 1683-1691, (Editors: J Shawe-Taylor and RS Zemel and P Bartlett and F Pereira and KQ Weinberger), Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

Abstract
We derive an instantaneous (per-round) data-dependent regret bound for stochastic multiarmed bandits with side information (also known as contextual bandits). The scaling of our regret bound with the number of states (contexts) $N$ goes as $\sqrt{N I_{\rho_t}(S;A)}$, where $I_{\rho_t}(S;A)$ is the mutual information between states and actions (the side information) used by the algorithm at round $t$. If the algorithm uses all the side information, the regret bound scales as $\sqrt{N \ln K}$, where $K$ is the number of actions (arms). However, if the side information $I_{\rho_t}(S;A)$ is not fully used, the regret bound is significantly tighter. In the extreme case, when $I_{\rho_t}(S;A) = 0$, the dependence on the number of states reduces from linear to logarithmic. Our analysis allows to provide the algorithm large amount of side information, let the algorithm to decide which side information is relevant for the task, and penalize the algorithm only for the side information that it is using de facto. We also present an algorithm for multiarmed bandits with side information with computational complexity that is a linear in the number of actions.

ei

PDF PDF Web [BibTex]

PDF PDF Web [BibTex]


no image
Fast projections onto L1,q-norm balls for grouped feature selection

Sra, S.

In Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2011, LNCS vol 6913, Part III, pages: 305-317, (Editors: D Gunopulos and T Hofmann and D Malerba and M Vazirgiannis), Springer, 22th European Conference on Machine Learning (ECML), 2011 (inproceedings)

ei

DOI [BibTex]

DOI [BibTex]


no image
Model Learning in Robot Control

Nguyen-Tuong, D.

Albert-Ludwigs-Universität Freiburg, Germany, 2011 (phdthesis)

ei

[BibTex]

[BibTex]


no image
Kernel Belief Propagation

Song, L., Gretton, A., Bickson, D., Low, Y., Guestrin, C.

In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, Vol. 15, pages: 707-715, (Editors: G Gordon and D Dunson and M Dudík), JMLR, AISTATS, 2011 (inproceedings)

ei

PDF [BibTex]

PDF [BibTex]


no image
On Causal Discovery with Cyclic Additive Noise Models

Mooij, J., Janzing, D., Schölkopf, B., Heskes, T.

In Advances in Neural Information Processing Systems 24, pages: 639-647, (Editors: J Shawe-Taylor and RS Zemel and PL Bartlett and FCN Pereira and KQ Weinberger), Curran Associates, Inc., Red Hook, NY, USA, Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

Abstract
We study a particular class of cyclic causal models, where each variable is a (possibly nonlinear) function of its parents and additive noise. We prove that the causal graph of such models is generically identifiable in the bivariate, Gaussian-noise case. We also propose a method to learn such models from observational data. In the acyclic case, the method reduces to ordinary regression, but in the more challenging cyclic case, an additional term arises in the loss function, which makes it a special case of nonlinear independent component analysis. We illustrate the proposed method on synthetic data.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Additive Gaussian Processes

Duvenaud, D., Nickisch, H., Rasmussen, C.

In Advances in Neural Information Processing Systems 24, pages: 226-234, (Editors: J Shawe-Taylor and RS Zemel and P Bartlett and F Pereira and KQ Weinberger), Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

Abstract
We introduce a Gaussian process model of functions which are additive. An additive function is one which decomposes into a sum of low-dimensional functions, each depending on only a subset of the input variables. Additive GPs generalize both Generalized Additive Models, and the standard GP models which use squared-exponential kernels. Hyperparameter learning in this model can be seen as Bayesian Hierarchical Kernel Learning (HKL). We introduce an expressive but tractable parameterization of the kernel function, which allows efficient evaluation of all input interaction terms, whose number is exponential in the input dimension. The additional structure discoverable by this model results in increased interpretability, as well as state-of-the-art predictive power in regression tasks.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
k-NN Regression Adapts to Local Intrinsic Dimension

Kpotufe, S.

In Advances in Neural Information Processing Systems 24, pages: 729-737, (Editors: J Shawe-Taylor and RS Zemel and P Bartlett and F Pereira and KQ Weinberger), Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

Abstract
Many nonparametric regressors were recently shown to converge at rates that depend only on the intrinsic dimension of data. These regressors thus escape the curse of dimension when high-dimensional data has low intrinsic dimension (e.g. a manifold). We show that k-NN regression is also adaptive to intrinsic dimension. In particular our rates are local to a query x and depend only on the way masses of balls centered at x vary with radius. Furthermore, we show a simple way to choose k = k(x) locally at any x so as to nearly achieve the minimax rate at x in terms of the unknown intrinsic dimension in the vicinity of x. We also establish that the minimax rate does not depend on a particular choice of metric space or distribution, but rather that this minimax rate holds for any metric space and doubling measure.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Fast Newton-type Methods for Total-Variation with Applications

Barbero, A., Sra, S.

In Proceedings of the 28th International Conference on Machine Learning, ICML 2011, pages: 313-320, (Editors: L Getoor and T Scheffer), Omnipress, 28th International Conference on Machine Learning (ICML), 2011 (inproceedings)

ei

[BibTex]

[BibTex]


no image
Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees

Gonzalez, J., Low, Y., Gretton, A., Guestrin, C.

In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, Vol. 15, pages: 324-332, (Editors: G Gordon and D Dunson and M Dudík), JMLR, AISTATS, 2011 (inproceedings)

ei

PDF [BibTex]

PDF [BibTex]


no image
Transfer Learning with Copulas

Lopez-Paz, D., Hernandez-Lobato, J.

Neural Information Processing Systems (NIPS), 2011 (poster)

ei

PDF [BibTex]

PDF [BibTex]


Thumb xl toc image
Quantum-Cascade Laser-Based Vibrational Circular Dichroism

Luedeke, S., Pfeifer, M., Fischer, P.

JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 133(15):5704-5707, 2011 (article)

Abstract
Vibrational circular dichroism (VCD) spectra were recorded with a tunable external-cavity quantum-cascade laser (QCL). In comparison with standard thermal light sources in the IR, QCLs provide orders of magnitude more power and are therefore promising for VCD studies in strongly absorbing solvents. The brightness of this novel light source is demonstrated with VCD and IR absorption measurements of a number of compounds, including proline in water.

pf

DOI [BibTex]

DOI [BibTex]


Thumb xl problem
Recovering Intrinsic Images with a Global Sparsity Prior on Reflectance

Gehler, P., Rother, C., Kiefel, M., Zhang, L., Schölkopf, B.

In Advances in Neural Information Processing Systems 24, pages: 765-773, (Editors: Shawe-Taylor, John and Zemel, Richard S. and Bartlett, Peter L. and Pereira, Fernando C. N. and Weinberger, Kilian Q.), Curran Associates, Inc., Red Hook, NY, USA, Twenty-Fifth Annual Conference on Neural Information Processing Systems (NIPS), 2011 (inproceedings)

Abstract
We address the challenging task of decoupling material properties from lighting properties given a single image. In the last two decades virtually all works have concentrated on exploiting edge information to address this problem. We take a different route by introducing a new prior on reflectance, that models reflectance values as being drawn from a sparse set of basis colors. This results in a Random Field model with global, latent variables (basis colors) and pixel-accurate output reflectance values. We show that without edge information high-quality results can be achieved, that are on par with methods exploiting this source of information. Finally, we are able to improve on state-of-the-art results by integrating edge information into our model. We believe that our new approach is an excellent starting point for future developments in this field.

ei ps

website + code pdf poster Project Page Project Page [BibTex]

website + code pdf poster Project Page Project Page [BibTex]


Thumb xl toc image
Actively coupled cavity ringdown spectroscopy with low-power broadband sources

Petermann, C., Fischer, P.

OPTICS EXPRESS, 19(11):10164-10173, 2011 (article)

Abstract
We demonstrate a coupling scheme for cavity enhanced absorption spectroscopy that makes use of an intracavity acousto-optical modulator to actively switch light into (and out of) a resonator. This allows cavity ringdown spectroscopy (CRDS) to be implemented with broadband nonlaser light sources with spectral power densities of less than 30 mu W/nm. Although the acousto-optical element reduces the ultimate detection limit by introducing additional losses, it permits absorptivities to be measured with a high dynamic range, especially in lossy environments. Absorption measurements for the forbidden transition of gaseous oxygen in air at similar to 760nm are presented using a low-coherence cw-superluminescent diode. The same setup was electronically configured to cover absorption losses from 1.8 x 10(-8)cm(-1) to 7.5\% per roundtrip. This could be of interest in process analytical applications. (C) 2011 Optical Society of America

pf

DOI [BibTex]

DOI [BibTex]


Thumb xl toc image
Magnetically actuated propulsion at low Reynolds numbers: towards nanoscale control

Fischer, P., Ghosh, A.

NANOSCALE, 3(2):557-563, 2011 (article)

Abstract
Significant progress has been made in the fabrication of micron and sub-micron structures whose motion can be controlled in liquids under ambient conditions. The aim of many of these engineering endeavors is to be able to build and propel an artificial micro-structure that rivals the versatility of biological swimmers of similar size, e. g. motile bacterial cells. Applications for such artificial ``micro-bots'' are envisioned to range from microrheology to targeted drug delivery and microsurgery, and require full motion-control under ambient conditions. In this Mini-Review we discuss the construction, actuation, and operation of several devices that have recently been reported, especially systems that can be controlled by and propelled with homogenous magnetic fields. We describe the fabrication and associated experimental challenges and discuss potential applications.

pf

Video - Nanospropellers DOI [BibTex]


Thumb xl toc image
Weak value amplified optical activity measurements

Pfeifer, M., Fischer, P.

Opt. Express, 19(17):16508-16517, OSA, 2011 (article)

Abstract
We present a new form of optical activity measurement based on a modified weak value amplification scheme. It has recently been shown experimentally that the left- and right-circular polarization components refract with slightly different angles of refraction at a chiral interface causing a linearly polarized light beam to split into two. By introducing a polarization modulation that does not give rise to a change in the optical rotation it is possible to differentiate between the two circular polarization components even after post-selection with a linear polarizer. We show that such a modified weak value amplification measurement permits the sign of the splitting and thus the handedness of the optically active medium to be determined. Angular beam separations of Δθ ∼ 1 nanoradian, which corresponds to a circular birefringence of Δn ∼ 1 × 10−9, could be measured with a relative error of less than 1%.

pf

link (url) DOI [BibTex]

link (url) DOI [BibTex]

1998


no image
SVMs — a practical consequence of learning theory

Schölkopf, B.

IEEE Intelligent Systems and their Applications, 13(4):18-21, July 1998 (article)

Abstract
My first exposure to Support Vector Machines came this spring when heard Sue Dumais present impressive results on text categorization using this analysis technique. This issue's collection of essays should help familiarize our readers with this interesting new racehorse in the Machine Learning stable. Bernhard Scholkopf, in an introductory overview, points out that a particular advantage of SVMs over other learning algorithms is that it can be analyzed theoretically using concepts from computational learning theory, and at the same time can achieve good performance when applied to real problems. Examples of these real-world applications are provided by Sue Dumais, who describes the aforementioned text-categorization problem, yielding the best results to date on the Reuters collection, and Edgar Osuna, who presents strong results on application to face detection. Our fourth author, John Platt, gives us a practical guide and a new technique for implementing the algorithm efficiently.

ei

PDF Web DOI [BibTex]

1998


PDF Web DOI [BibTex]


no image
Prior knowledge in support vector kernels

Schölkopf, B., Simard, P., Smola, A., Vapnik, V.

In Advances in Neural Information Processing Systems 10, pages: 640-646 , (Editors: M Jordan and M Kearns and S Solla ), MIT Press, Cambridge, MA, USA, Eleventh Annual Conference on Neural Information Processing (NIPS), June 1998 (inproceedings)

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
From regularization operators to support vector kernels

Smola, A., Schölkopf, B.

In Advances in Neural Information Processing Systems 10, pages: 343-349, (Editors: M Jordan and M Kearns and S Solla), MIT Press, Cambridge, MA, USA, 11th Annual Conference on Neural Information Processing (NIPS), June 1998 (inproceedings)

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Learning view graphs for robot navigation

Franz, M., Schölkopf, B., Mallot, H., Bülthoff, H.

Autonomous Robots, 5(1):111-125, March 1998 (article)

Abstract
We present a purely vision-based scheme for learning a topological representation of an open environment. The system represents selected places by local views of the surrounding scene, and finds traversable paths between them. The set of recorded views and their connections are combined into a graph model of the environment. To navigate between views connected in the graph, we employ a homing strategy inspired by findings of insect ethology. In robot experiments, we demonstrate that complex visual exploration and navigation tasks can thus be performed without using metric information.

ei

PDF PDF DOI [BibTex]

PDF PDF DOI [BibTex]


Thumb xl toc image
Surface second-order nonlinear optical activity

Fischer, P., Buckingham, A.

JOURNAL OF THE OPTICAL SOCIETY OF AMERICA B-OPTICAL PHYSICS, 15(12):2951-2957, 1998 (article)

Abstract
Following the recent observation of a large second-harmonic intensity difference from a monolayer of chiral molecules with left and right circularly polarized light, the scattering theory is generalized and extended to predict linear and circular intensity differences for the more Versatile sum-frequency spectroscopy. Estimates indicate that intensity differences should be detectable for a typical experimental arrangement. The second-order nonlinear surface susceptibility tensor is given for different surface point groups in the electric dipole approximation; it is shown that nonlinear optical activity phenomena unambiguously probe molecular chirality only for molecular monolayers that are symmetric about the normal. Other surface symmetries can give rise to intensity differences from monolayers composed of achiral molecules. A water surface is predicted to show Linear and nonlinear optical activity in the presence of an electric field parallel to the surface. (C) 1998 Optical Society of America {[}S0740-3224(98)01311-3] OCIS codes: 190.0190, 190.4350, 240.6490.

pf

DOI [BibTex]

DOI [BibTex]


Thumb xl toc image
Linear electro-optic effect in optically active liquids

Buckingham, A., Fischer, P.

CHEMICAL PHYSICS LETTERS, 297(3-4):239-246, 1998 (article)

Abstract
A linear effect of an electrostatic field F on the intensity of sum- and difference-frequency generation in a chiral liquid is predicted. It arises in the electric dipole approximation. The effect changes sign with the enantiomer and on reversing the direction of the electrostatic field. The sum-frequency generator chi(alpha beta gamma)((2)) (-omega(3);omega(1),omega(2)), where omega(3) = omega(1) + omega(2), and the electric field-induced sum-frequency generator chi(alpha beta gamma delta)((3))(-omega(3);omega(1),omega(2),0)F-delta interfere and their contributions to the scattering power can be distinguished. Encouraging predictions are given for a typical experimental arrangement. (C) 1998 Elsevier Science B.V. All rights reserved.

pf

DOI [BibTex]

DOI [BibTex]


Thumb xl toc image
Monolayers of hexadecyltrimethylammonium p-tosylate at the air-water interface. 1. Sum-frequency spectroscopy

Bell, G., Li, Z., Bain, C., Fischer, P., Duffy, D.

JOURNAL OF PHYSICAL CHEMISTRY B, 102(47):9461-9472, 1998 (article)

Abstract
Sum-frequency vibrational spectroscopy has been used to determine the structure of monolayers of the cationic surfactant, hexadecyltrimethylammonium p-tosylate (C(16)TA(+)Ts(-)), at the surface of water. Selective deuteration of the cation or the anion allowed the separate detection of sum-frequency spectra of the surfactant and of counterions that are bound to the monolayer. The p-tosylate ions an oriented with their methyl groups pointing away from the aqueous subphase and with the C-2 axis tilted, on average, by 30-40 degrees from the surface normal. The vibrational spectra of C(16)TA(+) indicate that the number of gauche defects in the monolayer does not change dramatically when bromide counterions are replaced by p-tosylate. The ends of the hydrocarbon chains of C16TA+ are, however, tilted much further from the surface normal in the presence of p-tosylate than in the presence of bromide. A quantitative analysis of the sum-frequency spectra requires a knowledge of the molecular hyperpolarizability tensor: the role of ab initio calculations and Raman spectroscopy in determining the components of this tensor is discussed.

pf

DOI [BibTex]

DOI [BibTex]


Thumb xl toc image
Ultraviolet resonance Raman study of drug binding in dihydrofolate reductase, gyrase, and catechol O-methyltransferase

Couling, V., Fischer, P., Klenerman, D., Huber, W.

BIOPHYSICAL JOURNAL, 75(2):1097-1106, 1998 (article)

Abstract
This paper presents a study of the use of ultraviolet resonance Raman (UVRR) spectroscopic methods as a means of elucidating aspects of drug-protein interactions. Some of the RR vibrational bands of the aromatic amino acids tyrosine and tryptophan are sensitive to the microenvironment, and the use of UV excitation radiation allows selective enhancement of the spectral features of the aromatic amino acids, enabling observation specifically of their change in microenvironment upon drug binding. The three drug-protein systems investigated in this study are dihydrofolate reductase with its inhibitor trimethoprim, gyrase with novobiocin, and catechol O-methyltransferase with dinitrocatechol. It is demonstrated that UVRR spectroscopy has adequate sensitivity to be a useful means of detecting drug-protein interactions in those systems for which the electronic absorption of the aromatic amino acids changes because of hydrogen bonding and/or possible dipole-dipole and dipole-polarizability interactions with the ligand.

pf

DOI [BibTex]

DOI [BibTex]

1996


no image
Incorporating invariances in support vector learning machines

Schölkopf, B., Burges, C., Vapnik, V.

In Artificial Neural Networks: ICANN 96, LNCS vol. 1112, pages: 47-52, (Editors: C von der Malsburg and W von Seelen and JC Vorbrüggen and B Sendhoff), Springer, Berlin, Germany, 6th International Conference on Artificial Neural Networks, July 1996, volume 1112 of Lecture Notes in Computer Science (inproceedings)

Abstract
Developed only recently, support vector learning machines achieve high generalization ability by minimizing a bound on the expected test error; however, so far there existed no way of adding knowledge about invariances of a classification problem at hand. We present a method of incorporating prior knowledge about transformation invariances by applying transformations to support vectors, the training examples most critical for determining the classification boundary.

ei

PDF DOI [BibTex]

1996


PDF DOI [BibTex]