Media Summary: Testing distributional assumptions of learning algorithms. Ronitt Rubinfeld, Arsen Vasilyan (MIT) What Makes a Good Fisherman? Linear Regression under Self-Selection Bias. Yeshwanth Cherapanamjeri (UC Berkeley); ... Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. André Lieutier (None); Mathijs Wintraecken (IST Austria and ...
Stoc 2023 Session 9c Average - Detailed Analysis & Overview
Testing distributional assumptions of learning algorithms. Ronitt Rubinfeld, Arsen Vasilyan (MIT) What Makes a Good Fisherman? Linear Regression under Self-Selection Bias. Yeshwanth Cherapanamjeri (UC Berkeley); ... Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. André Lieutier (None); Mathijs Wintraecken (IST Austria and ... Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ... Learning Polynomial Transformations via Generalized Tensor Decompositions. Sitan Chen (UC Berkeley); Jerry Li, Yuanzhi Li ... Lifting uniform learners via distributional decomposition. Guy Blanc (Stanford University); Jane Lange (MIT); Ali Malik, Li-Yang Tan ...
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes. Fernando Granha Jeronimo, Pei Wu (IAS) Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. Vaclav Rozhon (ETH ... Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. Jiatu Li (Tsinghua University); Igor C. Oliveira ... Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. Amir Abboud (Weizmann Institute of ... Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. Qipeng Liu (Simons Institute); Ran Raz, Wei ... Algorithms approaching the threshold for semi-random planted clique. Rares-Darius Buhai (ETH Zurich); Pravesh K. Kothari ...
