Concept

Rigour

Related publications (32)

Deep Learning Meets Sparse Regularization

Deep learning (DL) has been wildly successful in practice, and most of the state-of-the-art machine learning methods are based on neural networks (NNs). Lacking, however, is a rigorous mathematical theory that adequately explains the amazing performance of ...

2023

Federated Linear Bandit Learning via Over-the-air Computation

Yuning Jiang, Xin Liu, Ting Wang

In this paper, we investigate federated contextual linear bandit learning within a wireless system that comprises a server and multiple devices. Each device interacts with the environment, selects an action based on the received reward, and sends model upd ...

IEEE2023

Analysis-aware defeaturing of complex geometries

Pablo Antolin Sanchez, Ondine Gabrielle Chanon

Local modifications of a computational domain are often performed in order to simplify the meshing process and to reduce computational costs and memory requirements. However, removing geometrical features of a domain often introduces a non-negligible error ...

2022

Switchover phenomenon induced by epidemic seeding on geometric networks

Gergely Odor

It is a fundamental question in disease modeling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. One important goal has been to find the seed configuration, which infects the most individuals. Although the id ...

2021

Two mixed finite element formulations for the weak imposition of the Neumann boundary conditions for the Darcy flow

Erik Burman, Riccardo Puppi

We propose two different discrete formulations for the weak imposition of the Neumann boundary conditions of the Darcy flow. The Raviart-Thomas mixed finite element on both triangular and quadrilateral meshes is considered for both methods. One is a consis ...

2021

On Linear Optimization over Wasserstein Balls

Daniel Kuhn, Wolfram Wiesemann

Wasserstein balls, which contain all probability measures within a pre-specified Wasserstein distance to a reference measure, have recently enjoyed wide popularity in the distributionally robust optimization and machine learning communities to formulate an ...

2020

Properties of convex optimal power flow model based on power loss relaxation

Mario Paolone, Zhao Yuan

We derive the branch ampacity constraint associated to power losses for the convex optimal power flow (OPF) model based on the branch flow formulation. The branch ampacity constraint derivation is motivated by the physical interpretation of the transmissio ...

ELSEVIER SCIENCE SA2020

Mutual Information for the Stochastic Block Model by the Adaptive Interpolation Method

Nicolas Macris, Jean François Emmanuel Barbier, Chun Lam Chan

We rigorously derive a single-letter variational expression for the mutual information of the asymmetric two-groups stochastic block model in the dense graph regime. Existing proofs in the literature are indirect, as they involve mapping the model to a ran ...

IEEE2019

Statistical Physics Methods for Community Detection

Chun Lam Chan

This thesis is devoted to information-theoretic aspects of community detection. The importance of community detection is due to the massive amount of scientific data today that describes relationships between items from a network, e.g., a social network. I ...

EPFL2019

An algebraic least squares reduced basis method for the solution of nonaffinely parametrized Stokes equations

Alfio Quarteroni, Simone Deparis, Andrea Manzoni, Niccolò Dal Santo

In this paper we propose a new, purely algebraic, Petrov-Galerkin reduced basis (RB) method to solve the parametrized Stokes equations, where parameters serve to identify the (variable) domain geometry. Our method is obtained as an algebraic least squares ...

ELSEVIER SCIENCE SA2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.