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

Aristotelis Chrysakis

dblp:280/1679 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 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
2 papers
Learning paradigms · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
1.122023
Online Bias Correction for Task-Free Continual Learning · ICLR 2023
Online Continual Learning from Imbalanced Data · ICML 2020
Machine learning › Learning paradigms › continual learning
task-free continual learning
0.712023
Online Bias Correction for Task-Free Continual Learning · ICLR 2023
Machine learning › Learning paradigms › continual learning
online continual learning
0.412020
Online Continual Learning from Imbalanced Data · ICML 2020
Data mining › predictive modeling › classification
imbalanced classification
0.112020
Online Continual Learning from Imbalanced Data · ICML 2020

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

reservoir sampling · 0.9memory population · 0.9
YearPublicationVenuePosition
2023 Online Bias Correction for Task-Free Continual Learning
Aristotelis Chrysakis, Marie-Francine Moens
ICLR1
2020 Online Continual Learning from Imbalanced Data
abstract
A well-documented weakness of neural networks is the fact that they suffer from catastrophic forgetting when trained on data provided by a non-stationary distribution. Recent work in the field of continual learning attempts to understand and overcome this issue. Unfortunately, the majority of relevant work embraces the implicit assumption that the distribution of observed data is perfectly balanced, despite the fact that, in the real world, humans and animals learn from observations that are temporally correlated and severely imbalanced. Motivated by this remark, we aim to evaluate memory population methods that are used in online continual learning, when dealing with highly imbalanced and temporally correlated streams of data. More importantly, we introduce a new memory population approach, which we call class-balancing reservoir sampling (CBRS). We demonstrate that CBRS outperforms the state-of-the-art memory population algorithms in a considerably challenging learning setting, over a range of different datasets, and for multiple architectures.
Aristotelis Chrysakis, Marie-Francine Moens
ICML1