Demo Data from EDBT 2026 / reviewers in the wild / expert
Matteo Gamba
dblp:260/3328
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Trustworthy machine learning · 70% Efficient and distributed learning · 23% Deep learning architectures and training · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › interpretability › attribution methods
gradient-based attribution |
0.9 | 1 | 2025 | On the Complexity-Faithfulness Trade-Off of Gradient-Based Explanations · ICCV 2025 |
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | On the Complexity-Faithfulness Trade-Off of Gradient-Based Explanations · ICCV 2025 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.9 | 1 | 2025 | Curvature Tuning: Provable Training-free Model Steering From a Single Parameter · NeurIPS 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.9 | 1 | 2025 | Curvature Tuning: Provable Training-free Model Steering From a Single Parameter · NeurIPS 2025 |
Machine learning › Deep learning architectures and training
activation function |
0.3 | 1 | 2025 | Curvature Tuning: Provable Training-free Model Steering From a Single Parameter · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
spline operator analysis · 0.9PAC-Bayesian generalization bound · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | On the Complexity-Faithfulness Trade-Off of Gradient-Based Explanations
Amir Mehrpanah, Matteo Gamba, Kevin Smith 0001, Hossein Azizpour |
ICCV | 2 |
| 2025 | Curvature Tuning: Provable Training-free Model Steering From a Single ParameterabstractThe scaling of model and data sizes has reshaped the AI landscape, establishing finetuning pretrained models as the standard paradigm for solving downstream tasks. However, dominant finetuning methods typically rely on weight adaptation, often lack interpretability, and depend on heuristically chosen hyperparameters. In this paper, we take a different perspective and shift the focus from weights to activation functions, viewing them through the lens of spline operators. We propose Curvature Tuning (CT), an interpretable and principled steering method that modulates a model's decision boundary by injecting a single hyperparameter into its activation functions. We show that CT provably adjusts model decision boundary curvature and, more fundamentally, projects a model onto a space of smooth functions---thereby complementing current finetuning methods, whose effect lies primarily in feature adaptation. Making this hyperparameter trainable gives rise to a novel and highly parameter-efficient finetuning method. Empirically, CT improves both generalization and robustness. For example, it boosts downstream accuracy of ResNet-50/152 by 8.59\%/8.34\% over linear probing and 4.64\%/1.70\% over LoRA across 12 datasets, and improves robust accuracy on the $\ell_{\infty}$ benchmark from RobustBench by 1032.64\%/1494.46\%. Our code is available at https://github.com/Leon-Leyang/curvature-tuning. Leyang Hu, Matteo Gamba, Randall Balestriero |
NeurIPS | 2 |
| 2023 | On the Lipschitz Constant of Deep Networks and Double Descent
Matteo Gamba, Hossein Azizpour, Mårten Björkman |
BMVC | 1 |
| 2022 | Are All Linear Regions Created Equal?abstractThe number of linear regions has been studied as a proxy of complexity for ReLU networks. However, the empirical success of network compression techniques like pruning and knowledge distillation, suggest that in the overparameterized setting, linear regions density might fail to capture the effective nonlinearity. In this work, we propose an efficient algorithm for discovering linear regions and use it to investigate the effectiveness of density in capturing the nonlinearity of trained VGGs and ResNets on CIFAR-10 and CIFAR-100. We contrast the results with a more principled nonlinearity measure based on function variation, highlighting the shortcomings of linear regions density. Furthermore, interestingly, our measure of nonlinearity clearly correlates with model-wise deep double descent, connecting reduced test error with reduced nonlinearity, and increased local similarity of linear regions. Matteo Gamba, Adrian Chmielewski-Anders, Josephine Sullivan, Hossein Azizpour, Mårten Björkman |
AISTATS | 1 |