EDBT 2026 Demo / reviewers in the wild / expert
Kanad Pardeshi
dblp:376/7975 · also Kanad Shrikar Pardeshi
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Artificial intelligence
1 paper |
Learning theory · 100% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory
sample complexity |
0.8 | 1 | 2024 | Learning Social Welfare Functions · NeurIPS 2024 |
Algorithmic game theory and mechanism design
social welfare |
0.8 | 1 | 2024 | Learning Social Welfare Functions · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
polynomial sample complexity · 1.5pairwise comparison learning · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Learning Social Welfare FunctionsabstractIs it possible to understand or imitate a policy maker's rationale by looking at past decisions they made? We formalize this question as the problem of learning social welfare functions belonging to the well-studied family of power mean functions. We focus on two learning tasks; in the first, the input is vectors of utilities of an action (decision or policy) for individuals in a group and their associated social welfare as judged by a policy maker, whereas in the second, the input is pairwise comparisons between the welfares associated with a given pair of utility vectors. We show that power mean functions are learnable with polynomial sample complexity in both cases, even if the social welfare information is noisy. Finally, we design practical algorithms for these tasks and evaluate their performance. Kanad Pardeshi, Itai Shapira, Ariel D. Procaccia, Aarti Singh |
NeurIPS | 1 |