Concept

Séparation et évaluation

Publications associées (146)

Remote Source Coding Under Gaussian Noise: Dueling Roles of Power and Entropy Power

The distributed remote source coding (the so-called CEO) problem is studied in the case where the underlying source, not necessarily Gaussian, has finite differential entropy and the observation noise is Gaussian. The main result is a new lower bound for t ...

2019

The electric autonomous dial-a-ride problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provides shared-ride services to users specifying their origin, destination, and preferred arrival time. Typically, the problem consists of finding minimum cost routes, satisfying operational constraint ...

Elsevier2019

Safe Convex Learning under Uncertain Constraints

Maryam Kamgarpour, Andreas Krause, Ilnura Usmanova

We address the problem of minimizing a convex smooth function f(x) over a compact polyhedral set D given a stochastic zeroth-order constraint feedback model. This problem arises in safety-critical machine learning applications, such as personalized medicin ...

PMLR2019

Nested Convex Bodies are Chaseable

Marek Elias

In the Convex Body Chasing problem, we are given an initial point v0. Rd and an online sequence of n convex bodies F1,..., Fn. When we receive Ft, we are required to move inside Ft. Our goal is to minimize the total distance traveled. This fundamental onli ...

SPRINGER2019

Learning to Reduce Annotation Load

Ksenia Konyushkova

Modern machine learning methods and their applications in computer vision are known to crave for large amounts of training data to reach their full potential. Because training data is mostly obtained through humans who manually label samples, it induces a ...

EPFL2019

Deep Spline Networks With Control Of Lipschitz Regularity

Michaël Unser, Shayan Aziznejad

The motivation for this work is to improve the performance of deep neural networks through the optimization of the individual activation functions. Since the latter results in an infinite-dimensional optimization problem, we resolve the ambiguity by search ...

IEEE2019

Interactive Optimization With Parallel Coordinates: Exploring Multidimensional Spaces for Decision Support

François Maréchal, Nils Christian Schüler, Sébastien Cajot

Interactive optimization methods are particularly suited for letting human decision makers learn about a problem, while a computer learns about their preferences to generate relevant solutions. For interactive optimization methods to be adopted in practice ...

2019

Geometry in active learning for binary and multi-class image segmentation

Pascal Fua, Raphael Sznitman, Ksenia Konyushkova

We propose an active learning approach to image segmentation that exploits geometric priors to speed up and streamline the annotation process. It can be applied for both background foreground and multi-class segmentation tasks in 2D images and 3D image vol ...

2019

Overlapping Multi-Bandit Best Arm Identification

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

In the multi-armed bandit literature, the multi-bandit best-arm identification problem consists of determining each best arm in a number of disjoint groups of arms, with as few total arm pulls as possible. In this paper, we introduce a variant of the multi ...

IEEE2019

Co-localization of microstructural damage and excessive mechanical strain at aortic branches in Angiotensin-II-infused mice

Nikolaos Stergiopoulos, Lydia Aslanidou, Bram Trachet, Goran Lovric, Mauro Ferraro, Patrick Segers

Animal models of aortic aneurysm and dissection can enhance our limited understanding of the etiology of these lethal conditions particularly because early-stage longitudinal data are scant in humans. Yet, the pathogenesis of often-studied mouse models and ...

2019

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