Concept

Topologie faible

Publications associées (88)

A Linearly Convergent Algorithm for Decentralized Optimization: Sending Less Bits for Free!

Decentralized optimization methods enable on-device training of machine learning models without a central coordinator. In many scenarios communication between devices is energy demanding and time consuming and forms the bottleneck of the entire system. We ...

2020

Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes

Emre Telatar, Yunus Inan

We consider finite-level, symmetric quantization procedures for construction and decoding of polar codes. Whether polarization occurs in the presence of quantization is not known in general. Hassani and Urbanke have shown that a simple three-level quantiza ...

2020

Complex polymer topologies and polymer-nanoparticle hybrid films prepared via surface-initiated controlled radical polymerization

Harm-Anton Klok, Piotr Mocny

Advances in controlled radical polymerization over the past two decades have transformed the ability to produce molecularly well-defined, chain-end tethered polymer brush films. The assets of controlled radical polymerization reactions have impacted the sy ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Neural Anisotropy Directions

Pascal Frossard, Seyed Mohsen Moosavi Dezfooli, Guillermo Ortiz Jimenez, Apostolos Modas

In this work, we analyze the role of the network architecture in shaping the inductive bias of deep classifiers. To that end, we start by focusing on a very simple problem, i.e., classifying a class of linearly separable distributions, and show that, depen ...

2020

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

Regularity of solutions for a fourth-order elliptic system via Conservation law

Changyu Guo

In this paper, we obtain interior Holder continuity for solutions of the fourth-order elliptic system Delta(2)u = Delta(V center dot del u) + div(w del u) + W center dot del u formulated by Lamm and Riviere [Comm. Partial Differential Equations 33 (2008) 2 ...

2019

On the convergence of stochastic primal-dual hybrid gradient

Volkan Cevher, Ahmet Alacaoglu

In this paper, we analyze the recently proposed stochastic primal-dual hybrid gradient (SPDHG) algorithm and provide new theoretical results. In particular, we prove almost sure convergence of the iterates to a solution and linear convergence with standard ...

2019

On Cyclic Dependencies and Regulators in Time-Sensitive Networks

Jean-Yves Le Boudec, Ludovic Bernard Gérard Thomas

For time-sensitive networks, as in the context of IEEE TSN and IETF Detnet, cyclic dependencies are associated with certain fundamental properties such as improving availability and decreasing reconfiguration effort. Nevertheless, the existence of cyclic d ...

IEEE2019

On Cyclic Dependencies and Regulators in Time-Sensitive Networks

Jean-Yves Le Boudec, Ludovic Bernard Gérard Thomas

IEEE2019

Variance-Reduced Stochastic Learning by Networked Agents Under Random Reshuffling

Ali H. Sayed, Bicheng Ying, Kun Yuan

This paper develops a distributed variance-reduced strategy for a collection of interacting agents that are connected by a graph topology. The resulting diffusion-AVRG (where AVRG stands for "amortized variance-reduced gradient") algorithm is shown to have ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search