Fetching the paper…
Reading the bibliography…
We prove, under an assumption on the critical points of a real-valued function, that the symmetric Ising perceptron exhibits the `frozen 1-RSB' structure conjectured by Krauth and Mezard in the physics literature; that is, typical solutions of the model lie in clusters of vanishing entropy density.
Sur l’approximation du determinant de fredholm par les determinants des systèmes d’équations linéaires
Alexander Markowitsch Ostrowski · 1938
Earlier work this paper cites.
Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition
Thomas M Cover · 1965
Earlier work this paper cites.
A bound on tail probabilities for quadratic forms in independent random variables
D. L. Hanson and F. T. Wright · 1971
Earlier work this paper cites.
Solution of ’Solvable model of a spin glass’
David J Thouless, Philip W Anderson, and Robert G Palmer · 1977
Earlier work this paper cites.
Maximum storage capacity in neural networks
Elizabeth Gardner · 1987
Earlier work this paper cites.
Optimal storage properties of neural network models
E Gardner and B Derrida · 1988
Earlier work this paper cites.
Storage capacity of memory networks with binary couplings
Werner Krauth and Marc Mézard · 1989
Earlier work this paper cites.
Learning from examples in large neural networks
Haim Sompolinsky, Naftali Tishby, and H Sebastian Seung · 1990
Earlier work this paper cites.
Hard and easy distributions of SAT problems
David Mitchell, Bart Selman, and Hector Levesque · 1992
Earlier work this paper cites.
Covering cubes by random half cubes, with applications to binary neural networks
Jeong Han Kim and James R Roche · 1998
Earlier work this paper cites.
Sharp thresholds of graph properties, and the k–sat problem
Ehud Friedgut · 1999
Earlier work this paper cites.
Intersecting random half cubes
Michel Talagrand · 1999
Earlier work this paper cites.
The asymptotic order of the random k-SAT threshold
Dimitris Achlioptas and Cristopher Moore · 2002
Earlier work this paper cites.
Learning by message passing in networks of discrete synapses
Alfredo Braunstein and Riccardo Zecchina · 2006
Earlier work this paper cites.
Efficient supervised learning in networks with binary synapses
Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, and Riccardo Zecchina · 2007
Earlier work this paper cites.
Gibbs states and the set of solutions of random constraint satisfaction problems
Florent Krzakała, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, and Lenka Zdeborová · 2007
Cited alongside, same era.
Phase transitions in the coloring of random graphs
Lenka Zdeborová and Florent Krzakała · 2007
Cited alongside, same era.
Algorithmic barriers from phase transitions
Dimitris Achlioptas and Amin Coja-Oghlan · 2008
Cited alongside, same era.
Constraint satisfaction problems with isolated solutions are hard
Lenka Zdeborová and Marc Mézard · 2008
Cited alongside, same era.
Generalization learning in a perceptron with binary synapses
Carlo Baldassi · 2009
Cited alongside, same era.
Hiding quiet solutions in random constraint satisfaction problems
Florent Krzakala and Lenka Zdeborová · 2009
Cited alongside, same era.
The condensation phase transition in random graph coloring
Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, and Dan Vilenchik · 2016
Later among the works it cites.
Local entropy as a measure for sampling solutions in constraint satisfaction problems
Carlo Baldassi, Alessandro Ingrosso, Carlo Lucibello, Luca Saglietti, and Riccardo Zecchina · 2016
Later among the works it cites.
The number of solutions for random regular NAE-SAT
Allan Sly, Nike Sun, and Yumeng Zhang · 2016
Later among the works it cites.
Statistical physics of inference: Thresholds and algorithms
Lenka Zdeborová and Florent Krzakala · 2016
Later among the works it cites.
Community detection and stochastic block models: recent developments
Emmanuel Abbe · 2017
Later among the works it cites.
Planting colourings silently
Victor Bapst, Amin Coja-Oghlan, and Charilaos Efthymiou · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mean field models for spin glasses: Volume I: Basic examples
Michel Talagrand · 2010
Cited alongside, same era.
On the solution-space geometry of random constraint satisfaction problems
Dimitris Achlioptas, Amin Coja-Oghlan, and Federico Ricci-Tersenghi · 2011
Cited alongside, same era.
Reconstruction and clustering in random constraint satisfaction problems
Andrea Montanari, Ricardo Restrepo, and Prasad Tetali · 2011
Cited alongside, same era.
The condensation transition in random hypergraph 2-coloring
Amin Coja-Oghlan and Lenka Zdeborová · 2012
Cited alongside, same era.
Entropy landscape of solutions in the binary perceptron problem
Haiping Huang, KY Michael Wong, and Yoshiyuki Kabashima · 2013
Cited alongside, same era.
Satisfiability threshold for random regular NAE-SAT
Jian Ding, Allan Sly, and Nike Sun · 2014
Cited alongside, same era.
Later among the works it cites.
Charting the replica symmetric phase
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, and Tobias Kapetanopoulos · 2018
Later among the works it cites.
Information-theoretic thresholds from the cavity method
Amin Coja-Oghlan, Florent Krzakala, Will Perkins, and Lenka Zdeborová · 2018
Later among the works it cites.
The freezing threshold for k-colourings of a random graph
Michael Molloy · 2018
Later among the works it cites.
Storage capacity in symmetric binary perceptrons
Benjamin Aubin, Will Perkins, and Lenka Zdeborová · 2019
Later among the works it cites.
Breaking of 1RSB in random regular MAX-NAE-SAT
Zsolt Bartha, Nike Sun, and Yumeng Zhang · 2019
Later among the works it cites.
Capacity lower bound for the Ising perceptron
Jian Ding and Nike Sun · 2019
Later among the works it cites.
Sharp threshold for the Ising perceptron model
Changji Xu · 2019
Later among the works it cites.
Clustering of solutions in the symmetric binary perceptron
Carlo Baldassi, Riccardo Della Vecchia, Carlo Lucibello, and Riccardo Zecchina · 2020
Later among the works it cites.