We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the Johnson-Lindenstrauss transform and the angular kernel, we show that we can select matrices yielding guaranteed improved performance in accuracy and/or speed compared to earlier methods. We introduce matrices with complex entries which give significant further accuracy improvement. We provide geometric and Markov chain-based perspectives to help understand the benefits, and empirical results which suggest that the approach is helpful in a wider range of applications.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1703.00864")
get_code_for_paper("1703.00864")
have("1703.00864")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1703.00864.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1703.00864)
Connect an agent — have() is free.