5 papers
The price of multi-group transductive learning
Noah Bergam, Samuel Deng, Daniel Hsu
We show every multi-group learner in the transductive setting may incur a multiplicative penalty in its error rate on some group relative to the error rate achievable in the single…
A One-Inclusion Graph Approach to Multi-Group Learning
Noah Bergam, Samuel Deng, Daniel Hsu
We prove the tightest-known upper bounds on the sample complexity of multi-group learning. Our algorithm extends the one-inclusion graph prediction strategy using a generalization…
t-SNE Exaggerates Clusters, Provably
Noah Bergam, Szymon Snoeck, Nakul Verma
Central to the widespread use of t-distributed stochastic neighbor embedding (t-SNE) is the conviction that it produces visualizations whose structure roughly matches that of the i…
Compressibility Barriers to Neighborhood-Preserving Data Visualizations
Szymon Snoeck, Noah Bergam, Nakul Verma
To what extent is it possible to visualize high-dimensional data in two- or three-dimensional plots? We reframe this question in terms of embedding -vertex graphs (representing…
ClusterSC: Advancing Synthetic Control with Donor Selection
Saeyoung Rho, Andrew Tang, Noah Bergam +2
In causal inference with observational studies, synthetic control (SC) has emerged as a prominent tool. SC has traditionally been applied to aggregate-level datasets, but more rece…