Picture for Sreeram Kannan

Sreeram Kannan

Deepcode and Modulo-SK are Designed for Different Settings

Add code
Aug 18, 2020
Figure 1 for Deepcode and Modulo-SK are Designed for Different Settings
Figure 2 for Deepcode and Modulo-SK are Designed for Different Settings
Figure 3 for Deepcode and Modulo-SK are Designed for Different Settings
Figure 4 for Deepcode and Modulo-SK are Designed for Different Settings
Viaarxiv icon

C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation

Add code
May 17, 2020
Figure 1 for C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation
Figure 2 for C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation
Figure 3 for C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation
Figure 4 for C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation
Viaarxiv icon

Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels

Add code
Nov 08, 2019
Figure 1 for Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels
Figure 2 for Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels
Figure 3 for Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels
Figure 4 for Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels
Viaarxiv icon

Improving Federated Learning Personalization via Model Agnostic Meta Learning

Add code
Sep 27, 2019
Figure 1 for Improving Federated Learning Personalization via Model Agnostic Meta Learning
Figure 2 for Improving Federated Learning Personalization via Model Agnostic Meta Learning
Figure 3 for Improving Federated Learning Personalization via Model Agnostic Meta Learning
Figure 4 for Improving Federated Learning Personalization via Model Agnostic Meta Learning
Viaarxiv icon

Are Odds Really Odd? Bypassing Statistical Detection of Adversarial Examples

Add code
Jul 28, 2019
Figure 1 for Are Odds Really Odd? Bypassing Statistical Detection of Adversarial Examples
Figure 2 for Are Odds Really Odd? Bypassing Statistical Detection of Adversarial Examples
Figure 3 for Are Odds Really Odd? Bypassing Statistical Detection of Adversarial Examples
Figure 4 for Are Odds Really Odd? Bypassing Statistical Detection of Adversarial Examples
Viaarxiv icon

Learning in Gated Neural Networks

Add code
Jun 06, 2019
Figure 1 for Learning in Gated Neural Networks
Figure 2 for Learning in Gated Neural Networks
Figure 3 for Learning in Gated Neural Networks
Figure 4 for Learning in Gated Neural Networks
Viaarxiv icon

CCMI : Classifier based Conditional Mutual Information Estimation

Add code
Jun 05, 2019
Figure 1 for CCMI : Classifier based Conditional Mutual Information Estimation
Figure 2 for CCMI : Classifier based Conditional Mutual Information Estimation
Figure 3 for CCMI : Classifier based Conditional Mutual Information Estimation
Figure 4 for CCMI : Classifier based Conditional Mutual Information Estimation
Viaarxiv icon

Dropping Pixels for Adversarial Robustness

Add code
May 01, 2019
Figure 1 for Dropping Pixels for Adversarial Robustness
Figure 2 for Dropping Pixels for Adversarial Robustness
Figure 3 for Dropping Pixels for Adversarial Robustness
Figure 4 for Dropping Pixels for Adversarial Robustness
Viaarxiv icon

LEARN Codes: Inventing Low-latency Codes via Recurrent Neural Networks

Add code
Nov 30, 2018
Figure 1 for LEARN Codes: Inventing Low-latency Codes via Recurrent Neural Networks
Figure 2 for LEARN Codes: Inventing Low-latency Codes via Recurrent Neural Networks
Figure 3 for LEARN Codes: Inventing Low-latency Codes via Recurrent Neural Networks
Figure 4 for LEARN Codes: Inventing Low-latency Codes via Recurrent Neural Networks
Viaarxiv icon

Estimating Mutual Information for Discrete-Continuous Mixtures

Add code
Oct 09, 2018
Figure 1 for Estimating Mutual Information for Discrete-Continuous Mixtures
Figure 2 for Estimating Mutual Information for Discrete-Continuous Mixtures
Figure 3 for Estimating Mutual Information for Discrete-Continuous Mixtures
Viaarxiv icon