3 citations · 5 across the 4 of their papers we have counts for
4 papers
Controlling the Complexity and Lipschitz Constant improves polynomial nets
Zhenyu Zhu, Fabian Latorre, Grigorios G Chrysos +1
While the class of Polynomial Nets demonstrates comparable performance to neural networks (NN), it currently has neither theoretical generalization characterization nor robustness…
Efficient Proximal Mapping of the 1-path-norm of Shallow Networks
Fabian Latorre, Paul Rolland, Nadav Hallak +1
We demonstrate two new important properties of the 1-path-norm of shallow neural networks. First, despite its non-smoothness and non-convexity it allows a closed form proximal oper…
An incidence Hopf Algebra of Convex Geometries
Fabian Latorre
A lattice L is "meet-distributive" if for each element of L, the meets of the elements directly below it form a Boolean lattice. These objects are in bijection with "convex geometr…
The Maxflow problem and a generalization to simplicial complexes
Fabian Latorre
The problem of Maxflow is a widely developed subject in modern mathematics. Efficient algorithms exist to solve this problem, that is why a good generalization may permit these alg…