Publication

Online Contention Resolution Schemes With Applications To Bayesian Selection Problems

Publications associées (22)

Approximation Algorithms for Allocation and Network Design

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

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

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Ola Nils Anders Svensson, Moran Feldman, Rico Zenklusen, Ashkan Norouzi Fard

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multi-player model t ...

ASSOC COMPUTING MACHINERY2020

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

Ilija Bogunovic

The central task in many interactive machine learning systems can be formalized as the sequential optimization of a black-box function. Bayesian optimization (BO) is a powerful model-based framework for \emph{adaptive} experimentation, where the primary go ...

EPFL2019

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Rico Zenklusen, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

A Framework for the Secretary Problem on the Intersection of Matroids

Ola Nils Anders Svensson, Moran Feldman, Rico Zenklusen

The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one- ...

ASSOC COMPUTING MACHINERY2018

Deterministic Algorithms for Submodular Maximization Problems

Moran Feldman

Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area, most algorithms are randomized, and in almost all c ...

ASSOC COMPUTING MACHINERY2018

Robust Maximization of Non-Submodular Objectives

Volkan Cevher, Ilija Bogunovic, Junyao Zhao

We study the problem of maximizing a monotone set function subject to a cardinality constraint k in the setting where some number of elements is deleted from the returned set. The focus of this work is on the worst-case adversarial setting. While there exi ...

2018

Algorithms For Clustering Problems : Theoretical Guarantees and Empirical Evaluations

Ashkan Norouzi Fard

Clustering is a classic topic in combinatorial optimization and plays a central role in many areas, including data science and machine learning. In this thesis, we first focus on the dynamic facility location problem (i.e., the facility location problem in ...

EPFL2018

Online Contention Resolution Schemes With Applications To Bayesian Selection Problems

Approximation Algorithms for Allocation and Network Design

Streaming and Matching Problems with Submodular Functions

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

An Improved Analysis of Local Search for Max-Sum Diversification

A Framework for the Secretary Problem on the Intersection of Matroids

Deterministic Algorithms for Submodular Maximization Problems

Robust Maximization of Non-Submodular Objectives

Algorithms For Clustering Problems : Theoretical Guarantees and Empirical Evaluations

Graph Chatbot

Approximation Algorithms for Allocation and Network Design

Streaming and Matching Problems with Submodular Functions

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

An Improved Analysis of Local Search for Max-Sum Diversification

A Framework for the Secretary Problem on the Intersection of Matroids

Deterministic Algorithms for Submodular Maximization Problems

Robust Maximization of Non-Submodular Objectives

Algorithms For Clustering Problems : Theoretical Guarantees and Empirical Evaluations

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid