2 code implementations • KDD 2017 • Alessandro Epasto, Silvio Lattanzi, Renato Paes Leme
More precisely, our framework works in two steps: a local ego-net analysis phase, and a global graph partitioning phase .
Ranked #3 on Community Detection on Amazon
no code implementations • 9 Apr 2018 • Renato Paes Leme, Jon Schneider
We present an algorithm for the contextual search problem for the symmetric loss function $\ell(\theta, p) = |\theta - p|$ that achieves $O_{d}(1)$ total loss.
no code implementations • 25 Mar 2018 • Thodoris Lykouris, Vahab Mirrokni, Renato Paes Leme
We introduce a new model of stochastic bandits with adversarial corruptions which aims to capture settings where most of the input follows a stochastic pattern but some fraction of it can be adversarially changed to trick the algorithm, e. g., click fraud, fake reviews and email spam.
no code implementations • 2 Nov 2016 • Ilan Lobel, Renato Paes Leme, Adrian Vladu
We consider a multidimensional search problem that is motivated by questions in contextual decision-making, such as dynamic pricing and personalized medicine.
no code implementations • ICML 2017 • Vahab Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong
We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices.
no code implementations • 4 Jun 2019 • Weiran Shen, Sébastien Lahaie, Renato Paes Leme
The problem of market clearing is to set a price for an item such that quantity demanded equals quantity supplied.
no code implementations • 3 Mar 2020 • Allen Liu, Renato Paes Leme, Jon Schneider
We provide a generic algorithm with $O(d^2)$ regret where $d$ is the covering dimension of this class.
no code implementations • ICML 2020 • Thodoris Lykouris, Vahab Mirrokni, Renato Paes Leme
We study "adversarial scaling", a multi-armed bandit model where rewards have a stochastic and an adversarial component.
no code implementations • 19 May 2021 • Dirk Bergemann, Paul Duetting, Renato Paes Leme, Song Zuo
While the auctioneer takes as given the auction rule of the click-through auction, namely the generalized second-price auction, the auctioneer can design the information flow regarding the click-through rates among the bidders.
no code implementations • NeurIPS 2021 • Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias, Pasin Manurangsi, Renato Paes Leme, Jon Schneider
We design algorithms for this problem which achieve regret $O(d\log T)$ and $\exp(O(d \log d))$.
no code implementations • 8 Jun 2021 • Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah
In the Learning to Price setting, a seller posts prices over time with the goal of maximizing revenue while learning the buyer's valuation.
no code implementations • 15 Jun 2022 • Renato Paes Leme, Chara Podimata, Jon Schneider
We study the problem of contextual search in the adversarial noise model.
no code implementations • 30 Jun 2023 • Robert Kleinberg, Renato Paes Leme, Jon Schneider, Yifeng Teng
We show that sublinear U-calibration error is a necessary and sufficient condition for all agents to achieve sublinear regret guarantees.
no code implementations • 21 Jul 2023 • Khashayar Khosravi, Renato Paes Leme, Chara Podimata, Apostolis Tsorvantzis
We present online learning algorithms for any possible value of the evolution rate $\lambda$ and we show the robustness of our results to various model misspecifications.