2 code implementations • 6 Jun 2023 • Chandra Shekhara Kaushik Valmeekam, Krishna Narayanan, Dileep Kalathil, Jean-Francois Chamberland, Srinivas Shakkottai
We provide new estimates of an asymptotic upper bound on the entropy of English using the large language model LLaMA-7B as a predictor for the next token given a window of past tokens.
1 code implementation • 1 Dec 2021 • Archana Bura, Aria HasanzadeZonuzy, Dileep Kalathil, Srinivas Shakkottai, Jean-Francois Chamberland
Safe reinforcement learning is extremely challenging--not only must the agent explore an unknown environment, it must do so while ensuring no safety constraint violations.
no code implementations • 22 Nov 2020 • Allen Hao, Stefano Rini, Vamsi Amalladinne, Asit Kumar Pradhan, Jean-Francois Chamberland
In the cluster with higher power, devices transmit using a two-layer superposition modulation.
Information Theory Information Theory
no code implementations • 15 Feb 2021 • Vamsi K. Amalladinne, Allen Hao, Stefano Rini, Jean-Francois Chamberland
Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers.
Information Theory Information Theory
no code implementations • 24 Jan 2023 • Michail Gkagkos, Krishna R. Narayanan, Jean-Francois Chamberland, Costas N. Georghiades
The goal is to create a low complexity, linear compression strategy, called PolarAir, that reduces the size of the gradient at the user side to lower the number of channel uses needed to transmit it.
no code implementations • 1 Nov 2023 • Vicram Rajagopalan, Vishnu Teja Kunde, Chandra Shekhara Kaushik Valmeekam, Krishna Narayanan, Srinivas Shakkottai, Dileep Kalathil, Jean-Francois Chamberland
A communication channel is essentially a noisy function that maps transmitted symbols to received symbols, and this function can be represented by an unknown parameter whose statistics depend on an (also unknown) latent context.