default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlo Baldassi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i21]Carlo Baldassi, Enrico M. Malatesta, Gabriele Perugini, Riccardo Zecchina:
Typical and atypical solutions in non-convex neural networks with discrete and continuous weights. CoRR abs/2304.13871 (2023)- 2022
- [j9]Carlo Baldassi
:
Recombinator-k-Means: An Evolutionary Algorithm That Exploits k-Means++ for Recombination. IEEE Trans. Evol. Comput. 26(5): 991-1003 (2022) - [j8]Carlo Baldassi:
Systematically and efficiently improving $k$-means initialization by pairwise-nearest-neighbor smoothing. Trans. Mach. Learn. Res. 2022 (2022) - [c4]Fabrizio Pittorino, Antonio Ferraro, Gabriele Perugini, Christoph Feinauer, Carlo Baldassi, Riccardo Zecchina:
Deep Networks on Toroids: Removing Symmetries Reveals the Structure of Flat Regions in the Landscape Geometry. ICML 2022: 17759-17781 - [i20]Fabrizio Pittorino, Antonio Ferraro, Gabriele Perugini, Christoph Feinauer, Carlo Baldassi, Riccardo Zecchina:
Deep Networks on Toroids: Removing Symmetries Reveals the Structure of Flat Regions in the Landscape Geometry. CoRR abs/2202.03038 (2022) - [i19]Carlo Baldassi:
Systematically improving existing k-means initialization algorithms at nearly no cost, by pairwise-nearest-neighbor smoothing. CoRR abs/2202.03949 (2022) - 2021
- [c3]Fabrizio Pittorino, Carlo Lucibello, Christoph Feinauer, Gabriele Perugini, Carlo Baldassi, Elizaveta Demyanenko, Riccardo Zecchina:
Entropic gradient descent algorithms and wide flat minima. ICLR 2021 - [i18]Carlo Baldassi, Clarissa Lauditi, Enrico M. Malatesta, Gabriele Perugini, Riccardo Zecchina:
Unveiling the structure of wide flat minima in neural networks. CoRR abs/2107.01163 (2021) - [i17]Carlo Baldassi, Clarissa Lauditi, Enrico M. Malatesta, Rosalba Pacelli, Gabriele Perugini, Riccardo Zecchina:
Learning through atypical "phase transitions" in overparameterized neural networks. CoRR abs/2110.00683 (2021) - [i16]Pietro Torta, Glen B. Mbeng, Carlo Baldassi, Riccardo Zecchina, Giuseppe E. Santoro:
Quantum Approximate Optimization Algorithm applied to the binary perceptron. CoRR abs/2112.10219 (2021) - 2020
- [j7]Carlo Baldassi, Simone Cerreia-Vioglio, Fabio Maccheroni, Massimo Marinacci, Marco Pirazzini:
A Behavioral Characterization of the Drift Diffusion Model and Its Multialternative Extension for Choice Under Time Pressure. Manag. Sci. 66(11): 5075-5093 (2020) - [j6]Carlo Baldassi, Fabrizio Pittorino, Riccardo Zecchina:
Shaping the learning landscape in neural networks around wide flat minima. Proc. Natl. Acad. Sci. USA 117(1): 161-170 (2020) - [p2]Thomas Gueudré, Carlo Baldassi, Andrea Pagnani, Martin Weigt:
Predicting Interacting Protein Pairs by Coevolutionary Paralog Matching. Protein-Protein Interaction Networks 2020: 57-65 - [i15]Carlo Baldassi, Simone Cerreia-Vioglio, Fabio Maccheroni, Massimo Marinacci, Marco Pirazzini:
Multialternative Neural Decision Process. CoRR abs/2005.01081 (2020) - [i14]Fabrizio Pittorino, Carlo Lucibello, Christoph Feinauer, Enrico M. Malatesta, Gabriele Perugini, Carlo Baldassi, Matteo Negri, Elizaveta Demyanenko, Riccardo Zecchina:
Entropic gradient descent algorithms and wide flat minima. CoRR abs/2006.07897 (2020) - [i13]Carlo Baldassi, Fabio Maccheroni, Massimo Marinacci, Marco Pirazzini:
Ergodic Annealing. CoRR abs/2008.00234 (2020) - [i12]Carlo Baldassi, Enrico M. Malatesta, Matteo Negri, Riccardo Zecchina:
Wide flat minima and optimal generalization in classifying high-dimensional Gaussian mixtures. CoRR abs/2010.14761 (2020)
2010 – 2019
- 2019
- [i11]Carlo Baldassi:
Recombinator-k-means: Enhancing k-means++ by seeding from pools of previous runs. CoRR abs/1905.00531 (2019) - [i10]Carlo Baldassi, Fabrizio Pittorino, Riccardo Zecchina:
Shaping the learning landscape in neural networks around wide flat minima. CoRR abs/1905.07833 (2019) - [i9]Carlo Baldassi, Enrico M. Malatesta, Riccardo Zecchina:
On the geometry of solutions and on the capacity of multi-layer neural networks with ReLU activations. CoRR abs/1907.07578 (2019) - [i8]Matteo Negri, Davide Bergamini, Carlo Baldassi, Riccardo Zecchina, Christoph Feinauer:
Natural representation of composite data with replicated autoencoders. CoRR abs/1909.13327 (2019) - 2018
- [j5]Carlo Baldassi, Riccardo Zecchina:
Efficiency of quantum vs. classical annealing in nonconvex learning problems. Proc. Natl. Acad. Sci. USA 115(7): 1457-1462 (2018) - 2017
- [c2]Pratik Chaudhari, Anna Choromanska, Stefano Soatto, Yann LeCun, Carlo Baldassi, Christian Borgs, Jennifer T. Chayes, Levent Sagun, Riccardo Zecchina:
Entropy-SGD: Biasing Gradient Descent Into Wide Valleys. ICLR (Poster) 2017 - [i7]Carlo Baldassi, Riccardo Zecchina:
Efficiency of quantum versus classical annealing in non-convex learning problems. CoRR abs/1706.08470 (2017) - [i6]Pratik Chaudhari, Carlo Baldassi, Riccardo Zecchina, Stefano Soatto, Ameet Talwalkar:
Parle: parallelizing stochastic gradient descent. CoRR abs/1707.00424 (2017) - [i5]Carlo Baldassi, Federica Gerace, Hilbert J. Kappen, Carlo Lucibello, Luca Saglietti, Enzo Tartaglione, Riccardo Zecchina:
On the role of synaptic stochasticity in training low-precision neural networks. CoRR abs/1710.09825 (2017) - 2016
- [j4]Carlo Baldassi, Christian Borgs, Jennifer T. Chayes, Alessandro Ingrosso, Carlo Lucibello, Luca Saglietti, Riccardo Zecchina:
Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes. Proc. Natl. Acad. Sci. USA 113(48): E7655-E7662 (2016) - [i4]Carlo Baldassi, Christian Borgs, Jennifer T. Chayes, Alessandro Ingrosso, Carlo Lucibello, Luca Saglietti, Riccardo Zecchina:
Unreasonable Effectiveness of Learning Neural Nets: Accessible States and Robust Ensembles. CoRR abs/1605.06444 (2016) - [i3]Pratik Chaudhari, Anna Choromanska, Stefano Soatto, Yann LeCun, Carlo Baldassi, Christian Borgs, Jennifer T. Chayes, Levent Sagun, Riccardo Zecchina:
Entropy-SGD: Biasing Gradient Descent Into Wide Valleys. CoRR abs/1611.01838 (2016) - 2015
- [j3]Alireza Alemi, Carlo Baldassi, Nicolas Brunel, Riccardo Zecchina:
A Three-Threshold Learning Rule Approaches the Maximal Capacity of Recurrent Neural Networks. PLoS Comput. Biol. 11(8) (2015) - [p1]Jacopo Secco, Alessandro Vinassa, Valentina Pontrandolfo, Carlo Baldassi, Fernando Corinto:
Binary Synapse Circuitry for High Efficiency Learning Algorithm Using Generalized Boundary Condition Memristor Models. Advances in Neural Networks 2015: 369-374 - [i2]Carlo Baldassi, Alfredo Braunstein:
A Max-Sum algorithm for training discrete neural networks. CoRR abs/1505.05401 (2015) - 2014
- [c1]Anthony Gitter, Alfredo Braunstein, Andrea Pagnani, Carlo Baldassi, Christian Borgs, Jennifer T. Chayes, Riccardo Zecchina, Ernest Fraenkel:
Sharing Information to Reconstruct Patient-Specific Pathways in Heterogeneous Diseases. Pacific Symposium on Biocomputing 2014: 39-50 - 2013
- [j2]Carlo Baldassi, Alireza Alemi-Neissi, Marino Pagan, James J. DiCarlo, Riccardo Zecchina, Davide Zoccolan:
Shape Similarity, Better than Semantic Membership, Accounts for the Structure of Visual Object Representations in a Population of Monkey Inferotemporal Neurons. PLoS Comput. Biol. 9(8) (2013)
2000 – 2009
- 2007
- [j1]Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, Riccardo Zecchina:
Efficient supervised learning in networks with binary synapses. Proc. Natl. Acad. Sci. USA 104(26): 11079-11084 (2007) - [i1]Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, Riccardo Zecchina:
Efficient supervised learning in networks with binary synapses. CoRR abs/0707.1295 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
