3 citations · 6 across the 4 of their papers we have counts for
5 papers
Additional Results and Extensions for the paper "Probabilistic bounds on the Traveling Salesman Problem and the Traveling Repairman Problem''
Moïse Blanchard, Alexandre Jacquillat, Patrick Jaillet
This technical report provides additional results for the main paper ``Probabilistic bounds on the Traveling Salesman Problem (TSP) and the Traveling Repairman Problem (TRP…
Probabilistic bounds on the Traveling Salesman Problem and the Traveling Repairman Problem
Moïse Blanchard, Alexandre Jacquillat, Patrick Jaillet
The traveling salesman problem (-TSP) seeks a tour of minimal length that visits a subset of points. The traveling repairman problem (TRP) seeks a complete tour wi…
Universal Online Learning with Unbounded Losses: Memory Is All You Need
Moise Blanchard, Romain Cosson, Steve Hanneke
We resolve an open problem of Hanneke on the subject of universally consistent online learning with non-i.i.d. processes and unbounded losses. The notion of an optimistically unive…
The Representation Power of Neural Networks: Breaking the Curse of Dimensionality
Moise Blanchard, M. Amine Bennouna
In this paper, we analyze the number of neurons and training parameters that a neural networks needs to approximate multivariate functions of bounded second mixed derivatives -- Ko…
On the Length of Monotone Paths in Polyhedra
Moïse Blanchard, Jesùs A. De Loera, Quentin Louveaux
Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside t…