Danqi Jin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Danqi Jin has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Jie Chen
School of Artificial Intelligence, Northwestern Polytechnical University, Xian, China
11 shared publications - Cédric Richard
Universit Cte dAzur, CNRS, OCA, Nice, France
7 shared publications - Jingdong Chen
School of Marine Science and Technology, Northwestern Polytechnical University, Xian, China
6 shared publications Yitong Chen
Centre of Intelligent Acoustics and Immersive Communications at School of Marine Science and Technology, Northwestern Polytechnical University, Xian, China
5 shared publicationsJie Chen
4 shared publications- Ali H. Sayed
School of Engineering, cole Polytechnique Fdrale de Lausanne (EPFL), Lausanne, Switzerland
3 shared publications
Latest Publications
- 2 January 2026
- Published by Springer Nature
- p. 24-34
CDMGTU-Net: A Causal Dual-Branch Multi-channel Speech Enhancement Network with Multi-scale Gated Feature Fusion
- 2 January 2026
- Published by Springer Nature
- p. 24-34
CDMGTU-Net: A Causal Dual-Branch Multi-channel Speech Enhancement Network with Multi-scale Gated Feature Fusion
- 14 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 4004-4008
Zeroth-Order Distributed Stochastic Optimization Over Riemannian Manifolds
Due to its ability to handle strict constraints on feasible domains, distributed optimization over a Riemannian manifold offers an attractive solution for many practical applications. To develop such an algorithm for scenarios where the explicit expression of the cost function is unavailable, we introduce the zeroth-order (ZO) Riemannian stochastic gradient into distributed optimization on a Riemannian manifold. Specifically, an intermediate estimate is first obtained through a local update step using the ZO Riemannian stochastic gradient, which is ap proximated based on two function evaluations. Subsequently, an improved estimate is derived by minimizing the weighted Fr´echet mean over the manifold using information from neighboring nodes. To further enhance performance, a mini-batch strategy is incorporated into the gradient estimation process. Finally, simulation results are presented to validate the effectiveness of the proposed algorithm.
- 14 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 4004-4008
Zeroth-Order Distributed Stochastic Optimization Over Riemannian Manifolds
Due to its ability to handle strict constraints on feasible domains, distributed optimization over a Riemannian manifold offers an attractive solution for many practical applications. To develop such an algorithm for scenarios where the explicit expression of the cost function is unavailable, we introduce the zeroth-order (ZO) Riemannian stochastic gradient into distributed optimization on a Riemannian manifold. Specifically, an intermediate estimate is first obtained through a local update step using the ZO Riemannian stochastic gradient, which is ap proximated based on two function evaluations. Subsequently, an improved estimate is derived by minimizing the weighted Fr´echet mean over the manifold using information from neighboring nodes. To further enhance performance, a mini-batch strategy is incorporated into the gradient estimation process. Finally, simulation results are presented to validate the effectiveness of the proposed algorithm.
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 314-328
Distributed Online Learning Over Multitask Networks With Rank-One Model
Modeling multitask relations in distributed networks has garnered considerable interest in recent years. In this paper, we present a novel rank-one model, where all the optimal vectors to be estimated are scaled versions of an unknown vector to be determined. By considering the rank-one relation, we develop a constrained centralized optimization problem, and after a decoupling process, it is solved in a distributed way by using the projected gradient descent method. To perform an efficient calculation of this projection, we suggest substituting the intensive singular value decomposition with the computationally efficient power method. Additionally, local estimates targeting the same optimal vector are combined within a neighborhood to further improve their accuracy. Theoretical analyses of the proposed algorithm are conducted for star topologies, and conditions are derived to guarantee its stability in both the mean and mean-square senses. Finally, simulation results are presented to demonstrate the effectiveness of the proposed algorithms.
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 314-328
Distributed Online Learning Over Multitask Networks With Rank-One Model
Modeling multitask relations in distributed networks has garnered considerable interest in recent years. In this paper, we present a novel rank-one model, where all the optimal vectors to be estimated are scaled versions of an unknown vector to be determined. By considering the rank-one relation, we develop a constrained centralized optimization problem, and after a decoupling process, it is solved in a distributed way by using the projected gradient descent method. To perform an efficient calculation of this projection, we suggest substituting the intensive singular value decomposition with the computationally efficient power method. Additionally, local estimates targeting the same optimal vector are combined within a neighborhood to further improve their accuracy. Theoretical analyses of the proposed algorithm are conducted for star topologies, and conditions are derived to guarantee its stability in both the mean and mean-square senses. Finally, simulation results are presented to demonstrate the effectiveness of the proposed algorithms.
- 8 February 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 160
Online learning over distributed low-rank networks via sequential power iteration
- 8 February 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 160
Online learning over distributed low-rank networks via sequential power iteration
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 706-710
Conjugate Gradient and Variance Reduction Based Online ADMM for Low-Rank Distributed Networks
Modeling the relationships that may connect optimal parameter vectors is essential for the performance of parameter estimation methods in distributed networks. In this paper, we consider a low-rank relationship and introduce matrix factorization to promote this low-rank property. To devise a distributed algorithm that does not require any prior knowledge about the low-rank space, we first formulate local optimization problems at each node, which are subsequently addressed using the Alternating Direction Method of Multipliers (ADMM). Three subproblems naturally arise from ADMM, each resolved in an online manner with low computational costs. Specifically, the first one is solved using stochastic gradient descent (SGD), while the other two are handled using the conjugate gradient descent method to avoid matrix inversion operations. To further enhance performance, a variance reduction algorithm is incorporated into the SGD. Simulation results validate the effectiveness of the proposed algorithm.
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 706-710
Conjugate Gradient and Variance Reduction Based Online ADMM for Low-Rank Distributed Networks
Modeling the relationships that may connect optimal parameter vectors is essential for the performance of parameter estimation methods in distributed networks. In this paper, we consider a low-rank relationship and introduce matrix factorization to promote this low-rank property. To devise a distributed algorithm that does not require any prior knowledge about the low-rank space, we first formulate local optimization problems at each node, which are subsequently addressed using the Alternating Direction Method of Multipliers (ADMM). Three subproblems naturally arise from ADMM, each resolved in an online manner with low computational costs. Specifically, the first one is solved using stochastic gradient descent (SGD), while the other two are handled using the conjugate gradient descent method to avoid matrix inversion operations. To further enhance performance, a variance reduction algorithm is incorporated into the SGD. Simulation results validate the effectiveness of the proposed algorithm.
- 7 January 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 159
A unified combination scheme for online learning and distributed optimization over networks
- 7 January 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 159
A unified combination scheme for online learning and distributed optimization over networks
- 1 October 2021
- Published by Elsevier in Digital Signal Processing
- Vol. 117
A model-based variable step-size strategy for proximal multitask diffusion LMS algorithm
- 1 October 2021
- Published by Elsevier in Digital Signal Processing
- Vol. 117
A model-based variable step-size strategy for proximal multitask diffusion LMS algorithm
- 31 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 589-602
Zeroth-Order Diffusion Adaptive Filter Over Networks
Most existing diffusion-based estimation algorithms require the explicit expression of the cost function in order to evaluate the stochastic gradient. In this work, we first discuss the zeroth-order (ZO) gradient for diffusion strategies, and present the ZO-diffusion algorithm that is suitable for applications where the explicit expression of the cost function is unavailable. In addition, to improve the convergence rate of the ZO-diffusion algorithm, we introduce a time-averaging stochastic variance reduced gradient (TA-SVRG) strategy, which is a variant of SVRG algorithm and designed to address online learning problems, and propose a ZO-TA-SVRG diffusion algorithm. Then, we analyze the mean and mean-square stability of the proposed ZO-TA-SVRG diffusion algorithm. Finally, simulation results are provided that demonstrate the performance and effectiveness of the proposed algorithms.
- 31 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 589-602
Zeroth-Order Diffusion Adaptive Filter Over Networks
Most existing diffusion-based estimation algorithms require the explicit expression of the cost function in order to evaluate the stochastic gradient. In this work, we first discuss the zeroth-order (ZO) gradient for diffusion strategies, and present the ZO-diffusion algorithm that is suitable for applications where the explicit expression of the cost function is unavailable. In addition, to improve the convergence rate of the ZO-diffusion algorithm, we introduce a time-averaging stochastic variance reduced gradient (TA-SVRG) strategy, which is a variant of SVRG algorithm and designed to address online learning problems, and propose a ZO-TA-SVRG diffusion algorithm. Then, we analyze the mean and mean-square stability of the proposed ZO-TA-SVRG diffusion algorithm. Finally, simulation results are provided that demonstrate the performance and effectiveness of the proposed algorithms.
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 6319-6335
Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ RegularizationModeling relations between local optimum parameter vectors to estimate in multitask networks has attracted much attention over the last years. This work considers a distributed optimization problem with jointly sparse structure among nodes, that is, the local solutions have the same sparse support set. Several mixed norm have been proposed to address the jointly sparse structure in the literature. Among several candidates, the (reweighted) ℓ ∞,1 -norm is element-wise separable, it is more convenient to evaluate their approximate proximal operators. Thus by introducing a (reweighted) ℓ ∞,1 -norm penalty term at each node, and using a proximal gradient method to minimize the regularized cost, we devise a proximal multitask diffusion LMS algorithm which can promote joint-sparsity. Analyses are provided to characterize the algorithm behavior in the mean and mean-square sense. Simulation results are presented to show its effectiveness, as well as the accuracy of the theoretical findings.
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 6319-6335
Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ RegularizationModeling relations between local optimum parameter vectors to estimate in multitask networks has attracted much attention over the last years. This work considers a distributed optimization problem with jointly sparse structure among nodes, that is, the local solutions have the same sparse support set. Several mixed norm have been proposed to address the jointly sparse structure in the literature. Among several candidates, the (reweighted) ℓ ∞,1 -norm is element-wise separable, it is more convenient to evaluate their approximate proximal operators. Thus by introducing a (reweighted) ℓ ∞,1 -norm penalty term at each node, and using a proximal gradient method to minimize the regularized cost, we devise a proximal multitask diffusion LMS algorithm which can promote joint-sparsity. Analyses are provided to characterize the algorithm behavior in the mean and mean-square sense. Simulation results are presented to show its effectiveness, as well as the accuracy of the theoretical findings.
- 20 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 2087-2104
Affine Combination of Diffusion Strategies Over Networks
Diffusion adaptation is a powerful strategy for distributed estimation and learning over networks. Motivated by the concept of combining adaptive filters, this work proposes a combination framework that aggregates the operation of multiple diffusion strategies for enhanced performance. By assigning a combination coefficient to each node, and using an adaptation mechanism to minimize the network error, we obtain a combined diffusion strategy that benefits from the best characteristics of all component strategies simultaneously in terms of excess-mean- square error (EMSE). Analyses of the universality are provided to show the superior performance of affine combination scheme and to characterize its behavior in the mean and mean-square sense. Simulation results are presented to demonstrate the effectiveness of the proposed strategies, as well as the accuracy of theoretical findings.
- 20 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 2087-2104
Affine Combination of Diffusion Strategies Over Networks
Diffusion adaptation is a powerful strategy for distributed estimation and learning over networks. Motivated by the concept of combining adaptive filters, this work proposes a combination framework that aggregates the operation of multiple diffusion strategies for enhanced performance. By assigning a combination coefficient to each node, and using an adaptation mechanism to minimize the network error, we obtain a combined diffusion strategy that benefits from the best characteristics of all component strategies simultaneously in terms of excess-mean- square error (EMSE). Analyses of the universality are provided to show the superior performance of affine combination scheme and to characterize its behavior in the mean and mean-square sense. Simulation results are presented to demonstrate the effectiveness of the proposed strategies, as well as the accuracy of theoretical findings.