Concept

Inégalité de concentration

Publications associées (94)

S-matrix bootstrap for effective field theories: massless pions

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 ...

SPRINGER2021

Distributionally Robust Mechanism Design

Daniel Kuhn, Cagil Kocyigit, Wolfram Wiesemann

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

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

Wavelet analysis of the Besov regularity of Levy white noise

Julien René Pierre Fageot, Shayan Aziznejad

We characterize the local smoothness and the asymptotic growth rate of the Levy white noise. We do so by characterizing the weighted Besov spaces in which it is located. We extend known results in two ways. First, we obtain new bounds for the local smoothn ...

2020

Learning and Adaptive Data Analysis via Maximal Leakage

Michael Christoph Gastpar, Amedeo Roberto Esposito, Ibrahim Issa

There has been growing interest in studying connections between generalization error of learning algorithms and information measures. In this work, we generalize a result that employs the maximal leakage, a measure of leakage of information, and explore ho ...

IEEE2019

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

A reduced basis approach to large-scale pseudospectra computation

Petar Sirkovic

For studying spectral properties of a nonnormal matrix A is an element of Cnxn, information about its spectrum sigma(A) alone is usually not enough. Effects of perturbations on sigma(A) can be studied by computing epsilon-pseudospectra, i.e. the level sets ...

WILEY2019

MRI T2 Mapping of the Knee Providing Synthetic Morphologic Images: Comparison to Conventional Turbo Spin-Echo MRI

Tobias Kober, Tom Hilbert

Background: Use of a T2 mapping sequence in addition to the conventional knee MRI protocol increases sensitivity to early cartilage lesions but is time consuming. Purpose: To test the in vitro validity of quantitative data from an accelerated parallel T2 m ...

RADIOLOGICAL SOC NORTH AMERICA2019

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