Are ensemble-average learning curves reliable in evaluating the performance of adaptive filters?
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.
We propose new algorithms to overcome two of the most constraining limitations of surface reconstruction methods in use. In particular, we focus on the large amount of data characterizing standard acquisitions by scanner and the noise intrinsically introdu ...
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation Ax=b, where A is an m×n full-rank matrix, b is a column-vector of dimension m, and m (the number of equations) is larger tha ...
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that ...
Diffusion adaptation techniques based on the least-mean-squares criterion have been proposed for distributed detection of a signal in Gaussian-distributed noise, forgoing the need for a fusion center. However, least-mean-squares solutions are generally non ...
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate func- tions based on random sampling according to a given probability measure. Recent work has shown th ...
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation Ax=b, where A is an m×n full-rank matrix, b is a column-vector of dimension m, and m (the number of equations) is larger tha ...
In this work, we analyze the mean-square performance of different strategies for distributed estimation over least-mean-squares (LMS) adaptive networks. The results highlight some useful properties for distributed adaptation in comparison to fusion-based c ...
The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit ...
The Institute of Electronics, Information and Communication Engineers2007
We study the problem of distributed least-squares estimation over ad hoc adaptive networks, where the nodes have a common objective to estimate and track a parameter vector. We consider the case where there is stationary additive colored noise on both the ...
We consider the optimization of a quadratic objective function whose gradients are only accessible through a stochastic oracle that returns the gradient at any given point plus a zero-mean finite variance random error. We present the first algorithm that a ...
