research
∙
06/15/2023
Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings
Explainable AI aims to render model behavior understandable by humans, w...
share
research
∙
01/25/2021
On maximum-likelihood estimation in the all-or-nothing regime
We study the problem of estimating a rank-1 additive deformation of a Ga...
research
∙
11/23/2020
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem
Recovery a planted signal perturbed by noise is a fundamental problem in...
research
∙
10/07/2020
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games
In this work, we establish a frequency-domain framework for analyzing gr...
research
∙
09/30/2020
Solving Zero-Sum Games through Alternating Projections
In this work, we establish near-linear and strong convergence for a natu...
research
∙
07/23/2020
Two-way Greedy: Algorithms for Imperfect Rationality
The realization that selfish interests need to be accounted for in the d...
research
∙
01/21/2019
Exact Recovery for a Family of Community-Detection Generative Models
Generative models for networks with communities have been studied extens...
research
∙
12/04/2018
Online scheduling of jobs with favorite machines
This work introduces a natural variant of the online machine scheduling ...
research
∙
05/10/2018
On the approximation guarantee of obviously strategyproof mechanisms
The concept of obviously strategyproof (OSP) mechanisms has the merit to...
research
∙
04/20/2018
Optimal Sorting with Persistent Comparison Errors
We consider the problem of sorting n elements in the case of persistent ...
research
∙
12/18/2017
No truthful mechanism can be better than n approximate for two natural problems
This work gives the first natural non-utilitarian problems for which the...
research
∙
09/19/2017
