activity
20172023
most citedAdaptively Sketched Bregman Projection Methods for Linear Systems

15 citations · 46 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2023

Regularize implicit neural representation by itself

Zhemin Li, Hongxia Wang, Deyu Meng

This paper proposes a regularizer called Implicit Neural Representation Regularizer (INRR) to improve the generalization ability of the Implicit Neural Representation (INR). The IN…

cs.CV2022★ 7 cited

Adaptive and Implicit Regularization for Matrix Completion

Zhemin Li, Tao Sun, Hongxia Wang +1

The explicit low-rank regularization, e.g., nuclear norm regularization, has been widely used in imaging sciences. However, it has been found that implicit regularization outperfor…

math.NA2021★ 15 cited

Adaptively Sketched Bregman Projection Methods for Linear Systems

Ziyang Yuan, Lu Zhang, Hongxia Wang +1

The sketch-and-project, as a general archetypal algorithm for solving linear systems, unifies a variety of randomized iterative methods such as the randomized Kaczmarz and randomiz…

cs.LG2021★ 7 cited

AIR-Net: Adaptive and Implicit Regularization Neural Network for Matrix Completion

Zhemin Li, Tao Sun, Hongxia Wang +1

The explicit low-rank regularization, e.g., nuclear norm regularization, has been widely used in imaging sciences. However, it has been found that implicit regularization outperfor…

cs.LG2020★ 1 cited

A Robust graph attention network with dynamic adjusted Graph

Xianchen Zhou, Yaoyun Zeng, Hongxia Wang

Graph Attention Networks(GATs) are useful deep learning models to deal with the graph data. However, recent works show that the classical GAT is vulnerable to adversarial attacks.…

cs.LG2020★ 13 cited

A regularized deep matrix factorized model of matrix completion for image restoration

Zhemin Li, Zhi-Qin John Xu, Tao Luo +1

It has been an important approach of using matrix completion to perform image restoration. Most previous works on matrix completion focus on the low-rank property by imposing expli…

cs.DS2018

The Cut and Dominating Set Problem in A Steganographer Network

Hanzhou Wu, Wei Wang, Jing Dong +2

A steganographer network corresponds to a graphic structure that the involved vertices (or called nodes) denote social entities such as the data encoders and data decoders, and the…

cs.MM2017★ 3 cited

A Graph-theoretic Model to Steganography on Social Networks

Hanzhou Wu, Wei Wang, Jing Dong +2

Steganography aims to conceal the very fact that the communication takes place, by embedding a message into a digit object such as image without introducing noticeable artifacts. A…