3 citations · 10 across the 24 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2024
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…
math.OC2024
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…
math.OC2022★ 1 cited
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization
Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos +2
We propose an adaptive variance-reduction method, called AdaSpider, for minimization of -smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines…