Column Selection via Adaptive Sampling
| 
79 | 
61 | 
0
Abstract
Selecting a good column (or row) subset of massive data matrices has found many applications in data analysis and machine learning. We propose a new adaptive sampling algorithm that can be used to improve any relative-error column selection algorithm. Our algorithm delivers a tighter theoretical bound on the approximation error which we also demonstrate empirically using two well known relative-error column subset selection algorithms. Our experimental results on synthetic and real-world data show that our algorithm outperforms non-adaptive sampling as well as prior adaptive sampling approaches.
还没有评论，说两句吧！
热门资源
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
Learning to Predi...
Much of model-based reinforcement learning invo...
dynamical system ...
allows to preform manipulations of heavy or bul...
The Variational S...
Unlike traditional images which do not offer in...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
