978 citations
- École Normale Supérieure - PSLFR306 papers
- Centre National de la Recherche ScientifiqueFR135 papers
- Institut national de recherche en sciences et technologies du numériqueFR94 papers
- Université Paris Sciences et LettresFR89 papers
- Université Paris CitéFR23 papers
- Sorbonne UniversitéFR19 papers
- SIERRA: Apprentissage Statistique et optimisationFR17 papers
- Université de MontréalCA15 papers
- École Polytechnique Fédérale de LausanneCH14 papers
- Czech Technical University in PragueCZ13 papers
- École PolytechniqueFR13 papers
- University of EdinburghGB13 papers
11 papers · 1 filter
A general theorem of existence of quasi absolutely minimal Lipschitz extensions
Matthew J. Hirn, Erwan Le Gruyer
In this paper we consider a wide class of generalized Lipschitz extension problems and the corresponding problem of finding absolutely minimal Lipschitz extensions. We prove that i…
Bounding the weight choosability number of a graph
Ben Seamone
Let be a graph, and for each , let be a list of real numbers. Let be an edge weighting function such that $w(e) \in…
Choice of V for V-Fold Cross-Validation in Least-Squares Density Estimation
Sylvain Arlot, Matthieu Lerasle
This paper studies V-fold cross-validation for model selection in least-squares density estimation. The goal is to provide theoretical grounds for choosing V in order to minimize t…
The Erdős-Sós Conjecture for Geometric Graphs
Luis F. Barba, Ruy Fabila-Monroy, Dolores Lara +4
Let be the minimum number of edges that must be removed from some complete geometric graph on points, so that there exists a tree on vertices that is no longer…
Phase Recovery, MaxCut and Complex Semidefinite Programming
Irène Waldspurger, Alexandre d'Aspremont, Stéphane Mallat
Phase retrieval seeks to recover a signal x from the amplitude |Ax| of linear measurements. We cast the phase retrieval problem as a non-convex quadratic program over a complex pha…
Regret in Online Combinatorial Optimization
Jean-Yves Audibert, Sébastien Bubeck, Gábor Lugosi
We address online linear optimization problems when the possible actions of the decision maker are represented by binary vectors. The regret of the decision maker is the difference…