{"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/l1-regularization","slug":"l1-regularization","name":"L1 Regularization","full_name":"L1 Regularization","full_name_withheld":false,"description_markdown":"**$L_{1}$ Regularization** is a regularization technique applied to the weights of a neural network. We minimize a loss function compromising both the primary loss function and a penalty on the $L\\_{1}$ Norm of the weights:\r\n\r\n$$L\\_{new}\\left(w\\right) = L\\_{original}\\left(w\\right) + \\lambda{||w||}\\_{1}$$\r\n\r\nwhere $\\lambda$ is a value determining the strength of the penalty. In contrast to [weight decay](https://paperswithcode.com/method/weight-decay), $L_{1}$ regularization promotes sparsity; i.e. some parameters have an optimal value of zero.\r\n\r\nImage Source: [Wikipedia](https://en.wikipedia.org/wiki/Regularization_(mathematics)#/media/File:Sparsityl1.png)","description_state":"present","introduced_year":1986,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Parameter Norm Penalties","url":"/methods/category/parameter-norm-penalties","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Regularization","url":"/methods/category/regularization","pwc_aliases":[]}],"n_papers_tagged":90,"archive_num_papers":90,"papers_newest_first":[{"paper":null,"slug":"preti-patient-aware-retinal-foundation-model","title":"PRETI: Patient-Aware Retinal Foundation Model via Metadata-Guided Representation Learning","date":"2025-05-18","arxiv_id":"2505.12233","n_code_links":0,"syntology":null},{"paper":null,"slug":"spat-sensitivity-based-multihead-attention","title":"SPAT: Sensitivity-based Multihead-attention Pruning on Time Series Forecasting Models","date":"2025-05-13","arxiv_id":"2505.08768","n_code_links":0,"syntology":null},{"paper":null,"slug":"decoding-futures-price-dynamics-a-regularized","title":"Decoding Futures Price Dynamics: A Regularized Sparse Autoencoder for Interpretable Multi-Horizon Forecasting and Factor Discovery","date":"2025-05-11","arxiv_id":"2505.06795","n_code_links":0,"syntology":null},{"paper":"/paper/high-frequency-prior-driven-adaptive-masking","slug":"high-frequency-prior-driven-adaptive-masking","title":"High-Frequency Prior-Driven Adaptive Masking for Accelerating Image Super-Resolution","date":"2025-05-11","arxiv_id":"2505.06975","n_code_links":1,"syntology":null},{"paper":"/paper/bqsched-a-non-intrusive-scheduler-for-batch","slug":"bqsched-a-non-intrusive-scheduler-for-batch","title":"BQSched: A Non-intrusive Scheduler for Batch Concurrent Queries via Reinforcement Learning","date":"2025-04-27","arxiv_id":"2504.19142","n_code_links":1,"syntology":null},{"paper":null,"slug":"from-gaze-to-insight-bridging-human-visual","title":"From Gaze to Insight: Bridging Human Visual Attention and Vision Language Model Explanation for Weakly-Supervised Medical Image Segmentation","date":"2025-04-15","arxiv_id":"2504.11368","n_code_links":0,"syntology":null},{"paper":null,"slug":"nnn-next-generation-neural-networks-for","title":"NNN: Next-Generation Neural Networks for Marketing Measurement","date":"2025-04-08","arxiv_id":"2504.06212","n_code_links":0,"syntology":null},{"paper":null,"slug":"remarks-on-the-polyak-lojasiewicz-inequality","title":"Remarks on the Polyak-Lojasiewicz inequality and the convergence of gradient systems","date":"2025-03-31","arxiv_id":"2503.23641","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-rank-allocation-speeding-up-modern","slug":"adaptive-rank-allocation-speeding-up-modern","title":"Adaptive Rank Allocation: Speeding Up Modern Transformers with RaNA Adapters","date":"2025-03-23","arxiv_id":"2503.18216","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["roberto09/rana"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"al-khwarizmi-discovering-physical-laws-with","title":"Al-Khwarizmi: Discovering Physical Laws with Foundation Models","date":"2025-02-03","arxiv_id":"2502.01702","n_code_links":0,"syntology":null},{"paper":null,"slug":"renewable-energy-prediction-a-comparative","title":"Renewable Energy Prediction: A Comparative Study of Deep Learning Models for Complex Dataset Analysis","date":"2025-01-27","arxiv_id":"2501.15731","n_code_links":0,"syntology":null},{"paper":"/paper/hac-towards-100x-compression-of-3d-gaussian","slug":"hac-towards-100x-compression-of-3d-gaussian","title":"HAC++: Towards 100X Compression of 3D Gaussian Splatting","date":"2025-01-21","arxiv_id":"2501.12255","n_code_links":2,"syntology":null},{"paper":null,"slug":"kryptonite-n-machine-learning-strikes-back","title":"Kryptonite-N: Machine Learning Strikes Back","date":"2024-12-29","arxiv_id":"2412.20588","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-masked-autoencoder-for-video-object","title":"Efficient Masked AutoEncoder for Video Object Counting and A Large-Scale Benchmark","date":"2024-11-20","arxiv_id":"2411.13056","n_code_links":0,"syntology":null},{"paper":null,"slug":"carbon-price-fluctuation-prediction-using","title":"Carbon price fluctuation prediction using blockchain information A new hybrid machine learning approach","date":"2024-11-05","arxiv_id":"2411.02709","n_code_links":0,"syntology":null},{"paper":"/paper/eh-mam-easy-to-hard-masked-acoustic-modeling","slug":"eh-mam-easy-to-hard-masked-acoustic-modeling","title":"EH-MAM: Easy-to-Hard Masked Acoustic Modeling for Self-Supervised Speech Representation Learning","date":"2024-10-17","arxiv_id":"2410.13179","n_code_links":1,"syntology":{"ran":6,"of":10,"n_ran_checked":6,"n_instrument":0,"unverified":4,"pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["cs20s030/ehmam"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"defending-membership-inference-attacks-via","title":"Defending Membership Inference Attacks via Privacy-aware Sparsity Tuning","date":"2024-10-09","arxiv_id":"2410.06814","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-masking-enhances-visual-grounding","title":"Adaptive Masking Enhances Visual Grounding","date":"2024-10-04","arxiv_id":"2410.03161","n_code_links":0,"syntology":null},{"paper":"/paper/pre-training-on-high-definition-x-ray-images","slug":"pre-training-on-high-definition-x-ray-images","title":"Pre-training on High Definition X-ray Images: An Experimental Study","date":"2024-04-27","arxiv_id":"2404.17926","n_code_links":1,"syntology":null},{"paper":null,"slug":"salience-based-adaptive-masking-revisiting","title":"Salience-Based Adaptive Masking: Revisiting Token Dynamics for Enhanced Pre-training","date":"2024-04-12","arxiv_id":"2404.08327","n_code_links":0,"syntology":null},{"paper":"/paper/sparse-concept-bottleneck-models-gumbel","slug":"sparse-concept-bottleneck-models-gumbel","title":"Sparse Concept Bottleneck Models: Gumbel Tricks in Contrastive Learning","date":"2024-04-04","arxiv_id":"2404.03323","n_code_links":2,"syntology":null},{"paper":null,"slug":"retentive-decision-transformer-with-adaptive","title":"Retentive Decision Transformer with Adaptive Masking for Reinforcement Learning based Recommendation Systems","date":"2024-03-26","arxiv_id":"2403.17634","n_code_links":0,"syntology":null},{"paper":"/paper/hac-hash-grid-assisted-context-for-3d","slug":"hac-hash-grid-assisted-context-for-3d","title":"HAC: Hash-grid Assisted Context for 3D Gaussian Splatting Compression","date":"2024-03-21","arxiv_id":"2403.14530","n_code_links":2,"syntology":null},{"paper":null,"slug":"exploiting-adaptive-contextual-masking-for","title":"Exploiting Adaptive Contextual Masking for Aspect-Based Sentiment Analysis","date":"2024-02-21","arxiv_id":"2402.13722","n_code_links":0,"syntology":null},{"paper":"/paper/manipulating-sparse-double-descent","slug":"manipulating-sparse-double-descent","title":"Manipulating Sparse Double Descent","date":"2024-01-19","arxiv_id":"2401.10686","n_code_links":1,"syntology":null},{"paper":"/paper/a-novel-hybrid-time-varying-graph-neural","slug":"a-novel-hybrid-time-varying-graph-neural","title":"A novel hybrid time-varying graph neural network for traffic flow forecasting","date":"2024-01-17","arxiv_id":"2401.10155","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-sparse-regression-lp-regularization-and","title":"On sparse regression, Lp-regularization, and automated model discovery","date":"2023-10-09","arxiv_id":"2310.06872","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-asr-pathways-an-adaptive-masking","title":"Dynamic ASR Pathways: An Adaptive Masking Approach Towards Efficient Pruning of A Multilingual ASR Model","date":"2023-09-22","arxiv_id":"2309.13018","n_code_links":0,"syntology":null},{"paper":null,"slug":"amlp-adaptive-masking-lesion-patches-for-self","title":"AMLP:Adaptive Masking Lesion Patches for Self-supervised Medical Image Segmentation","date":"2023-09-08","arxiv_id":"2309.04312","n_code_links":0,"syntology":null},{"paper":null,"slug":"sdr-gain-a-high-real-time-occluded-pedestrian","title":"SDR-GAIN: A High Real-Time Occluded Pedestrian Pose Completion Method for Autonomous Driving","date":"2023-06-06","arxiv_id":"2306.03538","n_code_links":0,"syntology":null},{"paper":"/paper/amom-adaptive-masking-over-masking-for","slug":"amom-adaptive-masking-over-masking-for","title":"AMOM: Adaptive Masking over Masking for Conditional Masked Language Model","date":"2023-03-13","arxiv_id":"2303.07457","n_code_links":1,"syntology":null},{"paper":null,"slug":"mps-ams-masked-patches-selection-and-adaptive","title":"MPS-AMS: Masked Patches Selection and Adaptive Masking Strategy Based Self-Supervised Medical Image Segmentation","date":"2023-02-27","arxiv_id":"2302.13699","n_code_links":0,"syntology":null},{"paper":"/paper/revisiting-pre-training-in-audio-visual","slug":"revisiting-pre-training-in-audio-visual","title":"Revisiting Pre-training in Audio-Visual Learning","date":"2023-02-07","arxiv_id":"2302.03533","n_code_links":1,"syntology":null},{"paper":null,"slug":"hat-gae-self-supervised-graph-auto-encoders","title":"HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption","date":"2023-01-28","arxiv_id":"2301.12063","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-neural-networks-with-skip-connections","title":"Sparse neural networks with skip-connections for identification of aluminum electrolysis cell","date":"2023-01-02","arxiv_id":"2301.00582","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalized-deep-learning-based-proximal","title":"Generalized Deep Learning-based Proximal Gradient Descent for MR Reconstruction","date":"2022-11-30","arxiv_id":"2211.16881","n_code_links":0,"syntology":null},{"paper":"/paper/adamae-adaptive-masking-for-efficient","slug":"adamae-adaptive-masking-for-efficient","title":"AdaMAE: Adaptive Masking for Efficient Spatiotemporal Learning with Masked Autoencoders","date":"2022-11-16","arxiv_id":"2211.09120","n_code_links":2,"syntology":{"ran":18,"of":25,"n_ran_checked":13,"n_instrument":5,"unverified":7,"pointer_only":6,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","official":{"repos":["wgcban/adamae"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/clarinet-a-music-retrieval-system","slug":"clarinet-a-music-retrieval-system","title":"Clarinet: A Music Retrieval System","date":"2022-10-23","arxiv_id":"2210.12648","n_code_links":1,"syntology":null},{"paper":null,"slug":"sparse-deep-neural-networks-for-modeling","title":"Sparse deep neural networks for modeling aluminum electrolysis dynamics","date":"2022-09-13","arxiv_id":"2209.05832","n_code_links":0,"syntology":null},{"paper":"/paper/an-efficiency-study-for-splade-models","slug":"an-efficiency-study-for-splade-models","title":"An Efficiency Study for SPLADE Models","date":"2022-07-08","arxiv_id":"2207.03834","n_code_links":1,"syntology":null},{"paper":"/paper/unsupervised-representation-learning-of-2","slug":"unsupervised-representation-learning-of-2","title":"Unsupervised Representation Learning of Player Behavioral Data with Confidence Guided Masking","date":"2022-04-25","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"nonlinear-vrft-with-lasso","title":"Nonlinear VRFT with LASSO","date":"2022-04-01","arxiv_id":"2204.00590","n_code_links":0,"syntology":null},{"paper":null,"slug":"recursive-least-squares-policy-control-with","title":"Recursive Least Squares Policy Control with Echo State Network","date":"2022-01-13","arxiv_id":"2201.04781","n_code_links":0,"syntology":null},{"paper":null,"slug":"probabilistic-fine-tuning-of-pruning-masks","title":"Probabilistic fine-tuning of pruning masks and PAC-Bayes self-bounded learning","date":"2021-10-22","arxiv_id":"2110.11804","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-proxy-anchor-loss-and-effectiveness-of","title":"Multi Proxy Anchor Family Loss for Several Types of Gradients","date":"2021-10-08","arxiv_id":"2110.03997","n_code_links":0,"syntology":null},{"paper":"/paper/generative-pre-training-from-molecules","slug":"generative-pre-training-from-molecules","title":"Generative Pre-Training from Molecules","date":"2021-09-16","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"doubly-robust-estimation-with-machine","title":"Normalized Augmented Inverse Probability Weighting with Neural Network Predictions","date":"2021-08-03","arxiv_id":"2108.01768","n_code_links":0,"syntology":null},{"paper":"/paper/combining-machine-learning-classifiers-for","slug":"combining-machine-learning-classifiers-for","title":"Combining Machine Learning Classifiers for Stock Trading with Effective Feature Extraction","date":"2021-07-28","arxiv_id":"2107.13148","n_code_links":1,"syntology":null},{"paper":"/paper/self-attention-between-datapoints-going","slug":"self-attention-between-datapoints-going","title":"Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learning","date":"2021-06-04","arxiv_id":"2106.02584","n_code_links":3,"syntology":{"ran":22,"of":30,"n_ran_checked":20,"n_instrument":2,"unverified":8,"pointer_only":0,"phrase":"22 ran (of which 4 constructed an object rather than computing a result; 20 with no instrument failure: 2 honoured, 1 violated, 17 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","official":{"repos":["OATML/Non-Parametric-Transformers"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/characterizing-the-slope-trade-off-a","slug":"characterizing-the-slope-trade-off-a","title":"Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit","date":"2021-05-27","arxiv_id":"2105.13302","n_code_links":1,"syntology":null},{"paper":"/paper/building-reliable-explanations-of-unreliable","slug":"building-reliable-explanations-of-unreliable","title":"Building Reliable Explanations of Unreliable Neural Networks: Locally Smoothing Perspective of Model Interpretation","date":"2021-03-26","arxiv_id":"2103.14332","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 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["JBNU-VL/RelEx"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"channel-scaling-a-scale-and-select-approach","title":"Channel Scaling: A Scale-and-Select Approach for Transfer Learning","date":"2021-03-22","arxiv_id":"2103.12228","n_code_links":0,"syntology":null},{"paper":null,"slug":"uncertainty-maximization-in-partially","title":"Uncertainty Maximization in Partially Observable Domains: A Cognitive Perspective","date":"2021-02-22","arxiv_id":"2102.11232","n_code_links":0,"syntology":null},{"paper":"/paper/scaling-up-exact-neural-network-compression","slug":"scaling-up-exact-neural-network-compression","title":"Scaling Up Exact Neural Network Compression by ReLU Stability","date":"2021-02-15","arxiv_id":"2102.07804","n_code_links":1,"syntology":{"ran":3,"of":8,"n_ran_checked":1,"n_instrument":2,"unverified":5,"pointer_only":8,"phrase":"3 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; 2 where Syntology's instrument failed) · 5 unverified","official":{"repos":["yuxwind/ExactCompression"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"spectrum-attention-mechanism-for-time-series","title":"Spectrum Attention Mechanism for Time Series Classification","date":"2021-01-25","arxiv_id":"2101.10420","n_code_links":0,"syntology":null},{"paper":"/paper/neuron-level-structured-pruning-using","slug":"neuron-level-structured-pruning-using","title":"Neuron-level Structured Pruning using Polarization Regularizer","date":"2020-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"layer-pruning-via-fusible-residual","title":"Layer Pruning via Fusible Residual Convolutional Block for Deep Neural Networks","date":"2020-11-29","arxiv_id":"2011.14356","n_code_links":0,"syntology":null},{"paper":"/paper/learning-from-a-complementary-label-source","slug":"learning-from-a-complementary-label-source","title":"Learning from a Complementary-label Source Domain: Theory and Algorithms","date":"2020-08-04","arxiv_id":"2008.01454","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["Yiyang98/BFUDA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/clarinet-a-one-step-approach-towards-budget","slug":"clarinet-a-one-step-approach-towards-budget","title":"Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation","date":"2020-07-29","arxiv_id":"2007.14612","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["Yiyang98/BFUDA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"graph-neural-networks-including-sparse","title":"Graph Neural Networks Including Sparse Interpretability","date":"2020-06-30","arxiv_id":"2007.00119","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-double-side-learning-ensemble-model-for","title":"Deep Double-Side Learning Ensemble Model for Few-Shot Parkinson Speech Recognition","date":"2020-06-20","arxiv_id":"2006.11593","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-embedded-deep-stacked-sparse","title":"Hybrid Embedded Deep Stacked Sparse Autoencoder with w_LPPD SVM Ensemble","date":"2020-02-17","arxiv_id":"2002.06761","n_code_links":0,"syntology":null},{"paper":"/paper/artificial-neural-networks-for-cloud-masking","slug":"artificial-neural-networks-for-cloud-masking","title":"Artificial neural networks for cloud masking of Sentinel-2 ocean images with noise and sunglint","date":"2020-01-26","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"lossless-compression-of-deep-neural-networks","title":"Lossless Compression of Deep Neural Networks","date":"2020-01-01","arxiv_id":"2001.00218","n_code_links":0,"syntology":null},{"paper":null,"slug":"parallel-neural-text-to-speech-1","title":"Parallel Neural Text-to-Speech","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"relating-lp-regularization-and-reweighted-l1","title":"Relating lp regularization and reweighted l1 regularization","date":"2019-12-02","arxiv_id":"1912.00723","n_code_links":0,"syntology":null},{"paper":"/paper/improving-transformer-models-by-reordering","slug":"improving-transformer-models-by-reordering","title":"Improving Transformer Models by Reordering their Sublayers","date":"2019-11-10","arxiv_id":"1911.03864","n_code_links":2,"syntology":null},{"paper":null,"slug":"identifying-epigenetic-signature-of-breast","title":"Identifying Epigenetic Signature of Breast Cancer with Machine Learning","date":"2019-10-12","arxiv_id":"1910.06899","n_code_links":0,"syntology":null},{"paper":"/paper/mish-a-self-regularized-non-monotonic-neural","slug":"mish-a-self-regularized-non-monotonic-neural","title":"Mish: A Self Regularized Non-Monotonic Activation Function","date":"2019-08-23","arxiv_id":"1908.08681","n_code_links":9,"syntology":{"ran":9,"of":12,"n_ran_checked":7,"n_instrument":2,"unverified":3,"pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["digantamisra98/Mish"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/esports-pro-players-behavior-during-the-game","slug":"esports-pro-players-behavior-during-the-game","title":"eSports Pro-Players Behavior During the Game Events: Statistical Analysis of Data Obtained Using the Smart Chair","date":"2019-08-18","arxiv_id":"1908.06402","n_code_links":1,"syntology":null},{"paper":"/paper/slimyolov3-narrower-faster-and-better-for","slug":"slimyolov3-narrower-faster-and-better-for","title":"SlimYOLOv3: Narrower, Faster and Better for Real-Time UAV Applications","date":"2019-07-25","arxiv_id":"1907.11093","n_code_links":2,"syntology":null},{"paper":null,"slug":"multi-speaker-end-to-end-speech-synthesis","title":"Multi-Speaker End-to-End Speech Synthesis","date":"2019-07-09","arxiv_id":"1907.04462","n_code_links":0,"syntology":null},{"paper":"/paper/augmenting-self-attention-with-persistent","slug":"augmenting-self-attention-with-persistent","title":"Augmenting Self-attention with Persistent Memory","date":"2019-07-02","arxiv_id":"1907.01470","n_code_links":2,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/predicting-epileptic-seizures-using","slug":"predicting-epileptic-seizures-using","title":"Predicting epileptic seizures using nonnegative matrix factorization","date":"2019-06-25","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/parallel-neural-text-to-speech","slug":"parallel-neural-text-to-speech","title":"Non-Autoregressive Neural Text-to-Speech","date":"2019-05-21","arxiv_id":"1905.08459","n_code_links":2,"syntology":{"ran":6,"of":7,"n_ran_checked":4,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/adaptive-attention-span-in-transformers","slug":"adaptive-attention-span-in-transformers","title":"Adaptive Attention Span in Transformers","date":"2019-05-19","arxiv_id":"1905.07799","n_code_links":8,"syntology":null},{"paper":null,"slug":"neural-source-filter-waveform-models-for","title":"Neural source-filter waveform models for statistical parametric speech synthesis","date":"2019-04-27","arxiv_id":"1904.12088","n_code_links":0,"syntology":null},{"paper":null,"slug":"automatic-target-recognition-using","title":"Automatic Target Recognition Using Discrimination Based on Optimal Transport","date":"2019-04-06","arxiv_id":"1904.03534","n_code_links":0,"syntology":null},{"paper":null,"slug":"plit-an-alignment-free-computational-tool-for","title":"PLIT: An alignment-free computational tool for identification of long non-coding RNAs in plant transcriptomic datasets","date":"2019-02-12","arxiv_id":"1902.05064","n_code_links":0,"syntology":null},{"paper":null,"slug":"et-lasso-efficient-tuning-of-lasso-for-high","title":"ET-Lasso: A New Efficient Tuning of Lasso-type Regularization for High-Dimensional Data","date":"2018-10-10","arxiv_id":"1810.04513","n_code_links":0,"syntology":null},{"paper":null,"slug":"wasserstein-autoencoders-for-collaborative","title":"Wasserstein Autoencoders for Collaborative Filtering","date":"2018-09-15","arxiv_id":"1809.05662","n_code_links":0,"syntology":null},{"paper":"/paper/clarinet-parallel-wave-generation-in-end-to","slug":"clarinet-parallel-wave-generation-in-end-to","title":"ClariNet: Parallel Wave Generation in End-to-End Text-to-Speech","date":"2018-07-19","arxiv_id":"1807.07281","n_code_links":5,"syntology":{"ran":10,"of":13,"n_ran_checked":10,"n_instrument":0,"unverified":3,"pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":null,"slug":"doublede-biased-machine-learning-using","title":"De-Biased Machine Learning of Global and Local Parameters Using Regularized Riesz Representers","date":"2018-02-23","arxiv_id":"1802.08667","n_code_links":0,"syntology":null},{"paper":"/paper/deep-voice-3-scaling-text-to-speech-with","slug":"deep-voice-3-scaling-text-to-speech-with","title":"Deep Voice 3: Scaling Text-to-Speech with Convolutional Sequence Learning","date":"2017-10-20","arxiv_id":"1710.07654","n_code_links":7,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"on-parameters-transformations-for-emulating","title":"On parameters transformations for emulating sparse priors using variational-Laplace inference","date":"2017-03-06","arxiv_id":"1703.07168","n_code_links":0,"syntology":null},{"paper":"/paper/vote3deep-fast-object-detection-in-3d-point","slug":"vote3deep-fast-object-detection-in-3d-point","title":"Vote3Deep: Fast Object Detection in 3D Point Clouds Using Efficient Convolutional Neural Networks","date":"2016-09-21","arxiv_id":"1609.06666","n_code_links":0,"syntology":null},{"paper":null,"slug":"convex-optimization-for-non-convex-problems","title":"Convex Optimization For Non-Convex Problems via Column Generation","date":"2016-02-14","arxiv_id":"1602.04409","n_code_links":0,"syntology":null},{"paper":null,"slug":"lass-0-sparse-non-convex-regression-by-local","title":"Lass-0: sparse non-convex regression by local search","date":"2015-11-13","arxiv_id":"1511.04402","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-concave-regularization-technique-for-sparse","title":"A concave regularization technique for sparse mixture models","date":"2011-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"linear-complementarity-for-regularized-policy","title":"Linear Complementarity for Regularized Policy Evaluation and Improvement","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":90,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":90,"with_a_code_link":35,"where_syntology_ran_a_sample":13,"not_listed_spam_title":0,"listed":90,"listed_where_code_ran":13,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":12,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"papers_where_code_ran":13,"papers_where_code_ran_first_page":"/method/l1-regularization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/l1-regularization/papers/ran/1","json":"/method/l1-regularization/papers/ran/1.json","rows":13}],"tasks":[{"task":"/task/representation-learning","name":"Representation Learning","papers":8},{"task":"/task/language-modelling","name":"Language Modelling","papers":7},{"task":"/task/language-modeling","name":"Language Modeling","papers":6},{"task":"/task/feature-selection","name":"feature selection","papers":6},{"task":"/task/l2-regularization","name":"L2 Regularization","papers":4},{"task":"/task/speech-synthesis","name":"Speech Synthesis","papers":4},{"task":"/task/text-to-speech","name":"Text to Speech","papers":4},{"task":"/task/text-to-speech-1","name":"text-to-speech","papers":4},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":3},{"task":"/task/feature-engineering","name":"Feature Engineering","papers":3},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":3},{"task":"/task/medical-image-segmentation","name":"Medical Image Segmentation","papers":3},{"task":"/task/object-detection","name":"Object Detection","papers":3},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":3},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":3},{"task":"/task/speech-recognition","name":"Speech Recognition","papers":3},{"task":"/task/time-series-1","name":"Time Series","papers":3},{"task":"/task/time-series","name":"Time Series Analysis","papers":3},{"task":"/task/translation","name":"Translation","papers":3},{"task":"/task/object-detection-1","name":"object-detection","papers":3}],"tasks_shown":20,"n_tasks":120,"usage_by_year":[{"year":"2010","papers":1},{"year":"2011","papers":1},{"year":"2015","papers":1},{"year":"2016","papers":2},{"year":"2017","papers":2},{"year":"2018","papers":4},{"year":"2019","papers":14},{"year":"2020","papers":10},{"year":"2021","papers":12},{"year":"2022","papers":8},{"year":"2023","papers":9},{"year":"2024","papers":14},{"year":"2025","papers":12}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/l1-regularization"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=L1%20Regularization","read_at":"2026-10-05T00:58:21+00:00","query":"L1 Regularization","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'L1 Regularization' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["l1-APGD","CUDA-L1","L1-Coverage","l1-AutoAttack","FTLE regularization","regularization loss","Path Regularization","cost regularization"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"fe5d575e261fd8c1e50e54c06977beb55b208f521f32675930b08cf1af11c226","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}