{"paper":{"title":"Linear Regression with Self-Selection Bias in Polynomial Time","arxiv_id":"2611.17228","primary_cat":"math.ST","submitted_at":"2026-11-12T18:21:11+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"We revisit the problem of estimating $k$ linear regressors with self-selection bias in $n$ dimensions up to error $\\varepsilon$ with the maximum self-selection criterion, as introduced by Cherapanamjeri, Daskalakis, Ilyas, and Zampetakis [CDIZ23, STOC].","hedge":{"p":0.5,"label":"unclear"},"own_p":0.09,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.45,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.63,"id":"s1","own":true,"role":"result","text":"Our main result is a $\\mathrm{poly}(n,k,1/\\varepsilon)$ time algorithm for the unknown-index variant of this problem, thereby improving upon the running times of the best known algorithms due to Gaitonde and Mossel [GM24] and Kalavasis, Mehrotra, and Zhou [KMZ26, COLT] with exponential dependence on $k$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.97,"quantitative":true,"quantitative_p":0.95,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.63,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.37,"interpretation":0.0}},{"i":2,"p":0.64,"id":"s2","own":true,"role":"result","text":"Our algorithm succeeds in the presence of correlated noise between regressors, which captures the related setting of max-affine regression.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.87,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.64,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.21,"interpretation":0.15}},{"i":3,"p":0.49,"id":"s3","own":true,"role":"result","text":"Consequently, we also give the first polynomial-time algorithm for this problem, improving on the prior works of Ghosh, Pananjady, Guntuboyina, and Ramchandran [GPGR22, IEEE Transactions on Information Theory] and Gaitonde and Mossel [GM24] with exponential dependence on $k$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.92,"main_claim_p":0.16,"quantitative":true,"quantitative_p":0.88,"role_probabilities":{"gap":0.01,"method":0.0,"result":0.49,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.46,"interpretation":0.04}},{"i":4,"p":1.0,"id":"s4","own":false,"role":"background","text":"Prior works exhaustively search over a $k$-dimensional subspace spanned by the regressors, using conditional moments of the response to test candidates.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.03,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.21,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":5,"p":0.64,"id":"s5","own":true,"role":"method","text":"In contrast, our algorithm is driven by an improved understanding of the moments of the covariates.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.64,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.42,"role_probabilities":{"gap":0.01,"method":0.64,"result":0.0,"background":0.01,"limitation":0.0,"future_work":0.0,"contribution":0.33,"interpretation":0.01}},{"i":6,"p":0.42,"id":"s6","own":true,"role":"result","text":"We show that, restricting to observations with large response values, the degree-$(\\log n)$ Hermite moment of the covariates approximately decomposes as a sum of tensor powers of the regressors.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.93,"main_claim_p":0.06,"quantitative":true,"quantitative_p":0.63,"role_probabilities":{"gap":0.0,"method":0.38,"result":0.42,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.2,"interpretation":0.0}},{"i":7,"p":0.96,"id":"s7","own":true,"role":"method","text":"The first step of our algorithm can be viewed as a tensor decomposition algorithm for these implicitly represented high-order tensors, which outputs unit vectors parallel to the regressors.","hedge":{"p":0.89,"label":"asserted"},"own_p":0.92,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.96,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.03}},{"i":8,"p":1.0,"id":"s8","own":true,"role":"method","text":"A secondary step based on a simple variant of ordinary least squares extracts estimates for the regressors given these unit vectors.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":1.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":9,"p":0.84,"id":"s9","own":false,"role":"future_work","text":"We believe our analytic insight and algorithmic components may have applications to designing efficient algorithms for other latent-variable problems.","hedge":{"p":0.94,"label":"hedged_possibility"},"own_p":0.23,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.84,"contribution":0.0,"interpretation":0.16}}]},"compiled":{"main_claim":{"p":1.0,"text":"Our main result is a $\\mathrm{poly}(n,k,1/\\varepsilon)$ time algorithm for the unknown-index variant of this problem, thereby improving upon the running times of the best known algorithms due to Gaitonde and Mossel [GM24] and Kalavasis, Mehrotra, and Zhou [KMZ26, COLT] with exponential dependence on $k$.","location":"abstract s1","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":7943,"cost_usd_reported":0.0},"compiled_at":"2026-11-14","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.82,"states_limitation":0.11,"human_participants":0.02,"controlled_comparison":0.05,"randomized_assignment":0.02,"states_quantitative_result":0.77,"compares_with_prior_results":0.98,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.91,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.91,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.09,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.93,"text":"Our main result is a $\\mathrm{poly}(n,k,1/\\varepsilon)$ time algorithm for the unknown-index variant of this problem, thereby improving upon the running times of the best known algorithms due to Gaitonde and Mossel [GM24] and Kalavasis, Mehrotra, and Zhou [KMZ26, COLT] with exponential dependence on $k$.","location":"abstract s1"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":10,"sentences_in_abstract":10},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}