1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2022★ 1 cited
Triangle and Four Cycle Counting with Predictions in Graph Streams
Justin Y. Chen, Talya Eden, Piotr Indyk +7
We propose data-driven one-pass streaming algorithms for estimating the number of triangles and four cycles, two fundamental problems in graph analytics that are widely studied in…
cs.LG2021
Robust Learning of Fixed-Structure Bayesian Networks in Nearly-Linear Time
Yu Cheng, Honghao Lin
We study the problem of learning Bayesian networks where an -fraction of the samples are adversarially corrupted. We focus on the fully-observable case where the underlying grap…
cs.LG2021
Learning-Augmented Sketches for Hessians
Yi Li, Honghao Lin, David P. Woodruff
Sketching is a dimensionality reduction technique where one compresses a matrix by linear combinations that are chosen at random. A line of work has shown how to sketch the Hessian…