Guanghao Ye

According to our database1, Guanghao Ye authored at least 8 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improving the Bit Complexity of Communication for Distributed Convex Optimization.
CoRR, 2024

Fast Algorithms for Separable Linear Programs.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Faster Min-Cost Flow on Bounded Treewidth Graphs.
CoRR, 2023

2022
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020
Robust Gaussian Covariance Estimation in Nearly-Matrix Multiplication Time.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020


  Loading...