no code implementations • 13 May 2024 • Arnab Bhattacharyya, Sutanu Gayen, Philips George John, Sayantan Sen, N. V. Vinodchandran
This work establishes a novel link between the problem of PAC-learning high-dimensional graphical models and the task of (efficient) counting and sampling of graph structures, using an online learning framework.
no code implementations • 21 Jun 2020 • Philips George John, Deepak Vijaykeerthy, Diptikalyan Saha
Our objective is to construct verifiers for proving individual fairness of a given model, and we do so by considering appropriate relaxations of the problem.