Search Results for author:
Found 3 papers, 0 papers with code
Effective and Sparse Count-Sketch via k-means clustering
This data-oblivious matrix sketching method could produce a bad sketched matrix which will result in low accuracy for subsequent machine learning tasks (e. g. classification); (2) For highly sparse input data, count-sketch could produce a dense sketched data matrix.
Memory and Computation-Efficient Kernel SVM via Binary Embedding and Ternary Model Coefficients
The analysis shows that the convergence to a local optimum is guaranteed, and the inference complexity of our model is much lower than other competing methods.
Improved Subsampled Randomized Hadamard Transform for Linear SVM
To overcome this limitation, we analyze the effect of using SRHT for random projection in the context of linear SVM classification.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
