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.
Scalable algorithms to solve optimization and regression tasks even approximately, are needed to work with large datasets. In this paper we study efficient techniques from matrix sketching to solve a variety of convex constrained regression problems. We adopt "Iterative Hessian Sketching" (IHS) and show that the fast CountSketch and sparse Johnson-Lindenstrauss Transforms yield state-of-the-art accuracy guarantees under IHS, while drastically improving the time cost. As a result, we obtain significantly faster algorithms for constrained regression, for both sparse and dense inputs. Our empirical results show that we can summarize data roughly 100x faster for sparse data, and, surprisingly, 10x faster on dense data! Consequently, solutions accurate to within machine precision of the optimal solution can be found much faster than the previous state of the art.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.14166")
get_code_for_paper("1910.14166")
have("1910.14166")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.14166.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.14166)
Connect an agent — have() is free.