Matteo Bergamaschi

According to our database, Matteo Bergamaschi authored at least 5 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Probabilistic iterative hard thresholding for sparse learning.

Matteo Bergamaschi, Andrea Cristofari, Vyacheslav Kungurtsev, Francesco Rinaldi

Comput. Optim. Appl., January, 2026

2025

Increasing biases can be more efficient than increasing weights.

Carlo Metta, Marco Fantozzi, Andrea Papini, Gianluca Amato, Matteo Bergamaschi, Andrea Fois, Silvia Giulia Galfrè, Alessandro Marchetti, Michelangelo Vegliò, Maurizio Parton, Francesco Morandin

Adv. Data Anal. Classif., June, 2025

An efficient network-aware direct search method for influence maximization.

Matteo Bergamaschi, Sara Venturini, Francesco Tudisco, Francesco Rinaldi

J. Complex Networks, 2025

2024

Increasing biases can be more efficient than increasing weights.

Carlo Metta, Marco Fantozzi, Andrea Papini, Gianluca Amato, Matteo Bergamaschi, Silvia Giulia Galfrè, Alessandro Marchetti, Michelangelo Vegliò, Maurizio Parton, Francesco Morandin

Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2024

2023

Improving Performance in Neural Networks by Dendrites-Activated Connections.

Carlo Metta, Marco Fantozzi, Andrea Papini, Gianluca Amato, Matteo Bergamaschi, Silvia Giulia Galfrè, Alessandro Marchetti, Michelangelo Vegliò, Maurizio Parton, Francesco Morandin

CoRR, 2023