Yujia Jin
Title
Cited by
Cited by
Year
Variance reduction for matrix games
Y Carmon, Y Jin, A Sidford, K Tian
arXiv preprint arXiv:1907.02056, 2019
302019
Efficiently solving MDPs with stochastic mirror descent
Y Jin, A Sidford
International Conference on Machine Learning, 4890-4900, 2020
172020
Acceleration with a ball optimization oracle
Y Carmon, A Jambulapati, Q Jiang, Y Jin, YT Lee, A Sidford, K Tian
arXiv preprint arXiv:2003.08078, 2020
142020
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
Y Jin, H Li, Z Zhang
Theoretical Computer Science 703, 37-54, 2017
112017
Coordinate methods for matrix games
Y Carmon, Y Jin, A Sidford, K Tian
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
102020
Stochastic Bias-Reduced Gradient Methods
H Asi, Y Carmon, A Jambulapati, Y Jin, A Sidford
Advances in Neural Information Processing Systems 34, 2021
42021
Thinking inside the ball: Near-optimal minimization of the maximal loss
Y Carmon, A Jambulapati, Y Jin, A Sidford
arXiv preprint arXiv:2105.01778, 2021
42021
Principal component projection and regression in nearly linear time through asymmetric SVRG
Y Jin, A Sidford
arXiv preprint arXiv:1910.06517, 2019
22019
Towards Tight Bounds on the Sample Complexity of Average-reward MDPs
Y Jin, A Sidford
arXiv preprint arXiv:2106.07046, 2021
12021
Semi-streaming bipartite matching in fewer passes and optimal space
S Assadi, A Jambulapati, Y Jin, A Sidford, K Tian
arXiv e-prints, arXiv: 2011.03495, 2020
12020
On the Sample Complexity of Average-reward MDPs
Y Jin, A Sidford
The system can't perform the operation now. Try again later.
Articles 1–11