79 citations · 855 across the 98 of their papers we have counts for
62 papers · 1 filter
On Universal D-Semifaithful Coding for Memoryless Sources with Infinite Alphabets
Jorge F. Silva, Pablo Piantanida
The problem of variable length and fixed-distortion universal source coding (or D-semifaithful source coding) for stationary and memoryless sources on countably infinite alphabets…
Finite-Length Bounds on Hypothesis Testing Subject to Vanishing Type I Error Restrictions
Sebastian Espinosa, Jorge F. Silva, Pablo Piantanida
A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) er…
On the Estimation of Information Measures of Continuous Distributions
Georg Pichler, Pablo Piantanida, Günther Koliander
The estimation of information measures of continuous distributions based on samples is a fundamental problem in statistics and machine learning. In this paper, we analyze estimates…
An Index Coding Approach to Caching with Uncoded Cache Placement
Kai Wan, Daniela Tuninetti, Pablo Piantanida
Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without knowledge of user's later…
Fundamental Limits of Decentralized Data Shuffling
Kai Wan, Daniela Tuninetti, Mingyue Ji +2
Data shuffling of training data among different computing nodes (workers) has been identified as a core element to improve the statistical performance of modern large-scale machine…
On Combination Networks with Cache-aided Relays and Users
Kai Wan, Daniela Tuninetti, Pablo Piantanida +1
Caching is an efficient way to reduce peak hour network traffic congestion by storing some contents at the user's cache without knowledge of later demands. Coded caching strategy w…