Learning Theory, Missing Data, Generation
→ Gaitonde–Mossel’24: Runtime ≈ poly(d) / εᵏ (+ also have optimal sample complexity)
→ Ours: Runtime ≈ poly(d) / ε² via warm start + SGD
Key insight: Recast self-selection as regression with coarse (aka rounded) labels
→ Gaitonde–Mossel’24: Runtime ≈ poly(d) / εᵏ (+ also have optimal sample complexity)
→ Ours: Runtime ≈ poly(d) / ε² via warm start + SGD
Key insight: Recast self-selection as regression with coarse (aka rounded) labels
The seminal work of Roy (1951) introduced learning with self-selection
Even identification for unknown-index variant is nascent, starting w/ CDIZ [STOC’23]
The seminal work of Roy (1951) introduced learning with self-selection
Even identification for unknown-index variant is nascent, starting w/ CDIZ [STOC’23]
Cornell/MIT: Jon Kleinberg, @sendhil.bsky.social
Duke: Fan Wei
Stanford: Moses Charikar, Chirag Pabbaraju, Charlotte Peale, Omer Reingold
U Michigan: Jiaxun Li, @vkraman.bsky.social , Ambuj Tewari
Yale: Alkis Kalavasis, Anay mehrotra, Grigoris Velegkas
Cornell/MIT: Jon Kleinberg, @sendhil.bsky.social
Duke: Fan Wei
Stanford: Moses Charikar, Chirag Pabbaraju, Charlotte Peale, Omer Reingold
U Michigan: Jiaxun Li, @vkraman.bsky.social , Ambuj Tewari
Yale: Alkis Kalavasis, Anay mehrotra, Grigoris Velegkas