Author

R. R. Leme

h-index 22 View on Semantic Scholar

We have 2 of 102 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Graphic Matroid Secretary without the Graph

The matroid secretary problem (MSP) is one of the cleanest, and most captivating open problems in online algorithms. The famous MSP conjecture stipulates that there exists a constant-competitive algorithm, yet to date the best known algorithms are $O(\log \log (\text{rank}))$ competitive. It is widely believed that all...

Paul Dütting, R. P. Leme, Martin Pál et al. · 5 citations

#machine learning Preprint Sep 2026

Efficient Online Inverse Optimization with $O(d)$ Regret

We give a deterministic algorithm for online inverse linear optimization with regret $O(d)$, uniform in the horizon and $O(d^{2})$ time per round. A bound of this order was obtained recently by Dewasurendra, settling a question of Gollapudi et al.\ and of Oki and Sakaue, but by an improper rule that enumerates covers a...

Yang Cai, Anupam Gupta, Vineet Gupta et al. · 2 citations · ⚡1