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

Karthyek Murthy

dblp:122/9830 · also Karthyek R. A. Murthy, Karthyek Rajhaa A. M. · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0003-1071-0981ORCID · verified

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

Artificial intelligence and machine learning · 2 · 2 since 2021Theory of computation · 1 · 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
2 papers
Trustworthy machine learning · 50% Learning theory · 50%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory › distributed graph algorithms
congested clique
0.712023
A Nonparametric Approach with Marginals for Modeling Consumer Choice · EC 2023
Machine learning › Trustworthy machine learning
fairness
0.512021
Testing Group Fairness via Optimal Transport Projections · ICML 2021
Machine learning › Learning theory
hypothesis testing
0.512021
Testing Group Fairness via Optimal Transport Projections · ICML 2021

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

non-parametric modeling · 1.3optimal transport · 0.5linear programming · 0.5
YearPublicationVenuePosition
2023 A Nonparametric Approach with Marginals for Modeling Consumer Choice
abstract
Given data on choices made by consumers for different assortments, a key challenge is to develop parsimonious models that describe and predict consumer choice behavior. One such choice model is the marginal distribution model (MDM), which requires only the specification of the marginal distributions of the random utilities of the alternatives to explain choice data.
Yanqiu Ruan, Xiaobo Li 0002, Karthyek Murthy, Karthik Natarajan
EC3
2021 Testing Group Fairness via Optimal Transport Projections
abstract
We have developed a statistical testing framework to detect if a given machine learning classifier fails to satisfy a wide range of group fairness notions. Our test is a flexible, interpretable, and statistically rigorous tool for auditing whether exhibited biases are intrinsic to the algorithm or simply due to the randomness in the data. The statistical challenges, which may arise from multiple impact criteria that define group fairness and which are discontinuous on model parameters, are conveniently tackled by projecting the empirical measure to the set of group-fair probability models using optimal transport. This statistic is efficiently computed using linear programming, and its asymptotic distribution is explicitly obtained. The proposed framework can also be used to test for composite fairness hypotheses and fairness with multiple sensitive attributes. The optimal transport testing formulation improves interpretability by characterizing the minimal covariate perturbations that eliminate the bias observed in the audit.
Nian Si, Karthyek Murthy, Jose H. Blanchet
ICML2