Skip to content
Open access

From symmetry to sparsity: A dual framework of LiSHT and ReXTanh activation functions for deep learning

Sep 2026 · Journal of Applied Mathematics and Computational Mechanics · 0 citations · 13 references

TL;DR

This paper analyzes the already established Linearly Scaled Hyperbolic Tangent function and proposes ReXTanh, a smooth-sparse hybrid function that provides C 1 continuity while remaining asymmetric, showing that keeping negative magnitudes can outmatch forced sparsity in harder recognition problems.

Abstract

. Activation functions are one of the fundamental concepts in the field of artificial neural networks used to optimize their performance and feature extraction. In this paper, we introduce a dual approach to those non-linear transformations, focusing on the balance between keeping information and enforcing sparsity. We start by analyzing the already established Linearly Scaled Hyperbolic Tangent (LiSHT) function. Our mathematical proofs demonstrate that it provides a smooth and differentiable approximation of the absolute value function. This makes LiSHT a differentiable L1-like regularizer that does not discard negative signals. Next, for models that need strict sparsity, we propose ReXTanh, a smooth-sparse hybrid function that provides C 1 continuity while remaining asymmetric. We tested both functions extensively on HPC clusters using mixed-precision distributed training, and the results highlight a clear split in use cases. While ReXTanh works best as a sparse operator for standard image datasets, yielding higher accuracy, LiSHT’s symmetric shape handles complex and noisy data much better, showing that keeping negative magnitudes can outmatch forced sparsity in harder recognition problems.

Read PDF

Similar papers

Preprint Aug 2026

TESLA: Taylor Expansion of Sinusoidal Learnable Activations

TESLA, an activation defined as a learnable combination of sine and cosine terms, enabling explicit control over polynomial degree and selective amplification of high-order components is proposed, indicating that activation-level degree control transfers to more general vision workloads.

Daehwa Ko, Jae-Hwan Kim, Seunghyun Ham et al. · 0 citations
Open access Aug 2026

Provably convergent proximal gradient methods with tailored input convex neural networks regularization for inverse problems

This study presents a novel Deep Proximal Gradient Descent framework for ill-posed problems by employing a tailored second-order differentiable Input-Convex Neural Networks (ICNNs) as a learned regularizer, and introduces an innovative formulation that employs the learned residual to guide gradient descent.

Tian-Yi Ye, Guang-Yu Gao, Yang Li et al. · 0 citations
Preprint Aug 2026

BaKron: Efficient Quantization with Kronecker-Factored Hessians

BaKron is an efficient solver that combines anti-diagonal parallelism with a recursive divide-and-conquer construction that matches the cubic scaling of GPTQ while exploiting richer curvature information.

Johann Birnick, R. Saab · 2 citations

Geodesics and Low Rank Behavior in the Deep Linear Network

A general system of ordinary differential equations describing geodesics in the DLN is derived and an investigation into using an entropic log-volume form related to the geometry on the full-rank manifold as an explicit regularizer for a simple class of energies is investigated.

Alan Chen, Govind Menon · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.