203 citations · 288 across the 21 of their papers we have counts for
6 papers · 1 filter
On the Problem of Underranking in Group-Fair Ranking
Sruthi Gorantla, Amit Deshpande, Anand Louis
Search and recommendation systems, such as search engines, recruiting tools, online marketplaces, news, and social media, output ranked lists of content, products, and sometimes, p…
Robust Identifiability in Linear Structural Equation Models of Causal Inference
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
In this work, we consider the problem of robust parameter estimation from observational data in the context of linear structural equation models (LSEMs). LSEMs are a popular and we…
Group Fairness for Knapsack Problems
Deval Patel, Arindam Khan, Anand Louis
We study the knapsack problem with group fairness constraints. The input of the problem consists of a knapsack of bounded capacity and a set of items, each item belongs to a partic…
Approximation Algorithms and Hardness for Strong Unique Games
Suprovat Ghoshal, Anand Louis
The UNIQUE GAMES problem is a central problem in algorithms and complexity theory. Given an instance of UNIQUE GAMES, the STRONG UNIQUE GAMES problem asks to find the largest subse…
Planted Models for the Densest -Subgraph Problem
Yash Khanna, Anand Louis
Given an undirected graph , the Densest -subgraph problem (DkS) asks to compute a set of cardinality such that the weight of…
& Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric
Majid Farhadi, Anand Louis, Mohit Singh +1
Bobkov, Houdré, and the last author [2000] introduced a Poincaré-type functional parameter, , of a graph and related it to connectivity of the graph via Cheeger-type ineq…