Concept

Inégalité de Hoeffding

Publications associées (24)

Anthony C Davison and Igor Rodionov's contribution to the Discussion of 'Estimating means of bounded random variables by betting' by Waudby-Smith and Ramdas

Anthony Christopher Davison, Igor Rodionov

We derive confidence intervals (CIs) and confidence sequences (CSs) for the classical problem of estimating a bounded mean. Our approach generalizes and improves on the celebrated Chernoff method, yielding the best closed-form "empirical-Bernstein" CSs and ...

Oxford2024

Upper bounds on technoemission rates from 60 years of "silence"

Claudio Grimaldi

The lack of detection to date of electromagnetic technosignatures implies either that we have been unable to detect them due to incomplete sampling of the search space or that we cannot detect them because the Earth has been located during the entire histo ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Sharp asymptotics on the compression of two-layer neural networks

Marco Mondelli

In this paper, we study the compression of a target two-layer neural network with N nodes into a compressed network with M < N nodes. More precisely, we consider the setting in which the weights of the target network are i.i.d. sub-Gaussian, and we minimiz ...

IEEE2022

Generalization Error Bounds Via Rényi-, f-Divergences and Maximal Leakage

Michael Christoph Gastpar, Amedeo Roberto Esposito, Ibrahim Issa

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two random variables. ...

2021

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Daniel Kressner, Alice Cortinovis

Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...

2021

Shrinking Scale Equidistribution for Monochromatic Random Waves on Compact Manifolds

Matthew De Courcy-Ireland

We prove equidistribution at shrinking scales for the monochromatic ensemble on a compact Riemannian manifold of any dimension. This ensemble on an arbitrary manifold takes a slowly growing spectral window in order to synthesize a random function. With hig ...

OXFORD UNIV PRESS2021

Contact process under renewals II

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

Weyl-type bounds for Steklov eigenvalues

Joachim Stubbe, Luigi Provenzano

We present upper and lower bounds for Steklov eigenvalues for domains in RN+1 with C-2 boundary compatible with the Weyl asymptotics. In particular, we obtain sharp upper bounds on Riesz-means and the trace of corresponding Steklov heat kernel. The key res ...

EUROPEAN MATHEMATICAL SOC2019

Forbidden induced subposets of given height

Istvan Tomon

Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

Regularization via Mass Transportation

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Peyman Mohajerin Esfahani

The goal of regression and classification methods in supervised learning is to minimize the empirical risk, that is, the expectation of some loss function quantifying the prediction error under the empirical distribution. When facing scarce training data, ...

2019

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