Adversarial attacks are a serious threat to the reliable deployment of
m...
By introducing a subsampling strategy, we propose a randomized block
Kac...
We first propose the regular sketch-and-project method for solving tenso...
To solve nonlinear problems, we construct two kinds of greedy capped
non...
The nonlinear Kaczmarz method was recently proposed to solve the system ...
The indefinite least squares (ILS) problem is a generalization of the fa...
Aiming at the high cost of embedding annotation watermark in a narrow sm...
We first extend the famous sketch-and-project method and its adaptive
va...
The randomized Gauss–Seidel method and its extension have attracted much...
In this paper, we analyze the convergence behavior of the randomized ext...
Federated learning enables multiple participants to collaboratively trai...
The sampling Kaczmarz-Motzkin (SKM) method is a generalization of the
ra...
The famous greedy randomized Kaczmarz (GRK) method uses the greedy selec...
We present a novel greedy Gauss-Seidel method for solving large linear l...
In this paper, combining count sketch and maximal weighted residual Kacz...
With a greedy strategy to construct control index set of coordinates fir...
With a quite different way to determine the working rows, we propose a n...
Cataracts, which are lenticular opacities that may occur at different le...
A new optimized extreme learning machine- (ELM-) based method for power
...
Simultaneous Localization And Mapping (SLAM) is the problem of construct...