Sparse Distributed Learning Based on Diffusion Adaptation
Related publications (54)
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.
The effective representation of the structures in the multiview images is an important problem that arises in visual sensor networks. This paper presents a novel recovery scheme from compressive samples which exploit local and non-local correlated structur ...
The effective representation of the structures in the multiview images is an important problem that arises in visual sensor networks. This paper presents a novel recovery scheme from compressive samples which exploit local and non-local correlated structur ...
The recent advances in fluorescent molecular probes, photon detection instrumentation, and photon propagation models in tissue, have facilitated the emergence of innovative molecular imaging technologies such as Fluorescence Diffuse Optical Tomography (FDO ...
The goal of this paper is to propose diffusion LMS techniques for distributed estimation over adaptive networks, which are able to exploit sparsity in the underlying system model. The approach relies on convex regularization, common in compressive sensing, ...
We propose an adaptive diffusion mechanism to optimize global cost functions in a distributed manner over a network of nodes. The cost function is assumed to consist of a collection of individual components. Diffusion adaptation allows the nodes to coopera ...
In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is generic enough to ...
Institute of Electrical and Electronics Engineers2012
In this paper we consider recovery of a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model which can efficiently restricts the degrees of freedom of data and, at the same time, is generic so that f ...
We develop a principled way of identifying probability distributions whose independent and identically distributed realizations are compressible, i.e., can be well approximated as sparse. We focus on Gaussian compressed sensing, an example of underdetermin ...
Over the past decade researches in applied mathematics, signal processing and communications have introduced compressive sampling (CS) as an alternative to the Shannon sampling theorem. The two key observations making CS theory widely applicable to numerou ...
The least absolute shrinkage and selection operator (LASSO) for linear regression exploits the geometric interplay of the ℓ2-data error objective and the ℓ1-norm constraint to arbitrarily select sparse models. Guiding this uninformed selection ...