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

Mitchell Keren Taraday

dblp:348/0094 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
2 papers
Graph learning · 56% Trustworthy machine learning · 38% Transfer learning and domain adaptation · 6%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
aggregation function
0.812024
Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks · NeurIPS 2024
Machine learning › Graph learning › graph neural network
message passing
0.812024
Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.712023
Enhanced Meta Label Correction for Coping with Label Corruption · ICCV 2023
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
noisy label correction
0.712023
Enhanced Meta Label Correction for Coping with Label Corruption · ICCV 2023
Machine learning › Graph learning › graph neural network
expressive power
0.212024
Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks · NeurIPS 2024
Machine learning › Graph learning
graph neural network
0.212024
Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation
meta-learning
0.212023
Enhanced Meta Label Correction for Coping with Label Corruption · ICCV 2023

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

discrete signal convolution · 0.8meta-learning · 0.7meta-gradient · 0.7
YearPublicationVenuePosition
2024 Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks
abstract
Message Passing Graph Neural Networks (MPGNNs) have emerged as the preferred method for modeling complex interactions across diverse graph entities. While the theory of such models is well understood, their aggregation module has not received sufficient attention. Sum-based aggregators have solid theoretical foundations regarding their separation capabilities. However, practitioners often prefer using more complex aggregations and mixtures of diverse aggregations. In this work, we unveil a possible explanation for this gap. We claim that sum-based aggregators fail to "mix" features belonging to distinct neighbors, preventing them from succeeding at downstream tasks. To this end, we introduce Sequential Signal Mixing Aggregation (SSMA), a novel plug-and-play aggregation for MPGNNs. SSMA treats the neighbor features as 2D discrete signals and sequentially convolves them, inherently enhancing the ability to mix features attributed to distinct neighbors. By performing extensive experiments, we show that when combining SSMA with well-established MPGNN architectures, we achieve substantial performance gains across various benchmarks, achieving new state-of-the-art results in many settings. We published our code at https://almogdavid.github.io/SSMA/.
Mitchell Keren Taraday, Almog David, Chaim Baskin
NeurIPS1
2023 Enhanced Meta Label Correction for Coping with Label Corruption
abstract
Traditional methods for learning with the presence of noisy labels have successfully handled datasets with artificially injected noise but still fall short of adequately handling real-world noise. With the increasing use of meta-learning in the diverse fields of machine learning, researchers leveraged auxiliary small clean datasets to meta-correct the training labels. Nonetheless, existing meta-label correction approaches are not fully exploiting their potential. In this study, we propose an Enhanced Meta Label Correction approach abbreviated as EMLC for the learning with noisy labels (LNL) problem. We re-examine the meta-learning process and introduce faster and more accurate meta-gradient derivations. We propose a novel teacher architecture tailored explicitly to the LNL problem, equipped with novel training objectives. EMLC outperforms prior approaches and achieves state-of-the-art results in all standard benchmarks. Notably, EMLC enhances the previous art on the noisy real-world dataset Clothing1M by 1.52% while requiring ×0.5 the time per epoch and with much faster convergence of the meta-objective when compared to the baseline approach.1
Mitchell Keren Taraday, Chaim Baskin
ICCV1