Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1610.06209 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911276900286464 |
|---|---|
| author | Bojarski, Mariusz Choromanska, Anna Choromanski, Krzysztof Fagan, Francois Gouy-Pailler, Cedric Morvan, Anne Sakr, Nourhan Sarlos, Tamas Atif, Jamal |
| author_facet | Bojarski, Mariusz Choromanska, Anna Choromanski, Krzysztof Fagan, Francois Gouy-Pailler, Cedric Morvan, Anne Sakr, Nourhan Sarlos, Tamas Atif, Jamal |
| contents | We consider an efficient computational framework for speeding up several machine learning algorithms with almost no loss of accuracy. The proposed framework relies on projections via structured matrices that we call Structured Spinners, which are formed as products of three structured matrix-blocks that incorporate rotations. The approach is highly generic, i.e. i) structured matrices under consideration can either be fully-randomized or learned, ii) our structured family contains as special cases all previously considered structured schemes, iii) the setting extends to the non-linear case where the projections are followed by non-linear functions, and iv) the method finds numerous applications including kernel approximations via random feature maps, dimensionality reduction algorithms, new fast cross-polytope LSH techniques, deep learning, convex optimization algorithms via Newton sketches, quantization with random projection trees, and more. The proposed framework comes with theoretical guarantees characterizing the capacity of the structured model in reference to its unstructured counterpart and is based on a general theoretical principle that we describe in the paper. As a consequence of our theoretical analysis, we provide the first theoretical guarantees for one of the most efficient existing LSH algorithms based on the HD3HD2HD1 structured matrix [Andoni et al., 2015]. The exhaustive experimental evaluation confirms the accuracy and efficiency of structured spinners for a variety of different applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1610_06209 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Structured adaptive and random spinners for fast machine learning computations Bojarski, Mariusz Choromanska, Anna Choromanski, Krzysztof Fagan, Francois Gouy-Pailler, Cedric Morvan, Anne Sakr, Nourhan Sarlos, Tamas Atif, Jamal Machine Learning We consider an efficient computational framework for speeding up several machine learning algorithms with almost no loss of accuracy. The proposed framework relies on projections via structured matrices that we call Structured Spinners, which are formed as products of three structured matrix-blocks that incorporate rotations. The approach is highly generic, i.e. i) structured matrices under consideration can either be fully-randomized or learned, ii) our structured family contains as special cases all previously considered structured schemes, iii) the setting extends to the non-linear case where the projections are followed by non-linear functions, and iv) the method finds numerous applications including kernel approximations via random feature maps, dimensionality reduction algorithms, new fast cross-polytope LSH techniques, deep learning, convex optimization algorithms via Newton sketches, quantization with random projection trees, and more. The proposed framework comes with theoretical guarantees characterizing the capacity of the structured model in reference to its unstructured counterpart and is based on a general theoretical principle that we describe in the paper. As a consequence of our theoretical analysis, we provide the first theoretical guarantees for one of the most efficient existing LSH algorithms based on the HD3HD2HD1 structured matrix [Andoni et al., 2015]. The exhaustive experimental evaluation confirms the accuracy and efficiency of structured spinners for a variety of different applications. |
| title | Structured adaptive and random spinners for fast machine learning computations |
| topic | Machine Learning |
| url | https://arxiv.org/abs/1610.06209 |