Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Inégalité de Chernoff

Publications associées (29)

Learning Self-Exciting Temporal Point Processes Under Noisy Observations

William Trouleau

Understanding the diffusion patterns of sequences of interdependent events is a central question for a variety of disciplines. Temporal point processes are a class of elegant and powerful models of such sequences; these processes have become popular across ...

EPFL2021

Secrecy by Design With Applications to Privacy and Compression

Yanina Yurina Shkel

Secrecy by design is examined as an approach to information-theoretic secrecy. The main idea behind this approach is to design an information processing system from the ground up to be perfectly secure with respect to an explicit secrecy constraint. The pr ...

2021

Nearly-Tight and Oblivious Algorithms for Explainable Clustering

Ola Nils Anders Svensson, Adam Teodor Polak, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Xinrui Jia

We study the problem of explainable clustering in the setting first formalized by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). A k-clustering is said to be explainable if it is given by a decision tree where each internal node splits data point ...

2021

S-matrix bootstrap for effective field theories: massless pions

João Miguel Augusto Penedones Fernandes

We use the numerical S-matrix bootstrap method to obtain bounds on the two leading Wilson coefficients (or low energy constants) of the chiral lagrangian controlling the low-energy dynamics of massless pions. This provides a proof of concept that the numer ...

Springer Nature2021

Adaptive Social Learning

Ali H. Sayed, Virginia Bordignon

This work proposes a novel strategy for social learning by introducing the critical feature of adaptation. In social learning, several distributed agents update continually their belief about a phenomenon of interest through: i) direct observation of strea ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Contact process under renewals II

Thomas Mountford

We continue the study of renewal contact processes initiated in a companion paper, where we showed that if the tail of the interarrival distribution mu is heavier than t(-alpha) for some alpha < 1 (plus auxiliary regularity conditions) then the critical va ...

ELSEVIER2020

Distributionally Robust Mechanism Design

Daniel Kuhn, Wolfram Wiesemann, Cagil Kocyigit

We study a mechanism design problem where an indivisible good is auctioned to multiple bidders, for each of whom it has a private value that is unknown to the seller and the other bidders. The agents perceive the ensemble of all bidder values as a random v ...

2020

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Serge Vaudenay

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Springer, Cham2020

Distributional Robustness in Mechanism Design

Cagil Kocyigit

Mechanism design theory examines the design of allocation mechanisms or incentive systems involving multiple rational but self-interested agents and plays a central role in many societally important problems in economics. In mechanism design problems, agen ...

EPFL2020