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.

Anna Bodonhelyi

dblp:367/3911 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0001-8941-3893ORCID · corroborated

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

Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
Efficient and distributed learning · 100%
Human-computer interaction and pervasive computing
1 paper
Learning and educational technologies · 100%

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

TopicWeightPapersLastEvidence papers
Learning and educational technologies
active learning
0.912025
From Passive Watching to Active Learning: Empowering Proactive Participation in Digital Classrooms with AI Video Assistant · CHI 2025
Machine learning › Efficient and distributed learning › federated learning
data heterogeneity
0.812024
TurboSVM-FL: Boosting Federated Learning through SVM Aggregation for Lazy Clients · AAAI 2024
Machine learning › Efficient and distributed learning
federated learning
0.812024
TurboSVM-FL: Boosting Federated Learning through SVM Aggregation for Lazy Clients · AAAI 2024
Machine learning › Efficient and distributed learning › federated learning
model aggregation
0.812024
TurboSVM-FL: Boosting Federated Learning through SVM Aggregation for Lazy Clients · AAAI 2024

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

support vector machine · 0.8max-margin regularization · 0.8
YearPublicationVenuePosition
2026 Should AI Ask First? Investigating the Effects of Proactive vs Reactive AI Mentoring in Self-directed Learning
Khaoula Otmani, Anna Bodonhelyi, Babette Bühler, Enkelejda Kasneci
AIED (3)2
2025 From Passive Watching to Active Learning: Empowering Proactive Participation in Digital Classrooms with AI Video Assistant
Anna Bodonhelyi, Enkeleda Thaqi, Süleyman Özdel, Efe Bozkir, Enkelejda Kasneci
CHI1
2024 TurboSVM-FL: Boosting Federated Learning through SVM Aggregation for Lazy Clients
abstract
Federated learning is a distributed collaborative machine learning paradigm that has gained strong momentum in recent years. In federated learning, a central server periodically coordinates models with clients and aggregates the models trained locally by clients without necessitating access to local data. Despite its potential, the implementation of federated learning continues to encounter several challenges, predominantly the slow convergence that is largely due to data heterogeneity. The slow convergence becomes particularly problematic in cross-device federated learning scenarios where clients may be strongly limited by computing power and storage space, and hence counteracting methods that induce additional computation or memory cost on the client side such as auxiliary objective terms and larger training iterations can be impractical. In this paper, we propose a novel federated aggregation strategy, TurboSVM-FL, that poses no additional computation burden on the client side and can significantly accelerate convergence for federated classification task, especially when clients are "lazy" and train their models solely for few epochs for next global aggregation. TurboSVM-FL extensively utilizes support vector machine to conduct selective aggregation and max-margin spread-out regularization on class embeddings. We evaluate TurboSVM-FL on multiple datasets including FEMNIST, CelebA, and Shakespeare using user-independent validation with non-iid data distribution. Our results show that TurboSVM-FL can significantly outperform existing popular algorithms on convergence rate and reduce communication rounds while delivering better test metrics including accuracy, F1 score, and MCC.
Mengdi Wang 0002, Anna Bodonhelyi, Efe Bozkir, Enkelejda Kasneci
AAAI2