Zobrazeno 1 - 10
of 927
pro vyhledávání: '"Kim， Young Han"'
Coding schemes for several problems in network information theory are constructed starting from point-to-point channel codes that are designed for symmetric channels. Given that the point-to-point codes satisfy certain properties pertaining to the ra
Externí odkaz:
http://arxiv.org/abs/2211.07208
Autor:
Ryu, J. Jon, Kim, Young-Han
A short, information-theoretic proof of the Kac--Bernstein theorem, which is stated as follows, is presented: For any independent random variables $X$ and $Y$, if $X+Y$ and $X-Y$ are independent, then $X$ and $Y$ are normally distributed.
Commen
Commen
Externí odkaz:
http://arxiv.org/abs/2202.06005
Autor:
Ryu, J. Jon, Kim, Young-Han
This paper presents how to perform minimax optimal classification, regression, and density estimation based on fixed-$k$ nearest neighbor (NN) searches. We consider a distributed learning scenario, in which a massive dataset is split into smaller gro
Externí odkaz:
http://arxiv.org/abs/2202.02464
A new portfolio selection strategy that adapts to a continuous side-information sequence is presented, with a universal wealth guarantee against a class of state-constant rebalanced portfolios with respect to a state function that maps each side-info
Externí odkaz:
http://arxiv.org/abs/2202.02431
A class of parameter-free online linear optimization algorithms is proposed that harnesses the structure of an adversarial sequence by adapting to some side information. These algorithms combine the reduction technique of Orabona and P{\'a}l (2016) f
Externí odkaz:
http://arxiv.org/abs/2202.02406
Autor:
Bhatt, Alankrita, Kim, Young-Han
The problem of online prediction with sequential side information under logarithmic loss is studied, and general upper and lower bounds on the minimax regret incurred by the predictor is established. The upper bounds on the minimax regret are obtaine
Externí odkaz:
http://arxiv.org/abs/2102.06855
Autor:
Park, Sunwha, Shim, Minki, Lee, Gain, You, Young-Ah, Kim, Soo Min, Hur, Young Min, Ko, Hyejin, Park, Mi Hye, Na, Sung Hun, Kim, Young-Han, Cho, Geum Joon, Bae, Jin-Gon, Lee, Soo-Jeong, Lee, Sun Hwa, Lee, Dong-Kyu, Kim, Young Ju
Publikováno v:
In Reproductive Toxicology March 2024 124
The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the interactive capacity is notoriously difficult, and the best known lower boun
Externí odkaz:
http://arxiv.org/abs/2001.00499
Uplink and downlink cloud radio access networks are modeled as two-hop K-user L-relay networks, whereby small base-stations act as relays for end-to-end communications and are connected to a central processor via orthogonal fronthaul links of finite
Externí odkaz:
http://arxiv.org/abs/1912.04483