Shit, SupratimSupratimShit2025-08-312025-08-312020-01-02[9781450388177]10.1145/3430984.34310632-s2.0-85098875320https://d8.irins.org/handle/IITG2025/25694We study the distribution of matrices that can be used to preserve ℓp subspace embedding in input sparsity time, for integer p ϵ [2, ∞). We use the notion of power of two choice (Mitzenmacher, 2001) to design a distribution such matrices. For p = 2 case, we empirically compare our algorithm's performance with an existing method such as CountSketch (Clarkson and Woodruff, 2017).falseConference Paper4182 January 20201cpConference Proceeding0