Concept

Fonction d'ordre supérieur

Publications associées (85)

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

DFT plus U-type functional derived to explicitly address the flat plane condition

Edward Baxter Linscott

A DFT+U-type corrective functional is derived from first principles to enforce the flat plane condition on localized subspaces, thus dispensing with the need for an ad hoc derivation from the Hubbard model. Small, molecular test systems at the dissociated ...

AMER PHYSICAL SOC2023

On algebraic array theories

Viktor Kuncak, Rodrigo Raya

Automatic verification of programs manipulating arrays relies on specialised decision procedures. A methodology to classify the theories handled by these procedures is introduced. It is based on decomposition theorems in the style of Feferman and Vaught. T ...

New York2023

Outlier-free spline spaces for isogeometric discretizations of biharmonic and polyharmonic eigenvalue problems

Espen Sande

We present outlier-free isogeometric Galerkin discretizations of eigenvalue problems related to the biharmonic and the polyharmonic operator in the univariate setting. These are Galerkin discretizations in certain spline subspaces that provide accurate app ...

Lausanne2023

Combinatory Array Logic with Sums

Rodrigo Raya

We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combi- natory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven other fragment ...

2023

Scaling Language Features for Program Verification

Georg Stefan Schmid

Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...

EPFL2022

The Canopy Pavilion: A lightweight shading structure using a deployable auxetic linkage membrane

Mark Pauly, Dieter Dietz, Florin Isvoranu, Arthur François Blanc, Tian Chen, Etienne Bouleau

We present the Canopy Pavilion, a lightweight shading structure for a social gathering space. The shading surface is realized as a tensioned auxetic linkage membrane, composed of two double-curved anticlastic layers separated by a compression pole. The mem ...

2022

Improved Inference On Risk Measures For Univariate Extremes

Anthony Christopher Davison

We discuss the use of likelihood asymptotics for inference on risk measures in univariate extreme value problems, focusing on estimation of high quantiles and similar summaries of risk for uncertainty quantification. We study whether higher-order approxima ...

INST MATHEMATICAL STATISTICS-IMS2022

The physics of higher-order interactions in complex systems

Enrico Amico, Benedetta Franceschiello

Network representations of complex systems are limited to pairwise interactions, but real-world systems often involve higher-order interactions. This Perspective looks at the new physics emerging from attempts to characterize these interactions. Complex ne ...

NATURE PORTFOLIO2021

How the first wave of COVID-19 in Switzerland affected residential preferences

Vincent Kaufmann, Claudia Rebeca Binder Signer, Anna Pagani, Livia Bianca Fritz, Ralph Hansmann

During the first wave of COVID-19, residents’ health and well-being were challenged as residential environments suddenly had to accommodate most of the functions of an urban system. Although scholars and practitioners have proposed reconsidering dwelling r ...

2021

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.

Connectez-vous pour utiliser Chat avec Graph Search