The following pages link to Carlo Baldassi (Q1040711):
Displaying 14 items.
- Generalization learning in a perceptron with binary synapses (Q1040712) (← links)
- A Max-Sum algorithm for training discrete neural networks (Q3302364) (← links)
- Local entropy as a measure for sampling solutions in constraint satisfaction problems (Q3302534) (← links)
- A method to reduce the rejection rate in Monte Carlo Markov chains (Q3302990) (← links)
- Statistical Physics and Network Optimization Problems (Q3463610) (← links)
- Efficiency of quantum vs. classical annealing in nonconvex learning problems (Q4967423) (← links)
- Entropic gradient descent algorithms and wide flat minima* (Q5020063) (← links)
- Deep networks on toroids: removing symmetries reveals the structure of flat regions in the landscape geometry* (Q5055419) (← links)
- Entropy-SGD: biasing gradient descent into wide valleys (Q5854121) (← links)
- Clustering of solutions in the symmetric binary perceptron (Q5854146) (← links)
- Shaping the learning landscape in neural networks around wide flat minima (Q5854796) (← links)
- Wide flat minima and optimal generalization in classifying high-dimensional Gaussian mixtures (Q5857460) (← links)
- Unveiling the structure of wide flat minima in neural networks (Q6371845) (← links)
- Learning through atypical "phase transitions" in overparameterized neural networks (Q6379177) (← links)
