Concept

Opérateur de décalage

Publications associées (20)

Explicit representations for Banach subspaces of Lizorkin distributions

The Lizorkin space is well suited to the study of operators like fractional Laplacians and the Radon transform. In this paper, we show that the space is unfortunately not complemented in the Schwartz space. In return, we show that it is dense in C0(Double- ...

WORLD SCIENTIFIC PUBL CO PTE LTD2023

Stochastic distributed learning with gradient quantization and double-variance reduction

Sebastian Urban Stich, Konstantin Mishchenko

We consider distributed optimization over several devices, each sending incremental model updates to a central server. This setting is considered, for instance, in federated learning. Various schemes have been designed to compress the model updates in orde ...

TAYLOR & FRANCIS LTD2022

Fredholm transformation on Laplacian and rapid stabilization for the heat equation

Shengquan Xiang

We study the rapid stabilization of the heat equation on the 1-dimensional torus using the backstepping method with a Fredholm transformation. This classical framework allows us to present the backstepping method with Fredholm transformations for the Lapla ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Leveraging topology, geometry, and symmetries for efficient Machine Learning

Michaël Defferrard

When learning from data, leveraging the symmetries of the domain the data lies on is a principled way to combat the curse of dimensionality: it constrains the set of functions to learn from. It is more data efficient than augmentation and gives a generaliz ...

EPFL2022

Fredholm transformation on Laplacian and rapid stabilization for the heat equations

Shengquan Xiang

We revisit the rapid stabilization of the heat equation on the 1-dimensional torus using the backstepping method with a Fredholm transformation. We prove that, under some assumption on the control operator, two scalar controls are necessary and sufficient ...

2021

Error Feedback Fixes SignSGD and other Gradient Compression Schemes

Martin Jaggi, Sebastian Urban Stich, Quentin Rebjock, Sai Praneeth Reddy Karimireddy

Sign-based algorithms (e.g. signSGD) have been proposed as a biased gradient compression technique to alleviate the communication bottleneck in training large neural networks across multiple workers. We show simple convex counter-examples where signSGD doe ...

PMLR2019

Error Feedback Fixes SignSGD and other Gradient Compression Schemes

Martin Jaggi, Sebastian Urban Stich, Quentin Rebjock, Sai Praneeth Reddy Karimireddy

2019

Multi-channel Time Encoding for Improved Reconstruction of Bandlimited Signals

Martin Vetterli, Adam James Scholefield, Karen Adam

Traditional sampling involves encoding a signal through (time, value)-pairs. In contrast, time encoding machines (TEMs) characterize a signal by recording time points which depend on the integral of the signal over time. We study multi-channel TEMs where c ...

2019

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Demand Shifting Mechanisms

Since its creation in 1948, car sharing systems have always became more current worldwide. They represent a solution to congestions, parking issues as well as environmental pollution. This study aims at developing a new operational management of a one-way ...

2018

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

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019