Catégorie
Analyse de la complexité des algorithmes
Publications associées (602)
DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast
Daniel Kressner, Stefano Massei, Alice Cortinovis
This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for performing low-rank up ...
SIAM PUBLICATIONS2022A combination technique for optimal control problems constrained by random PDEs
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 ...
EPFL2022Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update
Efstratios Panteleimon Skoulakis
In this paper we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU), for convergence to \textit{Coarse Correlated Equilibria} (CCE) in general games. CMWU effectively corresponds to the standard MWU algorithm but where ...
2022Predicting in Uncertain Environments: Methods for Robust Machine Learning
One of the main goal of Artificial Intelligence is to develop models capable of providing valuable predictions in real-world environments. In particular, Machine Learning (ML) seeks to design such models by learning from examples coming from this same envi ...
EPFL2022Environmental policies: designing acceptable road pricing and voluntary waste sorting schemes
Growing urban population implies many challenges for the municipalities in terms of mobility, housing, waste management or infrastructures. Public policies are thus needed to ensure a sustainable development. The main objective of this thesis is to analyze ...
EPFL2022Practical Compilation of Quantum Programs
It's been a little more than 40 years since researchers first suggested exploiting quantum physics to build more powerful computers. During this time, we have seen the development of many quantum algorithms and significant technological advances to make th ...
EPFL2022Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution
The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...
EPFL2022Exploration of Hyperdimensional Computing Strategies for Enhanced Learning on Epileptic Seizure Detection
David Atienza Alonso, Tomas Teijeiro Campo, Una Pale
Wearable and unobtrusive monitoring and prediction of epileptic seizures has the potential to significantly increase the life quality of patients, but is still an unreached goal due to challenges of real-time detection and wearable devices design. Hyperdim ...
2022Safety Verification for Urban Air Mobility Scheduling
In Urban Air Mobility (UAM) networks, takeoff and landing sites, called vertiports, are likely to experience intermittent closures due to, e.g., adverse weather. For safety, it will be required that all in-transit Urban Air Vehicles (UAVs) in a UAM network ...
ELSEVIER2022List Ordered Statistics Decoders for Polar Codes
Andreas Peter Burg, Yifei Shen, Chuan Zhang
The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...
IEEE2022