default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJikai Jin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Kaifeng Lyu, Jikai Jin, Zhiyuan Li, Simon Shaolei Du, Jason D. Lee, Wei Hu:
Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking. ICLR 2024- [i10]Jikai Jin, Vasilis Syrgkanis:
Structure-agnostic Optimality of Doubly Robust Learning for Treatment Effect Estimation. CoRR abs/2402.14264 (2024) - 2023
- [c6]Jikai Jin, Yiping Lu, José H. Blanchet, Lexing Ying:
Minimax Optimal Kernel Operator Learning via Multilevel Training. ICLR 2023 - [c5]Jikai Jin, Zhiyuan Li
, Kaifeng Lyu, Simon Shaolei Du, Jason D. Lee:
Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing. ICML 2023: 15200-15238 - [i9]Jikai Jin, Zhiyuan Li, Kaifeng Lyu, Simon S. Du, Jason D. Lee:
Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing. CoRR abs/2301.11500 (2023) - [i8]Jikai Jin, Vasilis Syrgkanis:
Learning Causal Representations from General Environments: Identifiability and Intrinsic Ambiguity. CoRR abs/2311.12267 (2023) - [i7]Kaifeng Lyu, Jikai Jin, Zhiyuan Li, Simon S. Du, Jason D. Lee, Wei Hu:
Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking. CoRR abs/2311.18817 (2023) - 2022
- [c4]Jikai Jin, Suvrit Sra:
Understanding Riemannian Acceleration via a Proximal Extragradient Framework. COLT 2022: 2924-2962 - [c3]Binghui Li, Jikai Jin, Han Zhong, John E. Hopcroft, Liwei Wang:
Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power. NeurIPS 2022 - [i6]Binghui Li, Jikai Jin, Han Zhong, John E. Hopcroft, Liwei Wang:
Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power. CoRR abs/2205.13863 (2022) - [i5]Jikai Jin, Yiping Lu, Jose H. Blanchet, Lexing Ying:
Minimax Optimal Kernel Operator Learning via Multilevel Training. CoRR abs/2209.14430 (2022) - 2021
- [c2]Jikai Jin, Bohang Zhang, Haiyang Wang, Liwei Wang:
Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis. NeurIPS 2021: 2771-2782 - [i4]Jikai Jin, Bohang Zhang, Haiyang Wang, Liwei Wang:
Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis. CoRR abs/2110.12459 (2021) - [i3]Jikai Jin, Suvrit Sra:
A Riemannian Accelerated Proximal Extragradient Framework and its Implications. CoRR abs/2111.02763 (2021) - 2020
- [c1]Bohang Zhang, Jikai Jin, Cong Fang, Liwei Wang:
Improved Analysis of Clipping Algorithms for Non-convex Optimization. NeurIPS 2020 - [i2]Bohang Zhang, Jikai Jin, Cong Fang, Liwei Wang:
Improved Analysis of Clipping Algorithms for Non-convex Optimization. CoRR abs/2010.02519 (2020) - [i1]Jikai Jin:
On The Convergence of First Order Methods for Quasar-Convex Optimization. CoRR abs/2010.04937 (2020)
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-10-07 21:20 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:
