Publications associées à Overlapping Multi-Bandit Best Arm Identification

The Two Times Problem: Where Is the Problem?

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

Brill2024

Hands-on tasks make learning visible: a learning analytics lens on the development of mechanistic problem-solving expertise in makerspaces

Bertrand Roland Schneider, Richard Lee Davis

This study investigated the impact of participating in a year-long digital-fabrication course on high-school seniors' problem-solving skills, with a focus on problems involving mechanistic systems. The research questions centered on whether working in a ma ...

Springer2023

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Yunus Inan

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

EPFL2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...

2021

Optimal Adversarial Policies in the Multiplicative Learning System With a Malicious Expert

Seyed Jalal Etesami, Negar Kiyavash

We consider a learning system based on the conventional multiplicative weight ( MW) rule that combines experts' advice to predict a sequence of true outcomes. It is assumed that one of the experts is malicious and aims to impose the maximum loss on the sys ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Distributionally Robust Optimization with Markovian Data

Daniel Kuhn, Tobias Sutter, Mengmeng Li

We study a stochastic program where the probability distribution of the uncertain problem parameters is unknown and only indirectly observed via finitely many correlated samples generated by an unknown Markov chain with d states. We propose a data-driven d ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

Fostering computational thinking through educational robotics: a model for creative computational problem solving

Francesco Mondada, Morgane Solène Denise Chevalier, Christian Giang, Alberto Piatti

Background: Educational robotics (ER) is increasingly used in classrooms to implement activities aimed at fostering the development of students’ computational thinking (CT) skills. Though previous works have proposed different models and frameworks to desc ...

2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

The electric autonomous dial-a-ride problem

Claudia Bongiovanni

This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a ...

EPFL2020

Cooperative Data Exchange and Private Information Retrieval

Su Li

Coding techniques have been well studied and used for improving communication quality by combating noise and mitigating interference. Recently, it has been shown that the same coding techniques can also be exploited to further improve communication perform ...

EPFL2020

Model-based predictive control methods for distributed energy resources in smart grids

Luca Fabietti

This thesis develops optimization-based techniques for the control of distributed energy resources to provide multiple services to the power network. It is divided into three parts. The first part of this thesis focuses on the development of a framework f ...

EPFL2019

Low-rank tensor methods for large Markov chains and forward feature selection methods

Francisco Santos Paredes Quartin de Macedo

In the first part of this thesis, we present and compare several approaches for the determination of the steady-state of large-scale Markov chains with an underlying low-rank tensor structure. Such structure is, in our context of interest, associated with ...

EPFL2018

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

Pascal Frossard, Sergio Mena, Stefano D'Aronco

Multiparty videoconferences, or more generally multiparty video calls, are gaining a lot of popularity as they offer a rich communication experience. These applications have, however, large requirements in terms of both network and computational resources ...

2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Nematodynamics and random homogenization

Tudor Ratiu

We study the homogenization problem for the system of equations of dynamics of a mixture of liquid crystals with random structure. We consider a simplified form of the Ericksen-Leslie equations for an incompressible medium with inhomogeneous density with r ...

Taylor & Francis2016

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Pascal Frossard

In free viewpoint video, a viewer can choose at will any camera angle or the so-called "virtual view" to observe a dynamic 3-D scene, enhancing his/her depth perception. The virtual view is synthesized using texture and depth videos of two anchor camera vi ...

2015

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

Daniel Kuhn, Wolfram Wiesemann

Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that, primal and dual linear decision rule approximations can ...

Springer Verlag2015