{"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/huber-loss","slug":"huber-loss","name":"Huber loss","full_name":"Huber loss","full_name_withheld":false,"description_markdown":"The Huber loss function describes the penalty incurred by an estimation procedure f. Huber (1964) defines the loss function piecewise by[1]\r\n\r\n    L δ ( a ) = { 1 2 a 2 for  | a | ≤ δ , δ ⋅ ( | a | − 1 2 δ ) , otherwise. {\\displaystyle L_{\\delta }(a)={\\begin{cases}{\\frac {1}{2}}{a^{2}}&{\\text{for }}|a|\\leq \\delta ,\\\\\\delta \\cdot \\left(|a|-{\\frac {1}{2}}\\delta \\right),&{\\text{otherwise.}}\\end{cases}}}\r\n\r\nThis function is quadratic for small values of a, and linear for large values, with equal values and slopes of the different sections at the two points where | a | = δ |a|=\\delta . The variable a often refers to the residuals, that is to the difference between the observed and predicted values a = y − f ( x ) a=y-f(x), so the former can be expanded to[2]\r\n\r\n    L δ ( y , f ( x ) ) = { 1 2 ( y − f ( x ) ) 2 for  | y − f ( x ) | ≤ δ , δ   ⋅ ( | y − f ( x ) | − 1 2 δ ) , otherwise. {\\displaystyle L_{\\delta }(y,f(x))={\\begin{cases}{\\frac {1}{2}}(y-f(x))^{2}&{\\text{for }}|y-f(x)|\\leq \\delta ,\\\\\\delta \\ \\cdot \\left(|y-f(x)|-{\\frac {1}{2}}\\delta \\right),&{\\text{otherwise.}}\\end{cases}}}\r\n\r\nThe Huber loss is the convolution of the absolute value function with the rectangular function, scaled and translated. Thus it \"smoothens out\" the former's corner at the origin. \r\n\r\n.. math::\r\n        \\ell(x, y) = L = \\{l_1, ..., l_N\\}^T\r\n\r\n    with\r\n\r\n    .. math::\r\n        l_n = \\begin{cases}\r\n        0.5 (x_n - y_n)^2, & \\text{if } |x_n - y_n| < delta \\\\\r\n        delta * (|x_n - y_n| - 0.5 * delta), & \\text{otherwise }\r\n        \\end{cases}","description_state":"present","introduced_year":null,"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":"Loss Functions","url":"/methods/category/loss-functions","pwc_aliases":[]}],"n_papers_tagged":77,"archive_num_papers":77,"papers_newest_first":[{"paper":null,"slug":"shore-a-long-term-user-lifetime-value","title":"SHORE: A Long-term User Lifetime Value Prediction Model in Digital Games","date":"2025-06-12","arxiv_id":"2506.10487","n_code_links":0,"syntology":null},{"paper":"/paper/heavy-lasso-sparse-penalized-regression-under","slug":"heavy-lasso-sparse-penalized-regression-under","title":"Heavy Lasso: sparse penalized regression under heavy-tailed noise via data-augmented soft-thresholding","date":"2025-06-09","arxiv_id":"2506.07790","n_code_links":1,"syntology":null},{"paper":null,"slug":"differentially-private-sparse-linear","title":"Differentially Private Sparse Linear Regression with Heavy-tailed Responses","date":"2025-06-07","arxiv_id":"2506.06861","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-surrogate-model-for-the-forward-design-of","title":"A Surrogate Model for the Forward Design of Multi-layered Metasurface-based Radar Absorbing Structures","date":"2025-05-14","arxiv_id":"2505.09251","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-piecewise-lyapunov-analysis-of-sub","title":"A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regression","date":"2025-04-11","arxiv_id":"2504.08178","n_code_links":0,"syntology":null},{"paper":null,"slug":"asymptotics-of-non-convex-generalized-linear","title":"Asymptotics of Non-Convex Generalized Linear Models in High-Dimensions: A proof of the replica formula","date":"2025-02-27","arxiv_id":"2502.20003","n_code_links":0,"syntology":null},{"paper":null,"slug":"explainable-ai-based-system-for-supply-air","title":"Explainable AI based System for Supply Air Temperature Forecast","date":"2025-01-09","arxiv_id":"2501.05163","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-sparse-regression-with-non-isotropic","title":"Robust Sparse Regression with Non-Isotropic Designs","date":"2024-10-31","arxiv_id":"2410.23937","n_code_links":0,"syntology":null},{"paper":null,"slug":"residual-based-adaptive-huber-loss-rahl","title":"Residual-based Adaptive Huber Loss (RAHL) -- Design of an improved Huber loss for CQI prediction in 5G networks","date":"2024-08-27","arxiv_id":"2408.14718","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-huber-loss-minimization-approach-to-mean","title":"A Huber Loss Minimization Approach to Mean Estimation under User-level Differential Privacy","date":"2024-05-22","arxiv_id":"2405.13453","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-deep-learning-from-weakly-dependent","title":"Robust deep learning from weakly dependent data","date":"2024-05-08","arxiv_id":"2405.05081","n_code_links":0,"syntology":null},{"paper":null,"slug":"h-consistency-guarantees-for-regression","title":"$H$-Consistency Guarantees for Regression","date":"2024-03-28","arxiv_id":"2403.19480","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-framework-for-gradient-based","title":"A Unified Framework for Center-based Clustering of Distributed Data","date":"2024-02-02","arxiv_id":"2402.01302","n_code_links":0,"syntology":null},{"paper":"/paper/a-robust-quantile-huber-loss-with","slug":"a-robust-quantile-huber-loss-with","title":"A Robust Quantile Huber Loss With Interpretable Parameter Adjustment In Distributional Reinforcement Learning","date":"2024-01-04","arxiv_id":"2401.02325","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-non-parametric-knowledge-based","title":"Robust Non-parametric Knowledge-based Diffusion Least Mean Squares over Adaptive Networks","date":"2023-12-03","arxiv_id":"2312.01299","n_code_links":0,"syntology":null},{"paper":"/paper/towards-robust-offline-reinforcement-learning","slug":"towards-robust-offline-reinforcement-learning","title":"Towards Robust Offline Reinforcement Learning under Diverse Data Corruption","date":"2023-10-19","arxiv_id":"2310.12955","n_code_links":2,"syntology":{"ran":5,"of":9,"n_ran_checked":3,"n_instrument":2,"unverified":4,"pointer_only":9,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["yangrui2015/riql"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":null,"slug":"a-dual-latent-state-learning-approach","title":"Dual Latent State Learning: Exploiting Regional Network Similarities for QoS Prediction","date":"2023-10-07","arxiv_id":"2310.05988","n_code_links":0,"syntology":null},{"paper":null,"slug":"high-dimensional-robust-regression-under","title":"High-dimensional robust regression under heavy-tailed data: Asymptotics and Universality","date":"2023-09-28","arxiv_id":"2309.16476","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-huber-loss-minimization-approach-to","title":"A Huber Loss Minimization Approach to Byzantine Robust Federated Learning","date":"2023-08-24","arxiv_id":"2308.12581","n_code_links":0,"syntology":null},{"paper":null,"slug":"machine-learning-in-parameter-estimation-of","title":"Machine learning in parameter estimation of nonlinear systems","date":"2023-08-23","arxiv_id":"2308.12393","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-task-pseudo-label-learning-for-non","title":"Multi-Task Pseudo-Label Learning for Non-Intrusive Speech Quality Assessment Model","date":"2023-08-18","arxiv_id":"2308.09262","n_code_links":0,"syntology":null},{"paper":null,"slug":"investigating-the-edge-of-stability","title":"Investigating the Edge of Stability Phenomenon in Reinforcement Learning","date":"2023-07-09","arxiv_id":"2307.04210","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/asymptotic-characterisation-of-robust","slug":"asymptotic-characterisation-of-robust","title":"Asymptotic Characterisation of Robust Empirical Risk Minimisation Performance in the Presence of Outliers","date":"2023-05-30","arxiv_id":"2305.18974","n_code_links":1,"syntology":null},{"paper":null,"slug":"distributional-reinforcement-learning-with-6","title":"Distributional Reinforcement Learning with Dual Expectile-Quantile Regression","date":"2023-05-26","arxiv_id":"2305.16877","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-nonparametric-regression-under","title":"Robust Nonparametric Regression under Poisoning Attack","date":"2023-05-26","arxiv_id":"2305.16771","n_code_links":0,"syntology":null},{"paper":null,"slug":"computationally-efficient-and-statistically-1","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","date":"2023-05-10","arxiv_id":"2305.06199","n_code_links":0,"syntology":null},{"paper":null,"slug":"directly-optimizing-iou-for-bounding-box","title":"Directly Optimizing IoU for Bounding Box Localization","date":"2023-04-14","arxiv_id":"2304.07256","n_code_links":0,"syntology":null},{"paper":"/paper/robust-convex-biclustering-with-a-tuning-free","slug":"robust-convex-biclustering-with-a-tuning-free","title":"Robust convex biclustering with a tuning-free method","date":"2022-12-06","arxiv_id":"2212.03122","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-learning-for-inflexible-multi-asset","title":"Inflexible Multi-Asset Hedging of incomplete market","date":"2022-11-02","arxiv_id":"2211.00948","n_code_links":0,"syntology":null},{"paper":"/paper/deqgan-learning-the-loss-function-for-pinns","slug":"deqgan-learning-the-loss-function-for-pinns","title":"DEQGAN: Learning the Loss Function for PINNs with Generative Adversarial Networks","date":"2022-09-15","arxiv_id":"2209.07081","n_code_links":1,"syntology":null},{"paper":null,"slug":"statistical-properties-of-the-log-cosh-loss","title":"Statistical Properties of the log-cosh Loss Function Used in Machine Learning","date":"2022-08-09","arxiv_id":"2208.04564","n_code_links":0,"syntology":null},{"paper":null,"slug":"sharp-constants-in-uniformity-testing-via-the","title":"Sharp Constants in Uniformity Testing via the Huber Statistic","date":"2022-06-21","arxiv_id":"2206.10722","n_code_links":0,"syntology":null},{"paper":null,"slug":"introducing-the-huber-mechanism-for","title":"Introducing the Huber mechanism for differentially private low-rank matrix completion","date":"2022-06-16","arxiv_id":"2206.07910","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-matrix-completion-with-heavy-tailed","title":"Robust Matrix Completion with Heavy-tailed Noise","date":"2022-06-09","arxiv_id":"2206.04276","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-losses-for-learning-value-functions-1","title":"Robust Losses for Learning Value Functions","date":"2022-05-17","arxiv_id":"2205.08464","n_code_links":0,"syntology":null},{"paper":"/paper/a-huber-loss-based-super-learner-with","slug":"a-huber-loss-based-super-learner-with","title":"A Huber loss-based super learner with applications to healthcare expenditures","date":"2022-05-13","arxiv_id":"2205.06870","n_code_links":1,"syntology":null},{"paper":null,"slug":"re-examining-distillation-for-continual","title":"Re-examining Distillation For Continual Object Detection","date":"2022-04-04","arxiv_id":"2204.01407","n_code_links":0,"syntology":null},{"paper":null,"slug":"how-do-noise-tails-impact-on-deep-relu","title":"How do noise tails impact on deep ReLU networks?","date":"2022-03-20","arxiv_id":"2203.10418","n_code_links":0,"syntology":null},{"paper":null,"slug":"computationally-efficient-and-statistically","title":"Computationally Efficient and Statistically Optimal Robust Low-rank Matrix and Tensor Estimation","date":"2022-03-02","arxiv_id":"2203.00953","n_code_links":0,"syntology":null},{"paper":null,"slug":"nonconvex-extension-of-generalized-huber-loss","title":"Nonconvex Extension of Generalized Huber Loss for Robust Learning and Pseudo-Mode Statistics","date":"2022-02-22","arxiv_id":"2202.11141","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradient-based-clustering","title":"Gradient Based Clustering","date":"2022-02-01","arxiv_id":"2202.00720","n_code_links":0,"syntology":null},{"paper":null,"slug":"probabilistic-regression-with-huber","title":"Probabilistic Regression with Huber Distributions","date":"2021-11-19","arxiv_id":"2111.10296","n_code_links":0,"syntology":null},{"paper":null,"slug":"active-sampling-for-linear-regression-beyond","title":"Active Linear Regression for $\\ell_p$ Norms and Beyond","date":"2021-11-09","arxiv_id":"2111.04888","n_code_links":0,"syntology":null},{"paper":null,"slug":"consistent-estimation-for-pca-and-sparse","title":"Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers","date":"2021-11-04","arxiv_id":"2111.02966","n_code_links":0,"syntology":null},{"paper":null,"slug":"fregan-an-application-of-generative","title":"FREGAN : an application of generative adversarial networks in enhancing the frame rate of videos","date":"2021-11-01","arxiv_id":"2111.01105","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-high-dimensional-regression-with","title":"Robust High-Dimensional Regression with Coefficient Thresholding and its Application to Imaging Data Analysis","date":"2021-09-30","arxiv_id":"2109.14856","n_code_links":0,"syntology":null},{"paper":null,"slug":"finetuning-transformer-models-to-build-asag","title":"Finetuning Transformer Models to Build ASAG System","date":"2021-09-25","arxiv_id":"2109.12300","n_code_links":0,"syntology":null},{"paper":"/paper/cfear-radarodometry-conservative-filtering-1","slug":"cfear-radarodometry-conservative-filtering-1","title":"CFEAR Radarodometry - Conservative Filtering for Efficient and Accurate Radar Odometry","date":"2021-09-16","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":null,"slug":"generalized-huber-loss-for-robust-learning","title":"Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statistics","date":"2021-08-28","arxiv_id":"2108.12627","n_code_links":0,"syntology":null},{"paper":null,"slug":"derivatives-and-residual-distribution-of","title":"Derivatives and residual distribution of regularized M-estimators with application to adaptive tuning","date":"2021-07-11","arxiv_id":"2107.05143","n_code_links":0,"syntology":null},{"paper":null,"slug":"asymptotic-normality-of-robust-m-estimators","title":"Asymptotic normality of robust $M$-estimators with convex penalty","date":"2021-07-08","arxiv_id":"2107.03826","n_code_links":0,"syntology":null},{"paper":null,"slug":"support-estimation-in-high-dimensional","title":"Support estimation in high-dimensional heteroscedastic mean regression","date":"2020-11-03","arxiv_id":"2011.01591","n_code_links":0,"syntology":null},{"paper":null,"slug":"adversarial-robust-low-rank-matrix-estimation","title":"Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion","date":"2020-10-25","arxiv_id":"2010.13018","n_code_links":0,"syntology":null},{"paper":null,"slug":"multiple-pedestrians-and-vehicles-tracking-in","title":"Multiple Pedestrians and Vehicles Tracking in Aerial Imagery: A Comprehensive Study","date":"2020-10-19","arxiv_id":"2010.09689","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":"risk-bounds-for-robust-deep-learning","title":"Risk Bounds for Robust Deep Learning","date":"2020-09-14","arxiv_id":"2009.06202","n_code_links":0,"syntology":null},{"paper":"/paper/unsupervised-learning-of-solutions-to","slug":"unsupervised-learning-of-solutions-to","title":"Unsupervised Learning of Solutions to Differential Equations with Generative Adversarial Networks","date":"2020-07-21","arxiv_id":"2007.11133","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-estimation-with-lasso-when-outputs-are","title":"Robust estimation with Lasso when outputs are adversarially contaminated","date":"2020-04-13","arxiv_id":"2004.05990","n_code_links":0,"syntology":null},{"paper":null,"slug":"dc-distadmm-admm-algorithm-for-contrained","title":"DC-DistADMM: ADMM Algorithm for Constrained Distributed Optimization over Directed Graphs","date":"2020-03-30","arxiv_id":"2003.13742","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-alternative-probabilistic-interpretation","title":"An Alternative Probabilistic Interpretation of the Huber Loss","date":"2019-11-05","arxiv_id":"1911.02088","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-dualization-of-operator-valued-kernel","title":"Duality in RKHSs with Infinite Dimensional Outputs: Application to Robust Losses","date":"2019-10-10","arxiv_id":"1910.04621","n_code_links":0,"syntology":null},{"paper":null,"slug":"deeptio-a-deep-thermal-inertial-odometry-with","title":"DeepTIO: A Deep Thermal-Inertial Odometry with Visual Hallucination","date":"2019-09-16","arxiv_id":"1909.07231","n_code_links":0,"syntology":null},{"paper":"/paper/robusttrend-a-huber-loss-with-a-combined","slug":"robusttrend-a-huber-loss-with-a-combined","title":"RobustTrend: A Huber Loss with a Combined First and Second Order Difference Regularization for Time Series Trend Filtering","date":"2019-06-10","arxiv_id":"1906.03751","n_code_links":1,"syntology":null},{"paper":null,"slug":"stochastic-gradients-for-large-scale-tensor","title":"Stochastic Gradients for Large-Scale Tensor Decomposition","date":"2019-06-04","arxiv_id":"1906.01687","n_code_links":0,"syntology":null},{"paper":null,"slug":"exponentially-modified-gaussian-mixture-model","title":"Exponentially-Modified Gaussian Mixture Model: Applications in Spectroscopy","date":"2019-02-14","arxiv_id":"1902.05601","n_code_links":0,"syntology":null},{"paper":null,"slug":"scale-calibration-for-high-dimensional-robust","title":"Scale calibration for high-dimensional robust regression","date":"2018-11-06","arxiv_id":"1811.02096","n_code_links":0,"syntology":null},{"paper":"/paper/towards-a-zero-one-law-for-entrywise-low-rank","slug":"towards-a-zero-one-law-for-entrywise-low-rank","title":"Towards a Zero-One Law for Column Subset Selection","date":"2018-11-04","arxiv_id":"1811.01442","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-novel-approach-to-quantized-matrix","title":"A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure","date":"2018-10-29","arxiv_id":"1810.12460","n_code_links":0,"syntology":null},{"paper":null,"slug":"approach-for-video-classification-with-multi","title":"Approach for Video Classification with Multi-label on YouTube-8M Dataset","date":"2018-08-27","arxiv_id":"1808.08671","n_code_links":0,"syntology":null},{"paper":null,"slug":"risk-averse-classification","title":"Risk-Averse Classification","date":"2018-04-30","arxiv_id":"1805.00119","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-regularization-of-some-inverse","title":"Adaptive Regularization of Some Inverse Problems in Image Analysis","date":"2017-05-09","arxiv_id":"1705.03350","n_code_links":0,"syntology":null},{"paper":null,"slug":"active-regression-with-adaptive-huber-loss","title":"Active Regression with Adaptive Huber Loss","date":"2016-06-05","arxiv_id":"1606.01568","n_code_links":0,"syntology":null},{"paper":"/paper/deeper-depth-prediction-with-fully","slug":"deeper-depth-prediction-with-fully","title":"Deeper Depth Prediction with Fully Convolutional Residual Networks","date":"2016-06-01","arxiv_id":"1606.00373","n_code_links":18,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["iro-cp/FCRN-DepthPrediction"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/video2gif-automatic-generation-of-animated","slug":"video2gif-automatic-generation-of-animated","title":"Video2GIF: Automatic Generation of Animated GIFs from Video","date":"2016-05-16","arxiv_id":"1605.04850","n_code_links":1,"syntology":null},{"paper":null,"slug":"automatic-inference-of-the-quantile-parameter","title":"Automatic Inference of the Quantile Parameter","date":"2015-11-12","arxiv_id":"1511.03990","n_code_links":0,"syntology":null},{"paper":null,"slug":"semismooth-newton-coordinate-descent","title":"Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression","date":"2015-09-09","arxiv_id":"1509.02957","n_code_links":0,"syntology":null}],"papers_shown":77,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":77,"with_a_code_link":13,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":77,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"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":2,"papers_where_code_ran_first_page":"/method/huber-loss/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/huber-loss/papers/ran/1","json":"/method/huber-loss/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/regression-1","name":"regression","papers":23},{"task":"/task/matrix-completion","name":"Matrix Completion","papers":5},{"task":"/task/quantile-regression","name":"quantile regression","papers":5},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":4},{"task":"/task/prediction","name":"Prediction","papers":3},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":3},{"task":"/task/high","name":"Vocal Bursts Intensity Prediction","papers":3},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":3},{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":2},{"task":"/task/dimensionality-reduction","name":"Dimensionality Reduction","papers":2},{"task":"/task/distributional-reinforcement-learning","name":"Distributional Reinforcement Learning","papers":2},{"task":"/task/classification","name":"General Classification","papers":2},{"task":"/task/low-rank-matrix-completion","name":"Low-Rank Matrix Completion","papers":2},{"task":"/task/multi-task-learning","name":"Multi-Task Learning","papers":2},{"task":"/task/object","name":"Object","papers":2},{"task":"/task/object-detection","name":"Object Detection","papers":2},{"task":"/task/q-learning","name":"Q-Learning","papers":2},{"task":"/task/time-series-1","name":"Time Series","papers":2},{"task":"/task/compressed-sensing","name":"compressed sensing","papers":2}],"tasks_shown":20,"n_tasks":71,"usage_by_year":[{"year":"2015","papers":2},{"year":"2016","papers":3},{"year":"2017","papers":1},{"year":"2018","papers":5},{"year":"2019","papers":6},{"year":"2020","papers":8},{"year":"2021","papers":10},{"year":"2022","papers":14},{"year":"2023","papers":14},{"year":"2024","papers":7},{"year":"2025","papers":7}],"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/huber-loss"},"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=Huber%20loss","read_at":"2026-10-05T00:57:39+00:00","query":"Huber loss","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 'Huber loss' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"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":"04c69a02f214eed301198a430d01f750adf50b2b6074048f8ff5404bfb60e554","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}