3 papers
cs.CC2026
The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
Andreas Kontogiannis, Ioannis Panageas, Vasilis Pollatos
While first-order stationary points (FOSPs) are the traditional targets of non-convex optimization, they often correspond to undesirable strict saddle points. To circumvent this, a…
cs.LG2026
Efficient Swap Regret Minimization in Combinatorial Bandits
Andreas Kontogiannis, Vasilis Pollatos, Panayotis Mertikopoulos +1
This paper addresses the problem of designing efficient no-swap regret algorithms for combinatorial bandits, where the number of actions is exponentially large in the dimension…
cs.GT2025
Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
Andreas Kontogiannis, Vasilis Pollatos, Gabriele Farina +2
We examine the problem of efficiently learning coarse correlated equilibria (CCE) in polyhedral games, that is, normal-form games with an exponentially large number of actions per…