activity
20182026
most citedEMI: Exploration with Mutual Information

29 citations · 59 across the 8 of their papers we have counts for

collaborators

8 papers

cs.RO2026

Ludi: An Agentic System for Socially Intelligent Robots

Wooseong Chung, William Cong, Jakub Dworakowski +14

Robot foundation models have substantially advanced perception and control, but natural human-robot collaboration requires more than executing isolated commands. A robot must recog…

cs.LG2023

Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming

Jinuk Kim, Yeonwoo Jeong, Deokjae Lee +1

Recent works on neural network pruning advocate that reducing the depth of the network is more effective in reducing run-time memory usage and accelerating inference latency than r…

cs.CE2022★ 2 cited

Efficient Liquidity Providing via Margin Liquidity

Yeonwoo Jeong, Chanyoung Jeoung, Hosan Jeong +2

The limit order book mechanism has been the core trading mechanism of the modern financial market. In the cryptocurrency market, centralized exchanges also adopt this limit order b…

cs.CV2022

Optimal channel selection with discrete QCQP

Yeonwoo Jeong, Deokjae Lee, Gaon An +2

Reducing the high computational cost of large convolutional neural networks is crucial when deploying the networks to resource-constrained environments. We first show the greedy ap…

cs.LG2019★ 18 cited

Learning Discrete and Continuous Factors of Data via Alternating Disentanglement

Yeonwoo Jeong, Hyun Oh Song

We address the problem of unsupervised disentanglement of discrete and continuous explanatory factors of data. We first show a simple procedure for minimizing the total correlation…

cs.CV2019

End-to-End Efficient Representation Learning via Cascading Combinatorial Optimization

Yeonwoo Jeong, Yoonsung Kim, Hyun Oh Song

We develop hierarchically quantized efficient embedding representations for similarity-based search and show that this representation provides not only the state of the art perform…

cs.LG2018★ 29 cited

EMI: Exploration with Mutual Information

Hyoungseok Kim, Jaekyeom Kim, Yeonwoo Jeong +2

Reinforcement learning algorithms struggle when the reward signal is very sparse. In these cases, naive random exploration methods essentially rely on a random walk to stumble onto…

cs.LG2018★ 10 cited

Efficient end-to-end learning for quantizable representations

Yeonwoo Jeong, Hyun Oh Song

Embedding representation learning via neural networks is at the core foundation of modern similarity based search. While much effort has been put in developing algorithms for learn…