Concept

Intégrale de Lebesgue

Publications associées (59)

Extensions of Peer Prediction Incentive Mechanisms

As large, data-driven artificial intelligence models become ubiquitous, guaranteeing high data quality is imperative for constructing models. Crowdsourcing, community sensing, and data filtering have long been the standard approaches to guaranteeing or imp ...

EPFL2024

A New Analytical Approximation of the Fluid Antenna System Channel

Malek Khammassi

Fluid antenna systems (FAS) are an emerging technology that promises a significant diversity gain even in the smallest spaces. It consists of a freely moving antenna in a small linear space to pick up the strongest received signal. Previous works in the li ...

Piscataway2023

ALMOST EVERYWHERE NONUNIQUENESS OF INTEGRAL CURVES FOR DIVERGENCE-FREE SOBOLEV VECTOR FIELDS

Massimo Sorella

We construct divergence-free Sobolev vector fields in C([0,1];W-1,W-r(T-d;Rd)) with r < d and d\geq 2 which simultaneously admit any finite number of distinct positive solutions to the continuity equation. These vector fields are then shown to have at leas ...

Philadelphia2023

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

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

Understanding Deep Neural Function Approximation in Reinforcement Learning via ϵ-Greedy Exploration

Volkan Cevher, Fanghui Liu, Luca Viano

This paper provides a theoretical study of deep neural function approximation in reinforcement learning (RL) with the ϵ-greedy exploration under the online setting. This problem setting is motivated by the successful deep Q-networks (DQN) framework that fa ...

2022

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

2021

Sparse non-negative super-resolution - simplified and stabilised

Armin Eftekhari, Hemant Tyagi

We consider the problem of non-negative super-resolution, which concerns reconstructing a non-negative signal x = Sigma(k )(i=1)a(i)delta(ti) from m samples of its convolution with a window function phi(s - t), of the form y(s(j)) = Sigma(k)(i=1) a(i) phi( ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

On the stress tensor light-ray operator algebra

Grégoire Olivier Mathys, Matthew Thomas Walters, Alexandre Mathieu Frédéric Belin

We study correlation functions involving generalized ANEC operators of the form integral dx-x-n+2T--x -> in four dimensions. We compute two, three, and ...

2021

Numerical generation and contact analysis of rough surfaces in concrete

Guillaume Anciaux, Mohit Pundir

In concrete structures, opened cracks contribute significantly to the transfer of shear and normal stresses through the contact forces occurring between fractured surfaces. Such contact forces are due to protruding asperities, engaged by interlocking and f ...

2021

First passage sets of the 2D continuum Gaussian free field

Juhan Aru, Titus Lupu

We introduce the first passage set (FPS) of constant level -a of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the boundary by a path on whi ...

SPRINGER HEIDELBERG2020

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