Maria Chiara Angelini
Orcid: 0000-0002-6277-359X
According to our database1,
Maria Chiara Angelini
authored at least 9 papers
between 2012 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
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
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
Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model.
CoRR, 2021
2019
Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs.
CoRR, 2019
2018
2015
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015
2012
Proceedings of the 50th Annual Allerton Conference on Communication, 2012