Publications de Nisheeth Vishnoi

A dashboard for controlling polarization in personalization

Nisheeth Vishnoi, Farnood Salehi, Laura Elisa Celis, Vijay Keswani, Sayash Kapoor

Personalization is pervasive in the online space as it leads to higher efficiency for the user and higher revenue for the platform by individualizing the most relevant content for each user. However, recent studies suggest that such personalization can lea ...

IOS PRESS2019

Controlling Polarization in Personalization: An Algorithmic Framework

Nisheeth Vishnoi, Farnood Salehi, Laura Elisa Celis, Sayash Kapoor

Personalization is pervasive in the online space as it leads to higher efficiency for the user and higher revenue for the platform by individualizing the most relevant content for each user. However, recent studies suggest that such personalization can lea ...

ASSOC COMPUTING MACHINERY2019

Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees

Nisheeth Vishnoi, Laura Elisa Celis, Vijay Keswani, Lingxiao Huang

Developing classification algorithms that are fair with respect to sensitive attributes of the data is an important problem due to the increased deployment of classification algorithms in societal contexts. Several recent works have focused on studying cla ...

ASSOC COMPUTING MACHINERY2019

Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo

Nisheeth Vishnoi, Oren Rami Mangoubi

Hamiltonian Monte Carlo (HMC) is a widely deployed method to sample from high-dimensional distributions in Statistics and Machine learning. HMC is known to run very efficiently in practice and its popular second-order "leapfrog" implementation has long bee ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

Javad Ebrahimi Boroojeni, Damian Mateusz Straszak, Nisheeth Vishnoi

Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors v(1), ..., v(m) is an element of R-d and a constraint family B subset of 2([m]), find a set S. B that maximizes the squared volume of the sim ...

Ieee2017

On a Natural Dynamics for Linear Programming

Damian Mateusz Straszak, Nisheeth Vishnoi

Assoc Computing Machinery2016

The mixing time of the Dikin walk in a polytope-A simple proof

Nisheeth Vishnoi

We study the mixing time of the Dikin walk in a polytope a random walk based on the log-barrier from the interior point method literature. This walk, and a close variant, were studied by Narayanan (2016) and Kannan-Narayanan (2012). Bounds on its mixing ti ...

Elsevier Science Bv2016

On the Computational Complexity of Limit Cycles in Dynamical Systems

Nisheeth Vishnoi

Assoc Computing Machinery2016