We consider the problem of transfer learning in an online setting. Di↵erent tasks are presented sequentially and processed by a within-task algorithm. We propose a lifelong learning strategy which refines the underlying data representation used by the withintask algorithm, thereby transferring information from one task to the next. We show that when the within-task algorithm comes with some reg...

We prove a two-sided transference theorem between $$L^{p}$$ spherical multipliers on the compact symmetric space U/K and vector $$i{\mathfrak {p}},$$ where Lie algebra of U has Cartan decomposition $$\mathfrak {k\oplus }i{\mathfrak {p}}$$ . This generalizes classic deLeeuw relating $$ L^{p}(\mathbb {T)}$$ $$L^{p}(\mathbb {R)}$$

Fountain codes are becoming increasingly important for data transferring over dedicated high-speed long-distance network. However, the encoding and decoding complexity of traditional fountain codes such as LT and Raptor codes are still high. In this paper, a new fountain codes named LRF (Loss Rate Based Fountain) codes for data transfer is proposed. In order to improve the performance of encodi...