default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWon-Seok Choi 0006
Person information
- affiliation: Seoul National University, AI Institute, South Korea
Other persons with the same name
- Won-Seok Choi 0001
![[0000-0002-7239-1237]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7239-1237")
(aka: Wonseok Choi 0001) — Pohang University of Science and Technology, Department of Electronic and Electrical Engineering, South Korea - Won-Seok Choi 0010 — Soosang-ST CO2, Busan, South Korea
- Wonseok Choi 0013 (aka: Won-Seok Choi 0013) — Korea Advanced Institute of Science and Technology, School of Electrical Engineering, Daejeon, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Junseok Park, Yoonsung Kim, Hee bin Yoo, Min Whoo Lee, Kibeom Kim, Won-Seok Choi, Minsu Lee, Byoung-Tak Zhang:
Unveiling the Significance of Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning. AAAI 2024: 592-600- [c4]Won-Seok Choi, Hyundo Lee, Dong-Sig Han, Junseok Park, Heeyeon Koo, Byoung-Tak Zhang:
DUEL: Duplicate Elimination on Active Memory for Self-Supervised Class-Imbalanced Learning. AAAI 2024: 11579-11587 - [i6]Won-Seok Choi, Hyundo Lee, Dong-Sig Han, Junseok Park, Heeyeon Koo, Byoung-Tak Zhang:
DUEL: Duplicate Elimination on Active Memory for Self-Supervised Class-Imbalanced Learning. CoRR abs/2402.08963 (2024) - [i5]Junseok Park, Yoonsung Kim, Hee bin Yoo, Min Whoo Lee, Kibeom Kim, Won-Seok Choi, Minsu Lee, Byoung-Tak Zhang:
Unveiling the Significance of Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning. CoRR abs/2403.06880 (2024) - 2023
- [c3]Hyundo Lee, Inwoo Hwang, Hyunsung Go, Won-Seok Choi, Kibeom Kim, Byoung-Tak Zhang:
Learning Geometry-aware Representations by Sketching. CVPR 2023: 23315-23326 - [i4]Hyundo Lee, Inwoo Hwang, Hyunsung Go, Won-Seok Choi, Kibeom Kim, Byoung-Tak Zhang:
Learning Geometry-aware Representations by Sketching. CoRR abs/2304.08204 (2023) - 2022
- [i3]Won-Seok Choi, Dong-Sig Han, Hyundo Lee, Junseok Park, Byoung-Tak Zhang:
DUEL: Adaptive Duplicate Elimination on Working Memory for Self-Supervised Learning. CoRR abs/2210.17052 (2022) - 2021
- [c2]Taehyeong Kim, Injune Hwang, Hyundo Lee, Hyunseo Kim, Won-Seok Choi, Joseph J. Lim, Byoung-Tak Zhang:
Message Passing Adaptive Resonance Theory for Online Active Semi-supervised Learning. ICML 2021: 5519-5529 - 2020
- [c1]Taehyeong Kim, Injune Hwang, Gi-Cheon Kang, Won-Seok Choi, Hyunseo Kim, Byoung-Tak Zhang:
Label Propagation Adaptive Resonance Theory for Semi-Supervised Continuous Learning. ICASSP 2020: 4012-4016 - [i2]Taehyeong Kim, Injune Hwang, Gi-Cheon Kang, Won-Seok Choi, Hyunseo Kim, Byoung-Tak Zhang:
Label Propagation Adaptive Resonance Theory for Semi-supervised Continuous Learning. CoRR abs/2005.02137 (2020) - [i1]Taehyeong Kim, Injune Hwang, Hyundo Lee, Hyunseo Kim, Won-Seok Choi, Byoung-Tak Zhang:
Message Passing Adaptive Resonance Theory for Online Active Semi-supervised Learning. CoRR abs/2012.01227 (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 2025-02-03 21:11 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:
