default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYujia Jin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Junqi Luo
, Qin Ye, Zexin Yang, Yujia Jin:
Positioning Objects From Large Oblique Ultralong Focal Length UAV Imagery. IEEE Geosci. Remote. Sens. Lett. 21: 1-5 (2024)- [c26]Yujia Jin, Ishani Karmarkar, Christopher Musco, Aaron Sidford, Apoorv Vikram Singh:
Faster Spectral Density Estimation and Sparsification in the Nuclear Norm (Extended Abstract). COLT 2024: 2722 - [c25]Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions. SODA 2024: 3685-3723 - [i23]Yujia Jin, Ishani Karmarkar, Aaron Sidford, Jiayi Wang:
Truncated Variance Reduced Value Iteration. CoRR abs/2405.12952 (2024) - [i22]Yujia Jin, Ishani Karmarkar, Christopher Musco, Aaron Sidford, Apoorv Vikram Singh:
Faster Spectral Density Estimation and Sparsification in the Nuclear Norm. CoRR abs/2406.07521 (2024) - 2023
- [j5]Xu E, Yujia Jin, Yinong Chen, Shenghui Zhao, Yang Wang:
Prediction of environmental factors in seafood cold chain transportation based on IAGA-ELM algorithm. Int. J. Simul. Process. Model. 20(3): 159-171 (2023) - [j4]Shenghui Zhao, Yang Wang, Yinong Chen, Yujia Jin, N. A. Xu E:
Prediction of environmental factors in seafood cold chain transportation based on IAGA-ELM algorithm. Int. J. Simul. Process. Model. 20(3): 159-171 (2023) - [c24]Alekh Agarwal, Yujia Jin, Tong Zhang:
VOQL: Towards Optimal Regret in Model-free RL with Nonlinear Function Approximation. COLT 2023: 987-1063 - [c23]Yujia Jin, Christopher Musco, Aaron Sidford, Apoorv Vikram Singh:
Moments, Random Walks, and Limits for Spectrum Approximation. COLT 2023: 5373-5394 - [c22]Yair Carmon, Arun Jambulapati, Yujia Jin, Yin Tat Lee, Daogao Liu, Aaron Sidford, Kevin Tian:
ReSQueing Parallel and Private Stochastic Convex Optimization. FOCS 2023: 2031-2058 - [c21]Adam Bouland, Yosheb M. Getachew, Yujia Jin, Aaron Sidford, Kevin Tian:
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling. ICML 2023: 2932-2952 - [c20]Yujia Jin, Vidya Muthukumar, Aaron Sidford:
The Complexity of Infinite-Horizon General-Sum Stochastic Games. ITCS 2023: 76:1-76:20 - [i21]Yair Carmon, Arun Jambulapati, Yujia Jin, Yin Tat Lee, Daogao Liu, Aaron Sidford, Kevin Tian:
ReSQueing Parallel and Private Stochastic Convex Optimization. CoRR abs/2301.00457 (2023) - [i20]Adam Bouland, Yosheb Getachew, Yujia Jin, Aaron Sidford, Kevin Tian:
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling. CoRR abs/2301.03763 (2023) - [i19]Yujia Jin, Christopher Musco, Aaron Sidford, Apoorv Vikram Singh:
Moments, Random Walks, and Limits for Spectrum Approximation. CoRR abs/2307.00474 (2023) - [i18]Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions. CoRR abs/2311.10886 (2023) - 2022
- [c19]Yujia Jin, Aaron Sidford, Kevin Tian:
Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods. COLT 2022: 4362-4415 - [c18]Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian:
Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. ICALP 2022: 77:1-77:20 - [c17]Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
RECAPP: Crafting a More Efficient Catalyst for Convex Optimization. ICML 2022: 2658-2685 - [c16]Yujia Jin, Yanlu Xie, Jinsong Zhang:
A VR Interactive 3D Mandarin Pronunciation Teaching Model. INTERSPEECH 2022: 3951-3952 - [c15]Yair Carmon, Danielle Hausler, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Optimal and Adaptive Monteiro-Svaiter Acceleration. NeurIPS 2022 - [c14]Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian:
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. SODA 2022: 627-669 - [i17]Yujia Jin, Aaron Sidford, Kevin Tian:
Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods. CoRR abs/2202.04640 (2022) - [i16]Yujia Jin, Vidya Muthukumar, Aaron Sidford:
The Complexity of Infinite-Horizon General-Sum Stochastic Games. CoRR abs/2204.04186 (2022) - [i15]Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian:
Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. CoRR abs/2204.12721 (2022) - [i14]Yair Carmon, Danielle Hausler, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Optimal and Adaptive Monteiro-Svaiter Acceleration. CoRR abs/2205.15371 (2022) - [i13]Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
RECAPP: Crafting a More Efficient Catalyst for Convex Optimization. CoRR abs/2206.08627 (2022) - [i12]Alekh Agarwal, Yujia Jin, Tong Zhang:
VOQL: Towards Optimal Regret in Model-free RL with Nonlinear Function Approximation. CoRR abs/2212.06069 (2022) - 2021
- [c13]Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss. COLT 2021: 866-882 - [c12]Yujia Jin, Aaron Sidford:
Towards Tight Bounds on the Sample Complexity of Average-reward MDPs. ICML 2021: 5055-5064 - [c11]Hilal Asi, Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Stochastic Bias-Reduced Gradient Methods. NeurIPS 2021: 10810-10822 - [i11]Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss. CoRR abs/2105.01778 (2021) - [i10]Yujia Jin, Aaron Sidford:
Towards Tight Bounds on the Sample Complexity of Average-reward MDPs. CoRR abs/2106.07046 (2021) - [i9]Hilal Asi, Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Stochastic Bias-Reduced Gradient Methods. CoRR abs/2106.09481 (2021) - [i8]Lantao Yu, Yujia Jin, Stefano Ermon:
A Unified Framework for Multi-distribution Density Ratio Estimation. CoRR abs/2112.03440 (2021) - 2020
- [c10]Yair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian:
Coordinate Methods for Matrix Games. FOCS 2020: 283-293 - [c9]Yujia Jin, Aaron Sidford:
Efficiently Solving MDPs with Stochastic Mirror Descent. ICML 2020: 4890-4900 - [c8]Yanlu Xie, Xiaoli Feng, Boxue Li, Jinsong Zhang, Yujia Jin:
A Mandarin L2 Learning APP with Mispronunciation Detection and Feedback. INTERSPEECH 2020: 1015-1016 - [c7]Yair Carmon, Arun Jambulapati, Qijia Jiang, Yujia Jin, Yin Tat Lee, Aaron Sidford, Kevin Tian:
Acceleration with a Ball Optimization Oracle. NeurIPS 2020 - [i7]Yair Carmon, Arun Jambulapati, Qijia Jiang, Yujia Jin, Yin Tat Lee, Aaron Sidford, Kevin Tian:
Acceleration with a Ball Optimization Oracle. CoRR abs/2003.08078 (2020) - [i6]Yujia Jin, Aaron Sidford:
Efficiently Solving MDPs with Stochastic Mirror Descent. CoRR abs/2008.12776 (2020) - [i5]Yair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian:
Coordinate Methods for Matrix Games. CoRR abs/2009.08447 (2020) - [i4]Yujia Jin, Aaron Sidford, Kevin Tian:
Semi-Streaming Bipartite Matching in Fewer Passes and Less Space. CoRR abs/2011.03495 (2020)
2010 – 2019
- 2019
- [c6]Yujia Jin, Qi Bao, Zhongzhi Zhang:
Forest Distance Closeness Centrality in Disconnected Graphs. ICDM 2019: 339-348 - [c5]Yujia Jin, Aaron Sidford:
Principal Component Projection and Regression in Nearly Linear Time through Asymmetric SVRG. NeurIPS 2019: 3863-3873 - [c4]Yair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian:
Variance Reduction for Matrix Games. NeurIPS 2019: 11377-11388 - [i3]Yair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian:
Variance Reduction for Matrix Games. CoRR abs/1907.02056 (2019) - [i2]Yujia Jin, Aaron Sidford:
Principal Component Projection and Regression in Nearly Linear Time through Asymmetric SVRG. CoRR abs/1910.06517 (2019) - 2017
- [j3]Yujia Jin, Huan Li, Zhongzhi Zhang:
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. Theor. Comput. Sci. 703: 37-54 (2017) - [i1]Yujia Jin, Huan Li, Zhongzhi Zhang:
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. CoRR abs/1709.04404 (2017) - 2016
- [j2]Zhuoxi Yu, Yujia Jin, Milan Deepak Parmar, Limin Wang:
Application of Modified OPTICS Algorithm in E-Commerce Sites Classification and Evaluation. J. Electron. Commer. Organ. 14(1): 64-75 (2016)
2000 – 2009
- 2005
- [c3]Yujia Jin, Nadathur Satish, Kaushik Ravindran, Kurt Keutzer:
An automated exploration framework for FPGA-based soft multiprocessor systems. CODES+ISSS 2005: 273-278 - [c2]Yujia Jin, William Plishker, Kaushik Ravindran, Nadathur Satish, Kurt Keutzer:
Soft multiprocessor systems for network applications (abstract only). FPGA 2005: 271 - [c1]Kaushik Ravindran, Nadathur Satish, Yujia Jin, Kurt Keutzer:
An FPGA-based Soft Multiprocessor System for IPv4 Packet Forwarding. FPL 2005: 487-492 - 2002
- [j1]Andrew Mihal, Chidamber Kulkarni, Matthew W. Moskewicz, Mel M. Tsai, Niraj Shah, Scott J. Weber, Yujia Jin, Kurt Keutzer, Christian Sauer, Kees A. Vissers, Sharad Malik:
Developing Architectural Platforms: A Disciplined Approach. IEEE Des. Test Comput. 19(6): 6-16 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
