Publication

Information-Theoretic Caching: Sequential Coding for Computing

Related publications (37)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Motor-Unit Ordering of Blindly-Separated Surface-EMG Signals for Gesture Recognition

Pasquale Davide Schiavone, Elisa Donati

Hand gestures are one of the most natural and expressive way for humans to convey information, and thus hand gesture recognition has become a research hotspot in the human-machine interface (HMI) field. In particular, biological signals such as surface ele ...

SPRINGER INTERNATIONAL PUBLISHING AG2023

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

EPFL2022

A taxonomy of surprise definitions

Wulfram Gerstner, Johanni Michael Brea, Alireza Modirshanechi

Surprising events trigger measurable brain activity and influence human behavior by affecting learning, memory, and decision-making. Currently there is, however, no consensus on the definition of surprise. Here we identify 18 mathematical definitions of su ...

2022

Caching (Bivariate) Gaussians

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

Caching is a technique that alleviates networks during peak hours by transmitting partial information before a request for any is made. In a lossy setting of Gaussian databases, we study a single-user model in which good caching strategies minimize the dat ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Converse for Multi-Server Single-Message PIR with Side Information

Michael Christoph Gastpar, Su Li

Multi-server single-message private information retrieval is studied in the presence of side information. In this problem, K independent messages are replicatively stored at N non-colluding servers. The user wants to privately download one message from the ...

2020

Information Theoretic Characterization of Uncertainty Distinguishes Surprise From Accuracy Signals in the Brain

Kerstin Preuschoff, Leyla Loued-Khenissi

Uncertainty presents a problem for both human and machine decision-making. While utility maximization has traditionally been viewed as the motive force behind choice behavior, it has been theorized that uncertainty minimization may supersede reward motivat ...

2020

Measurement-system design for structural identification

Numa Joy Bertola

In developed countries, the management of existing civil infrastructure is challenging due to evolving functional requirements, aging and climate change. Due to conservative approaches in construction design and practice, infrastructure often has hidden re ...

EPFL2020

Contextual Games: Multi-Agent Learning with Side Information

Maryam Kamgarpour, Andreas Krause, Ilija Bogunovic

We formulate the novel class of contextual games, a type of repeated games driven by contextual information at each round. By means of kernel-based regularity assumptions, we model the correlation between different contexts and game out- comes and propose ...

Curran Associates, Inc.2020

In the celebrated coded caching problem studied by Maddah-Ali and Niesen, the peak-traffic network load is to be reduced by first caching some information about contents into individual memories of end users during the off-peak hours and then upon user req ...

IEEE2020

The single-server multi-message private information retrieval with side information problem is studied for general cases. In this problem, K independent messages are stored at a single server. One user initially has M messages as side information and wants ...

IEEE2020