Publications associées (180)

Extensions of Peer Prediction Incentive Mechanisms

Adam Julian Richardson

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

Stability of a liquid layer draining around a horizontal cylinder: Interplay of capillary and gravity forces

François Gallaire, Shahab Eghbali, Simeon Vladimirov Djambov

We study the drainage of a viscous liquid film coating the outside of a solid horizontal cylinder, where gravity acts vertically. We focus on the limit of large Ohnesorge numbers Oh, where inertia is negligible compared to viscous effects. We first study t ...
Amer Physical Soc2024

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

Fabio Nobile, Tommaso Vanzan

We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...
2024

High-Dimensional Kernel Methods under Covariate Shift: Data-Dependent Implicit Regularization

Volkan Cevher, Fanghui Liu

This paper studies kernel ridge regression in high dimensions under covariate shifts and analyzes the role of importance re-weighting. We first derive the asymptotic expansion of high dimensional kernels under covariate shifts. By a bias-variance decomposi ...
2024

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions f1,,fnf_1,\ldots,f_n with fi:DRf_i:\mathcal{D}\mapsto \mathbb{R}, finite-sum minimization seeks a point xD{x}^\star \in \mathcal{D} minimizing j=1nfj(x)/n\sum_{j=1}^nf_j(x)/n. In this work, we propose a key twist into the finite-sum minimizat ...
2024

Static Worst-Case Resource Analysis for Substrate Pallets

Simon Nicolas Perriard

We present saft, the first attempt of a static analyzer that extracts the asymptotic function complexity for the Polkadot/Substrate ecosystem, where the burden of accounting for computation resource consumption is put on the developer. saft is a tool meant ...
2023

Latency Interfaces for Systems Code

Rishabh Ramesh Iyer

This thesis demonstrates that it is feasible for systems code to expose a latency interface that describes its latency and related side effects for all inputs, just like the code's semantic interface describes its functionality and related side effects.Sem ...
EPFL2023

Weakly nonlinear versus semi-linear models of the nonlinear evolution of the centrifugal instability

François Gallaire, Eunok Yim

We carry out a weakly nonlinear analysis of the centrifugal instability for a columnar vortex in a rotating fluid, and compare the results to those of the semi-linear model derived empirically by Yim et al. (J. Fluid Mech., vol. 897, 2020, A34). The asympt ...
CAMBRIDGE UNIV PRESS2023

Learning curves for the multi-class teacher-student perceptron

Lenka Zdeborová, Elisabetta Cornacchia, Bruno Loureiro, Bruno Loureiro, Francesca Mignacco

One of the most classical results in high-dimensional learning theory provides a closed-form expression for the generalisation error of binary classification with a single-layer teacher-student perceptron on i.i.d. Gaussian inputs. Both Bayes-optimal (BO) ...
IOP Publishing Ltd2023

Liquid film instability of an internally coated horizontal tube

François Gallaire, Edouard Boujo, Yves-Marie François Ducimetière, Shahab Eghbali

We study numerically and theoretically the gravity-driven flow of a viscous liquid film coating the inner side of a horizontal cylindrical tube and surrounding a shear-free dynamically inert gaseous core. The liquid-gas interface is prone to the Rayleigh-P ...
AMER PHYSICAL SOC2023

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.