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

Andjela Mladenovic

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

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

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 · 54% Optimization for machine learning · 15% Generative modeling · 15%
Theoretical computer science
3 papers
Algorithmic game theory and mechanism design · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities
misinformation
0.812024
A Persuasive Approach to Combating Misinformation · ICML 2024
Computational social science and digital humanities
social media
0.812024
A Persuasive Approach to Combating Misinformation · ICML 2024
Algorithmic game theory and mechanism design › mechanism design › information design
bayesian persuasion
0.812024
A Persuasive Approach to Combating Misinformation · ICML 2024
Machine learning › Trustworthy machine learning › robustness
adversarial attack
0.612022
Online Adversarial Attacks · ICLR 2022
Machine learning › Generative modeling
generative adversarial network
0.612022
Generalized Natural Gradient Flows in Hidden Convex-Concave Games and GANs · ICLR 2022
Machine learning › Optimization for machine learning › gradient-based optimization › gradient descent
natural gradient descent
0.612022
Generalized Natural Gradient Flows in Hidden Convex-Concave Games and GANs · ICLR 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
Online Adversarial Attacks · ICLR 2022
Machine learning › Deep learning architectures and training
training dynamics
0.612022
Generalized Natural Gradient Flows in Hidden Convex-Concave Games and GANs · ICLR 2022
Machine learning › Trustworthy machine learning
fairness
0.412020
Designing Fairly Fair Classifiers Via Economic Fairness Notions · WWW 2020
Machine learning › Trustworthy machine learning › fairness
group fairness
0.412020
Designing Fairly Fair Classifiers Via Economic Fairness Notions · WWW 2020
Algorithmic game theory and mechanism design › fair division
fair resource allocation
0.412020
Designing Fairly Fair Classifiers Via Economic Fairness Notions · WWW 2020

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

performative prediction · 1.5linear programming · 1.5natural gradient · 1.1hidden convex-concave games · 1.1generalization bounds · 0.9online learning · 0.6adversarial examples · 0.6
YearPublicationVenuePosition
2024 A Persuasive Approach to Combating Misinformation
abstract
Bayesian Persuasion is proposed as a tool for social media platforms to combat the spread of misinformation. Since platforms can use machine learning to predict the popularity and misinformation features of to-be-shared posts, and users are largely motivated to share popular content, platforms can strategically signal this informational advantage to change user beliefs and persuade them not to share misinformation. We characterize the optimal signaling scheme with imperfect predictions as a linear program and give sufficient and necessary conditions on the classifier to ensure optimal platform utility is non-decreasing and continuous. Next, this interaction is considered under a performative model, wherein platform intervention affects the user's future behaviour. The convergence and stability of optimal signaling under this performative process are fully characterized. Lastly, we experimentally validate that our approach significantly reduces misinformation in both the single round and performative setting.
Safwan Hossain, Andjela Mladenovic, Yiling Chen 0001, Gauthier Gidel
ICML2
2022 Online Adversarial Attacks
Andjela Mladenovic, Joey Bose, Hugo Berard, William L. Hamilton, Simon Lacoste-Julien, Pascal Vincent, Gauthier Gidel
ICLR1
2022 Generalized Natural Gradient Flows in Hidden Convex-Concave Games and GANs
Andjela Mladenovic, Iosif Sakos, Gauthier Gidel, Georgios Piliouras
ICLR1
2020 Designing Fairly Fair Classifiers Via Economic Fairness Notions
abstract
The past decade has witnessed a rapid growth of research on fairness in machine learning. In contrast, fairness has been formally studied for almost a century in microeconomics in the context of resource allocation, during which many general-purpose notions of fairness have been proposed. This paper explore the applicability of two such notions — envy-freeness and equitability — in machine learning. We propose novel relaxations of these fairness notions which apply to groups rather than individuals, and are compelling in a broad range of settings. Our approach provides a unifying framework by incorporating several recently proposed fairness definitions as special cases. We provide generalization bounds for our approach, and theoretically and experimentally evaluate the tradeoff between loss minimization and our fairness guarantees.
Safwan Hossain, Andjela Mladenovic, Nisarg Shah 0001
WWW2