Basic Image
Image
![2011_CTW](/sites/default/files/2011_CTW.jpg)
Summary for Basic Image
Basic Image
Image
![Name spanish.](/sites/default/files/2020-12/spanish.jpg)
Summary
Content Cards Block
Description of Content Cards
Plain
Cart title
Cart textCard title 2
Card textCard Title 3
Card text 3Sponsor's Logo
Title Description
The name of this block is "Title Description"
Recent Journal Issues
Journal Name
Journal description
Journal Name
Journal Description
Plain
Two Cards
This card provides an image
Title description link
Body of "Title description link"/ There is the option for a background image. Set "Fixed Container"
Events and meeting: Events and Meeting
Research In Information Theory
Selected papers on information theory from our journals and conferences
IEEE JSAIT on the Information Theory Magazine
Throughput and Latency Analysis for Line Networks With Outage Links
Wireless communication links suffer from outage events caused by fading and interference. To facilitate a tractable analysis of network communication throughput and latency, we propose an outage link model to represent a communication link in the slow fading phenomenon. For a line-topology network with outage links, we study three types of intermediate network node schemes: random linear network coding, store-and-forward, and hop-by-hop retransmission. We provide the analytical formulas for the maximum throughputs and the end-to-end latency for each scheme.
IEEE JSAIT on the Information Theory Magazine
Addressing GAN Training Instabilities via Tunable Classification Losses
Generative adversarial networks (GANs), modeled as a zero-sum game between a generator (G) and a discriminator (D), allow generating synthetic data with formal guarantees. Noting that D is a classifier, we begin by reformulating the GAN value function using class probability estimation (CPE) losses. We prove a two-way correspondence between CPE loss GANs and f-GANs which minimize f-divergences. We also show that all symmetric f-divergences are equivalent in convergence.
IEEE JSAIT on the Information Theory Magazine
Information Velocity of Cascaded Gaussian Channels With Feedback
We consider a line network of nodes, connected by additive white noise channels, equipped with local feedback. We study the velocity at which information spreads over this network. For transmission of a data packet, we give an explicit positive lower bound on the velocity, for any packet size. Furthermore, we consider streaming, that is, transmission of data packets generated at a given average arrival rate. We show that a positive velocity exists as long as the arrival rate is below the individual Gaussian channel capacity, and provide an explicit lower bound.
IEEE JSAIT on the Information Theory Magazine
Long-Term Fairness in Sequential Multi-Agent Selection with Positive Reinforcement
While much of the rapidly growing literature on fair decision-making focuses on metrics for one-shot decisions, recent work has raised the intriguing possibility of designing sequential decision-making to positively impact long-term social fairness. In selection processes such as college admissions or hiring, biasing slightly towards applicants from under-represented groups is hypothesized to provide positive feedback that increases the pool of under-represented applicants in future selection rounds, thus enhancing fairness in the long term.