Federico Ricci-Tersenghi
Orcid: 0000-0003-4970-7376
According to our database1,
Federico Ricci-Tersenghi
authored at least 46 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2024
Phase transitions in the mini-batch size for sparse and dense two-layer neural networks.
Mach. Learn. Sci. Technol., March, 2024
2023
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set.
Nat. Mac. Intell., January, 2023
Stochastic Gradient Descent-like relaxation is equivalent to Glauber dynamics in discrete optimization and inference problems.
CoRR, 2023
CoRR, 2023
2022
The closest vector problem and the zero-temperature p-spin landscape for lossy compression.
CoRR, 2022
Cracking nuts with a sledgehammer: when modern graph neural networks do worse than classical greedy algorithms.
CoRR, 2022
A theory explaining the limits and performances of algorithms based on simulated annealing in solving sparse hard inference problems.
CoRR, 2022
2021
IEEE Trans. Pattern Anal. Mach. Intell., 2021
Nonequilibrium Monte Carlo for unfreezing variables in hard combinatorial optimization.
CoRR, 2021
How we are leading a 3-XORSAT challenge: from the energy landscape to the algorithm and its efficient implementation on GPUs.
CoRR, 2021
2020
Spin Glasses in a Field Show a Phase Transition Varying the Distance among Real Replicas (And How to Exploit It to Find the Critical Line in a Field).
Entropy, 2020
2019
How to iron out rough landscapes and get optimal performances: Replicated Gradient Descent and its application to tensor PCA.
CoRR, 2019
Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs.
CoRR, 2019
2018
CoRR, 2018
2017
J. Mach. Learn. Res., 2017
An improved Belief Propagation algorithm finds many Bethe states in the random field Ising model on random graphs.
CoRR, 2017
2016
CoRR, 2016
2015
CoRR, 2015
2014
Comput. Phys. Commun., 2014
CoRR, 2014
2013
The solution to the challenge in "Time-Reversible Random Number Generators" by Wm. G. Hoover and Carol G. Hoover
CoRR, 2013
Proceedings of the 12th IFAC Conference on Programmable Devices and Embedded Systems, 2013
Proceedings of the IEEE International Conference on Communications, 2013
2012
Reconfigurable computing for Monte Carlo simulations: results and prospects of the Janus project
CoRR, 2012
Proceedings of the Future HPC Systems - the Challenges of Power-Constrained Performance, 2012
Spin Glass Simulations on the Janus Architecture: A Desperate Quest for Strong Scaling.
Proceedings of the Euro-Par 2012: Parallel Processing Workshops, 2012
Proceedings of the 50th Annual Allerton Conference on Communication, 2012
2011
Random Struct. Algorithms, 2011
Characterizing and Improving Generalized Belief Propagation Algorithms on the 2D Edwards-Anderson Model
CoRR, 2011
2009
On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms
CoRR, 2009
2008
CoRR, 2008
2007
Proc. Natl. Acad. Sci. USA, 2007
Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation
CoRR, 2007
2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2003
CoRR, 2003
2002
2001
CoRR, 2001
2000