#### Filter Results:

#### Publication Year

2015

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Generalized matrix approximation plays a fundamental role in many machine learning problems, such as CUR decomposition, kernel approximation, and matrix low rank approximation. Especially with today's applications involved in larger and larger dataset, more and more efficient generalized matrix approximation algorithems become a crucially important research… (More)

- Yujun Li, Kaichun Mo, Haishan Ye
- AAAI
- 2016

Kaczmarz algorithm is an efficient iterative algorithm to solve overdetermined consistent system of linear equations. During each updating step, Kaczmarz chooses a hyperplane based on an individual equation and projects the current estimate for the exact solution onto that space to get a new estimate. Many vairants of Kacz-marz algorithms are proposed on… (More)

Prior optimal CUR decomposition and near optimal column reconstruction methods have been established by combining BSS sampling and adaptive sampling. In this paper, we propose a new approach to the optimal CUR decomposition and near optimal column reconstruction by just using leverage score sampling. In our approach, both the BSS sampling and adaptive… (More)

In this paper, we study subspace embedding problem and obtain the following results: 1. We extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Assume matrices A and B both have at most r stable rank and˜r rank, respectively. Let S be a subspace embedding matrix with l rows which depends on stable rank, then… (More)

- ‹
- 1
- ›