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

Jamelle Watson-Daniels

dblp:322/0516 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-4711-8789ORCID · verified

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 87% Web and social media mining · 13%
Artificial intelligence
1 paper
Trustworthy machine learning · 33% Probabilistic and Bayesian machine learning · 33% Learning theory · 33%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › ranking › text ranking
comment ranking
0.912025
Representative Ranking for Deliberation in the Public Sphere · ICML 2025
Information retrieval
ranking
0.912025
Representative Ranking for Deliberation in the Public Sphere · ICML 2025
Algorithmic game theory and mechanism design › social choice › proportional representation
justified representation
0.912025
Representative Ranking for Deliberation in the Public Sphere · ICML 2025
Algorithmic game theory and mechanism design
social choice
0.912025
Representative Ranking for Deliberation in the Public Sphere · ICML 2025
Machine learning › Learning theory
model selection
0.712023
Predictive Multiplicity in Probabilistic Classification · AAAI 2023
Machine learning › Trustworthy machine learning › model multiplicity
predictive multiplicity
0.712023
Predictive Multiplicity in Probabilistic Classification · AAAI 2023
Machine learning › Probabilistic and Bayesian machine learning
probabilistic classifier
0.712023
Predictive Multiplicity in Probabilistic Classification · AAAI 2023

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

civility classification · 1.7optimization-based methods · 0.7convex empirical risk minimization · 0.7
YearPublicationVenuePosition
2025 Representative Ranking for Deliberation in the Public Sphere
abstract
Online comment sections, such as those on news sites or social media, have the potential to foster informal public deliberation, However, this potential is often undermined by the frequency of toxic or low-quality exchanges that occur in these settings. To combat this, platforms increasingly leverage algorithmic ranking to facilitate higher-quality discussions, e.g., by using civility classifiers or forms of prosocial ranking. Yet, these interventions may also inadvertently reduce the visibility of legitimate viewpoints, undermining another key aspect of deliberation: representation of diverse views. We seek to remedy this problem by introducing guarantees of representation into these methods. In particular, we adopt the notion of *justified representation* (JR) from the social choice literature and incorporate a JR constraint into the comment ranking setting. We find that enforcing JR leads to greater inclusion of diverse viewpoints while still being compatible with optimizing for user engagement or other measures of conversational quality.
Manon Revel, Smitha Milli, Tyler Lu, Jamelle Watson-Daniels, Maximilian Nickel
ICML4
2023 Predictive Multiplicity in Probabilistic Classification
abstract
Machine learning models are often used to inform real world risk assessment tasks: predicting consumer default risk, predicting whether a person suffers from a serious illness, or predicting a person's risk to appear in court. Given multiple models that perform almost equally well for a prediction task, to what extent do predictions vary across these models? If predictions are relatively consistent for similar models, then the standard approach of choosing the model that optimizes a penalized loss suffices. But what if predictions vary significantly for similar models? In machine learning, this is referred to as predictive multiplicity i.e. the prevalence of conflicting predictions assigned by near-optimal competing models. In this paper, we present a framework for measuring predictive multiplicity in probabilistic classification (predicting the probability of a positive outcome). We introduce measures that capture the variation in risk estimates over the set of competing models, and develop optimization-based methods to compute these measures efficiently and reliably for convex empirical risk minimization problems. We demonstrate the incidence and prevalence of predictive multiplicity in real-world tasks. Further, we provide insight into how predictive multiplicity arises by analyzing the relationship between predictive multiplicity and data set characteristics (outliers, separability, and majority-minority structure). Our results emphasize the need to report predictive multiplicity more widely.
Jamelle Watson-Daniels, David C. Parkes, Berk Ustun
AAAI1