Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Park, Woomyoung"'
Autor:
Lee, Sang-Woo, Kim, Sungdong, Ko, Donghyeon, Ham, Donghoon, Hong, Youngki, Oh, Shin Ah, Jung, Hyunhoon, Jung, Wangkyo, Cho, Kyunghyun, Kwak, Donghyun, Noh, Hyungsuk, Park, Woomyoung
Task-oriented dialogue (TOD) systems are mainly based on the slot-filling-based TOD (SF-TOD) framework, in which dialogues are broken down into smaller, controllable units (i.e., slots) to fulfill a specific task. A series of approaches based on this
Externí odkaz:
http://arxiv.org/abs/2212.10504
Autor:
Bae, Sanghwan, Kwak, Donghyun, Kang, Soyoung, Lee, Min Young, Kim, Sungdong, Jeong, Yuin, Kim, Hyeri, Lee, Sang-Woo, Park, Woomyoung, Sung, Nako
Remembering important information from the past and continuing to talk about it in the present are crucial in long-term conversations. However, previous literature does not deal with cases where the memorized information is outdated, which may cause
Externí odkaz:
http://arxiv.org/abs/2210.08750
Autor:
Bae, Sanghwan, Kwak, Donghyun, Kim, Sungdong, Ham, Donghoon, Kang, Soyoung, Lee, Sang-Woo, Park, Woomyoung
Recent open-domain dialogue models have brought numerous breakthroughs. However, building a chat system is not scalable since it often requires a considerable volume of human-human dialogue data, especially when enforcing features such as persona, st
Externí odkaz:
http://arxiv.org/abs/2205.00176
Autor:
Shin, Seongjin, Lee, Sang-Woo, Ahn, Hwijeen, Kim, Sungdong, Kim, HyoungSeok, Kim, Boseop, Cho, Kyunghyun, Lee, Gichang, Park, Woomyoung, Ha, Jung-Woo, Sung, Nako
Many recent studies on large-scale language models have reported successful in-context zero- and few-shot learning ability. However, the in-depth analysis of when in-context learning occurs is still lacking. For example, it is unknown how in-context
Externí odkaz:
http://arxiv.org/abs/2204.13509
Autor:
Kim, Boseop, Kim, HyoungSeok, Lee, Sang-Woo, Lee, Gichang, Kwak, Donghyun, Jeon, Dong Hyeon, Park, Sunghyun, Kim, Sungju, Kim, Seonhoon, Seo, Dongpil, Lee, Heungsub, Jeong, Minyoung, Lee, Sungjae, Kim, Minsub, Ko, Suk Hyun, Kim, Seokhun, Park, Taeyong, Kim, Jinuk, Kang, Soyoung, Ryu, Na-Hyeon, Yoo, Kang Min, Chang, Minsuk, Suh, Soobin, In, Sookyo, Park, Jinseong, Kim, Kyungduk, Kim, Hiun, Jeong, Jisu, Yeo, Yong Goo, Ham, Donghoon, Park, Dongju, Lee, Min Young, Kang, Jaewook, Kang, Inho, Ha, Jung-Woo, Park, Woomyoung, Sung, Nako
GPT-3 shows remarkable in-context learning ability of large-scale language models (LMs) trained on hundreds of billion scale data. Here we address some remaining issues less reported by the GPT-3 paper, such as a non-English LM, the performances of d
Externí odkaz:
http://arxiv.org/abs/2109.04650
Autor:
Kim, HyoungSeok, Kang, JiHoon, Park, WooMyoung, Ko, SukHyun, Cho, YoonHo, Yu, DaeSung, Song, YoungSook, Choi, JungWon
The regret bound of an optimization algorithms is one of the basic criteria for evaluating the performance of the given algorithm. By inspecting the differences between the regret bounds of traditional algorithms and adaptive one, we provide a guide
Externí odkaz:
http://arxiv.org/abs/1707.01647
Autor:
Park, Woomyoung, Barg, Alexander
We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's polarizing kernel H_2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with capacity 1,2,.
Externí odkaz:
http://arxiv.org/abs/1107.4965
Publikováno v:
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ISBN: 9783031088773
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cff6b361259ef7e08cfc9fbc879d78eb
https://doi.org/10.1007/978-3-031-08878-0_9
https://doi.org/10.1007/978-3-031-08878-0_9
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.