DeepAI AI Chat

Even Simpler Deterministic Matrix Sketching

02/03/2022

∙

This paper provides a one-line proof of Frequent Directions (FD) for sketching streams of matrices. The simpler proof arises from sketching the covariance of the stream of matrices rather than the stream itself.

READ FULL TEXT

research

∙ 09/07/2020

A Simpler NP-Hardness Proof for Familial Graph Compression

This document presents a simpler proof showcasing the NP-hardness of Fam...

0 Ammar Ahmed, et al. ∙

research

∙ 12/09/2018

Equivalence of pushdown automata via first-order grammars

A decidability proof for bisimulation equivalence of first-order grammar...

0 Petr Jancar, et al. ∙

research

∙ 02/01/2023

Formalizing π_4(𝕊^3) ≅ℤ/2ℤ and Computing a Brunerie Number in Cubical Agda

Brunerie's 2016 PhD thesis contains the first synthetic proof in Homotop...

0 Axel Ljungström, et al. ∙

research

∙ 11/02/2018

On the Lazy Set object

The aim of this article is to employ the Lazy Set algorithm as an exampl...

0 Uri Abraham, et al. ∙

research

∙ 05/03/2022

Optimal minimization of the covariance loss

Let X be a random vector valued in ℝ^m such that X_2≤ 1 almost surely. F...

0 Vishesh Jain, et al. ∙

research

∙ 11/19/2020

Estimation of Shortest Path Covariance Matrices

We study the sample complexity of estimating the covariance matrix Σ∈ℝ^d...

0 Raj Kumar Maity, et al. ∙

research

∙ 11/08/2018

Bisimilarity of Open Terms in Stream GSOS

Stream GSOS is a specification format for operations and calculi on infi...

0 Filippo Bonchi, et al. ∙

Even Simpler Deterministic Matrix Sketching

Related Research

A Simpler NP-Hardness Proof for Familial Graph Compression

Equivalence of pushdown automata via first-order grammars

Formalizing π_4(𝕊^3) ≅ℤ/2ℤ and Computing a Brunerie Number in Cubical Agda

On the Lazy Set object

Optimal minimization of the covariance loss

Estimation of Shortest Path Covariance Matrices

Bisimilarity of Open Terms in Stream GSOS