Riccardo Zecchina

According to our database1, Riccardo Zecchina authored at least 65 papers between 1992 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Shaping the learning landscape in neural networks around wide flat minima.
Proc. Natl. Acad. Sci. USA, 2020

Wide flat minima and optimal generalization in classifying high-dimensional Gaussian mixtures.
CoRR, 2020

Entropic gradient descent algorithms and wide flat minima.
CoRR, 2020

Natural representation of composite data with replicated autoencoders.
CoRR, 2019

On the geometry of solutions and on the capacity of multi-layer neural networks with ReLU activations.
CoRR, 2019

Efficiency of quantum vs. classical annealing in nonconvex learning problems.
Proc. Natl. Acad. Sci. USA, 2018

On the role of synaptic stochasticity in training low-precision neural networks.
CoRR, 2017

Parle: parallelizing stochastic gradient descent.
CoRR, 2017

Efficiency of quantum versus classical annealing in non-convex learning problems.
CoRR, 2017

Entropy-SGD: Biasing Gradient Descent Into Wide Valleys.
Proceedings of the 5th International Conference on Learning Representations, 2017

Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes.
Proc. Natl. Acad. Sci. USA, 2016

Unreasonable Effectiveness of Learning Neural Nets: Accessible States and Robust Ensembles.
CoRR, 2016

A Three-Threshold Learning Rule Approaches the Maximal Capacity of Recurrent Neural Networks.
PLoS Comput. Biol., 2015

Sharing Information to Reconstruct Patient-Specific Pathways in Heterogeneous Diseases.
Proceedings of the Biocomputing 2014: Proceedings of the Pacific Symposium, 2014

Perturbation Biology: Inferring Signaling Networks in Cellular Systems.
PLoS Comput. Biol., 2013

Shape Similarity, Better than Semantic Membership, Accounts for the Structure of Visual Object Representations in a Population of Monkey Inferotemporal Neurons.
PLoS Comput. Biol., 2013

Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem.
J. Comput. Biol., 2013

On the performance of a cavity method based algorithm for the Prize-Collecting Steiner Tree Problem on graphs.
CoRR, 2013

Containing epidemic outbreaks by message-passing techniques.
CoRR, 2013

Bayesian inference of epidemics on networks via Belief Propagation.
CoRR, 2013

Stochastic optimization of service provision with selfish users.
Proceedings of the IEEE International Conference on Communications, 2013

The Spread Optimization Problem
CoRR, 2012

Message passing for quantified Boolean formulas
CoRR, 2012

Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions.
SIAM J. Discret. Math., 2011

3D Protein Structure Predicted from Sequence
CoRR, 2011

Efficient data compression from statistical physics of codes over finite fields
CoRR, 2011

Stochastic optimization by message passing
CoRR, 2011

Statistical physics approach to graphical games: local and global interactions
CoRR, 2011

Finding undetected protein associations in cell signaling by belief propagation
CoRR, 2011

Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach.
BMC Bioinform., 2010

Clustering with shallow trees
CoRR, 2009

Aligning graphs and finding substructures by message passing
CoRR, 2009

Statistical mechanics of budget-constrained auctions
CoRR, 2009

A rigorous analysis of the cavity equations for the minimum spanning tree
CoRR, 2009

Efficient LDPC codes over GF(q) for lossy data compression.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A Prize-Collecting Steiner Tree Approach for Transduction Network Inference.
Proceedings of the Computational Methods in Systems Biology, 7th International Conference, 2009

Pairs of SAT-assignments in random Boolean formulæ.
Theor. Comput. Sci., 2008

Viable flux distribution in metabolic networks.
Networks Heterog. Media, 2008

Entropy landscape and non-Gibbs solutions in constraint satisfaction problems
CoRR, 2008

Efficient supervised learning in networks with binary synapses.
Proc. Natl. Acad. Sci. USA, 2007

Encoding for the Blackwell Channel with Reinforced Belief Propagation.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Threshold values of random <i>K</i>-SAT from the cavity method.
Random Struct. Algorithms, 2006

Constraint Satisfaction by Survey Propagation.
Proceedings of the Computational Complexity and Statistical Physics., 2006

Survey propagation: An algorithm for satisfiability.
Random Struct. Algorithms, 2005

Learning by message-passing in networks of discrete synapses
CoRR, 2005

Pairs of SAT Assignment in Random Boolean Formulae
CoRR, 2005

Clustering of solutions in the random satisfiability problem
CoRR, 2005

Construction and VHDL Implementation of a Fully Local Network with Good Reconstruction Properties of the Inputs.
Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

Threshold values of Random K-SAT from the cavity method
CoRR, 2003

Survey Propagation as local equilibrium equations
CoRR, 2003

Are financial markets efficient? Phase transition in the aggregation of information.
Complex., 2003

Survey and Belief Propagation on Random K-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Constraint Satisfaction by Survey Propagation
CoRR, 2002

Coloring random graphs
CoRR, 2002

Alternative solutions to diluted p-spin models and XORSAT problems
CoRR, 2002

Statistical mechanics methods and phase transitions in optimization problems.
Theor. Comput. Sci., 2001

Theor. Comput. Sci., 2001

Boosting search by rare events
CoRR, 2001

Hiding solutions in random satisfiability problems: A statistical mechanics approach
CoRR, 2001

Exact solutions for diluted spin glasses and optimization problems
CoRR, 2001

Simplest random K-satisfiability problem
CoRR, 2000

2+p-SAT: Relation of typical-case complexity to the nature of the phase transition.
Random Struct. Algorithms, 1999

Neural Network with Local Short Memory and Complex Updating.
Int. J. Neural Syst., 1992

Memory Retrieval in Optimal Subspaces.
Int. J. Neural Syst., 1992

Attractor Neural Networks with Local Inhibition: From Statistical Physics to a Digitial Programmable Integrated Circuit.
Proceedings of the Advances in Neural Information Processing Systems 5, [NIPS Conference, Denver, Colorado, USA, November 30, 1992