8 citations · 40 across the 17 of their papers we have counts for
4 papers · 1 filter
Statistical and computational thresholds for the planted -densest sub-hypergraph problem
Luca Corinzia, Paolo Penna, Wojciech Szpankowski +1
In this work, we consider the problem of recovery a planted -densest sub-hypergraph on -uniform hypergraphs. This fundamental problem appears in different contexts, e.g., com…
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games
Ioannis Anagnostides, Paolo Penna
In this work, we establish a frequency-domain framework for analyzing gradient-based algorithms in linear minimax optimization problems; specifically, our approach is based on the…
Solving Zero-Sum Games through Alternating Projections
Ioannis Anagnostides, Paolo Penna
In this work, we establish near-linear and strong convergence for a natural first-order iterative algorithm that simulates Von Neumann's Alternating Projections method in zero-sum…
Two-way Greedy: Algorithms for Imperfect Rationality
Diodato Ferraioli, Paolo Penna, Carmine Ventre
The realization that selfish interests need to be accounted for in the design of algorithms has produced many contributions in computer science under the umbrella of algorithmic me…