activity
20142026
most citedLinear Programming for Large-Scale Markov Decision Problems

32 citations · 66 across the 11 of their papers we have counts for

collaborators

11 papers

stat.ML2026

Best of both worlds: Stochastic & adversarial best-arm identification

Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon +2

We study bandit best-arm identification with arbitrary and potentially adversarial rewards. A simple random uniform learner obtains the optimal rate of error in the adversarial sce…

cs.LG2023

Additive Causal Bandits with Unknown Graph

Alan Malek, Virginia Aglietti, Silvia Chiappa

We explore algorithms to select actions in the causal bandit setting where the learner can choose to intervene on a set of random variables related by a causal graph, and the learn…

stat.ML2023★ 1 cited

Constrained Causal Bayesian Optimization

Virginia Aglietti, Alan Malek, Ira Ktena +1

We propose constrained causal Bayesian optimization (cCBO), an approach for finding interventions in a known causal graph that optimize a target variable under some constraints. cC…

cs.LG2023

Pragmatic Fairness: Developing Policies with Outcome Disparity Control

Limor Gultchin, Siyuan Guo, Alan Malek +2

We introduce a causal framework for designing optimal policies that satisfy fairness constraints. We take a pragmatic approach asking what we can do with an action space available…

cs.LG2021

Prequential MDL for Causal Structure Learning with Neural Networks

Jorg Bornschein, Silvia Chiappa, Alan Malek +1

Learning the structure of Bayesian networks and causal relationships from observations is a common goal in several areas of science and technology. We show that the prequential min…

stat.ME2020★ 6 cited

Anytime-Valid Inference for Multinomial Count Data

Michael Lindon, Alan Malek

Many experiments are concerned with the comparison of counts between treatment groups. Examples include the number of successful signups in conversion rate experiments, or the numb…

math.OC2019★ 7 cited

Large-Scale Markov Decision Problems via the Linear Programming Dual

Yasin Abbasi-Yadkori, Peter L. Bartlett, Xi Chen +1

We consider the problem of controlling a fully specified Markov decision process (MDP), also known as the planning problem, when the state space is very large and calculating the o…

math.ST2018★ 7 cited

Best Arm Identification for Contaminated Bandits

Jason Altschuler, Victor-Emmanuel Brunel, Alan Malek

This paper studies active learning in the context of robust statistics. Specifically, we propose a variant of the Best Arm Identification problem for \emph{contaminated bandits}, w…

stat.CO2016★ 4 cited

Hit-and-Run for Sampling and Planning in Non-Convex Spaces

Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon +1

We propose the Hit-and-Run algorithm for planning and sampling problems in non-convex spaces. For sampling, we show the first analysis of the Hit-and-Run algorithm in non-convex sp…

cs.LG2016★ 9 cited

Online Isotonic Regression

Wojciech Kotłowski, Wouter M. Koolen, Alan Malek

We consider the online version of the isotonic regression problem. Given a set of linearly ordered points (e.g., on the real line), the learner must predict labels sequentially at…

math.OC2014★ 32 cited

Linear Programming for Large-Scale Markov Decision Problems

Yasin Abbasi-Yadkori, Peter L. Bartlett, Alan Malek

We consider the problem of controlling a Markov decision process (MDP) with a large state space, so as to minimize average cost. Since it is intractable to compete with the optimal…