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

Jacob Clarysse

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

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

Artificial intelligence and machine learning · 2 · 1 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
2 papers
Trustworthy machine learning · 48% Efficient and distributed learning · 32% Learning theory · 16%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
active learning
0.712023
Margin-based sampling in high dimensions: When being active is less efficient than staying passive · ICML 2023
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.712023
Why adversarial training can hurt robust accuracy · ICLR 2023
Machine learning › Efficient and distributed learning › active learning › query selection
margin-based active learning
0.712023
Margin-based sampling in high dimensions: When being active is less efficient than staying passive · ICML 2023
Machine learning › Learning theory › computational learning theory
passive learning
0.712023
Margin-based sampling in high dimensions: When being active is less efficient than staying passive · ICML 2023
Machine learning › Trustworthy machine learning › robustness
robust accuracy
0.712023
Why adversarial training can hurt robust accuracy · ICLR 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
Why adversarial training can hurt robust accuracy · ICLR 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression › generalized linear model
logistic regression
0.212023
Margin-based sampling in high dimensions: When being active is less efficient than staying passive · ICML 2023

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

margin-based sampling · 0.7logistic regression · 0.7adversarial training · 0.7
YearPublicationVenuePosition
2023 Why adversarial training can hurt robust accuracy
Jacob Clarysse, Julia Hörrmann, Fanny Yang
ICLR1
2023 Margin-based sampling in high dimensions: When being active is less efficient than staying passive
abstract
It is widely believed that given the same labeling budget, active learning (AL) algorithms like margin-based active learning achieve better predictive performance than passive learning (PL), albeit at a higher computational cost. Recent empirical evidence suggests that this added cost might be in vain, as margin-based AL can sometimes perform even worse than PL. While existing works offer different explanations in the low-dimensional regime, this paper shows that the underlying mechanism is entirely different in high dimensions: we prove for logistic regression that PL outperforms margin-based AL even for noiseless data and when using the Bayes optimal decision boundary for sampling. Insights from our proof indicate that this high-dimensional phenomenon is exacerbated when the separation between the classes is small. We corroborate this intuition with experiments on 20 high-dimensional datasets spanning a diverse range of applications, from finance and histology to chemistry and computer vision.
Alexandru Tifrea, Jacob Clarysse, Fanny Yang
ICML2