Jungseul Ok

Jungseul Ok

Auto-generated profile, based on publicly available information

Jungseul Ok

Pohang University of Science and Technology (POSTECH)

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 July 2018 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
RCRichard Combes
Richard Combes
JOJungseul Ok
Jungseul Ok
APAlexandre Proutiere
Alexandre Proutiere
DYDonggyu Yun
Donggyu Yun
YYYung Yi
Yung Yi
Rate Adaptation (RA) is a fundamental mechanism in 802.11 systems. It allows transmitters to adapt the coding and modulation scheme as well as the MIMO transmission mode to the radio channel conditions, to learn and track the (mode, rate) pair providing the highest throughput. The design of RA mechanisms has been mainly driven by heuristics. In contrast, we rigorously formulate RA as an online stochastic optimization problem. We solve this problem and present G-ORS (Graphical Optimal Rate Sampling), a family of provably optimal (mode, rate) pair adaptation algorithms. Our main result is that G-ORS outperforms state-of-the-art algorithms such as MiRA and Minstrel HT, as demonstrated by experiments on a 802.11n network test-bed. The design of G-ORS is supported by a theoretical analysis, where we study its performance in stationary radio environments where the successful packet transmission probabilities at the various (mode, rate) pairs do not vary over time, and in non-stationary environments where these probabilities evolve. We show that under G-ORS, the throughput loss due to the need to explore sub-optimal (mode, rate) pairs does not depend on the number of available pairs.

2 November 2022
Verified
Book Chapter
Closed access
PDF file
SHSehyun Hwang
Sehyun Hwang
SLSohyun Lee
Sohyun Lee
SKSungyeon Kim
Sungyeon Kim
JOJungseul Ok
Jungseul Ok
SKSuha Kwak
Suha Kwak

1 January 2024
Verified
Conference Paper
Open access
PDF file
JAJinmyeong An
Jinmyeong An
WLWonjun Lee
Wonjun Lee
YJYejin Jeon
Yejin Jeon
JOJungseul Ok
Jungseul Ok
YKYunsu Kim
Yunsu Kim
GLGary Geunbae Lee
Gary Geunbae Lee
Jinmyeong An, Wonjun Lee, Yejin Jeon, Jungseul Ok, Yunsu Kim, Gary Geunbae Lee. Proceedings of the 25th Annual Meeting of the Special Interest Group on Discourse and Dialogue. 2024.


31 October 2024
Verified
Book Chapter
Closed access
PDF file
JKJuwon Kang
Juwon Kang
NKNayeong Kim
Nayeong Kim
JOJungseul Ok
Jungseul Ok
SKSuha Kwak
Suha Kwak

12 June 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JOJungseul Ok
Jungseul Ok
SOSewoong Oh
Sewoong Oh
JSJinwoo Shin
Jinwoo Shin
YYYung Yi
Yung Yi
Crowdsourcing systems are popular for solving large-scale labelling tasks with low-paid workers. We study the problem of recovering the true labels from the possibly erroneous crowdsourced labels under the popular Dawid-Skene model. To address this inference problem, several algorithms have recently been proposed, but the best known guarantee is still significantly larger than the fundamental limit. We close this gap by introducing a tighter lower bound on the fundamental limit and proving that Belief Propagation (BP) exactly matches this lower bound. The guaranteed optimality of BP is the strongest in the sense that it is information-theoretically impossible for any other algorithm to correctly label a larger fraction of the tasks. Experimental results suggest that BP is close to optimal for all regimes considered and improves upon competing state-of-the-art algorithms.