default search action
Hyokun Yun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Julian Katz-Samuels, Zheng Li, Hyokun Yun, Priyanka Nigam, Yi Xu, Vaclav Petricek, Bing Yin, Trishul Chilimbi:
Evolutionary Contrastive Distillation for Language Model Alignment. EMNLP (Findings) 2024: 5328-5345 - [c12]Yifei He, Shiji Zhou, Guojun Zhang, Hyokun Yun, Yi Xu, Belinda Zeng, Trishul Chilimbi, Han Zhao:
Robust Multi-Task Learning with Excess Risks. ICML 2024 - [i18]Yifei He, Shiji Zhou, Guojun Zhang, Hyokun Yun, Yi Xu, Belinda Zeng, Trishul Chilimbi, Han Zhao:
Robust Multi-Task Learning with Excess Risks. CoRR abs/2402.02009 (2024) - [i17]Qizhang Feng, Siva Rajesh Kasa, Hyokun Yun, Choon Hui Teo, Sravan Babu Bodapati:
Exposing Privacy Gaps: Membership Inference Attack on Preference Data for LLM Alignment. CoRR abs/2407.06443 (2024) - [i16]Julian Katz-Samuels, Zheng Li, Hyokun Yun, Priyanka Nigam, Yi Xu, Vaclav Petricek, Bing Yin, Trishul Chilimbi:
Evolutionary Contrastive Distillation for Language Model Alignment. CoRR abs/2410.07513 (2024) - 2023
- [i15]Taehyun Yoon, Jinwon Choi, Hyokun Yun, Sungbin Lim
:
Threshold-aware Learning to Generate Feasible Solutions for Mixed Integer Programs. CoRR abs/2308.00327 (2023) - 2022
- [c11]Zhanyu Wang
MICO: Selective Search with Mutual Information Co-training. COLING 2022: 1179-1192 - [i14]Zhanyu Wang
MICO: Selective Search with Mutual Information Co-training. CoRR abs/2209.04378 (2022) - 2021
- [i13]Aigerim Bogyrbayeva, Taehyun Yoon, Hanbum Ko, Sungbin Lim, Hyokun Yun, Changhyun Kwon:
A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone. CoRR abs/2112.12545 (2021) - 2020
- [i12]Hyokun Yun, Michael Froh, Roshan Makhijani, Brian Luc, Alex Smola, Trishul Chilimbi:
Tiering as a Stochastic Submodular Optimization Problem. CoRR abs/2005.07893 (2020)
2010 – 2019
- 2019
- [c10]Sravan Babu Bodapati, Hyokun Yun, Yaser Al-Onaizan:
Robustness to Capitalization Errors in Named Entity Recognition. W-NUT@EMNLP 2019: 237-242 - [c9]Parameswaran Raman, Sriram Srinivasan, Shin Matsushima, Xinhua Zhang, Hyokun Yun, S. V. N. Vishwanathan:
Scaling Multinomial Logistic Regression via Hybrid Parallelism. KDD 2019: 1460-1470 - [i11]Sravan Babu Bodapati, Hyokun Yun, Yaser Al-Onaizan:
Robustness to Capitalization Errors in Named Entity Recognition. CoRR abs/1911.05241 (2019) - 2018
- [c8]Yanyao Shen, Hyokun Yun, Zachary C. Lipton, Yakov Kronrod, Animashree Anandkumar:
Deep Active Learning for Named Entity Recognition. ICLR (Poster) 2018 - 2017
- [c7]Shin Matsushima, Hyokun Yun, Xinhua Zhang, S. V. N. Vishwanathan:
Distributed Stochastic Optimization of Regularized Risk via Saddle-Point Problem. ECML/PKDD (1) 2017: 460-476 - [c6]Yanyao Shen, Hyokun Yun, Zachary Chase Lipton, Yakov Kronrod, Animashree Anandkumar:
Deep Active Learning for Named Entity Recognition. Rep4NLP@ACL 2017: 252-256 - [i10]Yanyao Shen, Hyokun Yun, Zachary C. Lipton, Yakov Kronrod, Animashree Anandkumar:
Deep Active Learning for Named Entity Recognition. CoRR abs/1707.05928 (2017) - 2016
- [j2]Hsiang-Fu Yu, Cho-Jui Hsieh, Hyokun Yun, S. V. N. Vishwanathan, Inderjit S. Dhillon:
Nomadic Computing for Big Data Analytics. Computer 49(4): 52-60 (2016) - [c5]Shihao Ji
WordRank: Learning Word Embeddings via Robust Ranking. EMNLP 2016: 658-668 - [i9]Parameswaran Raman, Shin Matsushima, Xinhua Zhang, Hyokun Yun, S. V. N. Vishwanathan:
DS-MLR: Exploiting Double Separability for Scaling up Distributed Multinomial Logistic Regression. CoRR abs/1604.04706 (2016) - 2015
- [c4]Hsiang-Fu Yu, Cho-Jui Hsieh, Hyokun Yun, S. V. N. Vishwanathan, Inderjit S. Dhillon:
A Scalable Asynchronous Distributed Algorithm for Topic Modeling. WWW 2015: 1340-1350 - [i8]Shihao Ji, Hyokun Yun, Pinar Yanardag, Shin Matsushima, S. V. N. Vishwanathan:
WordRank: Learning Word Embeddings via Robust Ranking. CoRR abs/1506.02761 (2015) - 2014
- [j1]Hyokun Yun, Hsiang-Fu Yu, Cho-Jui Hsieh, S. V. N. Vishwanathan, Inderjit S. Dhillon:
NOMAD: Nonlocking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion. Proc. VLDB Endow. 7(11): 975-986 (2014) - [c3]Hyokun Yun, Parameswaran Raman, S. V. N. Vishwanathan:
Ranking via Robust Binary Classification. NIPS 2014: 2582-2590 - [i7]Hyokun Yun, Parameswaran Raman, S. V. N. Vishwanathan:
Ranking via Robust Binary Classification and Parallel Parameter Estimation in Large-Scale Data. CoRR abs/1402.2676 (2014) - [i6]Shin Matsushima, Hyokun Yun, S. V. N. Vishwanathan:
Distributed Stochastic Optimization of the Regularized Risk. CoRR abs/1406.4363 (2014) - [i5]Hsiang-Fu Yu, Cho-Jui Hsieh, Hyokun Yun, S. V. N. Vishwanathan, Inderjit S. Dhillon:
A Scalable Asynchronous Distributed Algorithm for Topic Modeling. CoRR abs/1412.4986 (2014) - 2013
- [i4]Hyokun Yun, Hsiang-Fu Yu, Cho-Jui Hsieh, S. V. N. Vishwanathan, Inderjit S. Dhillon:
NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion. CoRR abs/1312.0193 (2013) - 2012
- [c2]Sung-Hee Kim, Hyokun Yun, Ji Soo Yi:
How to filter out random clickers in a crowdsourcing-based study? BELIV 2012: 15 - [c1]Hyokun Yun, S. V. N. Vishwanathan:
Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs. AISTATS 2012: 1389-1397 - [i3]Hyokun Yun, S. V. N. Vishwanathan:
Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process. CoRR abs/1202.6001 (2012) - 2011
- [i2]Hyokun Yun:
Using Logistic Regression to Analyze the Balance of a Game: The Case of StarCraft II. CoRR abs/1105.0755 (2011) - [i1]Hyokun Yun, S. V. N. Vishwanathan:
Quilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs. CoRR abs/1110.5383 (2011)
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-12-10 20:46 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: