3 citations · 10 across the 24 of their papers we have counts for
4 papers · 1 filter
Learning to Remove Cuts in Integer Linear Programming
Pol Puigdemont, Stratis Skoulakis, Grigorios Chrysos +1
Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced…
Efficient Continual Finite-Sum Minimization
Ioannis Mavrothalassitis, Stratis Skoulakis, Leello Tadesse Dadi +1
Given a sequence of functions with , finite-sum minimization seeks a point minimizing $\sum_{j=1}^n…
Imitation Learning in Discounted Linear MDPs without exploration assumptions
Luca Viano, Stratis Skoulakis, Volkan Cevher
We present a new algorithm for imitation learning in infinite horizon linear MDPs dubbed ILARL which greatly improves the bound on the number of trajectories that the learner needs…
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
Leello Dadi, Ioannis Panageas, Stratis Skoulakis +2
We introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an -appro…