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

Andreas Vlachos 0003

dblp:18/1071-3 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0003-2123-5071ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 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
3 papers
Trustworthy machine learning · 66% Efficient and distributed learning · 22% Language models and text generation · 10%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness › shortcut learning
shortcut learning mitigation
2.332025
Mitigating Shortcut Learning with InterpoLated Learning · ACL (1) 2025
ALVIN: Active Learning Via INterpolation · EMNLP 2024
Improving the robustness of NLI models with minimax training · ACL (1) 2023
Machine learning › Trustworthy machine learning
robustness
1.522025
Mitigating Shortcut Learning with InterpoLated Learning · ACL (1) 2025
Improving the robustness of NLI models with minimax training · ACL (1) 2023
Machine learning › Efficient and distributed learning
active learning
0.812024
ALVIN: Active Learning Via INterpolation · EMNLP 2024
Machine learning › Efficient and distributed learning › data-efficient learning
label-efficient learning
0.812024
ALVIN: Active Learning Via INterpolation · EMNLP 2024
Machine learning › Trustworthy machine learning › robustness
spurious correlation
0.812024
ALVIN: Active Learning Via INterpolation · EMNLP 2024
Natural language and speech › Language models and text generation › natural language understanding › sentence pair modeling
natural language inference
0.712023
Improving the robustness of NLI models with minimax training · ACL (1) 2023

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

representation interpolation · 0.9interpolation-based active learning · 0.8minimax training · 0.7
YearPublicationVenuePosition
2025 Mitigating Shortcut Learning with InterpoLated Learning
abstract
Empirical risk minimization (ERM) incentivizes models to exploit shortcuts, i.e., spurious correlations between input attributes and labels that are prevalent in the majority of the training data but unrelated to the task at hand.This reliance hinders generalization on minority examples, where such correlations do not hold.Existing shortcut mitigation approaches are model-specific, difficult to tune, computationally expensive, and fail to improve learned representations.To address these issues, we propose InterpoLated Learning (Inter-poLL) which interpolates the representations of majority examples to include features from intra-class minority examples with shortcutmitigating patterns.This weakens shortcut influence, enabling models to acquire features predictive across both minority and majority examples.Experimental results on multiple natural language understanding tasks demonstrate that InterpoLL improves minority generalization over both ERM and state-of-the-art shortcut mitigation methods, without compromising accuracy on majority examples.Notably, these gains persist across encoder, encoder-decoder, and decoder-only architectures, demonstrating the method's broad applicability.
Michalis Korakakis, Andreas Vlachos 0003, Adrian Weller
ACL (1)2
2024 ALVIN: Active Learning Via INterpolation
abstract
Active Learning aims to minimize annotation effort by selecting the most useful instances from a pool of unlabeled data.However, typical active learning methods overlook the presence of distinct example groups within a class, whose prevalence may vary, e.g., in occupation classification datasets certain demographics are disproportionately represented in specific classes.This oversight causes models to rely on shortcuts for predictions, i.e., spurious correlations between input attributes and labels occurring in well-represented groups.To address this issue, we propose Active Learning Via INterpolation (ALVIN), which conducts intra-class interpolations between examples from underrepresented and well-represented groups to create anchors, i.e., artificial points situated between the example groups in the representation space.By selecting instances close to the anchors for annotation, ALVIN identifies informative examples exposing the model to regions of the representation space that counteract the influence of shortcuts.Crucially, since the model considers these examples to be of high certainty, they are likely to be ignored by typical active learning methods.Experimental results on six datasets encompassing sentiment analysis, natural language inference, and paraphrase detection demonstrate that ALVIN outperforms state-of-the-art active learning methods in both in-distribution and out-of-distribution generalization.
Michalis Korakakis, Andreas Vlachos 0003, Adrian Weller
EMNLP2
2023 Improving the robustness of NLI models with minimax training
abstract
Natural language inference (NLI) models are susceptible to learning shortcuts, i.e. decision rules that spuriously correlate with the label.As a result, they achieve high in-distribution performance, but fail to generalize to out-ofdistribution samples where such correlations do not hold.In this paper, we present a training method to reduce the reliance of NLI models on shortcuts and improve their out-of-distribution performance without assuming prior knowledge of the shortcuts being targeted.To this end, we propose a minimax objective between a learner model being trained for the NLI task, and an auxiliary model aiming to maximize the learner's loss by up-weighting examples from regions of the input space where the learner incurs high losses.This process incentivizes the learner to focus on under-represented "hard" examples with patterns that contradict the shortcuts learned from the prevailing "easy" examples.Experimental results on three NLI datasets demonstrate that our method consistently outperforms other robustness enhancing techniques on out-of-distribution adversarial test sets, while maintaining high in-distribution accuracy.
Michalis Korakakis, Andreas Vlachos 0003
ACL (1)2