#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2003

2017

- This year (1)
- Last 5 years (15)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sören Laue
- ICML
- 2012

We present a hybrid algorithm for optimizing a convex, smooth function over the cone of positive semidefinite matrices. Our algorithm converges to the global optimal solution and can be used to solve general largescale semidefinite programs and hence can be readily applied to a variety of machine learning problems. We show experimental results on three… (More)

- Joachim Giesen, Martin Jaggi, Sören Laue
- ESA
- 2012

We devise a framework for computing an approximate solution path for an important class of parameterized semidefinite problems that is guaranteed to be ε-close to the exact solution path. The problem of computing the entire regularization path for matrix factorization problems such as maximum-margin matrix factorization fits into this framework, as well as… (More)

- SÖREN LAUE, Sören Laue
- 2008

Suppose we are given a finite set of points P in R and a collection of polytopes T that are all translates of the same polytope T . We consider two problems in this paper. The first is the set cover problem where we want to select a minimal number of polytopes from the collection T such that their union covers all input points P . The second problem that we… (More)

- Stefan Funke, Sören Laue
- STACS
- 2007

We consider the problem of assigning powers to nodes of a wireless network in the plane such that a message from a source node s reaches all other nodes within a bounded number k of transmissions and the total amount of assigned energy is minimized. By showing the existence of a coreset of size O( `

- Joachim Giesen, Jens K. Mueller, Sören Laue, Sascha Swiercy
- NIPS
- 2012

We consider an abstract class of optimization problems that are parameterized concavely in a single parameter, and show that the solution path along the parameter can always be approximated with accuracy ε > 0 by a set of sizeO(1/ √ ε). A lower bound of size Ω(1/ √ ε) shows that the upper bound is tight up to a constant factor. We also devise an algorithm… (More)

- Joachim Giesen, Martin Jaggi, Sören Laue
- ACM Trans. Algorithms
- 2010

We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an ε-approximate solution (and a corresponding ε-coreset) along the entire parameter path. We prove correctness and optimality of the method. Practically relevant instances of the… (More)

- Joachim Giesen, Martin Jaggi, Sören Laue
- AISTATS
- 2012

We devise a simple algorithm for computing an approximate solution path for parameterized semidefinite convex optimization problems that is guaranteed to be ε-close to the exact solution path. As a consequence, we can compute the entire regularization path for many regularized matrix completion and factorization approaches, as well as nuclear norm or… (More)

- Stefan Funke, Sören Laue, Zvi Lotker, Rouven Naujoks
- Ad Hoc Networks
- 2008

In this paper, we present approximation algorithms for a variety of problems occurring in the design of energy-efficient wireless communication networks. We first study the k-station network problem, where for a set S of stations and some constant k, one wants to assign transmission powers to at most k senders such that every station in S can receive a… (More)

Hyperbolic geo metry appears to be intrinsic in many large real networks. We construct and implement a new maximum likelihood estimation algorithm that embeds scale-free graphs in the hyperbolic space. All previous approaches of similar embedding algorithms require a runtime of Ω(n2). Our algorithm achieves quasilinear runtime, which makes it the first… (More)

- Georgiana Dinu, Stefan Thater, Sören Laue
- HLT-NAACL
- 2012

This paper compares a number of recently proposed models for computing context sensitive word similarity. We clarify the connections between these models, simplify their formulation and evaluate them in a unified setting. We show that the models are essentially equivalent if syntactic information is ignored, and that the substantial performance differences… (More)