output
20042025
most citedLeveraging Side Observations in Stochastic Bandits

67 citations

Showing 2020Show all

7 papers · 1 filter

math.PR2020★ 1 cited

Markovian linearization of random walks on groups

Charles Bordenave, Bastien Dubail

In operator algebra, the linearization trick is a technique that reduces the study of a non-commutative polynomial evaluated at elements of an algebra A to the study of a polynomia…

cs.DC2020★ 2 cited

Asynchrony and Acceleration in Gossip Algorithms

Mathieu Even, Hadrien Hendrikx, Laurent Massoulié

This paper considers the minimization of a sum of smooth and strongly convex functions dispatched over the nodes of a communication network. Previous works on the subject either fo…

stat.ML2020★ 10 cited

Sharp threshold for alignment of graph databases with Gaussian weights

Luca Ganassali

We study the fundamental limits for reconstruction in weighted graph (or matrix) database alignment. We consider a model of two graphs where is a planted uniform permutation…

cs.GT2020

Flexibility can hurt dynamic matching system performance

Arnaud Cadas, Josu Doncel, Jean-Michel Fourneau +1

We study the performance of general dynamic matching models. This model is defined by a connected graph, where nodes represent the class of items and the edges the compatibilities…

cs.GT2020★ 2 cited

Risk-Averse Equilibrium Analysis and Computation

Ilia Shilov, Hélène Le Cadre, Ana Busic

We consider two market designs for a network of prosumers, trading energy: (i) a centralized design which acts as a benchmark, and (ii) a peer-to-peer market design. High renewable…

math.PR2020★ 12 cited

Explicit Mean-Square Error Bounds for Monte-Carlo and Linear Stochastic Approximation

Shuhang Chen, Adithya M. Devraj, Ana Bušić +1

This paper concerns error bounds for recursive equations subject to Markovian disturbances. Motivating examples abound within the fields of Markov chain Monte Carlo (MCMC) and Rein…