Guanghao Ye

According to our database, Guanghao Ye authored at least 11 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfaces.

Mike A. Merrill, Alexander Glenn Shaw, Nicholas Carlini, Boxuan Li, Harsh Raj, Ivan Bercovich, Lin Shi, Jeong Yeon Shin, Thomas Walshe, Estefany Kelly Buchanan, Junhong Shen, Guanghao Ye, Haowei Lin, Jason Poulos, Maoyu Wang, Marianna Nezhurina, Jenia Jitsev, Di Lu, Orfeas Menis-Mastromichalakis, Zhiwei Xu, Zizhao Chen, Yue Liu, Robert Zhang, Leon Liangyu Chen, Anurag Kashyap, Jan-Lucas Uslu, Jeffrey Li, Jianbo Wu, Minghao Yan, Song Bian, Vedang Sharma, Ke Sun, Steven Dillmann, Akshay Anand, Andrew Lanpouthakoun, Bardia Koopah, Changran Hu, Etash Kumar Guha, Gabriel H. S. Dreiman, Jiacheng Zhu, Karl Krauth, Li Zhong, Niklas Muennighoff, Robert Amanfu, Shangyin Tan, Shreyas Pimpalgaonkar, Tushar Aggarwal, Xiangning Lin, Xin Lan, Xuandong Zhao, Yiqing Liang, Yuanli Wang, Zilong Wang, Changzhi Zhou, David Heineman, Hange Liu, Harsh Trivedi, John Yang, Junhong Lin, Manish Shetty, Michael Yang, Nabil Omi, Negin Raoof, Shanda Li, Terry Yue Zhuo, Wuwei Lin, Yiwei Dai, Yuxin Wang, Wenhao Chai, Shang Zhou, Dariush Wahdany, Ziyu She, Jiaming Hu, Zhikang Dong, Yuxuan Zhu, Sasha Cui, Ahson Saiyed, Arinbjörn Kolbeinsson, Jesse Hu, Christopher Michael Rytting, Ryan Marten, Yixin Wang, Alex Dimakis, Andy Konwinski, Ludwig Schmidt

CoRR, January, 2026

2025

On the Emergence of Thinking in LLMs I: Searching for the Right Intuition.

Guanghao Ye, Khiem Duc Pham, Xinzhi Zhang, Sivakanth Gopi, Baolin Peng, Beibin Li, Janardhan Kulkarni, Huseyin A. Inan

CoRR, February, 2025

2024

Improving the Bit Complexity of Communication for Distributed Convex Optimization.

Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fast Algorithms for Separable Linear Programs.

Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs.

Sally Dong, Guanghao Ye

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Faster Min-Cost Flow on Bounded Treewidth Graphs.

Sally Dong, Guanghao Ye

CoRR, 2023

2022

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.

Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.

Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye

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.

Damek Davis, Dmitriy Drusvyatskiy, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye

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.

Sally Dong, Yin Tat Lee, Guanghao Ye

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.

Jerry Li, Guanghao Ye

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020