activity
20122021
most citedSorting with Recurrent Comparison Errors

6 citations · 10 across the 4 of their papers we have counts for

collaborators

12 papers

cs.IT2021

On maximum-likelihood estimation in the all-or-nothing regime

Luca Corinzia, Paolo Penna, Wojciech Szpankowski +1

We study the problem of estimating a rank-1 additive deformation of a Gaussian tensor according to the \emph{maximum-likelihood estimator} (MLE). The analysis is carried out in the…

cs.LG20203 cited

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…

math.OC2020

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…

math.OC2020

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…

cs.GT2020

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…

cs.IT2019

Exact Recovery for a Family of Community-Detection Generative Models

Luca Corinzia, Paolo Penna, Luca Mondada +1

Generative models for networks with communities have been studied extensively for being a fertile ground to establish information-theoretic and computational thresholds. In this pa…