Publications associées (52)

Data-driven LPV Disturbance Rejection Control with IQC-based Stability Guarantees for Rate-bounded Scheduling Parameter Variations

Alireza Karimi, Elias Sebastian Klauser

In this paper, the challenge of asymptotically rejecting sinusoidal disturbances with unknown time-varying frequency and bounded rate is explored. A novel data-driven approach for designing linear parameter-varying (LPV) con- troller is introduced, leverag ...
2024

Phase diagram of the J-Jd Heisenberg model on the maple leaf lattice: Neural networks and density matrix renormalization group

Pratyay Ghosh, Ronny Thomale

We microscopically analyze the nearest-neighbor Heisenberg model on the maple leaf lattice through neural quantum state (NQS) and infinite density matrix renormalization group (iDMRG) methods. Embarking to parameter regimes beyond the exact dimer singlet g ...
Amer Physical Soc2024

Multiplicative chaos of the Brownian loop soup

Antoine Pierre François Jego, Titus Lupu

We construct a measure on the thick points of a Brownian loop soup in a bounded domain DDD of the plane with given intensity theta>0θ>0\theta >0, which is formally obtained by exponentiating the square root of its occupation field. The measure is construct ...
WILEY2023

Designing Horizontality

Paola Viganò, Tommaso Pietropolli

This paper is divided into three parts. The first introduces a trilogy of concepts and figures of the discourse. The concept of isotropy, as opposed to hierarchy, evokes the same conditions in all directions. The concept of porosity tackles the fluidity an ...
ROUTLEDGE JOURNALS, TAYLOR & FRANCIS LTD2021

Sparse Inverse Problems Over Measures: Equivalence Of The Conditional Gradient And Exchange Methods

Armin Eftekhari

We study an optimization program over nonnegative Borel measures that encourages sparsity in its solution. Efficient solvers for this program are in increasing demand, as it arises when learning from data generated by a "continuum-of-subspaces" model, a re ...
SIAM PUBLICATIONS2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.