Concept

Épreuve de Bernoulli

Publications associées (9)

Double Quasi-Poisson Algebras are Pre-Calabi-Yau

In this article, we prove that double quasi-Poisson algebras, which are noncommutative analogues of quasi-Poisson manifolds, naturally give rise to pre-Calabi-Yau algebras. This extends one of the main results in [11], where a correspondence between certai ...

2022

Timing is Everything

Karen Adam

In this thesis, timing is everything. In the first part, we mean this literally, as we tackle systems that encode information using timing alone. In the second part, we adopt the standard, metaphoric interpretation of this saying and show the importance of ...

EPFL2022

CauseOccam: Learning Interpretable Abstract Representations in Reinforcement Learning Environments via Model Sparsity

Sergei Volodin

"I choose this restaurant because they have vegan sandwiches" could be a typical explanation we would expect from a human. However, current Reinforcement Learning (RL) techniques are not able to provide such explanations, when trained on raw pixels. RL alg ...

2021

Zero-one laws for eventually always hitting points in in rapidly mixing systems

Florian Karl Richter

In this work we study the set of eventually always hitting points in shrinking target systems. These are points whose long orbit segments eventually hit the corresponding shrinking targets for all future times. We focus our attention on systems where trans ...

2020

Efficient learning of smooth probability functions from Bernoulli tests with guarantees.

Volkan Cevher, Paul Thierry Yves Rolland, Ali Kavis

We study the fundamental problem of learning an unknown, smooth probability function via pointwise Bernoulli tests. We provide a scalable algorithm for efficiently solving this problem with rigorous guarantees. In particular, we prove the convergence rate ...

2019

Influence of density of large stems on the blocking probability at spillways

Anton Schleiss, Michael Pfister, José Pedro Gamito de Saldanha Calado Matos, Paloma Furlan

Dam safety is strongly linked to the probability of occurrence of large floods. Floods can transport large wood (LW) into reservoirs and towards water release structures as spillways. Due to blocking and clogging, LW may significantly influence the dischar ...

Utah State University2018

On Risk Reduction in Kelly Betting Using the Conservative Expected Value

Daniel Kuhn, Napat Rujeerapaiboon

The celebrated Kelly betting strategy guarantees, with probability one, higher long-run wealth than any other causal investment strategy. However, on the way to its long-term supremacy, this strategy has a notable downfall: it typically displays high varia ...

2018

Interference Channels with Bursty Traffic and Delayed Feedback

Suhas Diggavi, I-Hsiang Wang

In this paper we study interference management in wireless networks with bursty user traffic. In each time slot, whether a user is on or off for transmission is governed by its own Bernoulli random state. At each transmitter, the states of activities of ot ...

Ieee2013

Variance Stabilizing the Difference of Two Binomial Proportions

Stephan Morgenthaler, Robert Staudte

The article studies estimation of Delta = p(1) - p(2), the difference of two proportions p(1) and p(2), based on two independent Binomial experiments of size n(1) and n(2). The usual estimator, the difference between the two sample proportions, is variance ...

American Statistical Association2010

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search