Publications related to Decentralized consensus optimization with asynchrony and delays

Inversion Minimization in Majority-Inverter Graphs

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Eleonora Testa

In this paper, we present new optimization techniques for the recently introduced Majority-Inverter Graph (MIG). Our optimizations exploit intrinsic algebraic properties of MIGs and aim at rewriting the complemented edges of the graph without changi ...

2016

An Efficient Streaming Algorithm for the Submodular Cover Problem

Volkan Cevher, Ilija Bogunovic, Ya-Ping Hsieh, Ashkan Norouzi Fard, Abbas Bazzi, Marwa El Halabi

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream wi ...

2016

Pattern formation with voluminous processes

Alexandre David Olivier Maurer

When a shoal of small fishes notices a predator, they typically change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. This motivates us to design algorithms with similar properties. In this p ...

EPFL2016

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

Target-based fiber assignment for large survey spectrographs

Jean-Paul Richard Kneib, Laleh Makarem

Next generation massive spectroscopic survey projects have to process a massive amount of targets. The preparation of subsequent observations should be feasible in a reasonable amount of time. We present a fast algorithm for target assignment that scales a ...

Spie-Int Soc Optical Engineering2016

Maximizing k-Submodular Functions and Beyond

Justin Dean Ward

We consider the maximization problem in the value oracle model of functions defined on k-tuples of sets that are submodular in every orthant and r-wise monotone, where k >= 2 and 1

Assoc Computing Machinery2016

Fast K-Means with Accurate Bounds

François Fleuret, James Peter Newling

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016

Sensing the real world

Juri Ranieri

A sensor is a device that detects or measures a physical property and records, indicates, or otherwise responds to it. In other words, a sensor allows us to interact with the surrounding environment, by measuring qualitatively or quantitatively a given phe ...

EPFL2014

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Jan Sickmann Hesthaven, Benjamin Stamm

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Pénélope Leyland, Ojas Joshi

Numerical multiphysics coupling is gaining more and more importance in engineering. Partitioned algorithms are among the most efficient methods to solve the coupled problem. However, they present some drawbacks, with the stability of the algorithm itself b ...

Amer Inst Aeronautics Astronautics2014

Decentralized consensus optimization with asynchrony and delays

Graph Chatbot

Chat with Graph Search

Inversion Minimization in Majority-Inverter Graphs

An Efficient Streaming Algorithm for the Submodular Cover Problem

Pattern formation with voluminous processes

Collision-Free Pattern Formation

Target-based fiber assignment for large survey spectrographs

Maximizing k-Submodular Functions and Beyond

Fast K-Means with Accurate Bounds

Sensing the real world

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Pattern formation with voluminous processes

Fast K-Means with Accurate Bounds

Sensing the real world

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

An Efficient Streaming Algorithm for the Submodular Cover Problem

Collision-Free Pattern Formation

Inversion Minimization in Majority-Inverter Graphs

Target-based fiber assignment for large survey spectrographs

Maximizing k-Submodular Functions and Beyond

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm