Publications related to Adaptive Content Search Through Comparisons

Results on Sparse Integer Programming and Geometric Independent Sets

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 p ...

EPFL2023

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

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Oliver Kröcher, Frédéric Vogel, David Baudouin, Ayush Agarwal

Ru/CNF catalysts of different Ru nanoparticle (NP) sizes (0.9-2.7 nm) were assessed for their performance in continuous supercritical water gasification (SCWG) of glycerol. A structure sensitivity of Ru was demonstrated, with high initial turnover frequenc ...

2022

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

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Mika Tapani Göös

We study the search problem class PPA_q defined as a modulo-q analog of the well-known polynomial parity argument class PPA introduced by Papadimitriou (JCSS 1994). Our first result shows that this class can be characterized in terms of PPA_p for prime p. ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020

On the Impact of Uncertainty for Path Planning

We consider the problem of planning paths on graphs with some edges whose traversability is uncertain; for each uncertain edge, we are given a probability of being traversable (e.g., by a learned classifier). We categorize different interpretations of the ...

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

Hardness Results for Consensus-Halving

Jie Zhang, Aris Filos Ratsikas

The Consensus-halving problem is the problem of dividing an object into two portions, such that each of n agents has equal valuation for the two portions. We study the epsilon-approximate version, which allows each agent to have an epsilon discrepancy on t ...

Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik2018

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Damian Mateusz Straszak

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Adaptive Content Search Through Comparisons

Graph Chatbot

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Minimum Cost Intervention Design for Causal Effect Identification

The double exponential runtime is tight for 2-stage stochastic ILPs

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

New Results in Integer and Lattice Programming

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

On the Impact of Uncertainty for Path Planning

Overlapping Multi-Bandit Best Arm Identification

Hardness Results for Consensus-Halving

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

The double exponential runtime is tight for 2-stage stochastic ILPs

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Results on Sparse Integer Programming and Geometric Independent Sets

New Results in Integer and Lattice Programming

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Overlapping Multi-Bandit Best Arm Identification

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Minimum Cost Intervention Design for Causal Effect Identification

On the Impact of Uncertainty for Path Planning

Hardness Results for Consensus-Halving