Quantization for Decentralized Learning Under Subspace Constraints
Publications associées (44)
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.
The goal of this paper is to propose a bio-inspired algorithm for decentralized dynamic access in cognitive radio systems. We study an improved social foraging swarm model that lets every node allocate its resources (power/bits) in the frequency regions wh ...
In point-to-point source-channel communication with a fidelity criterion and a transmission cost constraint, the region of achievable cost and fidelity pairs is completely characterized by Shannon's separation theorem. However, this is in general only true ...
We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset up ...
In this paper, multiple-input multiple-output (MIMO) relay transceiver processing is proposed for multiuser two-way relay communications. The relay processing is optimized based on both zero-forcing (ZF) and minimum mean-square-error (MMSE) criteria under ...
In this paper, we investigate the self-organization and cognitive abilities of adaptive networks when the individual agents are allowed to move in pursuit of a target. The nodes act as adaptive entities with localized processing and are able to respond to ...
Conventional sampling (Shannon's sampling formulation and its approximation-theoretic counterparts) and interpolation theories provide effective solutions to the problem of reconstructing a signal from its samples, but they are primarily restricted to the ...
Non-local means (NLM) provides a powerful framework for denoising. However, there are a few parameters of the algorithm-most notably, the width of the smoothing kernel-that are data-dependent and difficult to tune. Here, we propose to use Stein's unbiased ...
Institute of Electrical and Electronics Engineers2009
Audio coding based on Frequency Domain Linear Prediction (FDLP) uses auto-regressive models to approximate Hilbert envelopes in frequency sub-bands. Although the basic technique achieves good coding efficiency, there is a need to improve the reconstructed ...
This paper proposes a distributed resource assignment strategy for cognitive networks mimicking a swarm foraging mechanism, assuming that the communication among the cognitive nodes is impaired by random link failures and quantization noise. Using results ...
We consider the problem of optimizing the parameters of a given denoising algorithm for restoration of a signal corrupted by white Gaussian noise. To achieve this, we propose to minimize Stein's unbiased risk estimate (SURE) which provides a means of asses ...