Concept

Réduction (complexité)

Publications associées (172)

Adversarial training with informed data selection

Pascal Frossard, Javier Alejandro Maroto Morales, Marcele Oliveira Kuhfuss de Mendonça

With the increasing amount of available data and advances in computing capabilities, deep neural networks (DNNs) have been successfully employed to solve challenging tasks in various areas, including healthcare, climate, and finance. Nevertheless, state-of ...

IEEE2022

Rank-adaptive structure-preserving model order reduction of Hamiltonian systems

Jan Sickmann Hesthaven, Nicolò Ripamonti, Cecilia Pagliantini

This work proposes an adaptive structure-preserving model order reduction method for finite-dimensional parametrized Hamiltonian systems modeling non-dissipative phenomena. To overcome the slowly decaying Kolmogorov width typical of transport problems, the ...

EDP SCIENCES S A2022

Social Roots of Academc (Un)Freedom

Alexander Dmitriev

The current war between Russia and Ukraine has raised the question of the possibility of resistance from the academic community. The reduction of academic freedoms in Russia and Belarus in the 21st century is also related to the general social and politica ...

2022

A comparison of hydrological models with different level of complexity in Alpine regions in the context of climate change

Michael Lehning, Adrien Michel, Mathias Thierry Pierre Bavay, Francesca Carletti

This study compares the ability of two degree-day models (Poli-Hydro and a degree-day implementation of Alpine3D) and one full energy-balance melt model (Alpine3D) to predict the discharge on two partly glacierized Alpine catchments of different size and i ...

2021

AKSEL: Fast Byzantine SGD

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Sébastien Louis Alexandre Rouault

Modern machine learning architectures distinguish servers and workers. Typically, a d-dimensional model is hosted by a server and trained by n workers, using a distributed stochastic gradient descent (SGD) optimization scheme. At each SGD step, the goal is ...

Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021

Perceptual Quality of Point Clouds with application to Compression

Evangelos Alexiou

Modern information technologies and human-centric communication systems employ advanced content representations for richer portrayals of the real world. The newly adopted imaging modalities offer additional information cues and permit the depiction of real ...

EPFL2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Adam Teodor Polak

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Wasserstein Adversarial Regularization for learning with label noise

Devis Tuia, Sylvain Lobry, Nicolas Courty

Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose ...

2021

Bioluminescent compositions and uses thereof

Elena Goun, Pavlo Khodakivskyi, Hacer Karatas, Aleksey Yevtodiyenko

Compositions and methods for non-invasively monitoring the intracellular processing of a biomolecule are provided. The compositions have a novel thio-luciferin moiety which can be conjugated to the biomolecule directly or via a linker such as disulfide bon ...

2021

Experimental investigation of sequential narrow impingement channels for turbine cooling

Peter Ott, Michele Gaffuri

Sequentially stacked impingement channels allow for a more effective use of the cooling fluid and can limit the heat transfer reduction due to the crossflow when the number of jets increases. In this paper, sequential impingement channels are experimentall ...

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