Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

MohammadReza Davari

dblp:239/8727 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
4since 2021 · last 2024
0009-0001-7956-2617ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 5 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
4 papers
Representation and self-supervised learning · 42% Learning paradigms · 31% Efficient and distributed learning · 19%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
1.222023
Prototype-Sample Relation Distillation: Towards Replay-Free Continual Learning · ICML 2023
Probing Representation Forgetting in Supervised and Unsupervised Continual Learning · CVPR 2022
Machine learning › Learning paradigms
continual learning
1.222023
Prototype-Sample Relation Distillation: Towards Replay-Free Continual Learning · ICML 2023
Probing Representation Forgetting in Supervised and Unsupervised Continual Learning · CVPR 2022
Machine learning › Efficient and distributed learning
model merging
0.812024
Model Breadcrumbs: Scaling Multi-task Model Merging with Sparse Masks · ECCV (75) 2024
Machine learning › Efficient and distributed learning › model merging
multi-task model merging
0.812024
Model Breadcrumbs: Scaling Multi-task Model Merging with Sparse Masks · ECCV (75) 2024
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Prototype-Sample Relation Distillation: Towards Replay-Free Continual Learning · ICML 2023
Machine learning › Trustworthy machine learning
interpretability
0.712023
Reliability of CKA as a Similarity Measure in Deep Learning · ICLR 2023
Machine learning › Representation and self-supervised learning › representation analysis
representational similarity analysis
0.712023
Reliability of CKA as a Similarity Measure in Deep Learning · ICLR 2023
Machine learning › Representation and self-supervised learning › representation analysis
representation similarity
0.712023
Reliability of CKA as a Similarity Measure in Deep Learning · ICLR 2023
Machine learning › Representation and self-supervised learning › contrastive learning › contrastive loss
supervised contrastive loss
0.712023
Prototype-Sample Relation Distillation: Towards Replay-Free Continual Learning · ICML 2023
Machine learning › Representation and self-supervised learning › contrastive learning
supervised contrastive learning
0.212022
Probing Representation Forgetting in Supervised and Unsupervised Continual Learning · CVPR 2022

Methods — techniques the papers use, named apart from their topics

sparse masks · 0.8prototype learning · 0.7knowledge distillation · 0.7contrastive learning · 0.7centered kernel alignment · 0.7supervised contrastive learning · 0.6prototype construction · 0.6linear classifier probing · 0.6
YearPublicationVenuePosition
2024 Model Breadcrumbs: Scaling Multi-task Model Merging with Sparse Masks
MohammadReza Davari, Eugene Belilovsky
ECCV (75)1
2023 Reliability of CKA as a Similarity Measure in Deep Learning
MohammadReza Davari, Stefan Horoi, Amine Natik, Guillaume Lajoie, Guy Wolf, Eugene Belilovsky
ICLR1
2023 Prototype-Sample Relation Distillation: Towards Replay-Free Continual Learning
abstract
In Continual learning (CL) balancing effective adaptation while combating catastrophic forgetting is a central challenge. Many of the recent best-performing methods utilize various forms of prior task data, e.g. a replay buffer, to tackle the catastrophic forgetting problem. Having access to previous task data can be restrictive in many real-world scenarios, for example when task data is sensitive or proprietary. To overcome the necessity of using previous tasks’ data, in this work, we start with strong representation learning methods that have been shown to be less prone to forgetting. We propose a holistic approach to jointly learn the representation and class prototypes while maintaining the relevance of old class prototypes and their embedded similarities. Specifically, samples are mapped to an embedding space where the representations are learned using a supervised contrastive loss. Class prototypes are evolved continually in the same latent space, enabling learning and prediction at any point. To continually adapt the prototypes without keeping any prior task data, we propose a novel distillation loss that constrains class prototypes to maintain relative similarities as compared to new task data. This method yields state-of-the-art performance in the task-incremental setting, outperforming methods relying on large amounts of data, and provides strong performance in the class-incremental setting without using any stored data points.
Nader Asadi, MohammadReza Davari, Sudhir P. Mudur, Rahaf Aljundi, Eugene Belilovsky
ICML2
2022 Probing Representation Forgetting in Supervised and Unsupervised Continual Learning
abstract
Continual Learning (CL) research typically focuses on tackling the phenomenon of catastrophic forgetting in neural networks. Catastrophic forgetting is associated with an abrupt loss of knowledge previously learned by a model when the task, or more broadly the data distribution, being trained on changes. In supervised learning problems this forgetting, resulting from a change in the model's representation, is typically measured or observed by evaluating the decrease in old task performance. However, a model's representation can change without losing knowledge about prior tasks. In this work we consider the concept of representation forgetting, observed by using the difference in performance of an optimal linear classifier before and after a new task is introduced. Using this tool we revisit a number of standard continual learning benchmarks and observe that, through this lens, model representations trained without any explicit control for forgetting often experience small representation forgetting and can sometimes be comparable to methods which explicitly control for forgetting, especially in longer task sequences. We also show that representation forgetting can lead to new insights on the effect of model capacity and loss function used in continual learning. Based on our results, we show that a simple yet competitive approach is to learn representations continually with standard supervised contrastive learning while constructing prototypes of class samples when queried on old samples.11The code to reproduce our results is publicly available at: https://github.com/rezazzr/Probing-Representation-Forgetting
MohammadReza Davari, Nader Asadi, Sudhir P. Mudur, Rahaf Aljundi, Eugene Belilovsky
CVPR1
2020 TIMBERT: Toponym Identifier For The Medical Domain Based on BERT
abstract
In this paper, we propose an approach to automate the process of place name detection in the medical domain to enable epidemiologists to better study and model the spread of viruses.We created a family of Toponym Identification Models based on BERT (TIMBERT), in order to learn in an end-to-end fashion the mapping from an input sentence to the associated sentence labeled with toponyms.When evaluated with the SemEval 2019 task 12 test set (Weissenbacher et al., 2019), our best TIMBERT model achieves an F1 score of 90.85%, a significant improvement compared to the state-of-the-art of 89.
MohammadReza Davari, Leila Kosseim, Tien D. Bui
COLING1
2019 Toponym Identification in Epidemiology Articles - A Deep Learning Approach
MohammadReza Davari, Leila Kosseim, Tien D. Bui
CICLing (2)1