Proposes a framework for performing fair PCA in memory limited, streaming setting. Sample complexity results and empirical discussions show the superiority of our approach compared …
A novel problem setting where heterogeneous multi-agent bandits collaborate over a network to minimize their group regret. To deal with the high communication complexity of the …
First theoretical analysis of model estimation and reward-free RL of block MDP, without resorting to function approximation frameworks. Lower bounds and algorithms with …
We empirically validate the clustering algorithm proposed in (Jedra et al., 2022).
Inspired from (Wang et al., ICLR'22), we provide a preliminary statistical analysis of stochastic gradient noises (SGNs) of GIN and GCN in Cora node classification task.
Proposes a new MMD-based definition of fairness for PCA, then formulate fair PCA as an optimization over the Stiefel manifold. Various theoretical and empirical discussions show …
Extend SWAY (Chen et al., 2016) to the space of permutations by proposing a new Euclidean embedding of permutations.
In a symmetric partition of a regular n-gon into n congruent subtriangles and a regular n-gon in the center, we determine the loci of the incenter and points of tangency of the …