Demo Data from VLDB 2026 / reviewers in the wild / expert
Skander Karkar
dblp:274/7334
· DBLP profile ↗
3ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 1 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
1 paper |
Optimization for machine learning · 33% Efficient and distributed learning · 33% Deep learning architectures and training · 33% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
gradient flow |
0.7 | 1 | 2023 | Module-wise Training of Neural Networks via the Minimizing Movement Scheme · NeurIPS 2023 |
Machine learning › Deep learning architectures and training › neural network training
layer-wise training |
0.7 | 1 | 2023 | Module-wise Training of Neural Networks via the Minimizing Movement Scheme · NeurIPS 2023 |
Machine learning › Efficient and distributed learning
memory-efficient training |
0.7 | 1 | 2023 | Module-wise Training of Neural Networks via the Minimizing Movement Scheme · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
transport regularization · 0.7minimizing movement scheme · 0.7greedy learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Module-wise Training of Neural Networks via the Minimizing Movement SchemeabstractGreedy layer-wise or module-wise training of neural networks is compelling in constrained and on-device settings where memory is limited, as it circumvents a number of problems of end-to-end back-propagation. However, it suffers from a stagnation problem, whereby early layers overfit and deeper layers stop increasing the test accuracy after a certain depth. We propose to solve this issue by introducing a simple module-wise regularization inspired by the minimizing movement scheme for gradient flows in distribution space. We call the method TRGL for Transport Regularized Greedy Learning and study it theoretically, proving that it leads to greedy modules that are regular and that progressively solve the task. Experimentally, we show improved accuracy of module-wise training of various architectures such as ResNets, Transformers and VGG, when our regularization is added, superior to that of other module-wise training methods and often to end-to-end training, with as much as 60% less memory usage. Skander Karkar, Ibrahim Ayed, Emmanuel de Bézenac, Patrick Gallinari |
NeurIPS | 1 |
| 2023 | Adversarial Sample Detection Through Neural Network Transport Dynamics
Skander Karkar, Patrick Gallinari, Alain Rakotomamonjy |
ECML/PKDD (1) | 1 |
| 2020 | A Principle of Least Action for the Training of Neural Networks
Skander Karkar, Ibrahim Ayed, Emmanuel de Bézenac, Patrick Gallinari |
ECML/PKDD (2) | 1 |