{"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/12","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":12,"pages_in_order":17,"rows_per_page":100,"rows":[1101,1200],"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/11","next":"/method/linear-regression/papers/13","papers":[{"paper":null,"slug":"robust-high-dimensional-expectation","title":"Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard Thresholding","date":"2020-10-19","arxiv_id":"2010.09576","n_code_links":0,"syntology":null},{"paper":"/paper/roneld-robust-neural-network-output","slug":"roneld-robust-neural-network-output","title":"RONELD: Robust Neural Network Output Enhancement for Active Lane Detection","date":"2020-10-19","arxiv_id":"2010.09548","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-generalizable-and-accessible-approach-to","title":"A Generalizable and Accessible Approach to Machine Learning with Global Satellite Imagery","date":"2020-10-16","arxiv_id":"2010.08168","n_code_links":0,"syntology":null},{"paper":"/paper/learning-deep-features-in-instrumental-1","slug":"learning-deep-features-in-instrumental-1","title":"Learning Deep Features in Instrumental Variable Regression","date":"2020-10-14","arxiv_id":"2010.07154","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["liyuan9988/DeepFeatureIV"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-generalized-stacking-for-implementing","title":"A Generalized Stacking for Implementing Ensembles of Gradient Boosting Machines","date":"2020-10-12","arxiv_id":"2010.06026","n_code_links":0,"syntology":null},{"paper":null,"slug":"maximin-optimization-for-binary-regression","title":"Maximin Optimization for Binary Regression","date":"2020-10-10","arxiv_id":"2010.05077","n_code_links":0,"syntology":null},{"paper":null,"slug":"cryptocredit-securely-training-fair-models","title":"CryptoCredit: Securely Training Fair Models","date":"2020-10-09","arxiv_id":"2010.04840","n_code_links":0,"syntology":null},{"paper":null,"slug":"online-and-distribution-free-robustness","title":"Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination","date":"2020-10-08","arxiv_id":"2010.04157","n_code_links":0,"syntology":null},{"paper":"/paper/exploring-semantic-capacity-of-terms","slug":"exploring-semantic-capacity-of-terms","title":"Exploring Semantic Capacity of Terms","date":"2020-10-05","arxiv_id":"2010.01898","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["c3sr/semantic-capacity"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-universality-of-the-double-descent-1","slug":"on-the-universality-of-the-double-descent-1","title":"On the Universality of the Double Descent Peak in Ridgeless Regression","date":"2020-10-05","arxiv_id":"2010.01851","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":3,"n_instrument":2,"unverified":0,"pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["dholzmueller/universal_double_descent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/model-sharing-games-analyzing-federated","slug":"model-sharing-games-analyzing-federated","title":"Model-sharing Games: Analyzing Federated Learning Under Voluntary Participation","date":"2020-10-02","arxiv_id":"2010.00753","n_code_links":1,"syntology":null},{"paper":null,"slug":"mini-ddsm-mammography-based-automatic-age","title":"Mini-DDSM: Mammography-based Automatic Age Estimation","date":"2020-10-01","arxiv_id":"2010.00494","n_code_links":0,"syntology":null},{"paper":null,"slug":"regress-consistently-when-oblivious-outliers","title":"Consistent regression when oblivious outliers overwhelm","date":"2020-09-30","arxiv_id":"2009.14774","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-sparsity-on-dynamic-regression-models","title":"Dynamic sparsity on dynamic regression models","date":"2020-09-29","arxiv_id":"2009.14131","n_code_links":0,"syntology":null},{"paper":null,"slug":"from-twitter-to-traffic-predictor-next-day","title":"From Twitter to Traffic Predictor: Next-Day Morning Traffic Prediction Using Social Media Data","date":"2020-09-29","arxiv_id":"2009.13794","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-regression-with-covariate-filtering","title":"Robust regression with covariate filtering: Heavy tails and adversarial contamination","date":"2020-09-27","arxiv_id":"2009.12976","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-the-automation-of-a-chemical","title":"Towards the Automation of a Chemical Sulphonation Process with Machine Learning","date":"2020-09-25","arxiv_id":"2009.12125","n_code_links":0,"syntology":null},{"paper":"/paper/boosting-algorithms-for-delivery-time","slug":"boosting-algorithms-for-delivery-time","title":"Boosting Algorithms for Delivery Time Prediction in Transportation Logistics","date":"2020-09-24","arxiv_id":"2009.11598","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-mixtures-of-low-rank-models","title":"Learning Mixtures of Low-Rank Models","date":"2020-09-23","arxiv_id":"2009.11282","n_code_links":0,"syntology":null},{"paper":null,"slug":"explainable-boosted-linear-regression-for","title":"Explainable boosted linear regression for time series forecasting","date":"2020-09-18","arxiv_id":"2009.09110","n_code_links":0,"syntology":null},{"paper":null,"slug":"coordinate-methods-for-matrix-games","title":"Coordinate Methods for Matrix Games","date":"2020-09-17","arxiv_id":"2009.08447","n_code_links":0,"syntology":null},{"paper":null,"slug":"performance-evaluation-of-linear-regression","title":"Performance Evaluation of Linear Regression Algorithm in Cluster Environment","date":"2020-09-14","arxiv_id":"2009.06497","n_code_links":0,"syntology":null},{"paper":"/paper/simulating-normalised-constants-with","slug":"simulating-normalised-constants-with","title":"Referenced Thermodynamic Integration for Bayesian Model Selection: Application to COVID-19 Model Selection","date":"2020-09-08","arxiv_id":"2009.03851","n_code_links":1,"syntology":null},{"paper":null,"slug":"travel-time-prediction-for-congested-freeways","title":"Travel time prediction for congested freeways with a dynamic linear model","date":"2020-09-02","arxiv_id":"2009.01016","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-supervised-empirical-risk-minimization","title":"Semi-Supervised Empirical Risk Minimization: Using unlabeled data to improve prediction","date":"2020-09-01","arxiv_id":"2009.00606","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-joint-network-optimization-framework-to","title":"A Joint Network Optimization Framework to Predict Clinical Severity from Resting State Functional MRI Data","date":"2020-08-27","arxiv_id":"2009.03238","n_code_links":0,"syntology":null},{"paper":null,"slug":"out-of-sample-error-estimate-for-robust-m","title":"Out-of-sample error estimate for robust M-estimators with convex penalty","date":"2020-08-26","arxiv_id":"2008.11840","n_code_links":0,"syntology":null},{"paper":null,"slug":"demand-forecasting-using-long-short-term","title":"Demand Forecasting using Long Short-Term Memory Neural Networks","date":"2020-08-19","arxiv_id":"2008.08522","n_code_links":0,"syntology":null},{"paper":null,"slug":"structure-learning-in-inverse-ising-problems","title":"Structure Learning in Inverse Ising Problems Using $\\ell_2$-Regularized Linear Estimator","date":"2020-08-19","arxiv_id":"2008.08342","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-networks-in-day-ahead-electricity","title":"Neural networks in day-ahead electricity price forecasting: Single vs. multiple outputs","date":"2020-08-18","arxiv_id":"2008.08006","n_code_links":0,"syntology":null},{"paper":"/paper/obtaining-adjustable-regularization-for-free","slug":"obtaining-adjustable-regularization-for-free","title":"Obtaining Adjustable Regularization for Free via Iterate Averaging","date":"2020-08-15","arxiv_id":"2008.06736","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["uuujf/IterAvg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"on-the-generalization-properties-of-1","title":"On the Generalization Properties of Adversarial Training","date":"2020-08-15","arxiv_id":"2008.06631","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-neural-tangent-kernel-in-high-dimensions","title":"The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalization","date":"2020-08-15","arxiv_id":"2008.06786","n_code_links":0,"syntology":null},{"paper":"/paper/machine-learning-for-dynamic-resource","slug":"machine-learning-for-dynamic-resource","title":"Machine Learning for Dynamic Resource Allocation in Network Function Virtualization","date":"2020-08-12","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"machine-learning-for-robust-identification-of","title":"Machine Learning for Robust Identification of Complex Nonlinear Dynamical Systems: Applications to Earth Systems Modeling","date":"2020-08-12","arxiv_id":"2008.05590","n_code_links":0,"syntology":null},{"paper":null,"slug":"perfect-reconstruction-of-sparse-signals-via","title":"Reconstructing Sparse Signals via Greedy Monte-Carlo Search","date":"2020-08-07","arxiv_id":"2008.03175","n_code_links":0,"syntology":null},{"paper":null,"slug":"protein-structured-reservoir-computing-for","title":"Protein Structured Reservoir computing for Spike-based Pattern Recognition","date":"2020-08-07","arxiv_id":"2008.03330","n_code_links":0,"syntology":null},{"paper":null,"slug":"adiabatic-quantum-linear-regression","title":"Adiabatic Quantum Linear Regression","date":"2020-08-05","arxiv_id":"2008.02355","n_code_links":0,"syntology":null},{"paper":null,"slug":"macroeconomic-data-transformations-matter","title":"Macroeconomic Data Transformations Matter","date":"2020-08-04","arxiv_id":"2008.01714","n_code_links":0,"syntology":null},{"paper":null,"slug":"multiple-descent-design-your-own","title":"Multiple Descent: Design Your Own Generalization Curve","date":"2020-08-03","arxiv_id":"2008.01036","n_code_links":0,"syntology":null},{"paper":"/paper/rule-based-bayesian-regression","slug":"rule-based-bayesian-regression","title":"Rule-based Bayesian regression","date":"2020-08-02","arxiv_id":"2008.00422","n_code_links":4,"syntology":null},{"paper":null,"slug":"the-price-of-tailoring-the-index-to-your-data","title":"The Price of Tailoring the Index to Your Data: Poisoning Attacks on Learned Index Structures","date":"2020-08-01","arxiv_id":"2008.00297","n_code_links":0,"syntology":null},{"paper":"/paper/two-step-penalised-logistic-regression-for","slug":"two-step-penalised-logistic-regression-for","title":"Two-step penalised logistic regression for multi-omic data with an application to cardiometabolic syndrome","date":"2020-08-01","arxiv_id":"2008.00235","n_code_links":1,"syntology":null},{"paper":"/paper/machine-learning-for-complete-intersection","slug":"machine-learning-for-complete-intersection","title":"Machine learning for complete intersection Calabi-Yau manifolds: a methodological study","date":"2020-07-30","arxiv_id":"2007.15706","n_code_links":2,"syntology":null},{"paper":null,"slug":"healthcare-utilization-and-perceived-health","title":"Healthcare Utilization and Perceived Health Status from Falun Gong Practitioners in Taiwan: A Pilot SF-36 Survey","date":"2020-07-29","arxiv_id":"2007.14926","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantum-differentially-private-sparse","title":"Quantum Differentially Private Sparse Regression Learning","date":"2020-07-23","arxiv_id":"2007.11921","n_code_links":0,"syntology":null},{"paper":null,"slug":"using-local-dynamics-to-explain-analog","title":"Using local dynamics to explain analog forecasting of chaotic systems","date":"2020-07-22","arxiv_id":"2007.14216","n_code_links":0,"syntology":null},{"paper":null,"slug":"revisiting-sorted-table-search-procedures","title":"Learning from Data to Speed-up Sorted Table Search Procedures: Methodology and Practical Guidelines","date":"2020-07-20","arxiv_id":"2007.10237","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-robust-linear-regression-in-nearly","title":"Optimal Robust Linear Regression in Nearly Linear Time","date":"2020-07-16","arxiv_id":"2007.08137","n_code_links":0,"syntology":null},{"paper":null,"slug":"uncovering-a-factor-based-expected-return","title":"Uncovering a factor-based expected return conditioning structure with Regression Trees jointly for many stocks","date":"2020-07-16","arxiv_id":"2007.08115","n_code_links":0,"syntology":null},{"paper":null,"slug":"forecasting-hyponatremia-in-hospitalized","title":"Forecasting Hyponatremia in hospitalized patients Using Multilayer Perceptron and Multivariate Linear Regression Techniques","date":"2020-07-15","arxiv_id":"2007.15554","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-uncertainty-based-human-in-the-loop-system","title":"An Uncertainty-based Human-in-the-loop System for Industrial Tool Wear Analysis","date":"2020-07-14","arxiv_id":"2007.07129","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-spectral-algorithm-for-robust-regression","title":"A spectral algorithm for robust regression with subgaussian rates","date":"2020-07-12","arxiv_id":"2007.06072","n_code_links":0,"syntology":null},{"paper":null,"slug":"federated-learning-s-blessing-fedavg-has","title":"A Unified Linear Speedup Analysis of Federated Averaging and Nesterov FedAvg","date":"2020-07-11","arxiv_id":"2007.05690","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentially-private-simple-linear","title":"Differentially Private Simple Linear Regression","date":"2020-07-10","arxiv_id":"2007.05157","n_code_links":0,"syntology":null},{"paper":"/paper/robust-geodesic-regression","slug":"robust-geodesic-regression","title":"Robust Geodesic Regression","date":"2020-07-09","arxiv_id":"2007.04518","n_code_links":1,"syntology":null},{"paper":null,"slug":"coded-computing-for-federated-learning-at-the","title":"Coded Computing for Federated Learning at the Edge","date":"2020-07-07","arxiv_id":"2007.03273","n_code_links":0,"syntology":null},{"paper":"/paper/piecewise-linear-regression-via-a-difference","slug":"piecewise-linear-regression-via-a-difference","title":"Piecewise Linear Regression via a Difference of Convex Functions","date":"2020-07-05","arxiv_id":"2007.02422","n_code_links":2,"syntology":null},{"paper":null,"slug":"coded-distributed-computing-with-partial","title":"Coded Distributed Computing with Partial Recovery","date":"2020-07-04","arxiv_id":"2007.02191","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-computation-and-analysis-of","title":"Efficient computation and analysis of distributional Shapley values","date":"2020-07-02","arxiv_id":"2007.01357","n_code_links":0,"syntology":null},{"paper":"/paper/partial-trace-regression-and-low-rank-kraus","slug":"partial-trace-regression-and-low-rank-kraus","title":"Partial Trace Regression and Low-Rank Kraus Decomposition","date":"2020-07-02","arxiv_id":"2007.00935","n_code_links":1,"syntology":null},{"paper":null,"slug":"decentralized-stochastic-gradient-langevin","title":"Decentralized Stochastic Gradient Langevin Dynamics and Hamiltonian Monte Carlo","date":"2020-07-01","arxiv_id":"2007.00590","n_code_links":0,"syntology":null},{"paper":null,"slug":"online-robust-regression-via-sgd-on-the-l1","title":"Online Robust Regression via SGD on the l1 loss","date":"2020-07-01","arxiv_id":"2007.00399","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-linear-regression-optimal-rates-in","title":"Robust Linear Regression: Optimal Rates in Polynomial Time","date":"2020-06-29","arxiv_id":"2007.01394","n_code_links":0,"syntology":null},{"paper":null,"slug":"active-online-domain-adaptation","title":"Active Online Learning with Hidden Shifting Domains","date":"2020-06-25","arxiv_id":"2006.14481","n_code_links":0,"syntology":null},{"paper":null,"slug":"storm-foundations-of-end-to-end-empirical","title":"STORM: Foundations of End-to-End Empirical Risk Minimization on the Edge","date":"2020-06-25","arxiv_id":"2006.14554","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributionally-robust-machine-learning","title":"Distributionally-Robust Machine Learning Using Locally Differentially-Private Data","date":"2020-06-24","arxiv_id":"2006.13488","n_code_links":0,"syntology":null},{"paper":null,"slug":"artificial-lateral-line-based-relative-state","title":"Artificial Lateral Line Based Relative State Estimation for Two Adjacent Robotic Fish","date":"2020-06-23","arxiv_id":"2006.14421","n_code_links":0,"syntology":null},{"paper":"/paper/statistical-mechanics-of-generalization-in","slug":"statistical-mechanics-of-generalization-in","title":"Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networks","date":"2020-06-23","arxiv_id":"2006.13198","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Pehlevan-Group/kernel-generalization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"the-macroeconomy-as-a-random-forest","title":"The Macroeconomy as a Random Forest","date":"2020-06-23","arxiv_id":"2006.12724","n_code_links":0,"syntology":null},{"paper":null,"slug":"exact-support-recovery-in-federated","title":"Exact Support Recovery in Federated Regression with One-shot Communication","date":"2020-06-22","arxiv_id":"2006.12583","n_code_links":0,"syntology":null},{"paper":null,"slug":"learned-uncertainty-aware-luna-bases-for","title":"Uncertainty-Aware (UNA) Bases for Deep Bayesian Regression Using Multi-Headed Auxiliary Networks","date":"2020-06-21","arxiv_id":"2006.11695","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-different-machine-learning","title":"Evaluating Different Machine Learning Techniques as Surrogate for Low Voltage Grids","date":"2020-06-19","arxiv_id":"2006.12389","n_code_links":0,"syntology":null},{"paper":"/paper/transfer-learning-for-high-dimensional-linear","slug":"transfer-learning-for-high-dimensional-linear","title":"Transfer Learning for High-dimensional Linear Regression: Prediction, Estimation, and Minimax Optimality","date":"2020-06-18","arxiv_id":"2006.10593","n_code_links":1,"syntology":null},{"paper":null,"slug":"least-squares-regression-with-markovian-data","title":"Least Squares Regression with Markovian Data: Fundamental Limits and Algorithms","date":"2020-06-16","arxiv_id":"2006.08916","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-reflectron-exploiting-geometry-for","title":"The role of optimization geometry in single neuron learning","date":"2020-06-15","arxiv_id":"2006.08575","n_code_links":0,"syntology":null},{"paper":null,"slug":"sub-seasonal-climate-forecasting-via-machine","title":"Sub-Seasonal Climate Forecasting via Machine Learning: Challenges, Analysis, and Advances","date":"2020-06-14","arxiv_id":"2006.07972","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-statistical-cost-of-robust-kernel","title":"The Statistical Cost of Robust Kernel Hyperparameter Tuning","date":"2020-06-14","arxiv_id":"2006.08035","n_code_links":0,"syntology":null},{"paper":null,"slug":"double-double-descent-on-generalization","title":"Double Double Descent: On Generalization Errors in Transfer Learning between Linear Regression Tasks","date":"2020-06-12","arxiv_id":"2006.07002","n_code_links":0,"syntology":null},{"paper":null,"slug":"pac-bayes-unleashed-generalisation-bounds","title":"PAC-Bayes unleashed: generalisation bounds with unbounded losses","date":"2020-06-12","arxiv_id":"2006.07279","n_code_links":0,"syntology":null},{"paper":null,"slug":"multiplicative-noise-and-heavy-tails-in","title":"Multiplicative noise and heavy tails in stochastic optimization","date":"2020-06-11","arxiv_id":"2006.06293","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-recovery-by-reduced-variance","title":"Sparse recovery by reduced variance stochastic approximation","date":"2020-06-11","arxiv_id":"2006.06365","n_code_links":0,"syntology":null},{"paper":null,"slug":"distribution-regression-for-continuous-time","title":"Distribution Regression for Sequential Data","date":"2020-06-10","arxiv_id":"2006.05805","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-uniform-convergence-and-low-norm","title":"On Uniform Convergence and Low-Norm Interpolation Learning","date":"2020-06-10","arxiv_id":"2006.05942","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-grouped-variable-selection-using","title":"Robust Grouped Variable Selection Using Distributionally Robust Optimization","date":"2020-06-10","arxiv_id":"2006.06094","n_code_links":0,"syntology":null},{"paper":null,"slug":"robustified-multivariate-regression-and","title":"Robustified Multivariate Regression and Classification Using Distributionally Robust Optimization under the Wasserstein Metric","date":"2020-06-10","arxiv_id":"2006.06090","n_code_links":0,"syntology":null},{"paper":null,"slug":"homomorphic-sensing-of-subspace-arrangements","title":"Homomorphic Sensing of Subspace Arrangements","date":"2020-06-09","arxiv_id":"2006.05158","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-geometric-look-at-double-descent-risk","title":"Double Descent Risk and Volume Saturation Effects: A Geometric Perspective","date":"2020-06-08","arxiv_id":"2006.04366","n_code_links":0,"syntology":null},{"paper":"/paper/the-heavy-tail-phenomenon-in-sgd","slug":"the-heavy-tail-phenomenon-in-sgd","title":"The Heavy-Tail Phenomenon in SGD","date":"2020-06-08","arxiv_id":"2006.04740","n_code_links":1,"syntology":null},{"paper":null,"slug":"inject-machine-learning-into-significance","title":"Inject Machine Learning into Significance Test for Misspecified Linear Models","date":"2020-06-04","arxiv_id":"2006.03167","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-minimax-optimality-of-the-em-algorithm","title":"On the Minimax Optimality of the EM Algorithm for Learning Two-Component Mixed Linear Regression","date":"2020-06-04","arxiv_id":"2006.02601","n_code_links":0,"syntology":null},{"paper":"/paper/ue-throughput-guaranteed-small-cell-on-off","slug":"ue-throughput-guaranteed-small-cell-on-off","title":"UE throughput guaranteed small cell on /off algorithm with machine learning","date":"2020-06-03","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":null,"slug":"on-lower-bounds-for-the-bias-variance-trade","title":"On lower bounds for the bias-variance trade-off","date":"2020-05-30","arxiv_id":"2006.00278","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-how-to-learn-within-an-lsm-based-key","title":"From WiscKey to Bourbon: A Learned Index for Log-Structured Merge Trees","date":"2020-05-28","arxiv_id":"2005.14213","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-estimation-via-generalized-quasi","title":"Robust estimation via generalized quasi-gradients","date":"2020-05-28","arxiv_id":"2005.14073","n_code_links":0,"syntology":null},{"paper":null,"slug":"review-of-mathematical-frameworks-for","title":"Review of Mathematical frameworks for Fairness in Machine Learning","date":"2020-05-26","arxiv_id":"2005.13755","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-algorithm-using-component-wise-adaptive","title":"Component-wise Adaptive Trimming For Robust Mixture Regression","date":"2020-05-23","arxiv_id":"2005.11599","n_code_links":0,"syntology":null},{"paper":null,"slug":"blaze-blazing-fast-privacy-preserving-machine","title":"BLAZE: Blazing Fast Privacy-Preserving Machine Learning","date":"2020-05-18","arxiv_id":"2005.09042","n_code_links":0,"syntology":null},{"paper":null,"slug":"nested-model-averaging-on-solution-path-for","title":"Nested Model Averaging on Solution Path for High-dimensional Linear Regression","date":"2020-05-16","arxiv_id":"2005.08057","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-rate-annealing-can-provably-help","title":"Learning Rate Annealing Can Provably Help Generalization, Even for Convex Problems","date":"2020-05-15","arxiv_id":"2005.07360","n_code_links":0,"syntology":null}],"record_sha256":"5f54d89e04c25ebf1a272708678d8a6dec32361504540ea1ad83132bc6b2672c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}