Spencer Compton

According to our database, Spencer Compton authored at least 13 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Efficient ϵ-approximate minimum-entropy couplings.

Spencer Compton

CoRR, September, 2025

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation.

Spencer Compton, Gregory Valiant

CoRR, February, 2025

Embedding Probability Distributions into Low Dimensional ℓ₁: Tree Ising Models via Truncated Metrics.

Moses Charikar, Spencer Compton, Chirag Pabbaraju

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Lower Bounds for Greedy Teaching Set Constructions.

Spencer Compton, Chirag Pabbaraju, Nikita Zhivotovskiy

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024

Computing Low-Entropy Couplings for Large-Support Distributions.

Samuel Sokota, Dylan Sam, Christian Schröder de Witt, Spencer Compton, Jakob N. Foerster, J. Zico Kolter

Proceedings of the Uncertainty in Artificial Intelligence, 2024

Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances.

Spencer Compton, Gregory Valiant

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Average-Case Dimensionality Reduction in 𝓁₁: Tree Ising Models.

Moses Charikar, Spencer Compton, Chirag Pabbaraju

CoRR, 2023

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling.

Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier.

Spencer Compton, Dmitriy Katz, Benjamin Qi, Kristjan H. Greenewald, Murat Kocaoglu

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling.

Spencer Compton

Proceedings of the IEEE International Symposium on Information Theory, 2022

Entropic Causal Inference: Graph Identifiability.

Spencer Compton, Kristjan H. Greenewald, Dmitriy A. Katz, Murat Kocaoglu

Proceedings of the International Conference on Machine Learning, 2022

2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.

Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang

J. Inf. Process., 2020

Entropic Causal Inference: Identifiability and Finite Sample Results.

Spencer Compton, Murat Kocaoglu, Kristjan H. Greenewald, Dmitriy Katz

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020