81 citations · 168 across the 67 of their papers we have counts for
4 papers · 1 filter
Bayesian Recovery for Probabilistic Coalition Structures
Angshul Majumdar
Probabilistic Coalition Structure Generation (PCSG) is NP-hard and can be recast as an -type sparse recovery problem by representing coalition structures as sparse coefficient…
Dictionary-Transform Generative Adversarial Networks
Angshul Majumdar
Generative adversarial networks (GANs) are widely used for distribution learning, yet their classical formulations remain theoretically fragile, with ill-posed objectives, unstable…
Near-Optimal Coalition Structures in Polynomial Time
Angshul Majumdar
We study the classical coalition structure generation (CSG) problem and compare the anytime behavior of three algorithmic paradigms: dynamic programming (DP), MILP branch-and-bound…
A Unified Matrix Factorization Framework for Classical and Robust Clustering
Angshul Majumdar
This paper presents a unified matrix factorization framework for classical and robust clustering. We begin by revisiting the well-known equivalence between crisp k-means clustering…