3 citations · 7 across the 11 of their papers we have counts for
8 papers · 1 filter
Multigroup Fairness and Omniprediction: Separations and Equivalences
Sílvia Casacuberta, Parikshit Gopalan, Varun Kanade +3
Omniprediction is a learning guarantee which requires a single predictor to be competitive relative to the best hypothesis from a benchmark class for any loss chosen from a family…
The Importance of Being Smoothly Calibrated
Parikshit Gopalan, Konstantinos Stavropoulos, Kunal Talwar +1
Recent work has highlighted the centrality of smooth calibration [Kakade and Foster, 2008] as a robust measure of calibration error. We generalize, unify, and extend previous resul…
Efficient Calibration for Decision Making
Parikshit Gopalan, Konstantinos Stavropoulos, Kunal Talwar +1
A decision-theoretic characterization of perfect calibration is that an agent seeking to minimize a proper loss in expectation cannot improve their outcome by post-processing a per…
From Fairness to Infinity: Outcome-Indistinguishable (Omni)Prediction in Evolving Graphs
Cynthia Dwork, Chris Hays, Nicole Immorlica +2
Professional networks provide invaluable entree to opportunity through referrals and introductions. A rich literature shows they also serve to entrench and even exacerbate a status…
Differentially Private Learning Beyond the Classical Dimensionality Regime
Cynthia Dwork, Pranay Tankala, Linjun Zhang
We initiate the study of differentially private learning in the proportional dimensionality regime, in which the number of data samples and problem dimension approach infin…
From Pseudorandomness to Multi-Group Fairness and Back
Cynthia Dwork, Daniel Lee, Huijia Lin +1
We identify and explore connections between the recent literature on multi-group fairness for prediction algorithms and the pseudorandomness notions of leakage-resilience and graph…
On the convergence of group-sparse autoencoders
Emmanouil Theodosis, Bahareh Tolooshams, Pranay Tankala +2
Recent approaches in the theoretical analysis of model-based deep learning architectures have studied the convergence of gradient descent in shallow ReLU networks that arise from g…
K-Deep Simplex: Deep Manifold Learning via Local Dictionaries
Pranay Tankala, Abiy Tasissa, James M. Murphy +1
We propose K-Deep Simplex(KDS) which, given a set of data points, learns a dictionary comprising synthetic landmarks, along with representation coefficients supported on a simplex.…