1 citations · 1 across the 14 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2023
Learning the Positions in CountSketch
Yi Li, Honghao Lin, Simin Liu +2
We consider sketching algorithms which first compress data by multiplication with a random sketch matrix, and then apply the sketch to quickly solve an optimization problem, e.g.,…
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…