Search Results for author: Anand Louis

Found 14 papers, 6 papers with code

Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness

1 code implementation25 Aug 2023 Sruthi Gorantla, Eshaan Bhansali, Amit Deshpande, Anand Louis

Previous works have proposed efficient algorithms to train stochastic ranking models that achieve fairness of exposure to the groups ex-ante (or, in expectation), which may not guarantee representation fairness to the groups ex-post, that is, after realizing a ranking from the stochastic ranking model.

Fairness Learning-To-Rank

Sampling Individually-Fair Rankings that are Always Group Fair

no code implementations21 Jun 2023 Sruthi Gorantla, Anay Mehrotra, Amit Deshpande, Anand Louis

Fair ranking tasks, which ask to rank a set of items to maximize utility subject to satisfying group-fairness constraints, have gained significant interest in the Algorithmic Fairness, Information Retrieval, and Machine Learning literature.

Fairness Information Retrieval +2

Socially Fair Center-based and Linear Subspace Clustering

no code implementations22 Aug 2022 Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande, Anand Louis

Center-based clustering (e. g., $k$-means, $k$-medians) and clustering using linear subspaces are two most popular techniques to partition real-world data into smaller clusters.

Clustering Fairness

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All

1 code implementation21 Aug 2022 Atasi Panda, Anand Louis, Prajakta Nimbhorkar

Our first result is a polynomial-time algorithm that computes a distribution over `group-fair' matchings such that the individual fairness constraints are approximately satisfied and the expected size of a matching is close to OPT.

Fairness

Sampling Ex-Post Group-Fair Rankings

2 code implementations2 Mar 2022 Sruthi Gorantla, Amit Deshpande, Anand Louis

Our second random walk-based algorithm samples ex-post group-fair rankings from a distribution $\delta$-close to $D$ in total variation distance and has expected running time $O^*(k^2\ell^2)$, when there is a sufficient gap between the given upper and lower bounds on the group-wise representation.

Fairness

On the Problem of Underranking in Group-Fair Ranking

2 code implementations24 Sep 2020 Sruthi Gorantla, Amit Deshpande, Anand Louis

We give a fair ranking algorithm that takes any given ranking and outputs another ranking with simultaneous underranking and group fairness guarantees comparable to the lower bound we prove.

Fairness Learning-To-Rank +1

Robust Identifiability in Linear Structural Equation Models of Causal Inference

no code implementations14 Jul 2020 Karthik Abinav Sankararaman, Anand Louis, Navin Goyal

First, for a large and well-studied class of LSEMs, namely ``bow free'' models, we provide a sufficient condition on model parameters under which robust identifiability holds, thereby removing the restriction of paths required by prior work.

Causal Inference

HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs

1 code implementation NeurIPS 2019 Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Vikram Nitin, Anand Louis, Partha Talukdar

In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise.

Biologically Plausible Neural Networks via Evolutionary Dynamics and Dopaminergic Plasticity

no code implementations NeurIPS Workshop Neuro_AI 2019 Sruthi Gorantla, Anand Louis, Christos H. Papadimitriou, Santosh Vempala, Naganand Yadati

Artificial neural networks (ANNs) lack in biological plausibility, chiefly because backpropagation requires a variant of plasticity (precise changes of the synaptic weights informed by neural events that occur downstream in the neural circuit) that is profoundly incompatible with the current understanding of the animal brain.

Stability of Linear Structural Equation Models of Causal Inference

no code implementations16 May 2019 Karthik Abinav Sankararaman, Anand Louis, Navin Goyal

First we prove that under a sufficient condition, for a certain sub-class of $\LSEM$ that are \emph{bow-free} (Brito and Pearl (2002)), the parameter recovery is stable.

Causal Inference Sociology

HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs

1 code implementation7 Sep 2018 Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Vikram Nitin, Anand Louis, Partha Talukdar

In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise.

On Euclidean $k$-Means Clustering with $α$-Center Proximity

no code implementations28 Apr 2018 Amit Deshpande, Anand Louis, Apoorv Vikram Singh

On the hardness side we show that for any $\alpha' > 1$, there exists an $\alpha \leq \alpha'$, $(\alpha >1)$, and an $\varepsilon_0 > 0$ such that minimizing the $k$-means objective over clusterings that satisfy $\alpha$-center proximity is NP-hard to approximate within a multiplicative $(1+\varepsilon_0)$ factor.

Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.