This paper presents a stochastic model for the least-mean-square algorithm with symmetric/antisymmetric properties (LMS-SAS), operating in a system identification setup with Gaussian input data. Specifically, model expressions are derived to describe the mean weight behavior of the (global and virtual) adaptive filters, learning curves, and evolution of some correlation-like matrices, which allow predicting the algorithm behavior. Simulation results are shown and discussed, confirming the accuracy of the proposed model for both transient and steady-state phases
International audienceZero-attracting least-mean-square (ZA-LMS) algorithm has been widely used for ...
A fast variable step-size least-mean-square algorithm (MRVSS) is proposed and analyzed in this paper...
As one of the recently proposed algorithms for sparse system identification, l0 norm constraint Leas...
International audienceThis paper studies the behavior of the low rank LMS adaptive algorithm for the...
This paper proposes an improved stochastic model for the first and second moments of the modified fi...
International audienceNon-negativity is a widely used constraint in parameter estimation procedures ...
International audienceSome system identification problems impose nonnegativity constraints on the pa...
This study represents a stochastic model for the adaptation process performed on adaptive control sy...
The task of adaptive estimation in the presence of random and highly nonlinear environment such as w...
Abstract—For the least mean square (LMS) algorithm, we ana-lyze the correlation matrix of the filter...
International audienceThe kernel least-mean-square (KLMS) algorithm is a popular algorithm in nonlin...
We introduce a probabilistic approach to the LMS filter. By means of an efficient approximation, thi...
Non-negativity is a widely used constraint in parameter estimation procedures due to physical charac...
International audienceDynamic system modeling plays a crucial role in the development of techniques ...
This work studies the mean-square stability of stochastic gradient algorithms without resorting to s...
International audienceZero-attracting least-mean-square (ZA-LMS) algorithm has been widely used for ...
A fast variable step-size least-mean-square algorithm (MRVSS) is proposed and analyzed in this paper...
As one of the recently proposed algorithms for sparse system identification, l0 norm constraint Leas...
International audienceThis paper studies the behavior of the low rank LMS adaptive algorithm for the...
This paper proposes an improved stochastic model for the first and second moments of the modified fi...
International audienceNon-negativity is a widely used constraint in parameter estimation procedures ...
International audienceSome system identification problems impose nonnegativity constraints on the pa...
This study represents a stochastic model for the adaptation process performed on adaptive control sy...
The task of adaptive estimation in the presence of random and highly nonlinear environment such as w...
Abstract—For the least mean square (LMS) algorithm, we ana-lyze the correlation matrix of the filter...
International audienceThe kernel least-mean-square (KLMS) algorithm is a popular algorithm in nonlin...
We introduce a probabilistic approach to the LMS filter. By means of an efficient approximation, thi...
Non-negativity is a widely used constraint in parameter estimation procedures due to physical charac...
International audienceDynamic system modeling plays a crucial role in the development of techniques ...
This work studies the mean-square stability of stochastic gradient algorithms without resorting to s...
International audienceZero-attracting least-mean-square (ZA-LMS) algorithm has been widely used for ...
A fast variable step-size least-mean-square algorithm (MRVSS) is proposed and analyzed in this paper...
As one of the recently proposed algorithms for sparse system identification, l0 norm constraint Leas...