Unifying Orthogonal Monte Carlo Methods

Krzysztof Choromanski, Mark Rowland, Wenyu Chen, Adrian Weller
Proceedings of the 36th International Conference on Machine Learning, PMLR 97:1203-1212, 2019.

Abstract

Many machine learning methods making use of Monte Carlo sampling in vector spaces have been shown to be improved by conditioning samples to be mutually orthogonal. Exact orthogonal coupling of samples is computationally intensive, hence approximate methods have been of great interest. In this paper, we present a unifying perspective of many approximate methods by considering Givens transformations, propose new approximate methods based on this framework, and demonstrate the first statistical guarantees for families of approximate methods in kernel approximation. We provide extensive empirical evaluations with guidance for practitioners.

Cite this Paper


BibTeX
@InProceedings{pmlr-v97-choromanski19a, title = {Unifying Orthogonal {M}onte {C}arlo Methods}, author = {Choromanski, Krzysztof and Rowland, Mark and Chen, Wenyu and Weller, Adrian}, booktitle = {Proceedings of the 36th International Conference on Machine Learning}, pages = {1203--1212}, year = {2019}, editor = {Kamalika Chaudhuri and Ruslan Salakhutdinov}, volume = {97}, series = {Proceedings of Machine Learning Research}, month = {09--15 Jun}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v97/choromanski19a/choromanski19a.pdf}, url = { http://proceedings.mlr.press/v97/choromanski19a.html }, abstract = {Many machine learning methods making use of Monte Carlo sampling in vector spaces have been shown to be improved by conditioning samples to be mutually orthogonal. Exact orthogonal coupling of samples is computationally intensive, hence approximate methods have been of great interest. In this paper, we present a unifying perspective of many approximate methods by considering Givens transformations, propose new approximate methods based on this framework, and demonstrate the first statistical guarantees for families of approximate methods in kernel approximation. We provide extensive empirical evaluations with guidance for practitioners.} }
Endnote
%0 Conference Paper %T Unifying Orthogonal Monte Carlo Methods %A Krzysztof Choromanski %A Mark Rowland %A Wenyu Chen %A Adrian Weller %B Proceedings of the 36th International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2019 %E Kamalika Chaudhuri %E Ruslan Salakhutdinov %F pmlr-v97-choromanski19a %I PMLR %P 1203--1212 %U http://proceedings.mlr.press/v97/choromanski19a.html %V 97 %X Many machine learning methods making use of Monte Carlo sampling in vector spaces have been shown to be improved by conditioning samples to be mutually orthogonal. Exact orthogonal coupling of samples is computationally intensive, hence approximate methods have been of great interest. In this paper, we present a unifying perspective of many approximate methods by considering Givens transformations, propose new approximate methods based on this framework, and demonstrate the first statistical guarantees for families of approximate methods in kernel approximation. We provide extensive empirical evaluations with guidance for practitioners.
APA
Choromanski, K., Rowland, M., Chen, W. & Weller, A.. (2019). Unifying Orthogonal Monte Carlo Methods. Proceedings of the 36th International Conference on Machine Learning, in Proceedings of Machine Learning Research 97:1203-1212 Available from http://proceedings.mlr.press/v97/choromanski19a.html .

Related Material