Publications associées à Let’s be honest: An optimal no-regret framework for zero-sum games

Publications associées (30)

Pseudo-Three-Dimensional Analytical Model of Linear Induction Motors for High-Speed Applications

Mario Paolone, André Hodder, Simone Rametti, Lucien André Félicien Pierrejean

Literature on linear induction motors (LIMs) has proposed several approaches to model the behavior of such devices for different applications. In terms of accuracy and fidelity, field analysis-based models are the most relevant. Closed-form or numerical so ...

2024

The time-domain Cartesian multipole expansion of electromagnetic fields

Emanuela Radici, Farhad Rachidi-Haeri, Marcos Rubinstein, Nicolas Mora Parra, Elias Per Joachim Le Boudec

Time-domain solutions of Maxwell’s equations in homogeneous and isotropic media are paramount to studying transient or broadband phenomena. However, analytical solutions are generally unavailable for practical applications, while numerical solutions are co ...

Nature Publishing Group2024

FENNECS: a novel particle-in-cell code for simulating the formation of magnetized non-neutral plasmas trapped by electrodes of complex geometries

Guillaume Michel Le Bars, Stefano Alberti, Jean-Philippe Hogge, Joaquim Loizu Cisquella, Jérémy Genoud, Francesco Romano

This paper presents the new 2D electrostatic particle -in -cell code FENNECS developed to study the formation of magnetized non -neutral plasmas in geometries with azimuthal symmetry. This code has been developed in the domain of gyrotron electron gun desi ...

2024

Error assessment of an adaptive finite elements-neural networks method for an elliptic parametric PDE

Maude Girardin, Marco Picasso, Alexandre Caboussat

We present a finite elements-neural network approach for the numerical approximation of parametric partial differential equations. The algorithm generates training data from finite element simulations, and uses a data -driven (supervised) feedforward neura ...

Elsevier Science Sa2024

Learning the intrinsic dynamics of spatio-temporal processes through Latent Dynamics Networks

Alfio Quarteroni, Francesco Regazzoni, Stefano Pagani

Predicting the evolution of systems with spatio-temporal dynamics in response to external stimuli is essential for scientific progress. Traditional equations-based approaches leverage first principles through the numerical approximation of differential equ ...

Nature Portfolio2024

Learning Time-Scales in Two-Layers Neural Networks

Raphaël Jean Berthier

Gradient-based learning in multi-layer neural networks displays a number of striking features. In particular, the decrease rate of empirical risk is non-monotone even after averaging over large batches. Long plateaus in which one observes barely any progre ...

2024

Reliable data-driven decision-making through optimal transport

Bahar Taskesen

Decision-making permeates every aspect of human and societal development, from individuals' daily choices to the complex decisions made by communities and institutions. Central to effective decision-making is the discipline of optimization, which seeks th ...

EPFL2024

Aerodynamic modeling of a delta-wing UAV for model-based navigation

Jan Skaloud, Pasquale Longobardi

This study aims to identify an optimal, as well as practical, parametric structure for a delta-wing UAV aerodynamic model for the purpose of model-based navigation. We present a comprehensive procedure for characterizing the aerodynamics of this platform, ...

2024

Orbital-Resolved DFT plus U for Molecules and Solids

Nicola Marzari, Iurii Timrov

We present an orbital-resolved extension of the Hubbard U correction to density-functional theory (DFT). Compared to the conventional shell-averaged approach, the prediction of energetic, electronic and structural properties is strongly improved, particula ...

Amer Chemical Soc2024

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Daniel Kressner, Alice Cortinovis

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

An Iterative Adaptive Dynamic Programming Approach for Macroscopic Fundamental Diagram-Based Perimeter Control and Route Guidance

Nikolaos Geroliminis

Macroscopic fundamental diagrams (MFDs) have been widely adopted to model the traffic flow of large-scale urban networks. Coupling perimeter control and regional route guidance (PCRG) is a promising strategy to decrease congestion heterogeneity and reduce ...

Informs2024

On the Generalization of Stochastic Gradient Descent with Momentum

Volkan Cevher, Kimon Antonakopoulos

While momentum-based accelerated variants of stochastic gradient descent (SGD) are widely used when training machine learning models, there is little theoretical understanding on the generalization error of such methods. In this work, we first show that th ...

Microtome Publishing2024

Geometry-Driven Stock-Constrained Truss Design via Equilibrium-Based Structural Models

Corentin Jean Dominique Fivet

This paper presents a geometry-driven approach to form-finding with reused stock elements. Our proposed workflow uses a K-mean algorithm to cluster stock elements and incorporate their geometrical values early in the form-finding process. A feedback loop i ...

Springer2024

Quantum Error Correction and Simulation in Open Bosonic Systems

David Schlegel

Quantum computers have the potential to surpass conventional computing, but they are hindered by noise which induces errors that ultimately lead to the loss of quantum information. This necessitates the development of quantum error correction strategies fo ...

EPFL2024

Stochastic Simulations and Machine Learning Modeling to Predict Bedload Transport and Bed Topography

Mehrdad Kiani Oshtorjani

In computational hydraulics models, predicting bed topography and bedload transport with sufficient accuracy remains a significant challenge. An accurate assessment of a river's sediment transport rate necessitates a prior understanding of its bed topograp ...

EPFL2024

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

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Adaptive isogeometric methods with C-1 (truncated) hierarchical splines on planar multi-patch domains

Rafael Vazquez Hernandez

Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well s ...

WORLD SCIENTIFIC PUBL CO PTE LTD2023

Learning ground states of gapped quantum Hamiltonians with Kernel Methods

Giuseppe Carleo, Filippo Vicentini, Riccardo Rossi, Clemens Giuliani

Neural network approaches to approximate the ground state of quantum hamiltonians require the numerical solution of a highly nonlinear optimization problem. We introduce a statistical learning approach that makes the optimization trivial by using kernel me ...

Verein Forderung Open Access Publizierens Quantenwissenschaf2023

Low-Rank Tensor Methods for High-Dimensional Problems

Christoph Max Strössner

In this thesis, we propose and analyze novel numerical algorithms for solving three different high-dimensional problems involving tensors. The commonality of these problems is that the tensors can potentially be well approximated in low-rank formats. Ident ...

EPFL2023