Publication

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Related publications (103)

The splay-list: a distribution-adaptive concurrent skip-list

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

SPRINGER2023

Minimum Cost Intervention Design for Causal Effect Identification

Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

PMLR2022

Experimental data-driven model predictive control of a hospital HVAC system during regular use

Colin Neil Jones, Christophe Salzmann, Emilio Maddalena

Herein we report a multi-zone, heating, ventilation and air-conditioning (HVAC) control case study of an industrial plant responsible for cooling a hospital surgery center. The adopted approach to guaranteeing thermal comfort and reducing electrical energy ...

ELSEVIER SCIENCE SA2022

Mathematical Foundations of Adaptive Isogeometric Analysis

Annalisa Buffa, Rafael Vazquez Hernandez

This paper reviews the state of the art and discusses recent developments in the field of adaptive isogeometric analysis, with special focus on the mathematical theory. This includes an overview of available spline technologies for the local resolution of ...

SPRINGER2022

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Gergely Odor

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

2021

Modeling snow saltation: the effect of grain size and interparticle cohesion

Varun Sharma, Michael Lehning, Daniela Brito Melo, Francesco Comola, Armin Sigmund

This dataset includes the parallel application and the main results supporting the research article "Modeling snow saltation: the effect of grain size and interparticle cohesion" published at the Journal of Geophysical Research: Atmospheres.The code is a f ...

2021

Switchover phenomenon induced by epidemic seeding on geometric networks

Gergely Odor

It is a fundamental question in disease modeling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. One important goal has been to find the seed configuration, which infects the most individuals. Although the id ...

2021

Roundtable Panel Discussion at DAC 2019: Evolutionary Computing or Heuristic Forever?

Giovanni De Micheli, Massimiliano Di Ventra

As demands for computing have been continuously increasing, various solutions have been proposed. Some approaches deal with improving algorithms and software programs, mainly through the tuning of advanced heuristics and learning methods. Some other tackle ...

2020

Scalable and Efficient Comparison-based Search without Features

Matthias Grossglauser, Lucas Maystre, Daniyar Chumbalov

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generate ...

2020

A Catalyst Framework for Minimax Optimization

Negar Kiyavash

We introduce a generic \emph{two-loop} scheme for smooth minimax optimization with strongly-convex-concave objectives. Our approach applies the accelerated proximal point framework (or Catalyst) to the associated \emph{dual problem} and takes full advantag ...

2020

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.