Publication

Let’s be honest: An optimal no-regret framework for zero-sum games

Related publications (32)

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.

Tensor approximation of the self-diffusion matrix of tagged particle processes

Christoph Max Strössner

The objective of this paper is to investigate a new numerical method for the approximation of the self-diffusion matrix of a tagged particle process defined on a grid. While standard numerical methods make use of long-time averages of empirical means of de ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

A numerical algorithm based on probing to find optimized transmission conditions

Tommaso Vanzan

Optimized Schwarz Methods (OSMs) are based on optimized transmission conditions along the interfaces between the subdomains. Optimized transmission conditions are derived at the theoretical level, using techniques developed in the last decades. The hypothe ...

Springer-Verlag2021

MATHICSE Technical Report : A low-rank technique for computing the quasi-stationary distribution of subcritical Galton-Watson processes

Stefano Massei

We present a new algorithm for computing the quasi-stationary distribution of subcritical Galton-Watson branching processes. This algorithm is based on a particular discretization of a well-known functional equation that characterizes the quasi-stationary ...

MATHICSE2019

We consider the numerical approximation of lipid biomembranes at equilibrium described by the Canham-Helfrich model, according to which the bending energy is minimized under area and volume constraints. Energy minimization is performed via L-2-gradient flo ...

ELSEVIER SCIENCE SA2019

An Adjoint-Based Method For The Numerical Approximation Of Shape Optimization Problems In Presence Of Fluid-Structure Interaction

Andrea Manzoni

In this work, we propose both a theoretical framework and a numerical method to tackle shape optimization problems related with fluid dynamics applications in presence of fluid-structure interactions. We present a general framework relying on the solution ...

EDP SCIENCES S A2018

, ,

We consider the numerical approximation of lipid biomembranes, including red blood cells, described through the Canham-Helfrich model, according to which the shape minimizes the bending energy under area and volume constraints. Energy minimization is perfo ...

MATHICSE2017

Discontinuous Galerkin methods have desirable properties, which make them suitable for the com- putation of wave problems. Being parallelizable and hp-adaptive makes them attractive for the simulation of large-scale tsunami propagation. In order to retriev ...

2017

Isogeometric Analysis for High Order Geometric Partial Differential Equations with Applications

Andrea Bartezzaghi

In this thesis, we consider the numerical approximation of high order geometric Partial Differential Equations (PDEs). We first consider high order PDEs defined on surfaces in the 3D space that are represented by single-patch tensor product NURBS. Then, we ...

EPFL2017

Estimation of PKC delta autophosphorylation in U87 MG glioma cells: combination of experimental, conceptual and numerical approaches

Jaroslava Joniová, Veronika Huntosova

Golgi apparatus (GA) is a center for lipid metabolism and the final target of ceramide pathway, which may result in apoptosis. In this work localization of highly hydrophobic hypericin is followed by time-resolved imaging of NBDC6 (fluorescent ceramide) in ...

Wiley-V C H Verlag Gmbh2017

Decomposition Strategies for Nonconvex Problems, a Parametric Approach

Jean-Hubert Hours

This thesis deals with the development of numerical methods for solving nonconvex optimisation problems by means of decomposition and continuation techniques. We first introduce a novel decomposition algorithm based on alternating gradient projections and ...

EPFL2016