Related publications (20)

Explicit representations for Banach subspaces of Lizorkin distributions

Michaël Unser, Sebastian Jonas Neumayer

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

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

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 ...
2019

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set RNR\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\unicode[STIX]{x1D716}>0 there exists a set B=i=1raiN+biB=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}, where $a_{1},\ldots ,a_ ...
2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.