default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaewook Lee 0009
Person information
- affiliation: Stanford University, CA, USA
- affiliation (former): Korea Advanced Institute of Science and Technology (KAIST), Graduate School of AI, Seoul, South Korea
Other persons with the same name
- Jaewook Lee (aka: Jae-Wook Lee) — disambiguation page
- Jaewook Lee 0001
![[0000-0001-5720-8337]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5720-8337")
— Seoul National University, Department of Industrial Engineering, South Korea (and 2 more) - Jaewook Lee 0002 — Korea University, School of Electrical Engineering, Seoul, South Korea
- Jaewook Lee 0003 — Shizuoka University, Research Institute of Green Science and Technology, Japan
- Jaewook Lee 0004 — Gwangju Institute of Science and Technology (GIST), School of Mechanical Engineering, South Korea (and 1 more)
- Jaewook Lee 0005 — University of Washington, Seattle, Washington, USA
- Jaewook Lee 0006 — University of Massachusetts Amherst, MA, USA
- Jae-Wook Lee 0007 (aka: Jaewook Lee 0007) — Samsung Electronics, Hwaseong, South Korea (and 1 more)
- Jaewook Lee 0008 — Korea University, Seoul, South Korea
- Jaewook Lee 0010 — Electronics and Telecommunications Research Institute (ETRI), Daejeon, South Korea (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c3]Donghwa Kim, Jaewook Lee, Chulhee Yun:
Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent. ICML 2025- 2024
- [c2]Jaewook Lee, Hanseul Cho, Chulhee Yun:
Fundamental Benefit of Alternating Updates in Minimax Optimization. ICML 2024 - [i2]Jaewook Lee, Hanseul Cho, Chulhee Yun:
Fundamental Benefit of Alternating Updates in Minimax Optimization. CoRR abs/2402.10475 (2024) - 2023
- [c1]Jaeyoung Cha, Jaewook Lee, Chulhee Yun:
Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond. ICML 2023: 3855-3912 - [i1]Jaeyoung Cha, Jaewook Lee, Chulhee Yun:
Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond. CoRR abs/2303.07160 (2023)
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 2026-01-03 02:10 CET 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:
