Honghao Lin

Orcid: 0009-0004-5162-3328

According to our database1, Honghao Lin authored at least 23 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Adversarial Robustness on Insertion-Deletion Streams.
CoRR, February, 2026

L<sub>p</sub> Sampling in Distributed Data Streams with Applications to Adversarial Robustness.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Unbiased Insights: Optimal Streaming Algorithms for ℓ<sub>p</sub> Sampling, the Forget Model, and Beyond.
CoRR, August, 2025

On Sketching Trimmed Statistics.
CoRR, June, 2025

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Space Complexity of Minimum Cut Problems in Single-Pass Streams.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024
Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut.
Proc. ACM Manag. Data, 2024

A Theory for Compressibility of Graph Transformers for Transductive Learning.
CoRR, 2024

A Strong Separation for Adversarially Robust ℓ<sub>0</sub> Estimation for Linear Sketches.
CoRR, 2024

Even Sparser Graph Transformers.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
The ℓ<sub><i>p</i></sub>-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Learning the Positions in CountSketch.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

ℓ<sub>p</sub>-Regression in the Arbitrary Partition Model of Communication.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
The 𝓁<sub>p</sub>-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines.
CoRR, 2022

Learning Augmented Binary Search Trees.
Proceedings of the International Conference on Machine Learning, 2022

Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra.
Proceedings of the International Conference on Machine Learning, 2022

Triangle and Four Cycle Counting with Predictions in Graph Streams.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Streaming Algorithms with Large Approximation Factors.
Proceedings of the Approximation, 2022

2021
Learning-Augmented Sketches for Hessians.
CoRR, 2021

Robust Learning of Fixed-Structure Bayesian Networks in Nearly-Linear Time.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Learning-Augmented Data Stream Algorithms.
Proceedings of the 8th International Conference on Learning Representations, 2020


  Loading...