We prove an Ω(n2) lower bound on the query complexity of local proportionality in Robertson-Webb cake-cutting model. Local requires that each agent prefer their allocation to average neighbors' allocations some undirected social network. It is a weaker fairness notion than envy-freeness, which also has Ω(n2), and generally incomparable proportionality, Θ(nlog⁡n). This result separates from ordi...

Conditional t-SNE (ct-SNE) is a recent extension to that allows removal of known cluster information from the embedding, obtain visualization revealing structure beyond label information. This useful, for example, when one wants factor out unwanted differences between set classes. We show ct-SNE fails in many realistic settings, namely if data well clustered over labels original high-dimensiona...