activity
20232026
most citedSparsistency for Inverse Optimal Transport

1 citations · 1 across the 5 of their papers we have counts for

collaborators

6 papers

math.ST2026

Sample complexity of unbalanced entropic OT

Francisco Andrade, Gabriel Peyré, Clarice Poon

Optimal transport (OT) has become a central language for comparing probability measures, but exact balanced OT is often both too rigid for data with missing, created, or destroyed…

math.OC2026

Adaptive Dimension Reduction for Overlapping Group Sparsity

Yifan Bai, Clarice Poon, Jingwei Liang

Typical dimension reduction techniques for nonoverlapping sparse optimization involve screening or sieving strategies based on a dual certificate derived from the first-order optim…

math.NA2025

On the non-convexity issue in the radial Calderón problem

Giovanni S. Alberti, Romain Petit, Clarice Poon +1

A classical approach to the Calderón problem is to estimate the unknown conductivity by solving a nonlinear least-squares problem. It leads to a nonconvex optimization problem whic…

cs.LG2025

Learning from samples: inverse problems over measures

Francisco Andrade, Gabriel Peyré, Clarice Poon

We study inverse problems where an unknown potential is observed only through samples from the measure it induces by a convex variational principle. Such problems arise in learning…

math.OC2023

Super-resolved Lasso

Clarice Poon, Gabriel Peyré

Super-resolution of pointwise sources is of utmost importance in various areas of imaging sciences. Specific instances of this problem arise in single molecule fluorescence, spike…

math.ST2023★ 1 cited

Sparsistency for Inverse Optimal Transport

Francisco Andrade, Gabriel Peyre, Clarice Poon

Optimal Transport is a useful metric to compare probability distributions and to compute a pairing given a ground cost. Its entropic regularization variant (eOT) is crucial to have…