25 citations · 120 across the 12 of their papers we have counts for
12 papers
Testing for directed information graphs
Sina Molavipour, Germán Bassi, Mikael Skoglund
In this paper, we study a hypothesis test to determine the underlying directed graph structure of nodes in a network, where the nodes represent random processes and the direction o…
Tighter expected generalization error bounds via Wasserstein distance
Borja Rodríguez-Gálvez, Germán Bassi, Ragnar Thobaben +1
This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset b…
Causality Graph of Vehicular Traffic Flow
Sina Molavipour, Germán Bassi, Mladen Čičić +2
In an intelligent transportation system, the effects and relations of traffic flow at different points in a network are valuable features which can be exploited for control system…
On Random Subset Generalization Error Bounds and the Stochastic Gradient Langevin Dynamics Algorithm
Borja Rodríguez-Gálvez, Germán Bassi, Ragnar Thobaben +1
In this work, we unify several expected generalization error bounds based on random subsets using the framework developed by Hellström and Durisi [1]. First, we recover the bounds…
Secure Strong Coordination
Giulia Cervia, German Bassi, Mikael Skoglund
We consider a network of two nodes separated by a noisy channel, in which the source and its reconstruction have to be strongly coordinated, while simultaneously satisfying the str…
Neural Estimators for Conditional Mutual Information Using Nearest Neighbors Sampling
Sina Molavipour, Germán Bassi, Mikael Skoglund
The estimation of mutual information (MI) or conditional mutual information (CMI) from a set of samples is a long-standing problem. A recent line of work in this area has leveraged…
Upper Bounds on the Generalization Error of Private Algorithms for Discrete Data
Borja Rodríguez-Gálvez, Germán Bassi, Mikael Skoglund
In this work, we study the generalization capability of algorithms from an information-theoretic perspective. It has been shown that the expected generalization error of an algorit…
Conditional Mutual Information Neural Estimator
Sina Molavipour, Germán Bassi, Mikael Skoglund
Several recent works in communication systems have proposed to leverage the power of neural networks in the design of encoders and decoders. In this approach, these blocks can be t…
Non-Asymptotic Behavior of the Maximum Likelihood Estimate of a Discrete Distribution
Sina Molavipour, Germán Bassi, Mikael Skoglund
In this paper, we study the maximum likelihood estimate of the probability mass function (pmf) of independent and identically distributed (i.i.d.) random variables, in the non-…
Secret Key Generation over Noisy Channels with Correlated Sources
Germán Bassi, Pablo Piantanida, Shlomo Shamai
This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel…
The Wiretap Channel with Generalized Feedback: Secure Communication and Key Generation
Germán Bassi, Pablo Piantanida, Shlomo Shamai
It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet…
Capacity Bounds for a Class of Interference Relay Channels
Germán Bassi, Pablo Piantanida, Sheng Yang
The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first der…