
A Characterization of the Realizable Matoušek Unique Sink Orientations
The Matoušek LPtype problems were used by Matoušek to show that the Sha...
read it

A Subexponential Algorithm for ARRIVAL
The ARRIVAL problem is to decide the fate of a train moving along the ed...
read it

A New Combinatorial Property of Geometric Unique Sink Orientations
A unique sink orientation (USO) is an orientation of the hypercube graph...
read it

Phase Transition in Democratic Opinion Dynamics
Consider a community where initially, each individual is positive or neg...
read it

The Crossing Tverberg Theorem
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
read it

ARRIVAL: Next Stop in CLS
We study the computational complexity of ARRIVAL, a zeroplayer game on ...
read it

(Biased) Majority Rule Cellular Automata
Consider a graph G=(V,E) and a random initial vertexcoloring, where eac...
read it

Majority Model on Random Regular Graphs
Consider a graph G=(V,E) and an initial random coloring where each verte...
read it

Screening Rules for Convex Problems
We propose a new framework for deriving screening rules for convex optim...
read it

Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions
A function f: R^d →R is a Sparse Additive Model (SPAM), if it is of the ...
read it

Learning Sparse Additive Models with Interactions in High Dimensions
A function f: R^d →R is referred to as a Sparse Additive Model (SPAM), i...
read it

Stochastic continuum armed bandit problem of few linear parameters in high dimensions
We consider a stochastic continuum armed bandit problem where the arms a...
read it

A Combinatorial Algorithm to Compute Regularization Paths
For a wide variety of regularization methods, algorithms computing the e...
read it

An Exponential Lower Bound on the Complexity of Regularization Paths
For a variety of regularized optimization problems in machine learning, ...
read it
Bernd Gärtner
is this you? claim profile