/spright

Primary LanguageJupyter NotebookMIT LicenseMIT

spright

An implementation of and extension to the SPRIGHT (SParse Robust Iterative Graph-based Hadamard Transform) algorithm.

References

[1] Li, X., Ramchandran, K. (2015). An Active Learning Framework using Sparse-Graph Codes for Sparse Polynomials and Graph Sketching. NeurIPS, http://papers.neurips.cc/paper/5697-an-active-learning-framework-using-sparse-graph-codes-for-sparse-polynomials-and-graph-sketching.pdf

[2] Li, X., Bradley, J., Pawar, S., Ramchandran, K. (2015). SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform. arXiv.org. cs.IT. https://arxiv.org/abs/1508.06336

Comments in the code referencing equation and page numbers refer to [2] unless otherwise specified.