A primal-dual proximal algorithm for sparse template-based adaptive filtering: Application to seismic multiple removal

MQ Pham, L Duval, C Chaux… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
Unveiling meaningful geophysical information from seismic data requires to deal with both
random and structured “noises”. As their amplitude may be greater than signals of interest …

Transient analysis of l0-LMS and l0-NLMS algorithms

KS Olinto, DB Haddad, MR Petraglia - Signal Processing, 2016 - Elsevier
Sparsity-aware adaptive algorithms present some advantages over standard ones, specially
due to the fact that they have faster convergence rate. This paper proposes a stochastic …

Parameter estimation and variable selection for big systems of linear ordinary differential equations: A matrix-based approach

L Wu, X Qiu, Y Yuan, H Wu - Journal of the American Statistical …, 2019 - Taylor & Francis
Ordinary differential equations (ODEs) are widely used to model the dynamic behavior of a
complex system. Parameter estimation and variable selection for a “Big System” with linear …

Joint learning of model parameters and coefficients for online nonlinear estimation

MA Takizawa, M Yukawa - IEEE Access, 2021 - ieeexplore.ieee.org
We propose a novel online algorithm for efficient nonlinear estimation. Target nonlinear
functions are approximated with “unfixed” Gaussians of which the parameters are regarded …

A sparse system identification by using adaptively-weighted total variation via a primal-dual splitting approach

S Ono, M Yamagishi, I Yamada - 2013 IEEE International …, 2013 - ieeexplore.ieee.org
Observing that sparse systems are almost smooth, we propose to utilize the newly-
introduced adaptively-weighted total variation (AWTV) for sparse system identification. In our …

Adaptive proximal forward-backward splitting for sparse system identification under impulsive noise

T Yamamoto, M Yamagishi… - 2012 Proceedings of the …, 2012 - ieeexplore.ieee.org
In this paper, we propose a robust sparsity-aware adaptive filtering algorithm under
impulsive noise environment, by using the Huber loss function in the frame of adaptive …

Projection-based regularized dual averaging for stochastic optimization

A Ushio, M Yukawa - IEEE Transactions on Signal Processing, 2019 - ieeexplore.ieee.org
We propose a novel stochastic-optimization framework based on the regularized dual
averaging (RDA) method. The proposed approach differs from the previous studies of RDA …

Online learning with self-tuned Gaussian kernels: Good kernel-initialization by multiscale screening

M Takizawa, M Yukawa - ICASSP 2019-2019 IEEE …, 2019 - ieeexplore.ieee.org
We propose an efficient adaptive update method for the kernel parameters: the kernel
coefficients, scales and centers. The mirror descent and the steepest descent method for …

Steepening squared error function facilitates online adaptation of Gaussian scales

M Takizawa, M Yukawa - ICASSP 2020-2020 IEEE …, 2020 - ieeexplore.ieee.org
We previously proposed a joint learning scheme of Gaussian parameters (scales and
centers) and coefficients for online nonlinear estimation. The instantaneous squared error …

Exploiting sparsity in feed-forward active noise control with adaptive Douglas-Rachford splitting

M Yamagishi, I Yamada - 2013 Asia-Pacific Signal and …, 2013 - ieeexplore.ieee.org
Observing that a typical primary path in Active Noise Control (ANC) system is sparse, ie,
having a few significant coefficients, we propose an adaptive learning which promotes the …