Xinzhi Zhang

Affiliations:
  • University of Washington, Seattle, WA, USA
  • Tsinghua University, Beijing, China (former)


According to our database1, Xinzhi Zhang authored at least 10 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Pseudo-Asynchronous Local SGD: Robust and Efficient Data-Parallel Training.
CoRR, April, 2025

On the Emergence of Thinking in LLMs I: Searching for the Right Intuition.
CoRR, February, 2025

2023
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A Hyperbolic Extension of Kadison-Singer Type Results.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
An improved approximation algorithm for the minimum <i>k</i>-edge connected multi-subgraph problem.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem.
CoRR, 2021

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem.
Proceedings of the Conference on Learning Theory, 2021

2020
Smoothed complexity of local max-cut and binary max-CSP.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Sample complexity of single-parameter revenue maximization.
SIGecom Exch., 2019

Settling the sample complexity of single-parameter revenue maximization.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019


  Loading...