{"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":"/task/l2-regularization/papers/2","list_of":"/task/l2-regularization","task":"L2 Regularization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,128],"of":128,"counts":{"archive_papers_tagged":128,"with_a_code_link":32,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":128,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":4,"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":"/task/l2-regularization","prev":"/task/l2-regularization","next":null,"papers":[{"url":null,"slug":"dynamic-long-short-term-memory-neural-network","title":"dynamic Long Short-Term Memory Neural-Network-Based Indict Remaining-Useful-Life Prognosis for Satellite Lithium-ion Battery","date":"2018-11-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-adaptive-l2-regularization-image","title":"Edge-adaptive l2 regularization image reconstruction from non-uniform Fourier data","date":"2018-11-20","arxiv_id":"1811.08487","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-coherent-strong-regularization-for","title":"Gradient-Coherent Strong Regularization for Deep Neural Networks","date":"2018-11-20","arxiv_id":"1811.08056","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-low-precision-deep-neural-networks","title":"Learning Sparse Low-Precision Neural Networks With Learnable Regularization","date":"2018-09-01","arxiv_id":"1809.00095","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-angle-on-l2-regularization","title":"A New Angle on L2 Regularization","date":"2018-06-28","arxiv_id":"1806.11186","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-of-nonnegativity-constrained","title":"Deep Learning of Nonnegativity-Constrained Autoencoders for Enhanced Understanding of Data","date":"2018-01-31","arxiv_id":"1802.00003","repositories_listed":0,"syntology":null},{"url":null,"slug":"attentive-recurrent-tensor-model-for","title":"Attentive Recurrent Tensor Model for Community Question Answering","date":"2018-01-21","arxiv_id":"1801.06792","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-strong-regularization-for-deep","title":"Achieving Strong Regularization for Deep Neural Networks","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-parameter-tying-in-neural-networks","title":"Automatic Parameter Tying in Neural Networks","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pricing-football-players-using-neural","title":"Pricing Football Players using Neural Networks","date":"2017-11-16","arxiv_id":"1711.05865","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-fusion-on-motion-and-magnetic-sensors","title":"Data Fusion on Motion and Magnetic Sensors embedded on Mobile Devices for the Identification of Activities of Daily Living","date":"2017-10-31","arxiv_id":"1711.07328","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressing-low-precision-deep-neural","title":"Compressing Low Precision Deep Neural Networks Using Sparsity-Induced Regularization in Ternary Networks","date":"2017-09-19","arxiv_id":"1709.06262","repositories_listed":0,"syntology":null},{"url":"/paper/revisiting-activation-regularization-for","slug":"revisiting-activation-regularization-for","title":"Revisiting Activation Regularization for Language RNNs","date":"2017-08-03","arxiv_id":"1708.01009","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularization-techniques-for-fine-tuning-in","title":"Regularization techniques for fine-tuning in neural machine translation","date":"2017-07-31","arxiv_id":"1707.09920","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-end-to-end-speech-recognition","title":"Attention-Based End-to-End Speech Recognition on Voice Search","date":"2017-07-22","arxiv_id":"1707.07167","repositories_listed":0,"syntology":null},{"url":null,"slug":"l2-regularization-versus-batch-and-weight","title":"L2 Regularization versus Batch and Weight Normalization","date":"2017-06-16","arxiv_id":"1706.05350","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-evolution-of-convolutional-neural","title":"Large Scale Evolution of Convolutional Neural Networks Using Volunteer Computing","date":"2017-03-15","arxiv_id":"1703.05422","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-method-for-finding-sparse-solutions-to","title":"Robust method for finding sparse solutions to linear inverse problems using an L2 regularization","date":"2017-01-03","arxiv_id":"1701.00573","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-representation-for-icu-mortality","title":"Feature Representation for ICU Mortality","date":"2015-12-16","arxiv_id":"1512.05294","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-better-understanding-of-predict-and","title":"Towards a Better Understanding of Predict and Count Models","date":"2015-11-06","arxiv_id":"1511.02024","repositories_listed":0,"syntology":null},{"url":null,"slug":"to-drop-or-not-to-drop-robustness-consistency","title":"To Drop or Not to Drop: Robustness, Consistency and Differential Privacy Properties of Dropout","date":"2015-03-06","arxiv_id":"1503.02031","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-encourages-dropout","title":"A Bayesian encourages dropout","date":"2014-12-22","arxiv_id":"1412.7003","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-discovery-and-optimization-of-parts","title":"Automatic Discovery and Optimization of Parts for Image Classification","date":"2014-12-20","arxiv_id":"1412.6598","repositories_listed":0,"syntology":null},{"url":null,"slug":"action-classification-with-locality","title":"Action Classification with Locality-constrained Linear Coding","date":"2014-08-17","arxiv_id":"1408.3810","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-distributed-learning-algorithm","title":"An efficient distributed learning algorithm based on effective local functional approximations","date":"2013-10-31","arxiv_id":"1310.8418","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-dependent-sample-complexity-of","title":"Distribution-Dependent Sample Complexity of Large Margin Learning","date":"2012-04-05","arxiv_id":"1204.1276","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-sample-complexity-of-large-margin","title":"Tight Sample Complexity of Large-Margin Learning","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-policy-iteration","title":"Regularized Policy Iteration","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"36cffaf9d3fd7220e3488188b28116d9792e1f17a08fb0a7238ac6241c5ffab6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}