{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/linear-regression/papers/17","list_of":"/method/linear-regression","method":"Linear Regression","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":17,"pages_in_order":17,"rows_per_page":100,"rows":[1601,1657],"of":1657,"counts":{"archive_papers_tagged":1657,"with_a_code_link":323,"where_syntology_ran_a_sample":50,"not_listed_spam_title":0,"listed":1657,"listed_where_code_ran":50,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":39,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":39,"listed_every_run_a_failure_of_syntologys_instrument":11,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/linear-regression","prev":"/method/linear-regression/papers/16","next":null,"papers":[{"paper":null,"slug":"minimax-optimal-sparse-signal-recovery-with","title":"Minimax Optimal Sparse Signal Recovery with Poisson Statistics","date":"2015-01-21","arxiv_id":"1501.05200","n_code_links":0,"syntology":null},{"paper":null,"slug":"separation-of-undersampled-composite-signals","title":"Separation of undersampled composite signals using the Dantzig selector with overcomplete dictionaries","date":"2015-01-20","arxiv_id":"1501.04819","n_code_links":0,"syntology":null},{"paper":null,"slug":"implementable-confidence-sets-in-high","title":"Implementable confidence sets in high dimensional regression","date":"2015-01-19","arxiv_id":"1501.04467","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperspectral-classification-with-adaptively","title":"HyperSpectral classification with adaptively weighted L1-norm regularization and spatial postprocessing","date":"2014-12-08","arxiv_id":"1412.2684","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-bayesian-posterior-sampling-via","title":"Distributed Bayesian Posterior Sampling via Moment Sharing","date":"2014-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"on-sparse-gaussian-chain-graph-models","title":"On Sparse Gaussian Chain Graph Models","date":"2014-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-bayesian-structure-learning-with","title":"Sparse Bayesian structure learning with “dependent relevance determination” priors","date":"2014-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/private-empirical-risk-minimization-beyond","slug":"private-empirical-risk-minimization-beyond","title":"Private Empirical Risk Minimization Beyond the Worst Case: The Effect of the Constraint Set Geometry","date":"2014-11-20","arxiv_id":"1411.5417","n_code_links":1,"syntology":null},{"paper":null,"slug":"multivariate-response-and-parsimony-for","title":"Multivariate response and parsimony for Gaussian cluster-weighted models","date":"2014-11-03","arxiv_id":"1411.0560","n_code_links":0,"syntology":null},{"paper":"/paper/population-empirical-bayes","slug":"population-empirical-bayes","title":"Population Empirical Bayes","date":"2014-11-02","arxiv_id":"1411.0292","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-iterative-hard-thresholding-methods-for","title":"On Iterative Hard Thresholding Methods for High-dimensional M-Estimation","date":"2014-10-20","arxiv_id":"1410.5137","n_code_links":0,"syntology":null},{"paper":null,"slug":"augmented-neural-networks-for-modelling","title":"Augmented Neural Networks for Modelling Consumer Indebtness","date":"2014-09-03","arxiv_id":"1409.1057","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-scale-purchase-prediction-with","title":"Large Scale Purchase Prediction with Historical User Actions on B2C Online Retail Platform","date":"2014-08-27","arxiv_id":"1408.6515","n_code_links":0,"syntology":null},{"paper":null,"slug":"statistical-guarantees-for-the-em-algorithm","title":"Statistical guarantees for the EM algorithm: From population to sample-based analysis","date":"2014-08-09","arxiv_id":"1408.2156","n_code_links":0,"syntology":null},{"paper":null,"slug":"rapid-rapidly-accelerated-proximal-gradient","title":"RAPID: Rapidly Accelerated Proximal Gradient Algorithms for Convex Minimization","date":"2014-06-13","arxiv_id":"1406.4445","n_code_links":0,"syntology":null},{"paper":null,"slug":"discriminative-functional-connectivity","title":"Discriminative Functional Connectivity Measures for Brain Decoding","date":"2014-02-23","arxiv_id":"1402.5684","n_code_links":0,"syntology":null},{"paper":null,"slug":"retrieval-of-experiments-by-efficient","title":"Retrieval of Experiments by Efficient Estimation of Marginal Likelihood","date":"2014-02-19","arxiv_id":"1402.4653","n_code_links":0,"syntology":null},{"paper":null,"slug":"monte-carlo-simulation-for-lasso-type","title":"Monte Carlo Simulation for Lasso-Type Problems by Estimator Augmentation","date":"2014-01-17","arxiv_id":"1401.4425","n_code_links":0,"syntology":null},{"paper":null,"slug":"use-case-point-approach-based-software-effort","title":"Use Case Point Approach Based Software Effort Estimation using Various Support Vector Regression Kernel Methods","date":"2014-01-14","arxiv_id":"1401.3069","n_code_links":0,"syntology":null},{"paper":null,"slug":"inference-in-high-dimensions-with-the","title":"Inference in High Dimensions with the Penalized Score Test","date":"2014-01-12","arxiv_id":"1401.2678","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-optimization-models-in-the-presence","title":"Learning optimization models in the presence of unknown relations","date":"2014-01-06","arxiv_id":"1401.1061","n_code_links":0,"syntology":null},{"paper":null,"slug":"unsupervised-discovery-of-biographical","title":"Unsupervised Discovery of Biographical Structure from Text","date":"2014-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"modele-a-processus-latent-et-algorithme-em","title":"Modèle à processus latent et algorithme EM pour la régression non linéaire","date":"2013-12-25","arxiv_id":"1312.6978","n_code_links":0,"syntology":null},{"paper":null,"slug":"supervised-learning-of-a-regression-model","title":"Supervised learning of a regression model based on latent process. Application to the estimation of fuel cell life time","date":"2013-12-25","arxiv_id":"1312.7003","n_code_links":0,"syntology":null},{"paper":null,"slug":"performance-analysis-of-regularized-linear","title":"Performance Analysis Of Regularized Linear Regression Models For Oxazolines And Oxazoles Derivitive Descriptor Dataset","date":"2013-12-10","arxiv_id":"1312.2789","n_code_links":0,"syntology":null},{"paper":null,"slug":"swapping-variables-for-high-dimensional","title":"Swapping Variables for High-Dimensional Sparse Regression with Correlated Measurements","date":"2013-12-05","arxiv_id":"1312.1706","n_code_links":0,"syntology":null},{"paper":null,"slug":"information-theoretic-lower-bounds-for-1","title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","date":"2013-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comprehensive-approach-to-universal","title":"A Comprehensive Approach to Universal Piecewise Nonlinear Regression Based on Trees","date":"2013-11-25","arxiv_id":"1311.6392","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-does-more-regularization-imply-fewer","title":"When Does More Regularization Imply Fewer Degrees of Freedom? Sufficient Conditions and Counter Examples from Lasso and Ridge Regression","date":"2013-11-12","arxiv_id":"1311.2791","n_code_links":0,"syntology":null},{"paper":null,"slug":"regularization-of-ell_1-minimization-for","title":"Regularization of $\\ell_1$ minimization for dealing with outliers and noise in Statistics and Signal Recovery","date":"2013-10-28","arxiv_id":"1310.7637","n_code_links":0,"syntology":null},{"paper":null,"slug":"alternating-minimization-for-mixed-linear","title":"Alternating Minimization for Mixed Linear Regression","date":"2013-10-14","arxiv_id":"1310.3745","n_code_links":0,"syntology":null},{"paper":"/paper/linear-regression-as-a-non-cooperative-game","slug":"linear-regression-as-a-non-cooperative-game","title":"Linear Regression from Strategic Data Sources","date":"2013-09-30","arxiv_id":"1309.7824","n_code_links":1,"syntology":null},{"paper":null,"slug":"confidence-sets-based-on-thresholding","title":"Confidence Sets Based on Thresholding Estimators in High-Dimensional Gaussian Regression Models","date":"2013-08-14","arxiv_id":"1308.3201","n_code_links":0,"syntology":null},{"paper":null,"slug":"sharp-threshold-for-multivariate-multi","title":"Sharp Threshold for Multivariate Multi-Response Linear Regression via Block Regularized Lasso","date":"2013-07-30","arxiv_id":"1307.7993","n_code_links":0,"syntology":null},{"paper":null,"slug":"loss-minimization-and-parameter-estimation","title":"Loss minimization and parameter estimation with heavy tails","date":"2013-07-07","arxiv_id":"1307.1827","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-statistical-perspective-on-algorithmic","title":"A Statistical Perspective on Algorithmic Leveraging","date":"2013-06-23","arxiv_id":"1306.5362","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-experts-for-estimating-mixtures-of","title":"Spectral Experts for Estimating Mixtures of Linear Regressions","date":"2013-06-17","arxiv_id":"1306.3729","n_code_links":0,"syntology":null},{"paper":null,"slug":"confidence-intervals-and-hypothesis-testing","title":"Confidence Intervals and Hypothesis Testing for High-Dimensional Regression","date":"2013-06-13","arxiv_id":"1306.3171","n_code_links":0,"syntology":null},{"paper":null,"slug":"analytic-feature-selection-for-support-vector","title":"Analytic Feature Selection for Support Vector Machines","date":"2013-04-20","arxiv_id":"1304.5678","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-dictionary-learning-over-a-sensor","title":"Distributed dictionary learning over a sensor network","date":"2013-04-12","arxiv_id":"1304.3568","n_code_links":0,"syntology":null},{"paper":null,"slug":"feature-multi-selection-among-subjective","title":"Feature Multi-Selection among Subjective Features","date":"2013-02-18","arxiv_id":"1302.4297","n_code_links":0,"syntology":null},{"paper":null,"slug":"hypothesis-testing-in-high-dimensional","title":"Hypothesis Testing in High-Dimensional Regression under the Gaussian Random Design Model: Asymptotic Theory","date":"2013-01-17","arxiv_id":"1301.4240","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-classification-in-sparse-gaussian","title":"Optimal classification in sparse Gaussian graphic model","date":"2012-12-21","arxiv_id":"1212.5332","n_code_links":0,"syntology":null},{"paper":null,"slug":"fixed-rank-matrix-factorizations-and","title":"Fixed-rank matrix factorizations and Riemannian low-rank optimization","date":"2012-09-03","arxiv_id":"1209.0430","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimality-of-graphlet-screening-in-high","title":"Optimality of Graphlet Screening in High Dimensional Variable Selection","date":"2012-04-29","arxiv_id":"1204.6452","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-and-optimal-online-linear-regression","title":"Adaptive and optimal online linear regression on $\\ell^1$-balls","date":"2011-05-20","arxiv_id":"1105.4042","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparsity-regret-bounds-for-individual","title":"Sparsity regret bounds for individual sequences in online linear regression","date":"2011-01-05","arxiv_id":"1101.1057","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-dirty-model-for-multi-task-learning","title":"A Dirty Model for Multi-task Learning","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"a-family-of-penalty-functions-for-structured","title":"A Family of Penalty Functions for Structured Sparsity","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-global-convergence-rates-of-gradient","title":"Fast global convergence rates of gradient methods for high-dimensional statistical recovery","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"parametric-bandits-the-generalized-linear","title":"Parametric Bandits: The Generalized Linear Case","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"directed-regression","title":"Directed Regression","date":"2009-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"heterogeneous-multitask-learning-with-joint","title":"Heterogeneous multitask learning with joint sparsity constraints","date":"2009-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"modeling-human-function-learning-with","title":"Modeling human function learning with Gaussian processes","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"phase-transitions-for-high-dimensional-joint","title":"Phase transitions for high-dimensional joint support recovery","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/bolasso-model-consistent-lasso-estimation","slug":"bolasso-model-consistent-lasso-estimation","title":"Bolasso: model consistent Lasso estimation through the bootstrap","date":"2008-04-08","arxiv_id":"0804.1302","n_code_links":2,"syntology":null},{"paper":null,"slug":"online-linear-regression-and-its-application","title":"Online Linear Regression and Its Application to Model-Based Reinforcement Learning","date":"2007-12-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"record_sha256":"99d1131807daaf90061162e89f446ce1376446b85071c16ee2b414b9dac81a22","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}