Publications associées à Union (mathématiques)

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. By means of a suitably defined duality, new correspondence functors are constructed, having remarkable p ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Early decoding of walking tasks with minimal set of EMG channels

Silvestro Micera, Francesco Iberite, Federica Barberi, Eugenio Anselmino

Objective. Powered lower-limb prostheses relying on decoding motor intentions from non-invasive sensors, like electromyographic (EMG) signals, can significantly improve the quality of life of amputee subjects. However, the optimal combination of high decod ...

IOP Publishing Ltd2023

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

Alireza Karimi, Philippe Louis Schuchert

A new approach is presented to obtain a convex set of robust D—stabilizing fixed structure controllers, relying on Cauchy's argument principle. A convex set of D—stabilizing controllers around an initial D—stabilizing controller for a multi-model set is re ...

Elsevier2022

On Approximations of Data-Driven Chance Constrained Programs over Wasserstein Balls

Daniel Kuhn, Zhi Chen, Wolfram Wiesemann

Distributionally robust chance constrained programs minimize a deterministic cost function subject to the satisfaction of one or more safety conditions with high probability, given that the probability distribution of the uncertain problem parameters affec ...

2022

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

Pascal Frossard, Arun Venkitaraman

We propose an approach for estimating graph diffusion processes using annihilation filters from a finite set of observations of the diffusion process made at regular intervals. Our approach is based on the key observation that a graph diffusion process can ...

IEEE2022

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

2021

Positive moments for scattering amplitudes

Riccardo Rattazzi, Francesco Riva, Brando Bellazzini, Marc Riembau Saperas

We find the complete set of conditions satisfied by the forward 2 -> 2 scattering amplitude in unitary and causal theories. These are based on an infinite set of energy dependent quantities (the arcs) which are dispersively expressed as moments of a positi ...

AMER PHYSICAL SOC2021

Deterministic error bounds for kernel-based learning techniques under bounded noise

Colin Neil Jones, Paul Scharnhorst, Emilio Maddalena

We consider the problem of reconstructing a function from a finite set of noise-corrupted samples. Two kernel algorithms are analyzed, namely kernel ridge regression and epsilon-support vector regression. By assuming the ground-truth function belongs to th ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Mathematical Foundations of Robust and Distributionally Robust Optimization

Daniel Kuhn, Jianzhe Zhen, Wolfram Wiesemann

Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertainty set or are governed by any probability distribution from within an ambigu ...

2021

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.

Union (mathématiques)

Correspondence functors and duality

Early decoding of walking tasks with minimal set of EMG channels

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

On Approximations of Data-Driven Chance Constrained Programs over Wasserstein Balls

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Positive moments for scattering amplitudes

Deterministic error bounds for kernel-based learning techniques under bounded noise

Mathematical Foundations of Robust and Distributionally Robust Optimization

Local invertibility and sensitivity of atomic structure-feature mappings

Graph Chatbot

Chattez avec Graph Search

Early decoding of walking tasks with minimal set of EMG channels

Correspondence functors and duality

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

On Approximations of Data-Driven Chance Constrained Programs over Wasserstein Balls

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Positive moments for scattering amplitudes

Mathematical Foundations of Robust and Distributionally Robust Optimization

Deterministic error bounds for kernel-based learning techniques under bounded noise

Local invertibility and sensitivity of atomic structure-feature mappings