MSMatthias Seeger

Matthias Seeger

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Matthias Seeger has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design

    by Niranjan Srinivas, Andreas Krause, Sham M. Kakade, Matthias Seeger

    Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multi-armed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low RKHS norm. We resolve the important open problem of deriving regret bounds for this setting, which imply novel convergence rates for GP optimization. We analyze GP-UCB, an intuitive upper-confidence based algorithm, and bound its cumulative regret in terms of maximal information gain, establishing a novel connection between GP optimization and experimental design. Moreover, by bounding the latter in terms of operator spectra, we obtain explicit sublinear regret bounds for many commonly used covariance functions. In some important cases, our bounds have surprisingly weak dependence on the dimensionality. In our experiments on real sensor data, GP-UCB compares favorably with other heuristical GP optimization approaches.


  • Real-Time Local GP Model Learning

    by Duy Nguyen-Tuong, Matthias Seeger, Jan Peters


  • Open Access

    Optimization ofk‐space trajectories for compressed sensing by Bayesian experimental design

    by Matthias Seeger, Hannes Nickisch, Rolf Pohmann, Bernhard Schölkopf

    The optimization ofk‐space sampling for nonlinear sparse MRI reconstruction is phrased as a Bayesian experimental design problem. Bayesian inference is approximated by a novel relaxation to standard signal processing primitives, resulting in an efficient optimization algorithm for Cartesian and spiral trajectories. On clinical resolution brain image data from a Siemens 3T scanner, automatically optimized trajectories lead to significantly improved images, compared to standard low‐pass, equispaced, or variable density randomized designs. Insights into the nonlinear design optimization problem for MRI are given. Magn Reson Med, 2010.