Compressive sensing adaptation for polynomial chaos expansions

About
Privacy
Disclaimer

Graph Chatbot

Related publications (51)

Page 3 of 3

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Thomas Jean Debarre

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 ...

EPFL2022

Energy-Aware Decentralized Learning with Intermittent Model Training

Anne-Marie Kermarrec, Rafael Pereira Pires, Rishi Sharma, Marinus Abraham de Vos, Akash Balasaheb Dhasade

SKIPTRAIN is a novel Decentralized Learning (DL) algorithm, which minimizes energy consumption in decentralized learning by strategically skipping some training rounds and substituting them with synchronization rounds. These trainingsilent periods, besides ...

IEEE2024

Hybrid Flock - Formation Control Algorithms

Alcherio Martinoli, Cyrill Silvan Baumann

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

Springer Nature Switzerland2022

Mapping orthorhombic domains with geometrical phase analysis in rare-earth nickelate heterostructures

Duncan Thomas Lindsay Alexander, Bernat Mundet

Most perovskite oxides belong to the Pbnm space group, composed of an anisotropic unit cell, A-site antipolar displacements, and oxygen octahedral tilts. Mapping the orientation of the orthorhombic unit cell in epitaxial heterostructures that consist of at ...

Aip Publishing2024

Limiting the impact of supply chain disruptions in the face of distributional uncertainty in demand

Ralf Seifert, Anna Timonina-Farkas, René Yves Glogg

Service-level requirements play a crucial role in eliminating stock-outs in a production pipeline. However, delivering a specific service level can become an unattainable goal given the various uncertainties influencing both the production pipeline and cus ...

WILEY2022

Search for the lepton flavour violating decays B0→e±μ∓ and B0s→e±μ∓ with LHCb Run 2 data

Sebastian Schulte

A large variety of new physics models suggest that the rates for lepton flavour violating

b

-hadron decays may be much higher than predicted in the Standard Model, which leads to a high interest in the search for such decays. This thesis presents the se ...

EPFL2024

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

How Deep Neural Networks Learn Compositional Data: The Random Hierarchy Model

Matthieu Wyart, Leonardo Petrini, Alessandro Favero, Francesco Cagnetta, Umberto Maria Tomasini

Deep learning algorithms demonstrate a surprising ability to learn high-dimensional tasks from limited examples. This is commonly attributed to the depth of neural networks, enabling them to build a hierarchy of abstract, low-dimensional data representatio ...

American Physical Society2024

Constructing periodic orbits of high-dimensional chaotic systems by an adjoint-based variational method

Tobias Schneider, Omid Ashtari, Sajjad Azimi

Chaotic dynamics in systems ranging from low-dimensional nonlinear differential equations to high-dimensional spatiotemporal systems including fluid turbulence is supported by nonchaotic, exactly recurring time-periodic solutions of the governing equations ...

2022

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Yingying Ren

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Association for Computing Machinery2024

Real-Time Nonlinear Model Predictive Control for Fast Mechatronic Systems

Petr Listov

This thesis presents an efficient and extensible numerical software framework for real-time model-based control. We are motivated by complex and challenging mechatronic applications spanning from flight control of fixed-wing aircraft and thrust vector cont ...

EPFL2022