303 citations
- Politecnico di TorinoIT17 papers
- Sapienza University of RomeIT12 papers
- University of TurinIT10 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Collegio Carlo AlbertoIT9 papers
- Decision Sciences (United States)US7 papers
- École Polytechnique Fédérale de LausanneCH7 papers
- The Abdus Salam International Centre for Theoretical Physics (ICTP)IT7 papers
- The University of Texas at AustinUS7 papers
- University of MilanIT7 papers
- Institute for Complex SystemsIT6 papers
- Istituto Nazionale di Fisica NucleareIT6 papers
19 papers · 1 filter
Matrix factorization with neural networks
Francesco Camilli, Marc Mézard
Matrix factorization is an important mathematical problem encountered in the context of dictionary learning, recommendation systems and machine learning. We introduce a new `decima…
Theory of Kinetically-Constrained-Models Dynamics
Gianmarco Perrupato, Tommaso Rizzo
The mean-field theory of Kinetically-Constrained-Models is developed by considering the Fredrickson-Andersen model on the Bethe lattice. Using certain properties of the dynamics ob…
Stabilization of Capacitated Matching Games
Matthew Gerstbrein, Laura Sanità, Lucy Verberk
An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching.…
Easily Accessible Text-to-Image Generation Amplifies Demographic Stereotypes at Large Scale
Federico Bianchi, Pratyusha Kalluri, Esin Durmus +7
Machine learning models that convert user-written text descriptions into images are now widely available online and used by millions of users to generate millions of images a day.…
Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses
Chris Jones, Kunal Marwaha, Juspreet Singh Sandhu +1
We study random constraint satisfaction problems (CSPs) in the unsatisfiable regime. We relate the structure of near-optimal solutions for any Max-CSP to that for an associated spi…
Downward Self-Reducibility in TFNP
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
A problem is \emph{downward self-reducible} if it can be solved efficiently given an oracle that returns solutions for strictly smaller instances. In the decisional landscape, down…