Improved Subsampled Randomized Hadamard Transform for Linear SVM

@inproceedings{Lei2020ImprovedSR,
  title={Improved Subsampled Randomized Hadamard Transform for Linear SVM},
  author={Z. Lei and Liang Lan},
  booktitle={AAAI},
  year={2020}
}
  • Z. Lei, Liang Lan
  • Published in AAAI 2020
  • Computer Science, Mathematics
  • Subsampled Randomized Hadamard Transform (SRHT), a popular random projection method that can efficiently project a $d$-dimensional data into $r$-dimensional space ($r \ll d$) in $O(dlog(d))$ time, has been widely used to address the challenge of high-dimensionality in machine learning. SRHT works by rotating the input data matrix $\mathbf{X} \in \mathbb{R}^{n \times d}$ by Randomized Walsh-Hadamard Transform followed with a subsequent uniform column sampling on the rotated matrix. Despite the… CONTINUE READING

    Figures and Tables from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 30 REFERENCES
    Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
    • 92
    • PDF
    Faster Ridge Regression via the Subsampled Randomized Hadamard Transform
    • 91
    • PDF
    Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
    • 208
    • PDF
    Randomized Clustered Nystrom for Large-Scale Kernel Machines
    • 18
    • PDF
    Recovering the Optimal Solution by Dual Random Projection
    • 54
    • PDF
    Sparse Embedded k-Means Clustering
    • 17
    • PDF
    Random Projections for $k$-means Clustering
    • 112
    • PDF
    Improved Analysis of the subsampled Randomized Hadamard Transform
    • J. Tropp
    • Mathematics, Computer Science
    • 2011
    • 216
    • PDF