default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWonyoung Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
A Doubly Robust Approach to Sparse Reinforcement Learning. AISTATS 2024: 2305-2313- 2023
- [c15]Wonyoung Kim, Kyungbok Lee, Myunghee Cho Paik:
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits. AAAI 2023: 8300-8307 - [c14]Wonyoung Kim, Myunghee Cho Paik, Min-hwan Oh:
Squeeze All: Novel Estimator and Self-Normalized Bound for Linear Contextual Bandits. AISTATS 2023: 3098-3124 - [c13]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback. ICML 2023: 16458-16501 - [i8]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Improved Algorithms for Multi-period Multi-class Packing Problems with~Bandit~Feedback. CoRR abs/2301.13791 (2023) - [i7]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
Pareto Front Identification with Regret Minimization. CoRR abs/2306.00096 (2023) - [i6]Wonyoung Kim, Garud Iyengar, Assaf Zeevi:
A Doubly Robust Approach to Sparse Reinforcement Learning. CoRR abs/2310.15286 (2023) - 2022
- [i5]Wonyoung Kim, Min-hwan Oh, Myunghee Cho Paik:
Squeeze All: Novel Estimator and Self-Normalized Bound for Linear Contextual Bandits. CoRR abs/2206.05404 (2022) - [i4]Wonyoung Kim, Kyungbok Lee, Myunghee Cho Paik:
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits. CoRR abs/2209.06983 (2022) - 2021
- [c12]Sung Joo Park, Jonghoon J. Kim, Kun Joo, Young-Ho Lee, Kyoungsun Kim, Young-Tae Kim, Woo-Jin Na, IkJoon Choi, Hye-Seung Yu, Wonyoung Kim, Ju-Yeon Jung, Jaejun Lee, Dohyung Kim, Young-Uk Chang, Gong-Heum Han, Hangi-Jung, Sunwon Kang, Jeonghyeon Cho, Hoyoung Song, Tae-Young Oh, Young-Soo Sohn, SangJoon Hwang, Jooyoung Lee:
Industry's First 7.2 Gbps 512GB DDR5 Module. HCS 2021: 1-11 - [c11]Wonyoung Kim, Gi-Soo Kim, Myunghee Cho Paik:
Doubly Robust Thompson Sampling with Linear Payoffs. NeurIPS 2021: 15830-15840 - [i3]Wonyoung Kim, Gi-Soo Kim, Myunghee Cho Paik:
Doubly Robust Thompson Sampling for linear payoffs. CoRR abs/2102.01229 (2021) - 2020
- [j4]Yongchan Kwon, Wonyoung Kim, Masashi Sugiyama
, Myunghee Cho Paik:
Principled analytic classifier for positive-unlabeled learning via weighted integral probability metric. Mach. Learn. 109(3): 513-532 (2020) - [c10]Yongchan Kwon, Wonyoung Kim, Joong-Ho Won, Myunghee Cho Paik:
Principled learning method for Wasserstein distributionally robust optimization with local perturbations. ICML 2020: 5567-5576 - [i2]Yongchan Kwon, Wonyoung Kim, Joong-Ho Won, Myunghee Cho Paik:
Principled Learning Method for Wasserstein distributionally robust optimization with local perturbations. CoRR abs/2006.03333 (2020)
2010 – 2019
- 2019
- [i1]Yongchan Kwon, Wonyoung Kim, Masashi Sugiyama, Myunghee Cho Paik:
An analytic formulation for positive-unlabeled learning via weighted integral probability metric. CoRR abs/1901.09503 (2019) - 2013
- [c9]Tao Tong, Xuan Zhang, Wonyoung Kim, David M. Brooks, Gu-Yeon Wei:
A fully integrated battery-connected switched-capacitor 4: 1 voltage regulator with 70% peak efficiency using bottom-plate charge recycling. CICC 2013: 1-4 - 2012
- [j3]Wonyoung Kim, David M. Brooks, Gu-Yeon Wei:
A Fully-Integrated 3-Level DC-DC Converter for Nanosecond-Scale DVFS. IEEE J. Solid State Circuits 47(1): 206-219 (2012) - 2011
- [j2]Vijay Janapa Reddi, Svilen Kanev, Wonyoung Kim, Simone Campanoni, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
Voltage Noise in Production Processors. IEEE Micro 31(1): 20-28 (2011) - [c8]Wonyoung Kim, David M. Brooks, Gu-Yeon Wei:
A fully-integrated 3-level DC/DC converter for nanosecond-scale DVS with fast shunt regulation. ISSCC 2011: 268-270 - 2010
- [j1]Younghee Kim, Wonyoung Kim, Ungmo Kim:
Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams. J. Inf. Process. Syst. 6(1): 79-90 (2010) - [c7]Joonsuk Ryu, Wonyoung Kim, Jaeho Jeong, Ungmo Kim:
Mining Reputation of Person/Product from Comment and Reply on UCC/Internet Article. ICIC (1) 2010: 354-361 - [c6]Kyu Il Kim, Wonyoung Kim, Joonsuk Ryu, Hyuk Jin Ko, Ung-Mo Kim, Woo Jun Kang:
RBAC-based access control for privacy preserving in semantic web. ICUIMC 2010: 63 - [c5]Vijay Janapa Reddi, Svilen Kanev, Wonyoung Kim, Simone Campanoni, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
Voltage Smoothing: Characterizing and Mitigating Voltage Noise in Production Processors via Software-Guided Thread Scheduling. MICRO 2010: 77-88
2000 – 2009
- 2009
- [c4]Wonyoung Kim, Joonsuk Ryu, Kyu Il Kim, Ung-Mo Kim:
A method for opinion mining of product reviews using association rules. ICIS 2009: 270-274 - [c3]Joonsuk Ryu, Wonyoung Kim, Kyu Il Kim, Ung-Mo Kim:
Mining opinions from messenger. ICIS 2009: 287-290 - [c2]Juryon Paik, Junghyun Nam, Wonyoung Kim, Joonsuk Ryu, Ung-Mo Kim:
Mining association rules in tree structured XML data. ICIS 2009: 807-811 - 2008
- [c1]Wonyoung Kim, Meeta Sharma Gupta, Gu-Yeon Wei, David M. Brooks:
System level analysis of fast, per-core DVFS using on-chip switching regulators. HPCA 2008: 123-134
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-01 21:40 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:
