Pith. sign in

REVIEW 7 cited by

Statistical Properties of the log-cosh Loss Function Used in Machine Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.04564 v4 pith:NTMPH7SC submitted 2022-08-09 stat.ML cs.LG

Statistical Properties of the log-cosh Loss Function Used in Machine Learning

classification stat.ML cs.LG
keywords functionlosslog-coshquantiledistributionregressionstatisticalasymptotic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper analyzes a popular loss function used in machine learning called the log-cosh loss function. A number of papers have been published using this loss function but, to date, no statistical analysis has been presented in the literature. In this paper, we present the distribution function from which the log-cosh loss arises. We compare it to a similar distribution, called the Cauchy distribution, and carry out various statistical procedures that characterize its properties. In particular, we examine its associated pdf, cdf, likelihood function and Fisher information. Side-by-side we consider the Cauchy and Cosh distributions as well as the MLE of the location parameter with asymptotic bias, asymptotic variance, and confidence intervals. We also provide a comparison of robust estimators from several other loss functions, including the Huber loss function and the rank dispersion function. Further, we examine the use of the log-cosh function for quantile regression. In particular, we identify a quantile distribution function from which a maximum likelihood estimator for quantile regression can be derived. Finally, we compare a quantile M-estimator based on log-cosh with robust monotonicity against another approach to quantile regression based on convolutional smoothing.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Determining star formation histories and age-metallicity relations with convolutional neural networks

    astro-ph.GA 2026-05 unverdicted novelty 7.0

    A CNN with attention and shared latent space recovers SFHs and metallicities from spectro-photometric data with ~0.12 dex age and ~0.03 dex metallicity dispersion while running thousands of times faster than full spec...

  2. Eigenvalue Calibration for Semantic Embeddings of Large Language Models

    cs.LG 2026-07 conditional novelty 6.5

    Temperature scaling of density-matrix eigenvalues from LLM semantic embeddings optimizes proper-score calibration and corrects systematic overconfidence so entropy equals risk.

  3. Transformer-based machine learning using low-level calorimeter signals for collimated photon identification at collider experiments

    hep-ph 2026-07 accept novelty 6.0

    Cell-level Transformers classify collimated ALP photon-jets versus single photons with AUC 0.98 and regress diphoton mass to ~64 MeV, beating shower-shape and other ML baselines in an ATLAS-like GEANT4 simulation.

  4. Spectral Handling and Estimation of AGN Parameters (SHEAP), The first AGN fitting GPU-based code

    astro-ph.GA 2026-06 unverdicted novelty 6.0

    SHEAP introduces a GPU-accelerated JAX framework for AGN spectral decomposition that achieves ~100x speedup over pPXF with 85-100% parameter agreement within 0.3 dex on four test samples.

  5. UniRTL: Unifying Code and Graph for Robust RTL Representation Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    UniRTL unifies RTL code and CDFG through mutual masked modeling and hierarchical training with a graph-aware tokenizer, outperforming prior single-modality methods on performance prediction and code retrieval.

  6. Approximate full-conformal multi-task regression with reproducing kernels

    math.ST 2026-07 unverdicted novelty 5.0

    Constructs a computable approximating prediction region containing the full-conformal one for multi-task kernel regression in vector-valued RKHS, with theoretical volume bound for known covariance and empirical improv...

  7. Alternate loss functions and regression models that achieve robustness to outliers by modulating the learning rate

    cs.LG 2026-06 unverdicted novelty 3.0

    Introduces SRL and SMAE loss functions plus two robust linear regression models that achieve outlier robustness via learning-rate modulation, with vectorized GPU-friendly update rules.