Skip to Content
You are currently on the new version of our website. Access the old version .
  • Article
  • Open Access

26 May 2026

68 Pages

Elementary and Robust Distribution Shape Analysis via Mean Absolute Deviations and Quantile-Based Quadrature Approximations

,
and
Department of Computer Science, Metropolitan College, Boston University, 1010 Commonwealth Avenue, Boston, MA 02215, USA
*
Author to whom correspondence should be addressed.

Abstract

In both experimental and theoretical analyses of data, we often look to select a set of simple components that can be combined to create an appropriate model for the data. A convenient way to do this is to use quantile functions that can be added or transformed to obtain new distributions. In this work, we connect quantile statistics and mean absolute deviations (MADs) by deriving a general class of MAD-based shape metrics expressed as integrals of the quantile function, with a direct geometric interpretation. Our approach is applicable to distributions with finite mean that include many of the commonly used distributions, including those without a variance, such as the Pareto. When simple midpoint quadrature is used, the proposed metrics recover widely used quantile-shape metrics, including the interquartile range, Galton skewness, and Moore’s octile kurtosis as special cases. We further propose a C-Trapezoid quadrature approximation that combines cubic polynomial endpoint extrapolation with trapezoidal integration, achieving approximation errors that are significantly lower than those of the midpoint approximation for many common distributions. The proposed approximation provides simple-to-compute formulas for shape analysis and yields closed-form, non-iterative parameter-estimation formulas. These formulas are easy to compute and interpret, and they are applicable to a wide class of distributions, including those without an explicit cumulative distribution function or some with heavy tails. Unlike maximum likelihood estimation, the proposed method is more robust and has simple geometric interpretation. We illustrate the methodology with two detailed case studies. The proposed approach gives a simple way to quickly assess distributional shape without any specialized tools.

1. Introduction

In classical statistics, many shape metrics require the computation of the standard deviation. These computations are based on the L 2 norm. Such a norm is convenient in differentiation, optimization, and estimation. In addition, as noted in [1], the additive property of variance σ 2 for independent variables is often cited as one of the prime reasons for its use (for a historical survey, see [2]).
However, standard deviation and other classical shape metrics are sensitive to outliers. An alternative is to use quantile statistics and their quantile shape metrics [3,4], or to use the mean absolute deviation (MAD) or L 1 norm. The idea of using such a norm was not new and was used as early as the 18th century by Laplace and Boscovich (for a historical survey, see [5,6], for a survey of more recent results, see [1]).
The L 1 -based shape metrics have not been as widely used in statistics as their L 2 -based counterparts [1]. However, there is an increased interest in using this norm in statistical studies (e.g., [7,8,9,10,11,12]). Typically, MADs are computed from the density functions [8]. It is also possible to derive MADs by integrating the cumulative distribution function [13]. When a parametric model is well specified, and contamination is mild, maximum likelihood typically retains superior finite-sample efficiency; the octile-based quadrature estimators we develop trade some of that efficiency for closed-form robustness and for geometric interpretability via quantile subareas.
A distinct recent line of work introduces K-moments as an internally consistent alternative to classical raw/central/L-moment systems and highlights their usefulness for dispersion and tail-sensitive inference [14]. Global-scale benchmarking on hydrological margins further compares estimation based on K-moments with maximum likelihood and classical moments [15]. The present MAD-based constructions are complementary: skewness/kurtosis and spread measures here arise from deterministic integrals of the quantile function under explicit quadrature of subareas, yielding octile-level closed forms tied to geometric areas rather than hierarchical moment ladders.
Unless we explicitly mimic dependent data through simulations, finite-sample octiles used in this paper summarize marginally  i . i . d . draws after model fitting steps; analyzing long-memory or similarly structured serial dependence [15] lies outside our scope but motivates future extensions. We should note here that other variability metrics exist, such as classical raw and linear moments [16], probability-weighted moments [17], and more recent metrics such as Knowable moments (K-moments—expectations of maxima or minima) introduced in hydrology [18] and discussed in [14]. The methodology of using K-moments is particularly useful in modeling extreme values, where the proposed method has some limitations (discussed in Section 8.6 and Section 8.7). We hope to compare MAD-based analysis with K-moments methodology in the future.
In this work, we connect quantile statistics and MADs by deriving a general class of MAD-based shape metrics in terms of the quantile function. The proposed metrics are expressed as integrals of the quantile function and are easy to interpret. The computation of these metrics is reduced to evaluating these integrals, either analytically or by numerical (quadrature) methods. Using very simple quadrature approximations based on quartiles and octiles, the proposed metrics correspond to many widely used quantile metrics. Among the MAD-based metrics introduced are a MAD-based generalization of Moore’s octile kurtosis and Galton skewness.
For the numerical illustrations later in the paper, we use a small set of standard continuous distributions that are widely cited in textbooks and applications and that, taken together, stress different features of quantile shape: bounded support versus unbounded support; symmetry versus skewness; light tails versus heavier tails; and existence of the mean with or without a finite variance (e.g., Pareto with α = 2 ). This choice is deliberate: it lets readers compare the same quadrature rules under qualitatively different shapes without committing to a single parametric family.
In Section 6 we report exact and approximate values of the proposed MAD-based skewness G and kurtosis K for these same families, so skewness and tail weight can be read off consistently with the approximation experiments. Throughout, the methods we contrast are the elementary quadrature rules for subareas (midpoint, rectangles centered at octiles, and the cubic-endpoint C-trapezoid rule) applied to the same octile inputs, together with, where relevant, likelihood- and moment-based benchmarks in the parameter-estimation discussion.
This paper is organized as follows. In Section 2, we introduce the notation, summarize most commonly used quantile shape metrics, and derive a formula for MADs based on the subarea integrals of the quantile function. In Section 3, we discuss some elementary quadrature approximation methods using quartiles and octiles. In Section 4, we approximate the endpoints with cubic interpolating polynomials and suggest an additional (C-Trapezoid) quadrature approximation formula. In Section 5, we provide numerical comparisons for some commonly used continuous distributions. In Section 6, we propose MAD-based shape metrics, including shape index, skewness, and kurtosis; they coincide with classical quantile metrics under midpoint quadrature but generalize Galton skewness, Groeneveld and Meeden’s skewness coefficient, and Moore’s octile kurtosis in the MAD setting. We also compare the derived metrics with other such metrics based on classical moments and L-moments. In Section 7, we show how the approximations behave under transformations and convex combinations of quantile functions, illustrating skewed logistic models. In Section 8, we derive closed-form octile formulas for estimating parameters via C-Trapezoid subareas and contrast them with maximum likelihood and quartile fitting. We also compare our method to estimation using L-moments. We compare our results for several commonly used distributions. We address the issue of parameter estimation when distributions have multiple parameters. We also discuss the limitations of our approach when dealing with fat-tailed data and suggest some approaches to address such issues. We then illustrate the methodology with two case studies: Section 9 compares overnight versus daytime XLK ETF returns spanning 1999–2025, highlighting technology-sector regimes that parallel earlier S&P 500 diagnostics; Section 10 analyses weight distributions inside several pretrained transformers. Finally, Section 11 summarizes findings and avenues for refinement. Derivational details reside in the Appendix A, Appendix B, Appendix C, Appendix D, Appendix E and Appendix F.

2. Quantile Shape Metrics and Mean Absolute Deviations

Consider a real-valued random variable X on a sample space Ω ⊆ R with density f ( x ) and cumulative distribution function F ( x ) [19]. Let Q ( p ) be the quantile function by Q ( p ) = inf { x : F ( x ) ≥ p } with 0 ≤ p ≤ 1 . Let O 1 , … , O 7 denote the corresponding octiles with P ( X < O i ) ≤ i / 8 and P ( X > O i ) ≤ 1 − i / 8 for i = 1 , … , 7 . If X is continuous then O i = Q ( i / 8 ) . Let Q 1 = O 2 , M = O 4 , and Q 3 = O 6 denote the first, median, and third quartile, respectively.
Of particular interest are the quantile metrics that use quartiles and octiles [20]. Using the quantile function Q ( p ) , we can compute several such quantile measures of shape, including (Galton’s) skewness and (Moore’s) kurtosis. These are summarized in Table 1.
Table 1. Quantile measures of shape.
In classical statistics, one computes different shape metrics based on standard deviation and higher-order moments [21,22]. By contrast, in this paper, we will consider several shape metrics based on MAD. These metrics will be expressed as integrals of the quantile functions. Using simple quadrature approximations, we will show that these measures correspond to many of the quantile metrics in Table 1. Moreover, we will consider approximations of these integrals and obtain more accurate estimates of these shape metrics, including improvements to Moore’s kurtosis formula.
We will confine ourselves to continuous distributions. For such distributions, Q ( p ) is monotonically increasing. Let μ denote the mean of X and let M denote the median of X. We will assume the existence of the first-order moment μ . In such a case, for any real-value a, define MAD of X from a as [7]
H ( X , a ) = ∫ Ω | x − a | f ( x ) d x
MAD is an L 1 -metric for measuring the spread of data and is analogous to the L 2 standard deviation metric used in classical statistics [16]. It is well-known [7,23,24] that for any distribution with finite variance H ( X , O 4 ) ≤ H ( X , μ ) ≤ σ . On the other hand, MADs require only the existence of the first-order moment. We can rewrite the above Equation (1) for H ( X , a ) in terms of the quantile function Q ( p ) . Since x = Q ( p ) and p = F ( x ) , we have d p = F ′ ( x ) d x = f ( x ) d x . Therefore,
∫ p 1 p 2 Q ( p ) d p = ∫ x 1 x 2 x f ( x ) d x
In particular, the mean μ of the distribution
μ = ∫ 0 1 Q ( p ) d p
It has a simple interpretation as the area under the quantile function and is shown in Figure 1a.
Figure 1. Area interpretation of mean and MAD as areas.
If p * = F − 1 ( a ) then we can re-write Equation (1) for MAD H ( X , a ) of X around a as
H ( X , a ) = ∫ x ≤ a ( a − x ) f ( x ) d x + ∫ x ≥ a ( x − a ) f ( x ) d x = ∫ p * 1 Q ( p ) d p − ∫ 0 p * Q ( p ) d p + ( 2 p * − 1 ) a
We will introduce the following notation. For 0 ≤ p 1 < p 2 ≤ 1 , define:
I ( p 1 , p 2 ) = ∫ p 1 p 2 Q ( p ) d p = ∫ x 1 x 2 x f ( x ) d x
Then we can rewrite the above equation as
H ( X , a ) = I ( p * , 1 ) − I ( 0 , p * ) + ( 2 p * − 1 ) Q ( p * )
Note that for any 0 ≤ p * ≤ 1 , the mean μ is
μ = ∫ 0 1 Q ( p ) d p = I ( 0 , p * ) + I ( p * , 1 )
For MAD around the median a = O 4 , we have
H ( X , O 4 ) = I ( 1 2 , 1 ) − I ( 0 , 1 2 ) = ∫ 1 2 1 Q ( p ) d p − ∫ 0 1 2 Q ( p ) d p
This can be rewritten as
H ( X , O 4 ) = I ( 1 2 , 1 ) − I ( 0 , 1 2 ) = ∫ 1 2 1 Q ( p ) d p − ∫ 0 1 2 Q ( p ) d p
Alternatively, to compute MAD H ( X , O i ) around each octile O − i , Equation (4) can be rewritten as
H ( X , O i ) = I ( i / 8 , 1 ) − I ( 0 , i / 8 ) + i / 4 − 1 O i = μ − 2 I ( 0 , i / 8 ) + i / 4 − 1 O i i = 1 , … , 7
For MAD around the mean μ , let x * = μ and p * = F ( μ )
H ( X , μ ) = I ( p * , 1 ) − I ( 0 , p * ) + μ ( 2 p * − 1 )
In this work, we will focus on MAD around the median and quartiles [25]. We will use the notation H = H ( X , O 4 ) for convenience. From Equation (8), the MAD H of X around the median O 4 can be interpreted as the difference between corresponding subareas. Note that we can also rewrite the expression for H as
H = ∫ 1 2 1 Q ( p ) d p − O 4 2 + O 4 2 − ∫ 0 1 2 Q ( p ) d p
and interpret H as the sum of two areas. This is shown in Figure 1b.
Let us define the left and right subareas I L and I R of X as
I L = I ( 0 , 1 2 ) = ∫ 0 1 2 Q ( p ) d p and I R = I ( 1 2 , 1 ) = ∫ 1 2 1 Q ( p ) d p
Then the MAD H and the mean μ can written as
H = ( I R − I L ) and μ = ( I L + I R )
Formulae for MAD H and μ for some common distributions are presented in Appendix B. By analogy to the coefficient of variation σ / μ in classical statistics, we can define the MAD-based Relative Dispersion RD as
RD = H O 4 = ( I R − I L ) O 4
Example 1.
Suppose X is distributed according to an exponential distribution with rate λ > 0 [21]. Its density f ( x ) and cumulative distribution function F ( x ) are
f ( x ) = λ e − λ x and F ( x ) = 1 − e − λ x , x ∈ [ 0 , ∞ )
The quantile function is Q ( p ) = − log ( 1 − p ) / λ with octiles O i = − log ( 1 − i / 8 ) / λ . The auxiliary integral is
I ( p 1 , p 2 ) = − ( 1 − p ) Q ( p ) + 1 λ | p 1 p 2
Therefore, for the subareas, we obtain I L = ( 1 − log 2 ) / 2 λ and I R = ( 1 + log 2 ) / 2 λ . Then from Equation (14) we obtain that MAD H around the median is H = ( log 2 ) / λ and its mean μ = 1 / λ . Note that for this distribution, the MAD H coincides with the median H = O 4 . Since log 2 < 1 , for this distribution O 4 < μ , and, therefore, this distribution is non-symmetric and is right-skewed with a high concentration of lower data points on the left and a long, thin tail on the right.

3. Quadrature Approximations to Subareas

In this paper, we demonstrate that many shape metrics can be expressed as MAD around specific (primarily quartile) values. These MAD measures require the computation of subareas (integrals) under the quantile function. We consider several simple quadrature approximations to such integrals and demonstrate that many commonly used quantile metrics of shape correspond to straightforward quadrature methods.
In quadrature approximation, we replace the integral with a weighted sum of quantile values, the so-called “abscissas” or “Quadrature points” [26]. Since Q ( 0 ) or Q ( 1 ) can be unbounded, we will first confine ourselves to very simple rules, mostly the “rectangular” quadrature approximations [27]. We will show that even these simple rules provide valuable insights into interpreting the shape metrics. In Section 4, we approximate the endpoints with cubic polynomials and consider trapezoid quadrature approximation that will be shown to give a much lower approximation error.
We start with two simple quadrature approximations for the mean μ and MAD H. For notational convenience, let us introduce the subarea integrals between successive quartiles:
I L L = I ( 0 , 1 4 ) = ∫ 0 1 4 Q ( p ) d p I L R = I ( 1 4 , 1 2 ) = ∫ 1 4 1 2 Q ( p ) d p , I R L = I ( 1 2 , 3 4 ) = ∫ 1 2 3 4 Q ( p ) d p , I R R = I ( 3 4 , 1 ) = ∫ 3 4 1 Q ( p ) d p
Note that with this notation, I L = ( I L L + I L R ) and I R = ( I R L + I R R ) .

3.1. Midpoint Quadrature Approximation

We start by using the midpoint approximation, which involves a single rectangle of height M = O 4 and width 1 2 for the left and right subareas. With a midpoint approximation, for each subarea integrals, we have I L ≈ O 2 / 2 and I R ≈ O 6 / 2 . With this approximation, μ = ( I L + I R ) ≈ ( O 2 + O 6 ) / 2 and H = ( I R − I L ) = ( O 6 − O 2 ) / 2 . With this approximation, MAD H is approximated by the interquartile range. This is shown in Figure 2b.
Figure 2. Quadrature approximation methods for subareas.
In the midpoint approximation, the relative dispersion is the IQR divided by the median O 4 . This MAD-based robust alternative is simpler than the coefficient of variation σ / μ used in classical statistics.
Example 2.
For exponential distribution, the exact mean μ = 1 / λ whereas a midpoint approximation is ( I L + I R ) ≈ ( 4 log 2 − log 3 ) / λ ≈ 1.67 / λ . This represents about 67% relative error. The exact MAD is H = ( log 2 ) / λ ≈ 0.69 / λ whereas the midpoint approximation gives H = ( log 3 ) / λ ≈ 1.10 / λ . This represents a 60% relative error.

3.2. Rectangles Quadrature Approximation

We consider approximating left and right subareas I L and I R in Figure 1 by four rectangles centered at octiles { O 1 , O 2 , O 3 , O 4 } and { O 4 , O 5 , O 6 , O 7 } :
I L L ≈ ( O 1 + O 2 ) 8 , I L R ≈ ( O 3 + O 4 ) 8 , I R L ≈ ( O 4 + O 5 ) 8 , I R R ≈ ( O 6 + O 7 ) 8
Then I L ≈ ( O 1 + O 2 + O 3 + O 4 ) / 8 and I R ≈ ( O 4 + O 5 + O 6 + O 7 ) / 8 . This is shown in Figure 2b. With this approximation, we have
H ≈ ( O 5 − O 3 ) + ( O 6 − O 2 ) + ( O 7 − O 1 ) 8
Example 3.
For the exponential distribution, we obtain H ≈ ( log 5 + log 7 ) / 8 λ and μ ≈ ( 18 log 2 − log 7 − log 5 − 2 log 3 ) / 8 λ . This results in relative errors of 35.9% and 16.0% for MAD and mean, respectively. This represents a much lower relative error than the midpoint approximation.

4. Approximating with Cubic Polynomials

The accuracy of the approximation of the subareas will depend on the quadrature method and on the shape of the quantile function. The approximation methods considered in the previous sections involve areas of rectangles centered at quartiles. Since Q ( p ) is a monotonically increasing function, it would seem reasonable that other simple quadrature methods, such as the trapezoidal method, could provide higher accuracy. To use such methods to compute I L and I R , we would need to use Q ( 0 ) and Q ( 1 ) .
However, for many distributions, one or both of these values could be unbounded. To apply quadrature approximations with such values, we propose to estimate Q ( 0 ) and Q ( 1 ) using octiles only. One of the simplest ways to accomplish this is to consider cubic polynomial curves C L ( p ) and C R ( p ) passing through reference points corresponding to octiles in the left and right subareas, We then replace Q ( 0 ) and Q ( 1 ) by C L ( 0 ) and C R ( 1 ) , respectively.
We proceed as follows. For each octile O i and p i = i / 8 define the point A i = p i , Q ( p i ) . We will call these “reference” points. For the left subarea ( p ≤ 1 2 ) , we have four such points A 1 , A 2 , A 3 and A 4 . Similarly, for the right subarea ( p ≥ 1 2 ) we have sour points A 4 , A 5 , A 6 and A 7 . This is illustrated in Figure 3.
Figure 3. Approximating end points Q ( 0 ) and Q ( 1 ) by cubic polynomials.
To compute these cubic polynomial curves, we use Lagrange’s interpolation formula to construct a polynomial that passes through a set of corresponding reference points [28]. To that end, define Lagrange basis polynomials:
L i ( p ) = ∏ j = 1 , j ≠ i n ( p − p j ) ( p i − p j )
The equation for the curve is then
C ( p ) = ∑ i = 1 n L i ( p ) Q ( p i ) = ∑ i = 1 n ∏ j = 1 , j ≠ i n ( p − p j ) ( p i − p j ) O i
We will consider using cubic polynomial curves passing through four reference points in the left and right subareas to estimate the endpoints, combined with trapezoidal quadrature.

4.1. Using Cubic Polynomials to Estimate End Points for Trapezoid Integration

Consider a (left) cubic curve C L ( p ) passing through the four reference points A 1 , A 2 , A 3 and A 4 given by Equation (22). Its value at p = 0 is
C L ( 0 ) = 4 O 1 − 6 O 2 + 4 O 3 − O 4
Similarly, consider a (right) cubic curve C R ( p ) passing through four reference points: A 4 , A 5 , A 6 and A 7 given by Equation (22). Its value at p = 1 is
C R ( 1 ) = − O 4 + 4 O 5 − 6 O 6 + 4 O 7
Once we have estimates for the endpoints C L ( 0 ) and C R ( 1 ) we consider the trapezoid approximation for the subareas in Equation (18):
I L L ≈ ( C L ( 0 ) + O 1 ) 16 + ( O 1 + O 2 ) 16 , I L R ≈ ( O 2 + O 3 ) 16 + ( O 3 + O 4 ) 16 , I R L ≈ ( O 4 + O 5 ) 16 + ( O 5 + O 6 ) 16 , I R R ≈ ( O 6 + O 7 ) 16 + ( O 7 + C R ( 1 ) ) 16
With trapezoid approximation, we obtain for the left and right subareas I L and I R :
I L ≈ ( 3 O 1 − 2 O 2 + 3 O 3 ) 8 and I R ≈ ( 3 O 5 − 2 O 6 + 3 O 7 ) 8
This gives us the following approximations to the MAD H and the mean μ in terms of octiles:
H = ( I R − I L ) ≈ 3 ( O 7 − O 1 ) − 2 ( O 6 − O 2 ) + 3 ( O 5 − O 3 ) 8 μ = ( I L + I R ) ≈ 3 ( O 7 + O 1 ) − 2 ( O 6 + O 2 ) + 3 ( O 5 + O 3 ) 8
Example 4.
For the exponential distributions, the estimates for the endpoints are
C L ( 0 ) = ( 11 log 2 + 6 log 3 − 4 log 5 − 4 log 7 ) λ , C R ( 1 ) = ( 11 log 2 − 4 log 3 ) λ
Note that C L ( 0 ) = − 0.0051 / λ and practically identical to 0. The right estimated point C R ( 1 ) ≈ 3.23 / λ . The probability mass excluded to the right of this point is 1 − F ( C R ( 1 ) ) = e − 3.23 ≈ 0.0396 , significantly less 0.125 , the area to the right of the O 7 octile. With the trapezoid approximation in Equation (27) we have H ≈ ( 3 log 5 + 3 log 7 − 5 log 3 ) / 8 λ . This results in a relative error of approximately − 6.7 % for MAD. This is significantly better than previously considered methods for the exponential distribution.
We will call this method of combining endpoints Q ( 0 ) and Q ( 1 ) (estimated by cubic polynomials) and trapezoid quadrature, a “C-Trapezoid” method. Its accuracy for many distributions will be discussed in the next sections.

4.2. Probability Mass Excluded by Cubic-Approximated Endpoints

When using cubic polynomial interpolation to approximate the endpoints Q ( 0 ) and Q ( 1 ) from interior octiles, it is important to understand how much probability mass lies outside the approximated endpoints. This provides insight into the truncation error introduced by the endpoint extrapolation used in the quadrature rules.
For a continuous distribution with cumulative distribution function F ( x ) , we measure the probability mass that lies outside the approximated endpoints. When the approximated left endpoint C L ( 0 ) is greater than the true Q ( 0 ) , the excluded mass to the left is
P X ≤ C L ( 0 ) = F C L ( 0 )
which represents the probability mass that falls at or below the approximated endpoint (and, thus, outside the true support if C L ( 0 ) > Q ( 0 ) ). Similarly, when the approximated right endpoint C R ( 1 ) is less than the true Q ( 1 ) , the excluded mass to the right is
P X > C R ( 1 ) = 1 − F C R ( 1 )
which represents the probability mass that falls strictly above the approximated endpoint.
For the true endpoints Q ( 0 ) and Q ( 1 ) , we have F ( Q ( 0 ) ) = 0 and F ( Q ( 1 ) ) = 1 (by definition of the quantile function), so the excluded mass would be zero. Any nonzero values for F ( C L ( 0 ) ) or 1 − F ( C R ( 1 ) ) represent probability mass that is excluded (truncated) when using the approximations instead of the true support endpoints. Equivalently, the included mass is 1 − F ( C L ( 0 ) ) on the left and F ( C R ( 1 ) ) on the right.
In Table 2, we compute the probability mass to the left and to the right of the proposed cubic approximations C L ( 0 ) and C R ( 1 ) for some well-known distributions. For exact endpoints, both values are zero.
Table 2. Probability mass excluded by cubic-approximated endpoints.
Examining Table 2, we exclude about 4% in each tail. Several observations can be made:
  • For distributions with bounded support (Uniform, Power), cubic interpolation captures the endpoints well, with negligible excluded probability mass.
  • For distributions with unbounded support (Normal, Laplace, Exponential, Log-normal, Pareto, Weibull), cubic interpolation excludes a small but nonzero fraction of probability mass (typically on the order of 10 − 2 ).
  • The excluded mass is generally symmetric for symmetric distributions (Laplace, Normal) and asymmetric for skewed distributions (Exponential, Log-normal, Pareto, Weibull).
  • since only octiles are used, the approximation is robust to outliers with a breakpoint of 25% (12.5% at each tail)
Overall, this analysis shows that cubic endpoint construction introduces only modest truncation of probability mass. Given the excellent performance of the C-Trapezoid rule shown in the next Section, this level of truncation error is acceptable in practice, especially when working with empirical quantiles from finite samples. Therefore, we will use these cubic endpoint estimates C L ( 0 ) and C R ( 1 ) in the trapezoid approximation method discussed in Section 3.

5. Approximation Accuracy for Common Distributions

This section compares the accuracy of the proposed quadrature approximations to the subarea integrals I L and I R , and hence to the mean μ = ( I L + I R ) and the median MAD H = ( I R − I L ) , for the distributions listed below. The distributions were selected to cover complementary cases: Uniform (bounded, flat density), Normal and Laplace (unbounded, symmetric, light tails), Log-normal, Weibull and Exponential (unbounded, skewed), and Pareto with α = 2 (heavy right tail with finite mean but infinite variance). The comparison is methodological: for each distribution, we hold the quantile function fixed and evaluate midpoint quadrature, the octile-rectangle rule, and the C-trapezoid rule, summarized in Table 3, reporting percent error relative to exact integration where available.
Table 3. Quadrature approximations for subarea integrals.

5.1. Simple Numerical Comparisons

In Table 3 we present the expressions for the subarea integrals obtained by the proposed quadrature approximations.
Example 5.
In Table 4, we illustrate the accuracy of the proposed quadrature approximations for the exponential distribution. Recall that for this distribution, the quantile function Q ( p ) = − log ( 1 − p ) / λ with octiles O i = − log ( 1 − i / 8 ) / λ . With the above expressions for octiles of exponential distribution, from Table 3, we can express the quadrature approximations for subareas, shown in Table 4.
Table 4. Quadrature approximations of subareas for exponential distribution.
As can be seen from Table 4, the C-Trapezoid gives the minimum relative error for both left and right subarea integrals I L and I R . The midpoint and rectangle approximation give similar results.

5.2. Comparison of Approximation Accuracy for Common Distributions

We now present the accuracy comparisons for some common (standardized) distributions.
  • uniform ( a = 0 and b = 1 )
  • exponential (with rate λ = 1 )
  • Standard Normal ( μ = 0 and σ = 1 )
  • LogNormal (with μ = 0 and σ = 1 )
  • Laplace (mean μ = 0 and scale b = 1 / 2 )
  • Pareto ( α = 2 and β = 0.5 )
  • Weibull ( α = 2 and β = 1 )
The corresponding approximations for MADs are summarized in Table 5.
Table 5. Quadrature approximations for MAD H.
To further understand the accuracy of quadrature approximations, we examine the left and right subarea integrals I L and I R directly. Table 6 and Table 7 present the true values and estimated values of I L and I R , respectively, computed from a single sample of size n = 100 for each distribution using three quadrature methods: midpoint, rectangles, and C-trapezoid. The true values are computed by numerical integration of the quantile function Q ( p ) over the intervals [ 0 , 0.5 ] and [ 0.5 , 1 ] respectively. These tables demonstrate how each approximation method performs in estimating the fundamental subarea integrals that underlie the mean μ = ( I L + I R ) and mean absolute deviation H = ( I R − I L ) .
Table 6. Left subarea integral I L estimates across distributions using different quadrature methods. True values computed via numerical integration of Q ( p ) over [ 0 , 0.5 ] . In each row, the green color indicates the best approximation, whereas the red color indicates the worst approximation.
Table 7. Right subarea integral I R estimates across distributions using different quadrature methods. True values computed via numerical integration of Q ( p ) over [ 0.5 , 1 ] . In each row, the green color indicates the best approximation. The red indicates the worst approximation.
The results in Table 6 and Table 7 show that the accuracy of each approximation method varies by distribution and by which subarea ( I L or I R ) is being estimated. For symmetric distributions like Laplace and Normal, the quartile and C-Trapezoid methods tend to perform well. For skewed distributions like Exponential and Log-normal, the C-Trapezoid method generally provides better estimates of I R (the right subarea), which is critical for accurate MAD estimation since H = ( I R − I L ) . For most distributions, the C-trapezoid gives the best approximation. By contrast, the midpoint method, while simple, consistently underestimates both subareas for most distributions, leading to poor MAD estimates as seen in Table 8.
Table 8. Mean absolute deviation (MAD) estimates and percent error across distributions. Green indicates the lowest error, and red indicates the highest percent error.
In Table 8, we compare the MAD H results for all approximation methods.
Table 8 shows that across all distributions, C-Trapezoid attains smaller errors than both Midpoint and Rectangle rules.

6. MAD-Based Shape Metrics: Computation and Interpretation

We now consider several MAD-based shape metrics. Many of these metrics would correspond to well-known quantiles shape metrics when simple quadrature approximation methods are used. In the computation of these metrics, we will use MAD using only the values to the left and right of the median O 4 . We will find it convenient to express these metrics via the mean absolute deviations of truncated distributions.
To proceed, let X ( L ) and X ( R ) denote truncated random variables (with truncation at the median O 4 ). We will refer to these as derived left and right random variables. Let f ( L ) ( · ) , F ( L ) ( · ) and Q ( L ) ( · ) denote the corresponding density, cumulative distribution, and quantile function for the left derived variable X ( L ) . Similarly, let f ( R ) ( · ) , F ( R ) ( · ) and Q ( R ) ( · ) denote the corresponding density, cumulative distribution, and quantile function for the right derived variable X ( R ) .
Because the truncation is done at the median O 4 , we have for the left and right random variables X ( L ) and X ( R ) :
f ( L ) ( x ) = 2 f ( x ) , F ( L ) ( x ) = 2 F ( x ) − 1 2 , Q ( L ) ( p ) = Q ( p 2 ) , x ≤ O 4 f ( R ) ( x ) = 2 f ( x ) , F ( R ) ( x ) = 2 F ( x ) − 1 2 , Q ( R ) ( p ) = Q ( p 2 + 1 2 ) x ≥ O 4
For any point a, we have for the MAD of X ( L ) and X ( R ) around a:
H X ( L ) , a = ∫ x ≤ O 4 | a − x | f ( L ) ( x ) d x = 2 ∫ x ≤ O 4 | a − x | f ( x ) d x H X ( R ) , a = ∫ x ≥ O 4 | a − x | f ( R ) ( x ) d x = 2 ∫ x ≥ O 4 | a − x | f ( x ) d x

6.1. Left and Right Mean Absolute Deviations

Consider the MAD of H ( X ( L ) , O 6 ) and H ( X R ) , O 2 ) of X ( L ) and X ( R ) around O 6 and O 2 , respectively. Then from Equation (32) we immediately obtain
H X ( L ) , O 6 = ( O 6 − 2 I L ) and H X ( R ) , O 2 = ( 2 I R − O 2 )
From the above Equation (33) and Table 3 for quadrature approximations to I L and I R , we can compute the quadrature approximations to these left and right MAD. These approximations for p-differences are summarized in Table 9.
Table 9. Quadrature approximations for MAD H ( X ( L ) , O 6 ) and H ( X ( R ) , O 2 ) .
Example 6.
For the exponential distribution, I L = ( 1 − log 2 ) / 2 λ , I R = ( 1 + log 2 ) / 2 λ and H = log 2 / λ . Therefore, H ( X ( L ) , O 6 ) = ( 3 log 2 − 1 ) / λ and H ( X ( R ) , O 2 ) = ( 1 + log 3 − log 2 ) / λ .
The MAD H ( X ( L ) , O 6 ) is the average distance between X ( L ) and the third quartile O 6 . Similarly, the MAD H ( X ( R ) , O 2 ) is the average distance between X ( R ) and the first quartile O 2 . The midpoint approximation to these distances is the upper and lower q-distances in Table 1.

6.2. Skewness Shape Metrics

Consider the MAD of X ( L ) and X ( R ) around O 4 . From Equation (32), for a = O 4 we have
H X ( L ) , O 4 + H X ( R ) , O 4 = 2 H
We define the left and right normalized deviations H ( X ( L ) , O 4 ) / 2 H and H ( X ( L ) , O 4 ) / 2 H of truncated left and right variables X ( L ) and X ( R ) around the median O 4 . We define MAD skewness G as the difference of these normalized deviations:
G = H X ( R ) , O 4 − H X ( L ) , O 4 2 H
Since H ( X ( L ) , O 4 ) ≥ 0 and H ( X ( R ) , O 4 ) ≥ 0 from Equation (34) It immediately follows that − 1 ≤ G ≤ 1 . This is unlike the Pearson skewness in classical statistics, which could be unbounded. The MAD-based skewness can be used directly to compare any two distributions. In terms of subarea integrals, we can have
H X ( L ) , O 4 = ( O 4 − 2 I L ) and H X ( R ) , O 4 = ( 2 I R − O 4 )
Since μ = ( I L + I R ) , Using from Equations (35) and (36) we obtain
G = ( 2 I R − O 4 ) − ( O 4 − 2 I L ) 2 H = ( I L + I R ) − O 4 H = ( μ − O 4 ) H
The term ( μ − O 4 ) / H is the Groeneveld and Meeden’s or Yule’s skewness coefficient [29,30]. This skewness coefficient has a simple interpretation as the ratio of two distances: the numerator ( μ − O 4 ) is the (signed) distance between the mean μ and the median O 4 , whereas the denominator H is one half of the average distance of values in X to the median O 4 . This is an easier interpretation than the classical skewness E ( X − μ ) 3 / σ 3 defined in terms of the central third moment and standard deviation σ [31].
Using the quadrature approximations in Table 3, for the subarea integrals I L and I R , we can approximate the MAD skew in terms of octiles. Quadrature approximations for skewness are summarized in Table 10.
Table 10. Quadrature approximations for MAD-based skewness G.
The midpoint approximation is the so-called Galton skewness [32]. Therefore, the Galton skewness in quantile statistics can be interpreted as the normalized difference of MAD for right and left truncated variables X ( R ) and X ( L ) distributions from the median O 4 , when a simple midpoint approximation for subareas is used.
Example 7.
For the exponential distribution, we have I L = ( 1 − log 2 ) / 2 λ and I R = ( 1 + log 2 ) / 2 λ . The median O 4 = ( log 2 ) / λ and H = ( log 2 ) / λ . The skewness is then G = − 1 + ( 1 / log 2 ) ≈ 0.44 .

6.3. MAD-Based Kurtosis

Let us consider the MAD of X ( L ) and X ( R ) around O 2 and O 6 , respectively. For notational convenience, let H L and H R denote these corresponding “left” and “right” MAD:
H L = H X ( L ) , O 2 and H R = H X ( R ) , O 6
The medians of left and right random variables X ( L ) and X ( R ) are O 2 and O 6 , respectively. It is easy to show that we can express the left and right MAD H L and H R  as:
H L = 2 ( I L R − I L L ) and H R = 2 ( I R R − I R L )
The terms H L and H R can be interpreted as the average distances between values in X ( L ) and X ( R ) from their respective medians. We can think os these as measuring the “fatness” of left and right tails of X, somewhat similar to the notion of kurtosis in classical statistics [16,33]. We can think of H L / H as a normalized MAD-based measure of the left tail and H R / H as a normalized MAD-based measure of the right tail. With this in mind, we define MAD-based kurtosis K as the average of these “normalized” tails:
K = ( H L + H R ) 2 H = ( I L R − I L L ) + ( I R R − I R L ) ( I R − I L )
Mad-based kurtosis K in Equation (40) can be interpreted as the average distances between values in X ( L ) and X ( R ) from their respective medians O 2 and O 6 divided by an average distance of points in X from their median O 4 . This gives a simple MAD-centered view of the classical kurtosis measure.
Quadrature approximations for kurtosis are summarized in Table 11. Note that with a midpoint approximation, we obtain the so-called octile kurtosis suggested by Moore [34].
Table 11. Quadrature approximations for MAD-based kurtosis.
It is interesting to note that Moore suggested his formula based on the following analogy to classical kurtosis K C = E ( X − μ ) 4 / σ 4 . If Z = ( X − μ ) / σ denotes the standardized random variable and W = Z 2 , then E ( Z 2 ) = 1 and Var ( Z 2 ) = E ( Z 4 ) − E 2 ( Z 2 ) = K − 1 and, therefore, K C = Var ( Z 2 ) + 1 . The classical kurtosis K c can be viewed as related to the dispersion of Z 2 around its mean 1, or equivalently, with the dispersion of Z around − 1 and 1 [34]. This implies that classical kurtosis K c is associated with the concentration of X around points ( μ − σ ) and ( μ + σ ) respectively.
With this analogy, an quantile alternative K to classical kurtosis K C was suggested in [35] in terms of the inter-quartile ranges X ( L ) and X ( R ) around corresponding medians O 2 and O 4 using octiles O i = Q ( i / 8 ) . The MAD-based kurtosis K in the above Equation (40) measures the MAD of X ( L ) and X ( R ) from their corresponding medians O 2 and O 6 , playing the role of ( μ ± σ ) as in classical statistics.
Example 8.
For the exponential distribution, H = log 2 / λ . For the left and right MAD, we have H L = ( 5 log 2 − 3 log 3 ) / λ and H R = log 2 / λ . Skewness G = − 1 + 1 / log 2 ≈ 0.44 and kurtosis K = ( 6 log 2 − 3 log 3 ) / 2 log 2 ≈ 0.62 . .
It is well known that MAD is minimized by the median [23,24]. Therefore,
H X ( L ) , O 2 ≤ H X ( L ) , O 4 and H X ( R ) , O 6 ≤ H X ( R ) , O 4
This gives the following upper bound for MAD-based kurtosis:
K ≤ H X ( L ) , O 4 + H X ( R ) , O 4 2 H = 1 2 H 2 ∫ | x − O 4 | f ( x ) d x = 1
Therefore, unlike the classical kurtosis that can be unbounded, MAD-based kurtosis always satisfies 0 ≤ K ≤ 1 . This allows a direct comparison across distributions.
In Table 12 we summarize the values of MAD-based skew and kurtosis computed for some common distributions. The details of the computations are provided in the Appendix A, Appendix B, Appendix C and Appendix D. A further comparison with classical skew and kurtosis can be found in [36].
Table 12. MAD-based skew and kurtosis for common distributions. Here, u 2 ≈ − 0.675 and u 6 ≈ 0.675 are the octiles of the standard normal Φ − 1 ( · ) .

6.4. Comparison with Classical Skewness and Kurtosis

Classical skew G c and kurtosis K c are defined as normalized third and fourth central moments:
G c = E ( X − μ ) 3 σ 3 and K c = E ( X − μ ) 4 σ 4
These are summarized in Table 13 for some common distributions.
Table 13. Classical skewness and kurtosis for common distributions.
Note for classical kurtosis, K c ≥ G c 2 + 1 [16]. The lower bound is realized by the Bernoulli distribution. The classical kurtosis itself is unbounded. By contrast, for MAD-based skew G and kurtosis K, we have − 1 ≤ G ≤ 1 and 0 ≤ K ≤ 1 . Therefore, for any distribution K > G − 1 .

6.5. Some Additional Tail Metrics

We defined MAD-based kurtosis as measuring the MAD of X ( L ) and X ( R ) from their respective medians O 2 and O 6 . We can consider additional metrics of tail weight and tail length, which indicate the degree of probability in the tails of a distribution. One way to assess heavy tails is to measure whether the probability in the outer tails is particularly large or small. A simple way of summarizing the tail length is to use the so-called identification quantile function [4]:
IQ ( p ) = Q ( p ) − O 4 2 ( O 6 − O 2 )
The values of IQ ( 0.01 ) and IQ ( 0.99 ) are compared with ± 1 and ± 0.5 indicate tail lengths. For example, a distribution with IQ ( 0.99 ) > 1 is regarded as having a long right tail. If it is between zero and 0.5 then it is regarded as short-tailed.
Example 9.
Consider the exponential distribution with Q ( p ) = − log ( 1 − p ) / λ . For this distribution,
Q ( 0.01 ) = 0.0101 λ , O 2 = 0.2877 λ , O 4 = 0.6931 λ , O 6 = 1.3863 λ , Q ( 0.99 ) = 4.6052 λ
From this, we obtain IQ ( 0.01 ) = − 0.3109 and IQ ( 0.99 ) = 1.7804 . Therefore, the exponential distribution has a long right tail and a short left tail.
Another approach to measure skewness and kurtosis is to use L-moment based skewness τ 3 = l 3 / l 2 and L-kurtosis τ 4 = l 4 / l 2 defined in terms of the L-moments discussed in Appendix C for many common distributions.The L-skewness is strictly bounded within the interval ( − 1 , + 1 ) . The L kurtosis is strictly bounded in the interval ( − 1 / 4 , 1 ) . They are related by the inequality 5 τ 3 2 − 1 < 4 τ 4 .
Example 10.
Consider the exponential distribution. The L moments for this distribution are l 1 = 1 / λ , l 2 = 1 / 2 λ , l 3 = 1 / 6 λ and l 6 = 1 / 12 λ . The L-based skewness τ 3 = 1 / 3 and L kurtosis is τ 4 = 1 / 6 .
Table 14 summarizes L-moment skew and kurtosis for common distributions [37]. The details are presented in Appendix C.
Table 14. L-moment skewness and kurtosis for some common distributions. Formulas are from [37].
There have been several methods to compare distributions in terms of tails, such as comparing the quantile functions as p ↦ 1 and other methods [3]. We believe that MAD-based skew G and kurtosis K offer an attractive alternative to these measures: both measures have simple interpretation, simple approximations, and allow direct comparisons across distributions.

6.6. Numerical Comparisons

We now show the accuracy of our approximation. Assume that we have n data points x 1 ≤ x 2 ≤ … ≤ x n . We compute the octiles O 1 , … , O 7 . Let n L be the number of elements less than or equal to O 4 and let n R denote the number of elements greater than O 4 .
Then, we can compute the empirical MAD:
H = ∑ | x i − O 4 | n , H L = ∑ x i ≤ O 4 | x i − O 2 | n L , H R = ∑ x i > O 4 | x i − O 6 | n R
From this, we compute the MAD skew G = ( H R − H L ) / H . The approximation results for the common distribution are in Table 15. For log-normal, we take μ = 0 and σ = 1 . For Pareto, α = 2.0 and β = 1 / 2 .
Table 15. MAD-based Skewness G approximations across (non-symmetric) distributions using different quadrature methods. In each row, the green color indicates the best approximation, the red color indicates the worst.
Next, we compute MAD-based kurtsois K = ( H L + H R ) / 2 H . The results are in Table 16.
Table 16. MAD-based kurtosis K approximations across distributions using different quadrature methods. In each row, the green color indicates the best approximation, and the red color indicates the worst approximation.
As shown in Table 15, C-Trapezoid achieves the smallest absolute percentage error for skewness G across the three distributions listed. Table 16 is more mixed: for kurtosis K, C-Trapezoid is best on Normal and Laplace, Midpoint on Exponential and Pareto, Rectangles on Log-Normal, while Uniform is essentially exact under both Midpoint and C-Trapezoid (percentage errors rounded to two decimals). Overall, C-Trapezoid remains strongest for skewness in this comparison; no single quadrature rule dominates kurtosis across all six distributions.

6.7. Summary of MAD-Based Shape Metrics

We conclude with a summary of MAD-based shape metrics and their quantile statistics equivalents when a midpoint quadrature approximation is used. For ease of comparison, we follow the same format as Table 1. The results are summarized in Table 17:
Table 17. Mad-based shape metrics and quantile equivalents.

7. Transformations and Convex Sums

In both experimental and theoretical analyses of data, we often look to select a set of simple components that can be combined to create an appropriate model for the data. A convenient way to do this is to use quantile functions that can be transformed or added to obtain new distributions.

7.1. Transformations

We start with the following result: if T ( x ) is a non-decreasing function of x then T ( Q ( p ) ) is a quantile function [3]. Let Z = T ( X ) and let z p = T ( x ′ ) . Since T ( x ) is non-decreasing, we have
p = P ( Z ≤ z p ) = P ( T ( X ) ) ≤ T ( x ′ ) = P ( X ≤ x ′ )
and, therefore, Q ( p ) = T ( Q ( p ) ) . In other words, the quantile function of the transformed variable z is obtained by transforming the quantile function of the original variable x. Note that for the medians we have M z = T ( M x )
Example 11.
Consider the standard uniform random variable U. Its quantile function is Q ( p ) = p . Consider the function T ( x ) = − log ( 1 − x ) and let Z = T ( X ) . Then Z is exponential with a a quantile function Q ( Z , p ) = − log ( 1 − p ) .
The following are common transformations:
  • Reflected Distribution: Let Y be the distribution X reflected around x = 0 . Its quantile function Q ( Y , p ) = − Q ( Y , 1 − p ) .
    Then, the quantile function of the reflected distribution Y is Q ( Y , p ) = − Q ( X , 1 − p ) . In particular, the octiles of Y are related to octiles of X via Q ( Y , i / 8 ) = − Q ( X , 1 − i / 8 ) . The auxiliary integral of Y is I ( Y , p 1 , p 2 ) = − I ( X , 1 − p 2 , 1 − p 1 ) .
    I ( Y , p 1 , p 2 ) = ∫ p 1 p 2 Q ( Y , p ) d p = − ∫ p 1 p 2 Q ( X , 1 − p ) d p = − I ( X , 1 − p 2 , 1 − p 1 )
    In particular, H ( Y ) = H ( X ) and μ ( Y ) = − μ ( X ) .
    Example 12
    (reflected exponential). Let X be the exponential with scale s > 0 and Y the reflected exponential. The quantile function of X is Q ( X , p ) = − s log ( 1 − p ) and the quantile of Y is Q ( Y , p ) = s log p . Its auxiliary integral
    I ( Y , p 1 , p 2 ) = s p log p − s p
    In particular, its MAD H ( Y ) and mean μ ( Y ) are H ( Y ) = H ( X ) = s log 2 and μ ( Y ) = − μ ( X ) = − s .
  • Power Transformation:  Q ( Y , β ) = Q c ( X ) for some with c > 0 .
    Example 13.
    X is standard exponential with Q ( X ) = − log ( 1 − p ) . Then, Y is a Weibul distribution with Q ( Y , c ) = ( − log ( 1 − p ) ) c .
  • Reciprocal Distribution: The quantile function of 1 / X is 1 / Q ( 1 − p ) .
    Example 14.
    Let X be the power distribution Q ( p ) = C p α . If Y is the reciprocal of X then its quantile function Q ( p ) = 1 / ( 1 − p ) α . The distribution Y is a Pareto distribution.

7.2. Convex Sums

  • Next, one can consider the (convex) linear combinations of quantile functions. Let Q ( X 1 , p ) … , Q ( X k , p ) be the k quantile functions for variables X 1 , … , X k respectively. For each random variable X j , let O i ( X j ) = Q ( X j , p = i / 8 ) denote the corresponding octiles. Let H ( X j ) denote the MAD of X J around its median and let μ ( X j ) denote the its mean. Let w 1 , … , w k be non-negative constants with w 1 + ⋯ + w k > 0 and let
Q ( Z , p ) = w 1 Q ( X 1 , p ) + ⋯ + w k Q ( X k , p )
It is easy to verify that Q ( p ) is a quantile function for some random variable Z. Note that in general, Z ≠ w 1 X 1 + ⋯ + w k X k .
In particular, for the octiles of Z, from Equation (49), we have
O i ( Z ) = w 1 O i ( X 1 ) + ⋯ + w k O i ( X k )
For each X j , define the left and right subarea integrals I L ( X j ) and I R ( X j ) as
I L ( X j ) = ∫ 0 1 2 Q ( X j , p ) d p and I R ( X j ) = ∫ 1 2 1 Q ( X j , p ) d p
Then, from Equation (49) we immediately obtain for the MAD of Z around its median, we obtain
H ( Z ) = I R ( Z ) − I L ( Z ) = ∑ j = 1 k w j I R ( X j ) − I L ( X j ) = ∑ i = 1 k w i H ( X j )
Similarly, for the mean of Z we obtain:
μ ( Z ) = I L ( Z ) + I R ( Z ) = ∑ j = 1 k w j I L ( X j ) + I R ( X j ) = ∑ i = 1 k w i μ ( X j )
Finally, if we use cubic interpolation on four interior octiles of Z to construct the endpoints then from Equations (23), (24) and  (50) we obtain
C L ( 0 ) = 4 O 1 ( Z ) − 6 O 2 ( Z ) + 4 O 3 ( Z ) − O 4 ( Z ) = ∑ j = 1 k w j 4 O 1 ( X j ) − 6 O 2 ( X j ) + 4 O 3 ( X j ) − O 4 ( X j )
and
C R ( 1 ) = − O 4 ( Z ) + 4 O 5 ( Z ) − 6 O 6 ( Z ) + 4 O 7 ( Z ) = ∑ j = 1 k w j − O 4 ( X j ) + 4 O 5 ( X j ) − 6 O 6 ( X j ) + 4 O 7 ( X j )
Therefore, all our approximation methods via octiles are linear: the corresponding subarea integrals for Z can be approximated by the corresponding weighted sums of individual quadrature approximations with octiles.
Example 15
(skewed logistic). Let Q ( X , p ) = − s log ( 1 − p ) and Q ( Y , p ) = s log ( p ) . These are the quantile functions of the exponential distribution X and the reflected exponential distribution Y, respectively. Consider a quantile function Q ( Z , p ) of the form
Q ( Z , p ) = w Q ( X , p ) + ( 1 − w ) Q ( Y , p )
with 0 ≤ w ≤ 1 . This is a quantile function of the skewed logistic distribution [38]. Note that for w ≠ 1 2 , we do not have an explicit form for the cumulative distribution function. However, we can use the quantile function to compute shape metrics and to estimate parameters.
The MAD and mean of Z are:
H ( Z ) = w H ( X ) + ( 1 − w ) H ( Y ) = w H ( X ) + ( 1 − w ) H ( X ) = s log 2 μ ( Z ) = w μ ( X ) + ( 1 − w ) μ ( Y ) = w μ ( X ) − ( 1 − w ) μ ( X ) = ( 2 w − 1 ) s
This gives us the following estimates of the parameters of skewed logistic distribution in terms of the left and right subareas I 1 and I 2 of Z:
s = ( I R − I L ) log 2 and w = I R ( 1 + log 2 ) − I L ( 1 − log 2 ) 2 ( I R − I L )
The subareas can be approximated using octiles via the quadrature approximations developed in this paper. Table 18 shows estimates of s and w from a single sample of size n = 1000 for two choices of true ( s , w ) , using MLE, quartile (two-quartile) approximation of I 1 , I 2 , and C-trapezoid  approximation.
Table 18. Parameter estimates for the skewed logistic: true ( s , w ) vs. MLE, Quartile, and C-Trapezoid ( n = 1000 ).
As shown in Table 18, the C-trapezoid achieves better accuracy than quantile fitting and provides a quick approximation of the parameters within 10% relative error. By contrast, simple quantile fitting gives a much larger relative error of about 25% (especially in estimating s).

8. Parameter Estimation for Common Distributions

In this section, we illustrate how to compute parameters for common distributions. We derive the expressions for parameters in terms of the auxiliary integrals I 1 and I 2 . These are, in turn, approximated with the suggested C-trapezoid quadrature approximations.

8.1. Parameter Estimation with C-Trapezoid Approximation

The proposed method of parameter estimation is the following: Assume that we have n data points x 1 , … , x n . We compute the octiles O 1 , … , O 7 and compute the subarea integrals I L and I R with C-trapezoid approximation. We then estimate distribution parameters from these subarea integrals. Details of the computation of parameters for common distributions are presented in the Appendix B.
We compare the proposed MAD-based method for estimating the parameters with the following three common methods:
  • Maximum Likelihood Estimation (MLE): this method is widely used and is accurate [39]. It provides efficient estimators with minimal variance [40]. A historical overview is given in [41]. Despite its advantages, MLE lacks closed-form solutions for many distributions [42] and requires iterative methods.
  • Moment fitting: this method, formalized by Pearson [43], matches theoretical and empirical moments for computationally accessible estimators. It has limitations with heavy-tailed or asymmetric distributions [44], and the estimates are susceptible to outliers [45,46].
  • Quartile fitting: in this method, we derive parameters by matching theoretical and empirical percentiles [47,48].
There are many other methods, including the Bayesian paradigm [49], Maximum entropy methods [50,51] and others [52]. Many of these methods are computationally complex or assume particular distributions. By contrast, the proposed C-trapezoid approximation is simple and non-parametric. Although not as accurate as other methods, it is very simple and gives a close approximation for many common distributions.
Example 16.
For exponential distribution, I L = ( 1 / 2 λ − O 4 / 2 ) and ( I R = 1 / 2 λ + O 4 / 2 ) . The parameter λ is estimated as λ = 1 / ( I L + I R ) or alternatively, λ = O 4 / ( I R − I L ) . The maximum likelihood estimation is λ = n / ( x 1 + ⋯ + x n ) = 1 / x ¯ . The moment-fitting estimate λ = n / ( x 1 + ⋯ + x n ) = 1 / x ¯ is the same as MLE for exponential data. With median (quartile) fitting, λ = log 2 / O 4 and it uses the median O 4 only. Finally, with C-trapezoid method, λ = 1 / ( I L + I R ) with subareas I L and I R estimated by the C-trapezoid octile formula in Equation (68).
Table 19 gives example estimates for the scale for each distribution. Values are mean estimates over 500 replicates with n = 100 . Percent errors relative to the true value are shown in parentheses.
Table 19. Estimates for the scale parameter across distributions: True (parameter used in simulation), MLE, Moment-fit, Quartile, and C-Trapezoid. Mean over 500 replicates, n = 100 . Percent error is shown in parentheses.
Table 19 suggests that MLE and moment fitting are consistently the most accurate in this simulation, quartile fitting has the largest bias, and the proposed C-trapezoid method substantially improves over quartile fitting while remaining less accurate than MLE/moment fitting.

8.2. Comparison with L-Moments

Linear moments (L-moments) are expected values of linear combinations of order statistics. Hosking [37] defines the r-th L-moment as follows. If X is a real-valued random variable, let X 1 : n ≤ X 2 : n ≤ ⋯ ≤ X n : n be the order statistics of size n. Then, the L-moments of X are defined as
l r = 1 r ∑ k = 0 r − 1 ( − 1 ) k r − 1 k E ( X r − k : r ) = 1 r n r ∑ x 1 < ⋯ < x r ( − 1 ) k r − 1 k E ( X r − k : r )
It can be shown that these can be expressed as follows
l r = ∫ 0 1 Q ( p ) P r − 1 ( p ) d p
where the functions P r ( p ) are shifted Legendre polynomials
P r ( p ) = ∑ k = 0 r ( − 1 ) r − k r k r + k k p k
The first L moments are:
l 1 = ∫ 0 1 Q ( p ) d p , l 2 = ∫ 0 1 Q ( p ) ( 2 p − 1 ) d p , l 3 = ∫ 0 1 Q ( p ) ( 6 p 2 − 6 p + 1 ) d p l 4 = ∫ 0 1 Q ( p ) ( 20 p 3 − 30 p 2 + 12 p − 1 ) d p
The first two L-moments l 1 and l 2 , are called L-location and L-scale. The third and fourth L-moment ratios τ 3 = l 3 / l 2 and τ 4 = l 4 / l 2 are called L-skewness andL-kurtosis. These can be used to summarize a univariate distribution. Note that L-moments l r are a linear function of the expected order statistics. The existence of a finite mean for X is a necessary and sufficient condition for all linear moments to exist [37].
If a distribution has finite variance σ 2 , then the following relations hold:
l 2 = 1 2 E ( X 2 : 2 − X 1 : 2 ) and σ 2 = 1 2 E ( X 2 : 2 − X 1 : 2 ) 2
Equation (63) shows that σ 2 gives more weight to larger differences as these are squared. Since L-moments are linear functions of ordered data, they are less sensitive to outliers, providing more stable shape estimates estimates.
Example 17.
For the exponential distribution, the first L-moments are:
l 1 = 1 λ , l 2 = 1 2 λ , l 3 = 1 6 λ , l 4 = 1 12 λ
If we have a sample of size n drawn from a distribution specified by a finite number k of parameters, then we estimate these parameters by equating the first k sample L-moments to corresponding population estimates. Such methods offer robust alternatives to traditional measures of standard deviation, skewness, and kurtosis. In small sizes, this method can outperform maximum likelihood estimation for some distributions. For a detailed discussion, see [53,54].
It is of interest, therefore, to compare this method to the parameter estimation based on MADs. In Appendix C, we summarized the parameter estimation method based on L-moments. Since L-moments are expressed as integrals of products of quantile functions with polynomials, we could consider approximating L-moments using the C-trapezoid approximation. Let us define V r ( p ) as the integrand of l r in Equation (62).
Then, if we define O 0 = C L and O 8 = C R and, then C-trapezoid approximation for the r-th linear moment l r in Equation (60) is
l r ≈ 1 16 ∑ i = 1 8 V r i − 1 8 + V r i 8 = 1 16 ∑ i = 1 8 O i − 1 P r − 1 i − 1 8 + O i P r − 1 i 8
Equation (64) gives us a unified way to compute the L-moments directly in terms of octiles and polynomials P r ( · ) evaluated at p = i / 8 .
To illustrate, consider the computation of the first two L moments l 1 and l 2 . Since V 1 = Q ( p ) is it clear that the first linear moment l 1 is just the mean μ = ( I L + I R ) . Then, from Equation (27) we obtain
l 1 ≈ 3 ( O 7 + O 1 ) − 2 ( O 6 + O 2 ) + 3 ( O 5 + O 3 ) 8
Next, for V 2 we have V 2 ( p ) = Q ( p ) ( 2 p − 1 ) . Then replacing Q ( 0 ) by C L and Q ( 1 ) by C R we have
V 2 ( 0 ) = − C L , V 2 ( 1 8 ) = − 3 4 O 1 V 2 ( 2 8 ) = − 1 2 O 2 V 2 ( 3 8 ) = − 1 4 O 3 V 2 ( 1 2 ) = 0 V 2 ( 5 8 ) = 1 4 O 5 V 2 ( 6 8 ) = 1 2 O 6 V 2 ( 7 8 ) = 3 4 O 7 V 2 ( 1 ) = C R
Then, the C-trapezoid approximation for the second L-moment l 2 gives us
l 2 ≈ 1 16 [ − C L + 3 4 O 7 − 3 4 O 7 + 1 2 O 2 − 1 2 O 2 + 1 4 O 3 − 1 4 O 3 + 1 4 O 5 + 1 4 O 5 + 1 2 O 6 + 1 2 O 6 + 3 4 O 7 + 3 4 O 7 + C R ] = 2 ( C R − C L ) + 3 ( O 7 − O 1 ) + 2 ( O 6 − O 2 ) + ( O 5 − O 3 ) 32 = 9 ( O 5 − O 3 ) + 11 ( O 7 − O 1 ) − 10 ( O 6 − O 2 ) 32
Once L-moments are (approximately) computed, we can use them to estimate the parameters. We can also estimate the parameters via subareas I L and I R . Recall that the C-trapezoid approximation for the left and right subareas I L and I R from Equation (68):
I L ≈ 3 ( O 1 + O 3 ) − 2 O 2 8 and I R ≈ 3 ( O 5 + O 7 ) − 2 O 6 8
We summarize parameter estimation using L moments and MAD (using subarea integrals) in Table 20.
Table 20. Comparison of parameter estimation using L-moments ( l 1 and l 2 ) and subarea integrals ( I L and I R ) for some common distributions.
Finally, let us connect the L-moments and auxiliary integral as follows. Since Q ( p ) = I ′ ( 0 , p ) a simple integration by parts gives
l 2 = ∫ 0 1 ( 2 p − 1 ) Q ( p ) d p = 2 ∫ 0 1 p Q ( p ) d p − ∫ 0 1 Q ( p ) d p = 2 l 1 − 2 ∫ 0 1 I ( 0 , p ) d p ] − l 1 = l 1 − 2 ∫ 0 1 I ( 0 , p ) d p
Alternatively, consider Equation (6). For any ( 0 ≤ p ≤ 1 ) we have
H X , Q ( p ) = μ − 2 I ( 0 , p ) + ( 2 p − 1 ) Q ( p )
Integrating both sides of Equation (70) we obtain
∫ 0 1 H X , Q ( p ) d p = μ − 2 ∫ 0 1 I ( 0 , p ) d p + l 2
From Equations (69) and (71), we obtain
l 2 = 1 2 ∫ 0 1 H X , Q ( p ) d p
Equation (72) gives us a very simple interpretation of the second linear moment: The second linear moment l 2 is one-half of the integral of MADs computed over all points.
Table 21 summarizes one n = 100 draw (default_rng(42)): formulas of Table 20 with PWM-based ( l ^ 1 , l ^ 2 ) [37] vs. trapezoid ( I ^ L , I ^ R )  (68) from linear interpolated octiles (extrapolated last bin).
Table 21. Comparison of estimates for scale of L-moment and MAD-based estimation with C-trapezoid approximation ( n = 100 points). Parentheses show absolute percent error relative to the true scale parameter with C-trapezoid approximation.
Table 21 shows MAD-based method has better accuracy for heavy-tailed distributions like log-normal and Pareto. while remaining competitive for most other distributions.
Example 18.
For the exponential distribution, from Equation (A18) we have I ( 0 , p ) = ( 1 − p ) log ( 1 − p ) + p / λ . The second L-moment l 2 is then
l 2 = l 1 − 2 ∫ 0 1 ( 1 − p ) log ( 1 − p ) + p λ d p = 1 λ − 2 λ ∫ 0 1 u log u d u − 2 λ ∫ 0 1 ( 1 − u ) d u = 1 λ − 2 λ u 2 log u 2 − u 2 4 | 0 1 − 2 λ · 1 2 = 1 λ + 1 2 λ − 1 λ = 1 2 λ

8.3. Estimating Parameters for Distributions with Several Parameters

We can extend our method to handle distributions with several parameters. For common distribution with one or two parameters, we estimated the parameters by computing the analytical expression for the subareas integrals and approximating them in terms of quadrature approximations. For distributions with multiple parameters, it is sometimes easier to compute them via empirical MADs. The key idea is to compute MADs around octiles. For k parameters, we need to use k such equations.
Our general approach is the following. As before, assume that we have n data points x 1 , … , x n . Let O ^ 1 , … , O ^ 7 be the sample octiles. Define the sample mean μ ^ and the sample MAD H ^ i of X around empirical octiles O ^ i by
μ ^ = ( x 1 + ⋯ + x n ) n , H i ^ = | x 1 − O i ^ | + ⋯ + | x n − O i ^ | n i = 1 , … , 7
This computation of empirical MAD H ^ i requires O ( n ) subtractions, computing absolute values and additions for each octile. If the empirical octiles are available, then we can approximate MADs from Equation (10) by C-Trapezoid approximation as follows
μ ^ ≈ ∑ j = 1 i O ^ j − 1 + O ^ j 16 + ∑ j = i 7 O ^ j + O ^ j + 1 16 H ^ i ≈ ∑ j = i 7 O ^ j + O ^ j + 1 16 − ∑ j = 1 i O ^ j − 1 + O ^ j 16 + i / 4 − 1 O ^ i i = 1 , … , 7
For notational convenience, we let O ^ 0 and O ^ 8 be the left and right endpoints C L ( 0 ) and C R ( 1 ) computed from empirical octiles using Equations (23) and (24).
If we use MADs around all octiles, then Equation (73) gives us eight equations: one for the mean and seven for MADs of X around its 7 octiles. We compute the parameters by equating the theoretical expressions for the mean μ = I ( 0 , 1 ) and MAD H ( X , O i ) with their empirical counterparts μ ^ and H ^ i : The main equation is the following (from (10))
I ( 0 , 1 ) = μ ^ I ( i / 8 , 1 ) − I ( 0 , i / 8 ) + i / 4 − 1 O i = H ^ i i = 1 , … , 7
We illustrate this for some important distributions. Let us consider a few interesting cases:
  • Distributions with the same number of parameters and equations: We first consider the case of using exactly k parameters with k equations.
    Example 19.
    Assume that X a generalized 4-parameter Tukey distribution [3]. Its quartile function
    Q ( p ) = λ 1 + p λ 3 − ( 1 − p ) λ 4 λ 2
    where the parameter λ 1 is the location, λ 2 is the scale, λ 3 is the skewness and λ 4 is the kurtosis.
    For this quantile function, we obtain for the auxiliary integral
    I ( p 1 , p 2 ) = ( p 2 − p 1 ) λ 1 + 1 λ 2 p 2 λ 3 + 1 − p 1 λ 3 + 1 λ 3 + 1 + ( 1 − p 1 ) λ 4 + 1 − ( 1 − p 2 ) λ 4 + 1 λ 4 + 1
    For the mean λ 1 and MAD of X around O 2 , O 4 and O 6 we obtain:
    λ 1 = I ( 0 , 1 2 ) + I ( 1 2 , 1 ) , H ( X , O 2 ) = I ( 1 4 , 1 ) − I ( 0 , 1 4 ) − O 2 / 2 H ( X , O 4 ) = I ( 1 2 , 1 ) − I ( 0 , 1 2 ) , H ( X , O 6 ) = I ( 3 4 , 1 ) − I ( 0 , 3 4 ) + O 6 / 2
    By equating the analytical expressions for mean and MAD in Equation (78) with their empirical counterparts in Equation (73)
    λ 1 ^ = μ ^ , H ( X , O 2 ) = H 2 ^ , H ( X , O 4 ) = H 4 ^ , H ( X , O 6 ) = H 6 ^
    and using the C-trapezoid approximation for the integrals in Equation (78), we estimate the parameters λ ^ 1 , λ ^ 2 , λ ^ 3 and λ ^ 4 . There are four equations and four unknowns. We compute these parameters numerically by standard iterative methods.
  • Shifted Distributions: A number of multi-parameter distributions are obtained by a single shift. For such distributions, the parameters can be easily estimated from those of the original distribution.
    Example 20.
    X is distributed according to the 3-parameter Log-Normal Distribution μ ∈ ( ∞ , + ∞ ) , σ 2 ( σ > 0 ) and x > ν > 0 . The parameter ν > 0 is the so-called threshold. If ν = 0 then this reduces to the standard log-normal distribution X. This distribution is often used in hydrology and reliability analysis [55,56].
    Let Y = X − ν . Then Y follows the standard log-normal distribution with parameters μ and σ. The quantile function Q ( X ; p ) = ν + Q ( Y ; p ) . The auxiliary integrals I ( X ; p 1 , p 2 ) = I ( Y ; p 1 , p 2 ) + ν ( p 2 − p 1 ) . Then it can be shown that since MADs are shift invariant, and O i ( X ) = O i ( Y ) + ν we have H X , O i ( X ) = H ( Y , O i ( Y ) ) + ν .
    Then from Equation (A39) in Appendix B we obtain
    μ ( X ) = e μ + σ 2 / 2 + ν H X , O i ( X ) = 2 Φ ( σ − u i ) − 1 e μ + σ 2 / 2 + i / 4 − 1 e μ + σ u i + ν
    where u i are the octiles of the standard Normal distribution. This gives us eight equations from which we can choose three to compute μ, σ, and ν.
  • Distributions with a quantile function in closed form: For such distributions, we can often compute an explicit expression for MADs. These expressions could involve some special functions,
    Example 21.
    Consider the Burr XII distribution with shape parameters c andk and scale parameter λ This distribution is often used to model non-normal, heavy-tailed and skewed data in reliability analysis [57], insurance [58], flow levels in hydrology [59], to name just a few. For c = 1 this becomes the Lomax distribution. For k = 1 we obtain a log-logistic distribution. The details are provided in Appendix D. We summarize just a few results.
    The quantile function Q ( p ) is available in closed form and is
    Q ( p ) = λ ( ( 1 − p ) − 1 / k − 1 ) 1 / c
    The mean μ and its MAD around octiles are given by
    μ = λ k B k − 1 / c , 1 + 1 / c H ( X , O i ) = 2 λ k B * 1 − i / 8 1 / k ; k − 1 / c , 1 + 1 / c − λ k B k − 1 / c , 1 + 1 / c + λ i / 4 − 1 1 − i / 8 − 1 / k − 1 1 / c i = 1 , … , 7
    where B ( · ) and B * ( · ) are Beta and incomplete Beta functions respectively. There are three parameters and eight equations in (82).
  • Distributions without quantile function in closed-form: For some distributions like Beta, Gamma, Maxwell–Boltzmann [21] there is no closed-form formula for the quantile function. However, these distributions have closed-form expressions for their cumulative distribution functions F ( x ) . In such cases, we use an estimate of the octiles and compute the MAD by integrating the CDF directly. Our main result is the following equation for MAD H ( X , a ) derived in Appendix E.
    H ( X , a ) = ( μ − a ) + 2 ∫ x ≤ a F ( x ) d x
    Example 22.
    Assume X is distributed according to Gamma distribution with shape parameter α > 0 and rate β > 0 [21]. For this distribution, the quantile function Q ( p ) does not exist in closed form. We compute mean and MADs by integrating F ( x ) using Equation (83). The details are provided in Appendix E. For this distribution, the mean and MAD H ( X , O 4 ) are
    μ = α β and H ( X , O 4 ) = α β − O 4 + 2 β ( β O 4 ) α e − β O 4 Γ ( α )
    Similarly, we can compute other MAD H ( X , O i ) for this distribution. Assuming that we can accurately compute the octiles, Equation (84) gives us eight equations for the two unknowns that can be solved numerically. For a survey of methods, see [60],
For many of the cases discussed, we have more equations than parameters. The system is, therefore, over-constrained and will not, in general, have a unique solution. There are a few ways to address this:
  • We can choose just k equations for k unknowns. For example, for the 4-parameter Tukey distribution, we took the equation for the mean and three MADs around the quartiles. An interesting question to investigate is what MADs to use (e.g., MADs over “furthest” octiles) or whether it is better to exclude the equation for the mean and just focus on octiles.
  • We can choose different sets of k equations, compute the parameters, and average them. For example, for distributions, 3 parameters and 8 possible equations to choose from, there are 8 3 = 56 possible sets of parameters to choose from. We can average over any set of such parameters. The main disadvantage is the computational cost to compute each set. An interesting question to consider is estimating the number of such sets and which sets of parameters to use for averaging.
  • We can estimate the parameters θ by minimizing the mean square error (MSE). To that end, consider the following quadratic “loss” function:
    L ( θ ) = ( μ ( θ ) − μ ^ ) 2 + ∑ i = 1 7 H ( θ ; X , O i ) − H ^ i 2
    We included θ in μ ( · ) and H ( · ) to emphasize their dependence on this parameter. We can compute the parameter θ by minimizing the loss function L ( θ ) . We can use any standard techniques, such as gradient descent [61,62] (for a recent survey, see [63]). For such algorithms, the gradients can be computed numerically by forward differences.
  • We can estimate the parameters θ by minimizing the mean absolute error (MAE). To that end, consider the following “loss” function:
    L ( θ ) = | μ ( θ ) − μ ^ | + ∑ i = 1 7 H ( θ ; X , O i ) − H ^ i
    Minimizing loss function in Equation (86) is more difficult and sually slower that minimizing quadratic function in Equation (85). The absolute value terms in Equation (86) are not differentiable at zero. This makes it difficult to use many algorithms, such as gradient descent. A detailed discussion is presented in [64].
We hope to investigate these methods and the questions they raise in our future work.

8.4. Comparison to Estimation of Parameters by Truncation

In the suggested C-trapezoid approximation, we use cubic polynomials to truncate at C L and C R . A natural question is the following: what if we simply truncate at first and last octile, compute the MAD, and estimate the parameters. How do the obtained approximations compare with the suggested method?
We proceed as follows: Consider a distribution X truncated at x 1 = Q ( p 1 ) and x 2 = Q ( p 2 ) . We will denote this distribution X * . The density f * ( x ) and cumulative distribution function F * ( x ) of the truncated distribution are
f * ( x ) = f ( x ) ( p 2 − p 1 ) 0 F * ( x ) = F ( x ) − p 1 ( p 2 − p 1 ) x 1 ≤ x ≤ x 2 0 otherwise
For any p 1 ≤ p * ≤ p 2 with x * = Q ( p * ) we can compute MAD H ( X * , x * ) as
H ( X * , x * ) = ∫ x 1 x 2 | x − x * | f * ( x ) d x = I ( p * , p 2 ) − I ( p 1 , p * ) + 2 p * − ( p 1 + p 2 ) Q ( p * ) ( p 2 − p 1 )
We now consider some special cases for truncation at the octiles p 1 = 1 8 and p 2 = 7 4 . The cumulative distribution function of a truncated distribution is F ∗ ( x ) = ( F ( x ) − F ( O 1 ) ) / ( F ( O 7 ) − F ( O 1 ) ) = 4 3 ( F ( x ) − F ( O 1 ) ) . In particular, the median O 4 * of the truncated distribution
O 4 * = Q F ( O 1 ) + F ( O 7 ) 2 = Q ( 1 2 ) = O 4
coincides with the median O 4 of the truncated distribution.
The mean μ * and MAD around the median for the truncated distribution are
μ * = 4 3 I ( 1 8 , 7 8 ) , and H ( X * , M ) = 4 3 I ( 1 2 , 7 8 ) − I ( 1 8 , 1 2 )
Using the trapezoid quadrature approximation for the integrals:
I ( 1 8 , 1 2 ) = ( O 1 + O 2 ) 16 + ( O 2 + O 3 ) 16 + ( O 3 + O 4 ) 16 I ( 1 2 , 7 9 ) = ( O 4 + O 5 ) 16 + ( O 5 + O 6 ) 16 + ( O 6 + O 7 ) 16
we obtain the following approximations
μ * = ( O 7 + O 1 ) + 2 ( O 6 + O 2 ) + 2 ( O 5 + O 3 ) 12 H ( X * , O 4 ) = ( O 7 − O 1 ) + 2 ( O 6 − O 2 ) + 2 ( O 5 − O 3 ) 12
Example 23.
Consider the exponential random variable truncated at the first and last octiles. Its density f * ( x ) = ( 4 3 ) λ e − λ x and its cumulative function F ( x ) = ( 4 3 ) F ( x ) − 1 6 .
From Equation (92), we have
I ( 1 8 , 1 2 ) = 7 8 O 1 − 1 2 O 4 + 3 8 λ and I ( 1 2 , 7 9 ) = 1 2 O 4 − 1 8 O 7 + 3 8 λ
Then for the truncated mean μ * we have
μ * = 4 3 I ( 7 8 , 1 2 ) = 4 3 I ( 1 8 , 1 2 ) + I ( 1 2 , 7 8 ) = 1 λ + 7 6 O 1 − 1 6 O 7
From Equations (92) and (94) we obtain
1 λ = μ * − 7 O 1 + O 7 6 = 2 ( O 6 + O 7 ) + 2 ( O 5 + O 3 ) − ( O 7 + 13 O 1 ) 12
As a supplementary single-draw illustration, we evaluate the truncated-subarea rate estimator from (94) at the empirical octiles of one simulated Exp ( 1 ) sample ( n = 100 ): this gives λ ^ = 1.203 , i.e., ( λ ^ / λ ^ − 1 ) × 100 % ≈ + 20.3 % error relative to λ = 1 . For contrast, Table 19 (exponential row, means over 500 such replicates at n = 100 ) reports λ ^ = 1.01 ( + 1 % ) for MLE, 1.31 ( + 31 % ) for quartile matching, and 1.12 ( + 12 % ) for the C-trapezoid inversion of ( I ^ L + I ^ R ) . Thus, the truncated-subarea value is much larger than the pooled MLE bias, somewhat larger than the pooled C-trapezoid bias, and closer in magnitude to the pooled quartile bias, underscoring that one realization need not resemble replicate-averaged performance. Therefore, MAD-based estimation with the C-trapezoid is better than simple truncation.

8.5. Tail Probabilities

Using MADs allows estimation of tail probabilities. The most general bound for any distribution (with finite variance σ 2 ) is Chebyshev’s inequality [16]:
P | X − μ | ≥ b σ ≤ 1 / b 2
This inequality follows from the so-called Pearson inequality [16] with r = 2 :
P X − μ ≥ b V r 1 / r ≤ 1 / b 2 where V r = E | X − μ | r
For r = 1 , we have an inequality for bounds in terms of MAD H ( X , μ ) around the mean
P | X − μ | ≥ b H ( X , μ ) ≤ 1 / b
Similarly, there is an inequality in terms of MAD H around the median given by [1]
P | X − M | ≥ b H ≤ 1 / b
This inequality does not require a finite variance, only the existence of a Riemann-integrable quantile function Q ( p ) , providing a robust alternative across diverse distributional families.

8.6. Advantages and Limitations of Proposed Approximation for Parameter Estimation

Maximum Likelihood Estimation often encounters severe computational difficulties with heavy-tailed distributions, including extremely flat likelihood surfaces and high sensitivity to outliers. When datasets contain measurement errors or outliers, traditional methods such as maximum likelihood or moment fitting can produce severely biased estimates. The proposed approach uses only octiles, providing natural robustness without requiring outlier removal procedures.
As shown above, parameter estimation using the C-trapezoid is not as accurate as maximum likelihood, but it is typically within 10% of the exact values. At the same time, the proposed approximation provides a closed-form, non-iterative formula that is more robust than maximum likelihood or moment fitting, which are more sensitive to outliers. We also note that the C-trapezoid method provides much better parameter estimation than simple median matching. This can be explained by the fact that we estimate parameters by averaging octiles rather than fitting a single value. On the other hand, unlike MLE and moment fitting, we require only octiles, making our method more resilient to outliers.
Example 24.
Consider estimating the parameter λ for the exponential distribution. If we replace the maximum value x n by x n + ( x 1 + ⋯ + x n − 1 ) then the sample mean doubles and the rate λ decreases by 50%. At the same time, the octiles do not change, resulting in no change for our estimation of λ with octiles using the C-trapezoid method.
Another challenge in applying the proposed method is computing quantiles [65,66]. For large data sets, sorting could be expensive. Sorting algorithms (merge or heapsort and their variants) have O ( n log n ) complexity [67]. In small data sets, estimates could be sensitive to outliers. There may be dependencies in sequences that are difficult to identify. A detailed discussion on practical and theoretical issues is presented in [65]. A comprehensive review of quantile estimation methods and a methodology for estimating quantiles by simulating processes with arbitrary dependence structures is presented in [68].
The main advantage of our method is its computational simplicity. For many distributions, the method provides a closed-form, non-iterative approximation to the parameters directly in terms of the octiles. A parameter estimation method based on MAD of a truncated distribution using quantile functions was recently described in [69].
Remark (wall-clock comparison).   In addition to the asymptotic O ( n log n ) sorting discussion above, we report illustrative median wall-clock times (milliseconds) for a representative setting in Table 22. For the reported results, maximum likelihood uses iterative optimization while a closed-form, rank-based estimator avoids it. We simulate Weibull ( α = 2 , β = 1 ) samples, and for each sample size n we draw N trials = 30 independent datasets (seed 0), timing one call per draw.
Table 22. Illustrative wall-clock times (median ms per independent sample; Weibull α = 2 , β = 1 ). MLE via scipy weibull_min.fit (floc = 0 ); closed-form via Hosking PWM/L-moments + algebraic inversion. N trials = 30 , seed 0. Medians are from one representative workstation run; re-run wall_clock_mle_vs_closed_form.py from the public GitHub version 3.5.8. The repository is listed under Data Availability for machine-specific timings.
Baseline (MLE): scipy.stats.weibull_min.fit with fixed location floc = 0 (SciPy 1.16.3).
Closed-form Comparator: unbiased probability-weighted moments [37] for ( l 1 , l 2 ) followed by the closed-form Weibull inversion used elsewhere in this paper (sort once per draw; no optimizer).
This comparator matches the computational structure of our octile pipelines—empirical quantiles, fixed linear statistics, and algebraic parameter recovery—while keeping the benchmark narrowly defined and reproducible. The % column is 100 ( 1 − t closed / t MLE ) , i.e., the percentage reduction in median time relative to MLE. Full machine metadata, permanent GitHub version 3.5.8. URLs for the replication script and output, and caveats are discussed in Appendix F.
Finally, it should be noted that we do not require the explicit form of the quantile function, only the estimates of the octiles. Some distributions, such as Gamma and Beta, do not have explicit forms for their quantile functions [27,70]. However, many distributions can be modeled by convex linear combinations of quantile functions [3]. Because MAD is based on an L 1 metric and additive (Equation (52)), the proposed approximation can be applied directly based on (empirical) octiles.
The proposed methodology of using C-trapezoid approximation provides a unified approach to parameter estimation that is simple, resilient to outliers, and has a simple geometric interpretation. Our approach applies to many distributions (with finite means), including some characterized by heavy tails [71]. Compared with simplistic quantile interpolation, this framework, therefore, improves accuracy broadly, while still requiring readers to heed endpoint-sensitive exceptions such as Laplace. The proposed method yields better results than the commonly used quantile-based methods for most distributions. The main advantage is its computational simplicity and geometric interpretation, which allows a quick initial assessment of candidate models before more advanced analysis methods are employed.

8.7. Limitations with Fat-Tailed Data and Truncation

In our discussion, we assumed that using octiles alone would yield simple expressions connecting mean absolute deviations to shape parameters. The proposed methodology implies truncation at C L and C R computed by Equations (23) and (24).
However, there are many applications where the probability in the tails of the distribution can be significant and cannot be ignored. We present two areas:
  • Hydrology: as pointed in [3], the occurrence of very long-tailed distributions in hydrology has led to the consideration of specialized quantile functions and distributions [72]. For such models, more specialized methods are often employed, such as K-moment methods [14,15,68]. These methods account for long-range dependence and better handle outlier data.
  • Financial Data: Many asset prices in finance do not follow simple distributions [73,74,75]. Starting with pioneering work in [76], several heavy-tail distributions have been proposed, including Levy distributions [77,78,79,80] and their extensions [81,82]. Pareto [83] and other heavy-tailed distributions [75,84].
One of the major limitations of the proposed method is that it involves (implicit) truncation (at C L and C R ). As a result, the obtained distributions are not infinitely divisible (i.e., can be expressed as a sum of an arbitrary number of independent and identically distributed random variables). Infinitely divisible distributions are necessary for continuous time asset pricing [73], dynamic portfolio theory [85], and options valuation [86]. Unlike standard normal distributions, infinitely divisible distributions enable the construction of arbitrage-free continuous-time pricing models and allow the modeling of fat tails, large kurtosis [75], and jumps [87].
Although the proposed approximation offers robustness and computational convenience, it may not be feasible for many such distributions. We could extend our methodology to handle such distributions by estimating Q ( p ) and Q ( 1 − p ) for p ↦ 1 and using these instead of endpoints C L and C R .
Another approach is to model such distributions with sums of basic quantile functions considered in this paper. This would allow us to analyze data with fat tails or asymmetry where simple quantile functions would not perform well. We can consider algorithms analogous to expectation maximization or other optimization models to compute the weights. This is analogous to modeling fat-tailed distributions with mixtures of normal distributions. We hope to address this in our future research.
At the same time, we want to emphasize that our goal is to provide a computationally simple method for deciding between models before more advanced analysis methods are deployed.
In the next two sections, we present two case studies to illustrate our approach.

9. Case Study I: Analyzing Overnight and Daytime Returns for Technology Stocks ETF (Exchange-Traded Fund XLK)

For our first case study, we study the similarities and differences in overnight and daytime returns of the XLK Exchange-Traded Fund (ETF). This ETF tracks the largest technology stocks in the S&P 500. We analyze this ETF for 27 years from 1999 to 2025.
It has long been observed that the return distributions in these periods could be quite different for many stocks [88,89,90,91,92,93,94,95,96,97,98,99,100,101]. It should be kept in mind that transaction costs represent a critical factor. Recent research has demonstrated that many documented anomalies disappear after accounting for realistic trading frictions [102,103,104,105,106]. We will ignore trading costs in the current case study.
We will focus on the overnight and daytime returns of technology stocks represented by the XLK ETF. We proceed as follows. For each day d i , let O i and C i denote the Open and Close prices, respectively. These prices are obtained from the Wharton Data Resource Services (WRDS) database [107].
A day d i consists of two periods:
  • (previous) Overnight period: time between the closing time of stock trading of the previous trading day d i − 1 and the opening time of the present day d i .
  • Daytime period: time between the opening time of stock trading for d i and the closing time of stock trading for the same day d i .
For the U.S. market, the opening and closing times are the times of the main floor of the New York Stock Exchange: the opening time is 9:30 a.m. EST and the closing time is 4:00 p.m. EST. Although we do have (sometimes active) pre-market and extended hours trading, we will ignore these times and only consider the above times.
Table 23 provides an example of the daily open and close prices O i and C i for XLK for several trading days in April of 2024.
Table 23. Example of historical stock data.
We divide each day d i into three time periods shown in Figure 4.
Figure 4. CO (overnight), OC (daytime), and CC (daily) returns over 24-h period.
We compute the corresponding returns for each day d i and its sub-periods as follows:
  • CO (Close-to-Open or “night” trading): this is the return of the first sub-period (night portion) of day d i . Since this sub-period is the same as the previous night period, its return is computed as the percent change between the Close price C i − 1 at d i − 1 and the Open price O i of the trading day d i . We will use the notation R i C O to denote such returns.
  • OC (Open-to-Close or “daytime” trading): this is the return of the second subperiod (daytime portion) of day d i . We will use the notation R i O C to denote such returns.
  • CC (Close-to-Close or “24-h” trading): the return is computed as the percent change between the Close price C i − 1 of trading day d i − 1 and the Close price C i of the day d i . We will use the notation R i C C to denote such returns. This definition corresponds to the standard definition of daily returns in finance. Note that for the CC return R i C C for day d i we have
    R i C C = ( 1 + R i C O ) ( 1 + R i O C ) − 1
    The 24-h return R i C C is the compounded return from the night and day sub-periods ( R i C O and R i O C ), as expected.
In this case study, we will focus on overnight and daytime returns. From the initial Close and Open price data in Table 23, we compute the returns data for the three periods. An example is given in Table 24.
Table 24. Example of historical stock data for XLK with % returns.
For our study, we computed the overnight and daytime returns for XLK for 1999–2025. There are 6789 overnight and 6789 daytime return observations in total (about 250 trading days per year). Table 25 reports, for each calendar year, primary information and marginal statistics (n, range, missing values, mean, standard deviation, classical skewness, and excess kurtosis) for both sub-periods, without aggregating across years. Table 26 gives, for each year, the autocorrelation of daily returns at lags 1–5 (trading days) within that year. Each year, we compute the corresponding octiles; these are summarized in Table 27. Per-year C-trapezoid H, G, and K from the octile construction appear in Table 28.
Table 25. Per-year dataset summary for XLK overnight and daytime returns (1999–2025). For each calendar year and sub-period: sample size n, range [ min , max ] (percent), non-finite count (Miss.), mean and standard deviation (percent), and classical skewness ( G c ) and excess kurtosis ( K c ).
Table 26. Per-year autocorrelation of XLK daily overnight and daytime returns at lags 1–5 (trading days). For each calendar year, acf k is the sample Pearson autocorrelation of daily returns within that year (not across years).
Table 27. Overnight and daytime return octiles for XLK. All octile entries are in percent. For each year, the higher median return O 4 is highlighted in green, and the lower median return is highlighted in red.
Table 28. Overnight and daytime MAD-based returns metrics. For each year, the higher “normalized” median return O 4 / H is highlighted in green, the lower normalized median return O 4 / H is highlighted in red.
Table 25 shows substantial year-to-year variation in volatility and tail behaviour: for example, 2008 and 2020 combine wide ranges and elevated K c , while several mid-2010s years exhibit tighter ranges and lower excess kurtosis. Daytime standard deviation often exceeds the overnight counterpart within the same year (e.g., 2001, 2008, 2025), consistent with higher pooled daytime volatility.
Pooled over 1999–2025 ( n = 6789 per leg, no missing values), overnight returns span [ − 14.8 % , 7.4 % ] with mean 0.058 % , std 1.002 % , G c = − 1.004 , and K c = 17.160 , and C-trapezoid H ¯ = 0.561 % , G ¯ = − 0.026 , K ¯ = 0.613 ; daytime returns span [ − 7.5 % , 15.9 % ] with mean − 0.008 % , std 1.355 % , G c = 0.417 , and K c = 8.153 , and H ¯ = 0.851 % , G ¯ = − 0.055 , K ¯ = 0.592 .
Table 26 reports short-horizon serial dependence of daily returns within each calendar year. Most acf 1 values are small in magnitude (typically | acf 1 | < 0.2 ), with occasional larger values (e.g., overnight 2007: + 0.18 ; daytime 2025: − 0.30 at lag 1). The COVID year 2020 shows more pronounced short-lag structure for overnight returns ( acf 1 = − 0.22 , acf 2 = + 0.26 ).
Autocorrelation of the 27 annual per-year C-trapezoid MAD spreads H ^ (lags in years; contrast Table 26, where lags are trading days) shows strong lag-1 and lag-2 persistence for both legs (overnight acf 1 = 0.55 , acf 2 = 0.28 ; daytime acf 1 = 0.60 , acf 2 = 0.35 ), with acf 3 near zero and acf 4 – acf 5 negative.
From Table 27, we see that in 18 out of 27 years, the median return was higher for the overnight period than for the daytime period. This suggests that most of the gain for the technology stocks is realized during the overnight period.
Before further analysis, we compare the exact mean absolute deviations for the two periods with the approximations computed by the midpoint and C-trapezoid approximations that were summarized in Table 5. The results are presented in Figure 5.
Figure 5. XLK MAD % error by year: C-trapezoid vs midpoint.
From Figure 5 we see that both the midpoint and the C-trapezoid approximations underestimate the exact MAD. The accuracy of the C-trapezoid approximation is much better than that of the midpoint approximation: for the overnight period, it is around 10% vs. 30%. For the daytime approximation, the accuracy of the proposed C-trapezoid is even higher: around 5% vs. about 25% for the midpoint.
From the octiles in Table 27, using the proposed C-trapezoid approximation, we compute the mean absolute deviation H, MAD skewness G, and MAD kurtosis K separately for each year and each sub-period. In addition, we compute the inverse relative dispersion O 4 / H . The results are summarized in Table 28.
The mean absolute deviation can be viewed as a measure of volatility or risk [108]. Unlike the standard volatility metric, the standard deviation of returns, the MAD is less sensitive to outliers and can provide a more accurate representation of volatility [109,110,111,112].
The ratio O 4 / H in Table 28 reads off median return per unit of C-trapezoid MAD spread, conceptually like a Sharpe ratio [113], but built from the median octile O 4 and H rather than mean and standard deviation. Over 1999–2025, the overnight MAD risk-adjusted median return O 4 C O / H C O exceeds the daytime MAD risk-adjusted median return O 4 O C / H O C in 21 of 27 years; the arithmetic means of those two ratio series are about 0.16 and 0.06 , while mean H is about 0.56 overnight and 0.85 daytime in the same units as the table, so the overnight advantage is driven jointly by higher typical medians and smaller MAD, not by one effect alone. Daytime posts the larger ratio in only six years (when regular-hours medians are comparatively strong or overnight medians weaken). Stress episodes illustrate the denominator channel: in 2008, for example, H reaches about 0.99 and 1.42 while O 4 / H falls to about 0.05 and − 0.06 ; in 2020, H is again elevated (about 0.80 and 1.01 ) but both O 4 / H remain positive (about 0.24 and 0.18 ), unlike the 2008 daytime outcome, showing that a spike in dispersion does not always collapse median return per unit of MAD in both sessions.
Figure 6 places H and O 4 / H side by side in each row.
Figure 6. MAD volatility and “risk” adjusted returns for overnight (CO) vs daytime (OC) periods.
Subfigures (a) and (b) in Figure 6 track the C-trapezoid MAD spread H: daytime (OC) dispersion is typically larger than overnight (CO), and both spike in stress episodes (for example, 2008 and 2020), aligning with Table 28. The three largest values for the mean absolute deviations occur during the 2001 technology sector (dot.com) meltdown, the 2008–2009 financial crisis, and the 2019–2020 COVID epidemic. The 2008–2009 crisis affected most areas. The MAD for XLK is highest in 2001, as the technology sector meltdown primarily affected technology stocks.
The corresponding boxplots for H and O 4 / H are shown in Figure 6.
The boxplots in Figure 7 show that daytime volatility (regular trading hours) H O C is not only higher but also has a wider cross-sectional spread across years than overnight volatility H C O . The O 4 / H line and boxplot panels mirror the decomposition in Table 28 for O 4 / H : the overnight series O 4 C O / H C O stays mostly above zero and only occasionally dips below the horizontal reference in stress years, whereas the daytime series O 4 O C / H O C crosses zero far more often and shows deeper troughs when regular-hours dispersion is high. Those boxplots show overnight ratios concentrated at modest positive values with a tighter interquartile range, while daytime ratios are more dispersed and centered lower, consistent with the table’s counts and with interpreting O 4 / H as a median-based analog of return per unit of MAD spread. Overall, median octile return per unit of MAD spread is systematically more favorable overnight than in regular hours over 1999–2025: XLK’s typical overnight move is more often positive relative to its MAD-based dispersion, while regular hours more often deliver a weak or negative median at the same scale, so the session split is visible in both H and this median-per-spread comparison, not only in G.
Figure 7. Cross-sectional spread of MAD and O 4 / H (1999–2025).
Figure 8 displays the implied MAD skewness and kurtosis in the same two-column format.
Figure 8. MAD skewness and kurtosis for overnight (CO) and daytime (OC) periods.
Figure 8 shows persistent negative MAD skewness G O C over 1999–2025, so downside tends to materialize in regular trading hours. Overnight (close-to-open) returns sit nearer to symmetric G C O with slightly higher tail mass in K C O , matching gap risk at the open more than a sustained directional overnight drift. Both sessions exhibit kurtosis K well above the Gaussian benchmark, so extremes are a recurring feature. Major stress episodes such as the dot-com bubble (2000–2002), the financial crisis (2008), and the COVID shock (2020), appear as sharp increases in H and K in Table 28, with the largest overnight–daytime divergence in skewness in those years.
The corresponding boxplots for H and O 4 / H are shown in Figure 9.
Figure 9. Cross-sectional spread of skewness G and kurtosis K (1999–2025).
From boxplots in Figure 9, we can see that overnight (CO) is the most symmetric session. The daytime (CO) session carries a structural downside bias that persists across regimes.
On methodology, C-trapezoid is clearly stronger than the midpoint rule, as shown by Figure 5 and Table 28. The midpoint method is the default because it is simple, but it is observed to underestimate MAD by about 20–40% and to push MAD’s kurtosis to roughly 0.55 – 0.87 , far below the heavy tails that characterize XLK in the data. That gap hurts most in stress regimes: relative to MAD from returns, midpoint errors reach about − 37 % overnight and − 32 % during the day in 2008, and about − 42 % overnight in 2020, so volatility is understated exactly when it matters. C-trapezoid keeps MAD percentage errors in a much tighter band (about 5–18%) and yields kurtosis near 1.05 – 1.35 , in line with the empirical shape even through crises. The two schemes agree on the skewness sign, but only the C-trapezoid captures the dispersion level and tail structure, making it a highly reliable foundation for risk estimation or distribution modeling based on octiles.
The above results strongly suggest that most of the gains for technology stocks come from overnight returns. It is informative to compute the true returns for technology stocks and compare this sector with the S&P 500 index (represented by the SPY exchange-traded fund).
We proceed as follows. For each period (overnight or daytime), we have three possibilities:
  • Cash
  • Long position
  • Short position
For example, the (long, long) strategy is the passive investment (the so-called Buy&Hold strategy) where we are always invested. By contrast, the (long, cash) strategy means we take a long position overnight and maintain a cash position during the day. With two periods and three possibilities per period, we have a total of nine possible strategies. Excluding the trivial (cash, cash) strategy, we have eight strategies. In Table 29, we compute the final balance for these strategies for the technology ETF and compare the results with those for the overall market.
Table 29. Final balances (no transaction costs and $100 initial investment in 1999) and Average Annualized Volatility for the S&P-500 exchange-traded fund SPY and technology exchange-traded fund XLK from 1999 to 2025. Blue color in strategy #5 indicates the final balance for the passive Buy&Hold (long, long) strategy. For the Balance columns, the green (red) color indicates that the corresponding strategy achieves a higher (lower) final balance than the passive strategy. For the Volatility columns, the green (red) color indicates that the corresponding strategy has lower (higher) volatility than the passive strategy. The first column (#) is for notational convenience and denotes the strategy number.
As can be seen from Table 29, the technology sector outperforms the market for the passive (long, long) strategy (948 vs. 758). However, for the overall market, we do not gain by investing in a particular period. By contrast, for the technology sector, most of the gains are generated during the overnight period, as evidenced by the (long, cash) strategy (3165 vs. 948). Taking a short position during the daytime period adds very little gain (3210 vs. 3165). This is what was predicted by examining the differences for the quantiles and MAD-based metrics during the overnight and daytime periods.

10. Case Study II: Weight Distribution Shape in Transformer Language Models

For our second case study on an application of the proposed MAD-based shape metrics, we analyze the empirical weight distributions of four pretrained transformer language models: GPT-2 Small (124 M parameters, 12 layers) [114], GPT-2 Medium (355M parameters, 24 layers) [114], OPT-125M (125M parameters, 12 layers) [115], and Pythia-160M (160M parameters, 12 layers) [116]. These models span two dimensions of comparison: GPT-2 Small versus GPT-2 Medium tests whether shape patterns persist when the same architecture family is scaled from 12 to 24 layers, while GPT-2 Small versus OPT-125M and Pythia-160M (all with 12 layers) tests whether the patterns transfer across independently trained architectures.
Each transformer layer contains four core weight matrices:
  • Attention input (attn_input): the combined query–key–value projection;
  • Attention output (attn_output): the attention output projection;
  • FFN input (ffn_input): the first MLP layer; and
  • FFN output (ffn_output): the second MLP layer.
Figure 10 locates these four matrices inside a standard transformer decoder layer: multi-head self-attention with query–key–value and output projections, followed by a position-wise MLP with expansion factor 4, residual additions, and layer normalization [117]. GPT-2 and related decoder-only models follow the same stacking pattern [114,115,116]; checkpoint-specific module names are mapped to the unified labels attn_input, attn_output, ffn_input, and ffn_output. The dashed red region highlights the learned linear maps whose weight entries form the empirical distributions studied below (not activations or attention probabilities).
Figure 10. Transformer decoder block with the four weight matrices (red) analysed in Case Study II. Hidden size d and number of layers L depend on the checkpoint (legend); GPT-2 Small uses d = 768 , L = 12 . Each matrix is flattened to a one-dimensional sample; empirical octiles O 1 , … , O 7 yield H, G, and K via C-trapezoid quadrature (Section 4).
For each weight matrix, we flatten all entries into a single one-dimensional sample, compute the empirical octiles { O 1 , … , O 7 } , and apply the C-trapezoid approximation (Section 4) to obtain the MAD spread H, MAD skewness G, and MAD kurtosis K. The analysis yields 48 weight-distribution profiles per 12-layer model and 96 for GPT-2 Medium (24 layers), totaling 240 profiles across all four models. Figure 11 illustrates how attn_output weights concentrate near zero while retaining heavy tails, with octiles marked for layers 0, 4, 8, and 11 of GPT-2 Small.
Figure 11. Representative histograms of attn_output weights in GPT-2 Small at layers 0, 4, 8, and 11 (empirical densities; vertical lines mark octiles).
This setting mirrors the XLK overnight/daytime study of Section 9: there, rows index years and columns separate two trading sessions; here, rows index transformer layers and columns separate the four matrix roles.

10.1. Dataset Description

Table 30 summarises the four weight-matrix roles for each of the four pretrained models in Case Study II. There is no missing data. For every role, we report the total number of scalar entries n (architecture-exact), the observed range [ min , max ] , the count of non-finite values (zero for every checkpoint examined), and pooled marginal statistics: mean, standard deviation, classical skewness  G c , and classical excess kurtosis  K c ex . All entries were computed from the public checkpoints using llm_dataset_summary.py (repository; Data Availability). Pooled means are within 10 − 3 of zero for GPT-2 and Pythia roles, consistent with near-zero-mean initialisation; GPT-2 Medium ffn_input is the largest reported mean ( + 5 × 10 − 4 ). Classical excess kurtosis is positive for every role (e.g., K c ex = + 94.9 for GPT-2 Small attn_output and + 101.6 for GPT-2 Medium attn_output), confirming leptokurtic weight distributions as in Figure 11. OPT-125M and Pythia-160M use much tighter weight ranges than GPT-2 (e.g., Pythia attn_output in [ − 0.39 , 0.37 ] versus GPT-2 Small [ − 8.88 , 8.70 ] ).
Table 30. Primary dataset information and marginal statistics for Case Study II weight matrices. n = total scalar entries; Miss. = non-finite count; Mean, Std, G c , and K c ex are pooled over all layers within each role (reproducible via llm_dataset_summary.py in the repository).
Table 31 reports the autocorrelation of the layer-wise raw weight values at lags 1–5 for all four models. For each layer the weight matrix is flattened into a one-dimensional vector and Pearson ACF is computed; values are then averaged across all layers. All values are within ± 0.03 of zero, confirming that scalar weight entries are approximately uncorrelated within each matrix, consistent with near-i.i.d. initialisation and gradient-based training. The only notable exception is ffn_input for GPT-2 Small and GPT-2 Medium, where a small but consistent positive ACF ( ≈ + 0.022 and + 0.026 respectively) persists uniformly across all lags, suggesting a mild row-wise structure introduced during training of the feed-forward input projection. Statistics are reproducible via llm_weight_acf.py in the repository.
Table 31. Mean autocorrelation of raw weight values at lags 1–5 (Case Study II). For each model, matrix role, and layer the weight matrix is flattened into a one-dimensional vector and Pearson ACF is computed; values are then averaged across all layers. Values near zero indicate that scalar weight entries are approximately uncorrelated within each matrix, consistent with near-i.i.d. initialisation and gradient-based training.

10.2. Octile Profiles Across Layers

Table 32 reports the empirical octiles for the attn_input and ffn_output weight matrices of GPT-2 Small across all 12 layers. These two roles are highlighted because they show pronounced and contrasting depth-dependent behaviour: attn_input octiles are widest at layer 0 and stabilize thereafter, while ffn_output octiles grow monotonically from layer 0 to layer 11.
Table 32. Empirical octiles of attn_input and ffn_output. weight matrices for GPT-2 Small, layers 0–11. All values are in weight units (dimensionless).

10.3. MAD Shape Metrics Across Layers and Matrix Types

From the octiles, we compute the C-trapezoid MAD spread H, MAD skewness G, and MAD kurtosis K for all four matrix types. Table 33 reports these metrics for GPT-2 Small; corresponding values for the other three models are available in the public repository https://github.com/anacodicAI-labs/c-trapezoid-quantile-metrics.git, accessed on 15 May 2026. All reported K values lie in [ 0.57 , 0.78 ] , consistent with the theoretical range for this construction.
Table 33. MAD-based shape metrics (H, G, K) for GPT-2 Small weight matrices, layers 0–11, C-trapezoid approximation.

10.4. C-Trapezoid vs. Midpoint Comparison

Table 34 reports the same metrics computed using the midpoint (Galton/Moors-type) octile approximation for GPT-2 Small, for direct comparison with the C-trapezoid estimates. Several midpoint K values exceed 1 (e.g., attn_output at layer 0 has K mid = 1.232 ), whereas the C-trapezoid K in Table 33 remains in [ 0.57 , 0.78 ] for all entries.
Table 34. Midpoint-approximation shape metrics (H, G, K) for GPT-2 Small, layers 0–11.

10.5. Approximation Accuracy

To assess the fidelity of the C-trapezoid approximation, we compute exact values of H and K by evaluating the defining sums over all individual weight values, and compare percentage errors for both the C-trapezoid and midpoint methods. Table 35 summarises the mean percentage errors across the four matrix types for each model (negative values indicate underestimation relative to the exact benchmark).
Table 35. Mean percentage errors of approximate H and K versus exact values, averaged over four matrix types per model (all weight matrices in the study).
The C-trapezoid approximation achieves mean errors on the order of 5–9% for H and about 5–6% for K across architectures. The midpoint method systematically underestimates H by roughly 18–23% on average. For kurtosis, mean midpoint errors are modestly positive (4–7%), but individual matrices can be far off: for example, midpoint K mid = 1.232 at GPT-2 Small attn_output layer 0 exceeds the proven upper bound of 1 for MAD-based K, while the global maximum midpoint K in our sample reaches 1.31 (Pythia-160M). The C-trapezoid K computed with the corrected octile formula stays within [ 0 , 1 ] for all 240 matrices. Figure 12 compares approximate versus exact H for every matrix in Table 35; Figure 13 does the same for K. Figure 14 overlays exact, C-trapezoid, and midpoint traces versus layer for GPT-2 Small attn_output, summarizing how octile-only rules track the brute-force benchmark.
Figure 12. MAD spread H: exact values (horizontal axis) versus midpoint (left) and C-trapezoid (right) approximations. Diagonal line: perfect agreement.
Figure 13. MAD kurtosis K: same layout as Figure 12.
Figure 14. GPT-2 Small, attn_output: exact H, G, and K (from all weights) compared with C-trapezoid and midpoint octile approximations across layers 0–11.
This mirrors the XLK finding in Section 9, where midpoint MAD errors reached about − 37 % overnight and − 32 % during the day in 2008, while C-trapezoid errors remained within about  18 % .
Readers should note that C-Trapezoid consistently outperforms Midpoint across all benchmark distributions, including Laplace; the case studies confirm this pattern holds in real financial and neural-network data.
The consistency of C-trapezoid’s accuracy advantage across financial returns and neural-network weights support its practical use when only a small number of quantiles are available.

10.6. Discussion

Several patterns emerge from the multi-model analysis.
  • Spread ( H ) grows with depth for output-projection matrices:
In GPT-2 Small, the attn_output MAD spread rises from H = 0.048 at layer 0 to H = 0.110 at layer 11 (a 2.3 × increase), and ffn_output rises from 0.060 to 0.142 ( 2.4 × ). The input-projection matrices attn_input and ffn_input remain stable at H ≈ 0.094 – 0.098 throughout. GPT-2 Medium exhibits the same qualitative pattern across 24 layers. OPT-125M shows a similar gradient for output projections, while Pythia-160M shows little depth gradient in H, suggesting the effect is not universal across architectures. Absolute magnitudes of H differ across families (GPT-2 roughly 0.05 – 0.14 ; OPT and Pythia roughly 0.01 – 0.02 ), reflecting different parameter scales; relative depth patterns remain informative (Figure 15).
Figure 15. MAD spread H versus normalised layer depth for attn_output and ffn_output (four models).
  • Kurtosis ( K ) is largest in early layers and then flattens:
The highest kurtosis in GPT-2 Small occurs at attn_output layer 0 ( K = 0.77 ), compared with K ≈ 0.58 – 0.60 in mid layers. This is shown in Figure 16. The Gaussian benchmark for this K is about 0.50 , so these weights are moderately heavier-tailed than Gaussian. OPT-125M shows a notable kurtosis bump in ffn_output around layers 2–3 (e.g., K ≈ 0.74 at layer 3), which is absent in GPT-2 Medium and Pythia-160M at the same depth. These observations are consistent with work on critical early-layer structure in LLMs [118] and with heavy-tailed spectra and implicit regularisation [119,120]; MAD kurtosis offers a lightweight diagnostic using only seven octiles.
Figure 16. MAD kurtosis K versus normalised depth for attn_output and ffn_output (four models).
  • Skewness ( G ) is small:
Across the 240 matrices, | G | is below 0.02 in the vast majority of cases; the largest observed value is | G | ≈ 0.058 (OPT-125M, ffn_input, layer 3). Weight histograms are, therefore, close to symmetric, as expected from symmetric initialisation. Figure 17 aggregates H, G, and K across layers and matrix types for all four models, complementing the layer-resolved tables above.
Figure 17. Distribution of C-trapezoid H, G, and K across all weight matrices in each model (pooled over layers and the four matrix types).
  • Same-family scaling: GPT-2 Small versus GPT-2 Medium:
Normalized-layer profiles of H and K for output projections are similar between the two GPT-2 variants, with GPT-2 Medium showing slightly lower K in mid-to-late layers (Figure 18).
Figure 18. GPT-2 Small versus GPT-2 Medium: H and K versus normalised depth (output projections).
  • Cross-family comparison:
Among the three 12-layer models, GPT-2 Small exhibits the strongest H depth gradient on output projections, OPT-125M a moderate gradient, and Pythia-160M almost none; K and G profiles are otherwise broadly comparable (Figure 19).
Figure 19. Cross-family comparison (12-layer models): H and K versus depth for output projections.
Replication scripts and additional exports are available in the public repository https://github.com/anacodicAI-labs/c-trapezoid-quantile-metrics.git (accessed on 18 May 2026) together with the figures_llm/ assets bundled for this manuscript.
  • Comparison with the XLK case study:
The structural analogy between the two case studies is direct: trading sessions in XLK play a role analogous to matrix types here, and K highlights stress episodes (calendar years for XLK, early-layer output weights for transformers). The proposed MAD-based metrics, thus, offer a common language for shape comparisons across domains.
  • Implications for neural network diagnostics:
The findings above suggest that the proposed MAD-based octile metrics can serve as lightweight diagnostics for pretrained transformer models, complementing the eigenvalue-based spectral methods that dominate the current literature. Several concrete applications emerge:
  • Data-free model quality assessment. Martin et al. [120] demonstrated that the power-law exponent α of the eigenvalue spectrum, computed from weights alone, correlates with test accuracy across more than 100 computer vision models—without access to training or test data. The MAD kurtosis K captures the same tail heaviness property using only seven octile values, avoiding the O ( d 3 ) cost of eigenvalue decomposition entirely. A natural conjecture is that average K across layers correlates with model quality in a manner analogous to the WeightWatcher α ^ metric [120].
  • Layer importance for pruning. AlphaPruning [121] allocates per-layer pruning ratios based on spectral α : layers with heavier tails (lower  α ) are pruned less aggressively. Our results show that K identifies the same layers as tail-heavy (e.g., layer 0 attn_output with K = 0.77 in GPT-2 Small). The bounded, interpretable nature of K ∈ [ 0 , 1 ] makes it a candidate for a simpler pruning-ratio allocation rule.
  • Quantization sensitivity prediction. Weight outliers are the primary cause of accuracy degradation under post-training quantization [122,123,124]. Both H (spread) and K (tail heaviness) directly characterise the outlier structure of each weight matrix. Layers with high K or rapidly growing H may require higher-precision quantization or outlier-aware treatment, a hypothesis that could be tested against existing quantization benchmarks.
  • Module-type differentiation. AlphaDecay [125] found that attention modules have heavier-tailed weights than MLP modules and, therefore, benefit from smaller weight decay. Our K profiles confirm this asymmetry across all four models: attention output matrices consistently show higher K at early layers than feedforward matrices. This suggests that octile-based metrics could inform module-wise training hyperparameter selection.
  • Detecting critical parameters. Yu et al. [118] identified single “super weights” in early transformer layers whose removal destroys model performance. The concentration of high K values at layer 0 in our analysis is consistent with the presence of such extreme outliers. The MAD kurtosis could serve as a fast screening tool to flag candidate layers for super-weight analysis.
  • Skewness as a unique diagnostic. Unlike spectral methods, which operate on squared singular values and, therefore, lose sign information, the MAD skewness G measures distributional asymmetry directly. While G ≈ 0 for all pretrained models studied here (confirming symmetric initialisation), G could detect asymmetric drift introduced by fine-tuning, reinforcement learning from human feedback (RLHF), or adversarial weight perturbation—a diagnostic that eigenvalue-based tools fundamentally cannot provide.
These implications connect octile-based shape metrics to spectral diagnostics, compression, and training practice; Section 11 summarises broader conclusions and lists follow-up directions, including several motivated specifically by Case Study II.

11. Concluding Remarks and Future Research

We presented a number of quantile shape metrics, computed as mean absolute deviations from the integrals of the quantile function Q ( p ) . It is also possible to compute these mean deviations as integrals of the cumulative distribution functions [13]. For many distributions (including LogNormal, Pareto, and exponential), both the quantile function Q ( p ) and the cumulative distribution function F ( x ) is available in closed form. For some distributions, such as the Gamma distribution, we do not have a closed-form expression for Q ( p ) , but we do have one for the CDF. For other distributions (such as weighted logistic or Tukey lambda), we have explicit formulas for the quantile functions but not for the cumulative distribution function.
In this work, we assumed that we can compute MAD by computing the corresponding integrals of the quantile function Q ( p ) . If we are not able to compute these integrals exactly, then we assume that we can compute the octiles and consider very elementary quadrature approximations. With these very basic approximations, we showed that the proposed MAD-based metrics correspond to well-known quantile statistics.
The proposed shape metrics generalize many widely used quantile shape metrics, including Galton’s skewness and Moore’s octile kurtosis. We can improve accuracy by using more precise approximations. We hope to investigate this further in our future work.
The framework presented in this paper can be extended in several directions. One promising avenue is to expand the quantile-based quadrature approach to estimate other statistical quantities beyond the mean and mean absolute deviation. Specifically, we plan to investigate approximations for:
  • Sum statistics: Extending the quadrature methods to estimate sums and weighted sums of random variables, which are fundamental in many statistical applications.
  • Inverse sum statistics: Developing approximations for quantities involving inverse sums, which arise in various optimization and estimation problems.
  • Higher-order moments: Generalizing the approach to estimate variance, skewness, and kurtosis using quantile-based quadrature methods.
  • Multivariate extensions: Adapting the quantile-based framework to multivariate distributions and exploring applications in multivariate shape analysis.
The weight-distribution analysis presented in our case study in Section 10 opens several avenues for future investigation:
  • Correlation with downstream accuracy. A direct empirical test of whether average K (or H) across layers correlate with perplexity or zero-shot benchmark accuracy across model families and scales, analogous to the WeightWatcher study [120] but using octile-based metrics.
  • Quantization-aware shape analysis. Comparing H and K profiles before and after 4-bit quantization (e.g., via GPTQ [126] or AWQ [124]) to test whether pre-quantization shape metrics predict post-quantization accuracy loss.
  • Fine-tuning and RLHF drift detection. Tracking H, G, K across training checkpoints to determine whether fine-tuning or RLHF introduces measurable changes in distributional shape—particularly in skewness G, which is invisible to eigenvalue methods.
  • Mixture-of-Experts architectures. Extending the analysis to MoE models such as Mixtral [127], where each expert has its own weight distribution and routing frequency may correlate with shape metrics.
  • Larger-scale models. Scaling the analysis to models with 7B–70B parameters (e.g., LLaMA [128]) to test whether the depth gradient in H and the layer-0 kurtosis spike persist at production scale.
  • Pruning and compression guidance. Using K as a pruning-ratio allocator in place of spectral α , and benchmarking against AlphaPruning [121] on standard pruning tasks.
Additionally, we aim to refine the endpoint approximation methods and explore alternative interpolation schemes that may provide better accuracy for specific distribution families. The development of adaptive quadrature methods that automatically select the optimal approximation strategy based on the distribution characteristics is another area of future investigation.
We strongly believe that the methods and methodology presented in this paper provide effective, computationally efficient, interpretable, and valuable tools for both theoretical and experimental analysis in many disciplines.

Author Contributions

T.K., R.K. and E.P. contributed equally to this work. Conceptualization: E.P.; Methodology: T.K., R.K. and E.P.; Software: T.K. and R.K.; Data Curation: T.K. and R.K.; Investigation: T.K., R.K. and E.P.; Formal Analysis: T.K., R.K. and E.P.; Software: T.K. and R.K.; Visualization: T.K. and R.K.; Writing—Original Draft Preparation: T.K., R.K. and E.P.; Writing, Review and Editing: T.K., R.K. and E.P.; Project Administration and Supervision: E.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data and code are available at https://github.com/anacodicAI-labs/c-trapezoid-quantile-metrics.git (accessed on 5 April 2026).

Acknowledgments

We thank the Department of Computer Science at Boston University Metropolitan College for their support.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Some Special Functions and Integrals

For many distributions, computation of MAD involves special functions and integrals [27,129,130,131]. We present them here for easy reference.
  • Error function
    erf ( z ) = 2 π ∫ 0 z e − t 2 d t
  • Density of the standard normal
    ϕ ( x ) = 1 2 π e − x 2 / 2
  • Cumulative distribution of the standard normal
    Φ ( x ) = 1 2 π ∫ − ∞ x e − t 2 / 2 d t = 1 2 + 1 2 erf x 2
  • Lower incomplete Gamma function
    ν ( s , x ) = ∫ 0 x t s − 1 e − t d t
  • Gamma function
    Γ ( s ) = ∫ 0 ∞ t s − 1 e − t d t
  • Beta function
    B ( z 1 , z 2 ) = ∫ 0 1 t z 1 − 1 ( 1 − t ) z 2 − 1 d t
  • Incomplete Beta function
    B ( x ; a , b ) = ∫ 0 x t a − 1 ( 1 − t ) b − 1 d t
    In particular, B * ( 0 ; a , b ) = B ( a , b )
  • Integration of incomplete gamma function
    ∫ ν ( α , z ) d z = z α e − z + C

Appendix B. Quantile Functions and Auxiliary Integrals for Some Common Continuous Distributions

This appendix discusses some common continuous distributions. For convenience, for any 0 ≤ p 1 < p 2 ≤ 1 , we define x 1 = Q ( p 1 ) and x 2 = Q ( p 2 ) . Recall the definition of auxiliary integral
I ( p 1 , p 2 ) = ∫ p 1 p 2 Q ( p ) d p = ∫ x 1 x 2 x f ( x ) d x
Recall our formula for the mean μ ( X ) = ( I 1 + I 2 ) and the mean absolute deviation H ( X ) from the median is H ( X ) = ( I 2 − I 1 ) where I 1 = I ( 0 , 1 2 ) and I 2 = I ( 1 2 , 1 ) .

Appendix B.1. Uniform Distribution

X is distributed according to uniform distribution with parameters a < b [21]. Its probability density function f ( x ) = 1 / ( b − a ) , its cumulative distribution function F ( x ) = ( x − a ) / ( b − a ) and its quantile function Q ( p ) = a + p ( b − a ) . The octiles are:
O 1 = ( 7 a + b ) / 8 , O 2 = ( 3 a + b ) / 4 , O 3 = ( 5 a + 3 b ) / 8 , O 4 = ( a + b ) / 2 , O 5 = ( 3 a + 5 b ) / 8 , O 6 = ( a + 3 b ) / 4 , O 7 = ( a + 7 b ) / 8
The auxiliary integral is
I ( p 1 , p 2 ) = a p + p 2 2 ( b − a ) | p 1 p 2 = p 2 a + Q ( p ) | p 1 p 2
This gives the following expressions for subarea integrals:
I L L = ( a + O 2 ) / 8 , I L R = ( a + 2 O 4 − O 2 ) / 8 , I R L = ( a + 3 O 6 − 2 O 4 ) / 8 , I R R = ( a + 4 b − 3 O 6 ) / 8 , I L = ( a + O 4 ) / 4 , I R = ( a + 2 b − O 4 ) / 4
For the left and right mean absolute deviations, from Equation (39)
H L = ( O 4 − O 2 ) / 2 = ( b − a ) / 8 , H R = ( 2 b − 3 O 6 + O 4 ) / 2 = ( b − a ) / 8
For the mean, MADs, and MAD-based shape metrics, we obtain
μ = ( a + b ) / 2 , H = ( b − a ) / 4 , G = 0 , K = 1 / 2
The parameters a and b are estimated as
a ^ = ( 3 I L − I R ) and b ^ = ( 3 I R − I L )

Appendix B.2. Exponential Distribution

X is distributed according to an exponential distribution with rate λ > 0 with X > 0 . Its density f ( x ) = λ e − λ x , cumulative distribution function F ( x ) = 1 − e − λ x and the quantile function Q ( p ) = − log ( 1 − p ) / λ . The octiles are:
O 1 = ( 3 log 2 − log 7 ) / λ , O 2 = ( 2 log 2 − log 3 ) / λ , O 3 = ( 3 log 2 − log 5 ) / λ , O 4 = ( log 2 ) / λ , O 5 = ( 3 log 2 − log 3 ) / λ , O 6 = ( 2 log 2 ) / λ , O 7 = ( 3 log 2 ) / λ
Using the identity [130]
∫ log t d t = t log t − t
we compute the auxiliary integral
I ( p 1 , p 2 ) = ( 1 − p ) log ( 1 − p ) λ − 1 λ | p 1 p 2 = − ( 1 − p ) Q ( p ) + 1 λ | p 1 p 2
In particular, for p 1 = 0 and p i = i / 8
I ( 0 , i / 8 ) = i 8 λ − 1 − i 8 O i
From this, we obtain subarea integrals:
I L L = − 3 4 O 2 + 1 4 λ , I L R = 3 4 O 2 − 1 2 O 4 + 1 4 λ , I R L = 1 2 O 4 − 1 4 O 6 + 1 4 λ , I R R = 1 4 O 6 + 1 4 λ , I L = 1 2 λ − 1 2 O 4 , I R = 1 2 O 4 + 1 2 λ
For the left and right mean absolute deviations, from Equation (39)
H L = 2 ( I L R − I L L ) = 2 ( 5 log 2 − 3 log 3 ) λ , H R = 2 ( I R R − I R L ) = log 2 λ
From this we compute
H = log 2 λ , μ = 1 λ , G = − 1 + 1 log 2 ≈ 0.44 , K = 3 − 3 log 3 2 log 2 ≈ 0.62
The parameter is estimated as
λ ^ = 1 I L + I R = O 4 I R − I L

Appendix B.3. Normal Distribution

X is normally distributed with mean μ and standard deviation σ .
f ( x ) = 1 σ ϕ x − μ σ and F ( x ) = Φ x − μ σ , x ∈ R
where ϕ ( · ) and Φ ( · ) denote the density and cumulative distribution of the standard normal distribution (Equations (A2) and (A3) in Appendix A).
The quantile function Q ( p ) = μ + σ Φ − 1 ( p ) . Let u 1 , … , u 7 denote the octiles of the standard normal distribution: u i = Φ − 1 ( i / 8 ) . Then the octiles of X are O i = μ + σ u i .
Since ϕ ′ ( x ) = − x ϕ ( x ) we have
∫ Φ − 1 ( p ) d p = ∫ x ϕ ( x ) d x = − ∫ ϕ ′ ( x ) d x = − ϕ Φ − 1 ( p ) + C
Therefore, for the auxiliary integral, we obtain
I ( p 1 , p 2 ) = ∫ p 1 p 2 Q ( p ) d p = μ p − σ ϕ Φ − 1 ( p ) | p 1 p 2
In particular, for p 1 = 0 and p 2 = i / 8 , we obtain I ( 0 , i / 8 ) = μ ( i / 8 ) − σ u i . Since ϕ Φ − 1 ( 0 ) = ϕ Φ − 1 ( 1 ) = 0 and ϕ Φ − 1 ( 1 2 ) = 1 / 2 π , we obtain for the subarea integrals:
I L L = μ 4 − σ ϕ ( u 2 ) , I L R = μ 4 + σ ϕ ( u 2 ) − 1 2 π , I R L = μ 4 + σ 1 2 π − ϕ ( u 6 ) I R R = μ 4 + σ ϕ ( u 6 ) , I L = μ 2 − σ 2 π , I R = μ 2 + σ 2 π
For the left and right mean absolute deviations, from Equation (39)
H L = 2 ( I L R − I L L ) = σ 2 ϕ ( u 2 ) − 1 2 π H R = 2 ( I R R − I R L ) = σ 2 ϕ ( u 6 ) − 1 2 π
From the above, we obtain:
H = σ 2 π , G = 0 , K = − 1 + e − u 2 2 / 2 + e − u 6 2 / 2
The parameters can be estimated as
μ ^ = ( I L + I R ) and σ ^ = π 2 ( I R − I L )

Appendix B.4. LogNormal Distribution

X is distributed according to the Log-Normal Distribution with parameters μ ∈ ( ∞ , + ∞ ) , σ 2    ( σ > 0 ) and x > 0 . The density f ( x ) , the cumulative distribution function F ( x ) and the quantile function Q ( p ) are given by ([16,21]):
f ( x ) = 1 x σ ϕ log x − μ σ , F ( x ) = Φ log x − μ σ , Q ( p ) = exp μ + σ Φ − 1 ( p )
The mean μ ( X ) = exp ( μ + σ 2 / 2 ) . For notational convenience, we let μ * = μ ( X ) to distinguish the mean of the lognormal variable X from the mean of the underlying Normal distribution. Then, for the octiles, we have: O i = exp ( μ + σ u i ) where as before, u i = Φ − 1 ( i / 8 ) are the octiles of standard Normal. To compute the auxiliary integral, let y = ( log x − μ ) / σ giving us d x = σ e μ + σ y d y . Then, we can write
I ( p 1 , p 2 ) = 1 σ 2 π ∫ y 1 y 2 e − y 2 / 2 ( σ e μ + σ y ) d y = 1 2 π ∫ y 1 y 2 e − ( y 2 − 2 σ y + σ 2 ) / 2 e μ + σ 2 / 2 d y = μ * ∫ y 1 y 2 1 2 π e − ( y − σ ) 2 / 2 d y = μ * Φ log x − μ σ − σ | x 1 x 2
Noting that u 4 = 0 and Φ ( − x ) = 1 − Φ ( x ) , we obtain
I ( p 1 , p 2 ) = 1 σ 2 π ∫ x 1 x 2 e − ( log x − μ ) 2 / 2 σ 2 d x = μ * Φ log x − μ σ − σ | x 1 x 2
In particular, for MAD around octiles we have
I ( 0 , i / 8 ) = μ * − μ * Φ ( σ − u i )
Then, for the subarea integrals, we immediately obtain
I L L = μ * 1 − Φ ( σ − u 2 ) , I L R = μ * Φ ( σ − u 2 ) − Φ ( σ ) , I R L = μ * Φ ( σ ) − Φ ( σ − u 6 ) ,   I R R = μ * Φ ( σ − u 6 ) , I L = μ * 1 − Φ ( σ ) , I R = μ * Φ ( σ )
For the left and right mean absolute deviations, from Equation (39)
H L = 2 μ * 2 Φ ( σ − u 2 ) − Φ ( σ ) − 1 , H R = 2 μ * 2 Φ ( σ − u 6 ) − Φ ( σ )
For the mean absolute deviation, skewness, and kurtosis, we obtain:
H = μ * 2 Φ ( σ ) − 1 , G = 1 − e − σ 2 / 2 2 Φ ( σ ) − 1 , K = 2 Φ ( σ − u 6 ) + 2 Φ ( σ − u 2 ) − 2 Φ ( σ ) − 1 2 Φ ( σ ) − 1
The parameters are estimated as follows:
σ ^ = Φ − 1 I R I L + I R and μ ^ = log ( I L + I R ) − σ ^ 2 2
Finally, note that from Equations (A34) and (10) we obtain for MADs around octiles
H ( X , O i ) = μ * 2 Φ ( σ − u i ) − 1 + i / 4 − 1 O i = 2 Φ ( σ − u i ) − 1 e μ + σ 2 / 2 + i / 4 − 1 e μ + σ u i

Appendix B.5. Laplace Distribution

X is distributed according to Laplace Distribution with location μ and scale b. The density f ( x ) and cumulative distribution function F ( x ) are given by ([16,21]):
f ( x ) = 1 2 b e − | x − μ | / b and F ( x ) = 1 2 e ( x − μ ) / b , if x ≤ μ 1 − 1 2 e − ( x − μ ) / b , if x ≥ μ
The quantile function is
Q ( p ) = μ + b log ( 2 p ) , if 0 ≤ p ≤ 1 / 2 μ − b log ( 2 − 2 p ) if 1 / 2 ≤ p ≤ 1
The octiles are:
O 1 = μ − b log 2 , O 2 = μ − b log 2 , O 3 = μ + b log 3 − 2 b log 2 , O 4 = μ , O 5 = μ − b log 3 + 2 b log 2 , O 6 = μ + b log 2 , O 7 = μ + 2 b log 2
Using the following identity [130]
∫ log ( x ) d x = x log ( x ) − x
we obtain for the auxiliary integral:
I ( p 1 , p 2 ) = μ p + b p log ( 2 p ) − b p , for 0 ≤ p 1 ≤ p 2 ≤ 1 2 μ p + b ( 1 − p ) log ( 2 ( 1 − p ) ) − b ( 1 − p ) , for 1 2 ≤ p 1 ≤ p 2 ≤ 1
From this, we immediately obtain for the subareas:
I L L = 1 4 2 μ − b − O 2 , I L R = 1 4 O 2 , I R L = 1 4 O 6 , I R R = 1 4 ( 2 μ + b + O 6 ) , I L = 1 2 ( μ − b ) , I R = 1 2 ( μ + b )
We obtain:
μ = ( I L + I R ) , H = b , G = 0 , K = log 2 ≈ 0.69
Parameter estimates are
μ ^ = ( I L + I R ) and b ^ = ( I R − I L )

Appendix B.6. Pareto Distribution

X is distributed according to the Pareto distribution over the domain x ≥ β with scale β > 0 and shape α > 0 . Its density f ( x ) , its cumulative distribution function F ( x ) and quantile function are given by
f ( x ) = α β α x α + 1 , F ( x ) = 1 − β x α , Q ( p ) = β ( 1 − p ) − 1 / α
The octiles are:
O 1 = β 8 / 7 1 / α , O 2 = β 4 / 3 1 / α , O 3 = β 8 / 5 1 / α , O 4 = β 2 1 / α , O 5 = β 8 / 3 1 / α , O 6 = β 2 2 / α , O 7 = β 2 3 / α
For this distribution, no moments exist for α ≤ 1 . Assume α > 1 . For this distribution, the auxiliary integral is
I ( p 1 , p 2 ) = ∫ p 1 p 2 β ( 1 − p ) − 1 / α d p = − α ( 1 − p ) Q ( p ) ( α − 1 ) | p 1 p 2
In particular, for p 1 = 0 and p i = i / 8 we obtain
I ( 0 , i / 8 ) = α β ( α − 1 ) − a ( 1 − i / 8 ) ( α − 1 ) O i
From this, we obtain subarea integrals:
I L L = α ( α − 1 ) β − 3 4 O 2 , I L R = α ( α − 1 ) 3 4 O 2 − 1 2 O 4 , I R L = α ( α − 1 ) 1 2 O 4 − 1 4 O 6 , I R R = α ( α − 1 ) 1 4 O 6 , I L = α ( α − 1 ) β − 1 2 O 4 , I R = α ( α − 1 ) 1 2 O 4
For the left and right mean absolute deviations, from Equation (39)
H L = α β ( α − 1 ) 3 ( 4 / 3 ) 1 / α − 2 1 / α − 2 , H R = α β ( α − 1 ) 4 1 / α − 2 1 / α
We have
μ = α β ( α − 1 ) , H = α β ( 2 1 / α − 1 ) ( α − 1 ) , G = − 1 + 2 1 / α α ( 2 1 / α − 1 ) , K = 3 ( 4 / 3 ) 1 / α + 4 1 / α − 2 ( 2 1 / α + 1 ) 2 ( 2 1 / α − 1 )
We obtain the following estimation:
α ^ = 2 I R ( 2 I R − O 4 ) and β ^ = ( I L + I R ) O 4 2 I R

Appendix B.7. Weibull Distribution

X is distributed according to an Weibull distribution with scale β > 0 and shape α > 0 [21]. Its density f ( x ) , cumulative distribution function F ( x ) and quantile function Q ( p ) are given by ( x ≥ 0 )
f ( x ) = α β x β α − 1 e − ( x / β ) α , F ( x ) = 1 − e − ( x / β ) α , Q ( p ) = β − log ( 1 − p ) 1 / α
Let u = − log ( 1 − p ) . Then d p = − e − u d u . Then, for the auxiliary integral, we have
I ( p 1 , p 2 ) = β ∫ log ( 1 − p 1 ) log ( 1 − p 2 ) u 1 / k e − u d u = β ν 1 + 1 α , u | − log ( 1 − p 2 ) − log ( 1 − p 1 )
where ν ( · ) is the incomplete gamma function (Equation (A8) in Appendix A). Note that for the octiles O i we have − log ( 1 − p i ) = O i α / β . For p 1 = 0 and p 2 = i / 8 we have
I ( 0 , i / 8 ) = β ν 1 + 1 α , O i β α
Therefore, for the subarea integrals, we obtain:
I L L = β ν 1 + 1 α , O 2 β α , I L R = β ν 1 + 1 α , O 2 β α − β ν 1 + 1 α , O 4 β α , I R L = β ν 1 + 1 α , O 4 β α − β ν 1 + 1 α , O 6 β α , I R R = β Γ 1 + 1 α − β ν 1 + 1 α , O 6 β α , I L = β ν 1 + 1 α , O 4 β α , I R = β Γ 1 + 1 α − β ν 1 + 1 α , O 4 β α
where Γ ( · ) is the Gamma function. From this, we obtain:
μ = α Γ 1 + 1 k , H = β ( log 2 ) 1 / α + 2 k Γ 1 α , α α log 2 − 1 α Γ 1 α
Parameter estimates α ^ and β ^ have to be found numerically from Equation (A60).

Appendix C. Estimation of Parameters Using L-Moments

Recall from Section 8.2 the definitions of the first L moments l 1 , l 2 , l 3 , and l 4 :
l 1 = ∫ 0 1 Q ( p ) d p , l 2 = ∫ 0 1 Q ( p ) ( 2 p − 1 ) d p , l 3 = ∫ 0 1 Q ( p ) ( 6 p 2 − 6 p + 1 ) d p l 4 = ∫ 0 1 Q ( p ) ( 20 p 3 − 30 p 2 + 12 p − 1 ) d p
The L-skewness ratio τ 3 = l 3 / l 2 and L-kurtosis τ 4 = l 4 / l 2 .

Appendix C.1. Uniform

We have
l 1 = ( a + b ) 2 , l 2 = ( b − a ) 6 , τ 3 = 0 , τ 4 = 0
The parameter estimation with L moments is then
a ^ = ( l 1 − 3 l 2 ) , b ^ = ( l 1 + 3 l 2 )
For uniform distribution, it has a somewhat similar form for parameter estimation via subareas in Equation (A15):
a ^ = ( 3 I L − I R ) , b ^ = ( 3 I R − I L )

Appendix C.2. Exponential

We have
l 1 = 1 λ , l 2 = 1 2 λ , τ 3 = 1 3 , τ 4 = 1 6
The parameter estimation is
λ ^ = 1 / l 1
This is similar to estimation using subareas:
λ ^ = 1 ( I L + I R ) = O 4 ( I R − I L )

Appendix C.3. Normal

We have
l 1 = μ , l 2 = σ π , , τ 3 = 0 , τ 4 = 30 π tan − 1 ( 2 ) − 9 = 0.1226
The parameter estimation with L-moments is
μ ^ = l 1 , σ ^ = π l 2
By contrast, the estimation of parameters using subarea integrals in Equation (A30)
μ ^ = ( I L + I R ) and σ ^ = π 2 ( I R − I L )

Appendix C.4. LogNormal

We have
l 1 = e μ + σ 2 / 2 , l 2 = e μ + σ 2 / 2 Φ ( σ / 2 ) − 1 τ 3 = 6 π erf ( σ / 2 ) ∫ 0 σ / 2 erf ( x / 3 ) e − x 2 d x
The parameter estimation with L-moments is
σ ^ = 2 Φ − 1 l 1 + l 2 2 l 1 and μ ^ = log ( l 1 ) − σ ^ 2 2
By contrast, the estimation of parameters using subarea integrals in Equation (A38) has a “similar” form: The parameters are estimated as follows:
σ ^ = Φ − 1 I R I L + I R and μ ^ = log ( I L + I R ) − σ ^ 2 2

Appendix C.5. Laplace

We have
l 1 = μ , l 2 = 3 4 b , τ 3 = 0 , τ 4 = ( 13 / 32 ) b ( 3 / 4 ) b = 13 24 ≈ 0.5417
The parameter estimation with L-moments is
μ ^ = l 1 , b ^ = 4 3 l 2
By contrast, the estimation of parameters using subarea integrals in Equation (A47) is
μ ^ = ( I L + I R ) , b ^ = ( I R − I L )

Appendix C.6. Pareto

We have
l 1 = α β ( α − 1 ) , l 2 = α β ( α − 1 ) ( α − 2 ) , τ 3 = ( 1 − 3 α ) ( 3 − α ) , τ 4 = 1 + 6 α ( α − 2 ) + α 2 ( α − 3 ) ( α − 2 )
The parameter estimation with L-moments is
α ^ = ( l 1 + 2 l 2 ) l 2 , β ^ = ( l 1 + l 2 ) l 1 ( l 1 + 2 l 2 )
By contrast, the estimation of parameters using subarea integrals in Equation (A55) is
α ^ = 2 I R ( 2 I R − O 4 ) and β ^ = ( I L + I R ) O 4 2 I R

Appendix C.7. Weibull Distribution

We have [54]
l 1 = β Γ 1 + 1 α , l 2 = β Γ 1 + 1 α · 1 − 2 − 1 / α , τ 3 = 2 ( 2 − 1 / α − 3 − 1 / α ) 2 − 1 / α − 1 + 1
The parameters admit a closed-form inversion: α ^ = − ln ( 2 ) / ln ( 1 − l 2 / l 1 ) and β ^ = l 1 / Γ ( 1 + 1 / α ^ ) .

Appendix D. Distributions with Multiple Parameters and Closed-Form for the Quantile Function: Burr XII Distribution

The distributions considered in this paper involve one or two parameters. For these distributions, we could compute parameters from MAD around the median and mean (e.g., Equation (A60) in Appendix B).
However, there are many distributions with three or more parameters. For such distributions, we compute expressions for mean μ ( X ) and MAD H ( X , O i ) of X around its octiles. Recall our main formula (Equation (10)):
H ( X , O i ) = μ − 2 I ( 0 , i / 8 ) + i / 4 − 1 O i
As an illustration, we consider the analysis of Burr XII distribution:
Example A1
(Burr XII Distribution). X is distributed according to the Burr (Burr XII) distribution with scale parameter λ and shape parameters c > 0 and k > 0 .
The density f ( x ) , the cumulative distribution function F ( x ) and the quantile function Q ( p ) are given by ([16,21]):
f ( x ) = c k λ x λ c − 1 1 + x λ c − k − 1 , F * ( x ) = 1 − 1 + x λ c − k Q ( p ) = λ ( 1 − p ) − 1 / k − 1 1 / c
The octiles are O i = λ ( 1 − i 8 ) − 1 / k − 1 1 / c and the median is O 4 = λ ( 2 1 / k − 1 ) 1 / c .
To compute the auxiliary integral, let u = ( 1 − p ) 1 / k Then u k = ( 1 − p ) and d p = − k u k − 1 d u . The auxiliary integral I ( p 1 , p 2 ) is then
I ( p 1 , p 2 ) = λ ∫ p 1 p 2 ( 1 − p ) − 1 / k − 1 1 / c d p = − λ k ∫ u 1 u 2 1 u − 1 1 / c u k − 1 d u = λ k ∫ 0 u 1 ( 1 − u ) 1 / c u k − 1 − 1 / c d u − λ k ∫ 0 u 2 ( 1 − u ) 1 / c u k − 1 − 1 / c d u = λ k B * ( 1 − p 1 ) 1 / k ; k − 1 / c , 1 + 1 / c − λ k B * ( 1 − p 2 ) 1 / k ; k − 1 / c , 1 + 1 / c
In particular,
I ( 0 , p ) = λ k B k − 1 / c , 1 + 1 / c − λ k B * ( 1 − p ) 1 / k ; k − 1 / c , 1 + 1 / c
Here, B * ( · ) and B ( · ) denote the incomplete Beta and beta function respectively (see Appendix A). The mean μ is
μ = I ( 0 , 1 ) = λ k B k − 1 / c , 1 + 1 / c
The MAD H ( X , O i ) of X around the octiles { O 1 , … , O 7 } from Equations (A81), (A84) and (A85) are
H ( X , O i ) = 2 λ k B * 1 − i / 8 1 / k ; k − 1 / c , 1 + 1 / c − λ k B k − 1 / c , 1 + 1 / c + λ i / 4 − 1 1 − i / 8 − 1 / k − 1 1 / c i = 1 , … 7
Equations (A85) and (A86) gives us eight equations for three unknown parameters λ, k and c.

Appendix E. Distributions Without Explicit Form of the Quantile Function: Gamma Distribution

For some distributions like Beta, Gamma, Maxwell–Boltzmann [21] there is no closed form formula for the quantile function. However, these distributions have a closed form formula for the cumulative distribution function F ( x ) .
For such distributions, we proceed as follows. For the auxiliary integral I ( 0 , p ) we have
I ( 0 , p ) = ∫ 0 p Q ( p ) d p = ∫ x ≤ a x f ( x ) d x = ∫ x ≤ a F ( x ) d x
Let a = Q ( p ) for some p. We will compute MAD H ( X , a ) in terms of F ( x ) as follows. Consider the function h ( x ) = x F ( x ) . Then x f ( x ) = h ′ ( x ) − F ( x ) . Integrating both sides we obtain
I ( 0 , p ) = ∫ x ≤ a x f ( x ) d x = a F ( a ) − ∫ x ≤ a F ( x ) d x
Substituting this in Equation (6) we obtain
H ( X , a ) = ( μ − a ) + 2 ∫ x ≤ a F ( x ) d x
Example A2
(Gamma Distribution). Assume X is distributed according Gamma Distribution with shape parameter α > 0 and rate β > 0 : The corresponding density f ( x ) and cumulative distribution function F ( x ) are given by ([16,21])
f ( x ) = β α x α − 1 e − β x Γ ( α ) and F ( x ) = ν ( α , β x ) Γ ( α ) , x ≥ 0
where Γ ( · ) denotes the Gamma function and ν ( · ) denotes the lower incomplete Gamma function (Equations (A4) and (A5) in Appendix A).
For this distribution, the quantile function Q ( p ) does not exist in closed form, but both density f ( x ) and CDF F ( x ) do. The mean of this distribution is
μ = α β
Let us define z = β x . Then for MAD around median O 4 we have
H ( X , O 4 ) = ( μ − O 4 ) + 2 ∫ x ≤ O 4 F ( x ) d x = α β − O 4 + 2 Γ ( α ) ∫ 0 O 4 ν ( α , β x ) d x = α β − O 4 + 2 β Γ ( α ) ∫ 0 β O 4 ν ( α , z ) d z = α β − O 4 + 2 β Γ ( α ) z α e − z | 0 β O 4 = α β − O 4 + 2 β ( β O 4 ) α e − β O 4 Γ ( α )
Assuming that we can accurately estimate the median O 4 we have two equations Equation (A90) for μ and Equation (A91) for MAD H ( X , O 4 ) . These equations We have two unknown parameters: shape α and rate β. These need to be solved numerically by solving H ( X , O 4 ) = H 4 ^ and μ = μ ^ .

Appendix F. Wall-Clock Timing for Weibull Parameter Estimation (MLE Versus Closed-Form PWM/L-Moments)

This appendix supplements the brief timing table in Section 8.6 (Table 22) and records what was timed so readers can reproduce or adapt the comparison.
  • Purpose.   We provide a concrete wall-clock comparison between a standard iterative likelihood fit and a lightweight rank-based alternative. Because the octile-based C-trapezoid parameter pipeline shares the same qualitative steps as other rank-based estimators (sort the sample, evaluate a fixed small set of empirical quantiles or linear statistics, invert algebraically), we benchmark a clean Weibull case where MLE is known to invoke numerical optimisation in SciPy while the Hosking [37] PWM/L-moment pair ( l 1 , l 2 ) admits the closed-form inversion already used in the paper’s estimation discussion.
  • Implementation details.   Software: Python 3.12.4; NumPy 2.1.3; SciPy 1.16.3. Hardware (authors’ timing run): Apple Silicon, macOS 15.3.2 (arm64). Randomness: numpy.random.default_rng(0). Trials: for each n ∈ { 10 2 , 10 3 , 10 4 , 10 5 } we generate N trials = 30 independent datasets and record one wall-clock measurement per dataset for each method (median reported in the table). MLE baseline: scipy.stats.weibull_min.fit(x, floc=0). Closed-form path: sort x once; unbiased PWMs b 0 , b 1 ; l 1 = b 0 , l 2 = 2 b 1 − b 0 ; Weibull shape α ^ = − ln 2 / ln ( 1 − l 2 / l 1 ) and scale β ^ = l 1 / Γ ( 1 + 1 / α ^ ) . Script: wall_clock_mle_vs_closed_form.py at https://github.com/anacodicAI-labs/c-trapezoid-quantile-metrics/blob/main/jupiter_notebooks/scripts%E2%80%A6 (last accessed on 18 May 2026). Output: wall_clock
  • Caveats. (i) Timings are environment-specific; readers should re-measure on their own hardware when strict reproducibility is required. (ii) SciPy’s Pareto and Normal MLE implementations can be extremely fast in compiled code; comparing them naively to a pure-Python PWM loop can misleadingly suggest the closed-form route is slower. We, therefore, emphasize the Weibull headline row, where the contrast between optimization and closed-form is clearest. (iii) This experiment times parameter recovery only; it excludes IO, plotting, or LaTeX compilation.

References

  1. Pham-Gia, T.; Hung, T. The Mean and Median Absolute deviations. J. Math. Comput. Model. 2001, 34, 921–936. [Google Scholar] [CrossRef] [Scilit]
  2. Gorard, S. Revisiting a 90-year-old debate: The advantages of the mean deviation. Br. J. Educ. Stud. 2005, 53, 417–430. [Google Scholar] [CrossRef] [Scilit]
  3. Gilchrist, W. Statistical Modelling with Quantile Functions; Chapman and Hall/CRC: Boca Raton, FL, USA, 2000. [Google Scholar]
  4. Parzen, E. Quantile Probability and Statistical data Modeling. Stat. Sci. 2024, 19, 652–662. [Google Scholar]
  5. Farebrother, R.W. The Historical Development of the L1 and L∞ Estimation Methods. In Statistical Data Analysis Based on the L1-Norm and Related Topics; Dodge, Y., Ed.; North-Holland: Amsterdam, The Netherlands, 1987; pp. 37–63. [Google Scholar]
  6. Portnoy, S.; Koenker, R. The gaussian hare and the Laplacian tortoise: Computability of square-error versus absolute-error estimators. Stat. Sci. 1997, 2, 279–300. [Google Scholar] [CrossRef] [Scilit]
  7. Bloomfield, P.; Steiger, W. Least Absolute Deviations: Theory, Applications and Algorithms; Birkhauser: Boston, MA, USA, 1983. [Google Scholar]
  8. Dodge, Y. Statistical Data Analysis Based on the L1 Norm and Related Topics; North-Holland: Amsterdam, The Netherlands, 1987. [Google Scholar]
  9. Elsayed, K. Mean Absolute Deviation: Analysis and Applications. Int. J. Bus. Stat. Anal. 2015, 2, 63–74. [Google Scholar] [CrossRef] [Scilit]
  10. Gorard, S. An Absolute Deviation Approach to Assessing Correlation. Br. J. Educ. Soc. Behav. Sci. 2015, 53, 73–81. [Google Scholar] [CrossRef] [Scilit]
  11. Gorard, S. Introducing the Mean Deviation “Effect” Size. Int. J. Res. Method Educ. 2015, 38, 105–114. [Google Scholar] [CrossRef] [Scilit]
  12. Rousseeuw, P.; Croux, C. Alternatives to the Median Absolute Deviation. J. Am. Stat. Assoc. 1993, 88, 1273–1283. [Google Scholar] [CrossRef]
  13. Pinsky, E. Computation and Interpretation of Mean Absolute Deviations by Cumulative Distribution Functions. Front. Appl. Math. Stat. 2025, 11, 1487331. [Google Scholar] [CrossRef] [Scilit]
  14. Koutsoyiannis, D. Knowable Moments in Stochastics: Knowing Their Advantages. Axioms 2023, 12, 590. [Google Scholar] [CrossRef] [Scilit]
  15. Dimitriadis, P.; Koutsoyiannis, D.; Iliopoulou, T.; Papanicolaou, P. A Global-Scale Investigation of Stochastic Similarities in Marginal Distribution and Dependence Structure of Key Hydrological-Cycle Processes. Hydrology 2021, 8, 59. [Google Scholar] [CrossRef] [Scilit]
  16. Feller, W. An Introduction to Probability Theory and Its Applications; J. Wiley: New York, NY, USA, 1968. [Google Scholar]
  17. Greenwood, J.A.; Landwehr, J.M.; Matalas, N.C.; Wallis, J.R. Probability weighted moments: Definition and relation to parameters of several distributions expressable in inverse form. Water Resour. Res. 1979, 15, 1049–1054. [Google Scholar] [CrossRef] [Scilit]
  18. Koutsoyiannis, D. Knowable moments for high-order stochastic characterization and modelling of hydrological processes. Hydrol. Sci. J. 2019, 64, 19–33. [Google Scholar] [CrossRef] [Scilit]
  19. Papoulis, A. Probability, Random Variable, and Stochastic Processes, 2nd ed.; McGraw-Hill: New York, NY, USA, 1984. [Google Scholar]
  20. Huber, P.J. Robust Statistics; J. Wiley: New York, NY, USA, 2009. [Google Scholar]
  21. Johnson, N.; Kotz, S. Distributions in Statistics; J. Wiley: New York, NY, USA, 1970. [Google Scholar]
  22. Kenney, J.; Keeping, E. Mathematics of Statistics; Van Nostrand: Princeton, NJ, USA, 1962. [Google Scholar]
  23. Schwertman, N.; Gilks, A.; Cameron, J. A Simple Noncalculus Proof That the Median Minimizes the Sum of the Absolute Deviations. Am. Stat. 1990, 44, 38–41. [Google Scholar] [CrossRef] [Scilit]
  24. Shad, S. On the Minimum Property of the First Absolute Moment. Am. Stat. 1969, 23, 27. [Google Scholar] [PubMed]
  25. Leys, C.; Klein, O.; Bernard, P.; Licata, L. Detecting outliers: Do not use standard deviation around the mean, use absolute deviation around the median. J. Exp. Soc. Psychol. 2013, 49, 764–766. [Google Scholar] [CrossRef] [Scilit]
  26. Rudin, W. Principles of Mathematical Analysis; McGraw-Hill: New York, NY, USA, 1976. [Google Scholar]
  27. Olver, F.; Lozier, D.; Boisvert, R.; Clark, C. NIST Handbook of Mathematical Functions; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  28. Lange, K. Numerical Analysis for Statisticians, 2nd ed.; Springer: New York, NY, USA, 2010. [Google Scholar] [CrossRef] [Scilit]
  29. Groeneveld, R.A.; Meeden, G. Measuring Skewness and Kurtosis. Statistician 1984, 33, 391–399. [Google Scholar] [CrossRef] [Scilit]
  30. Yule, G.U. An Introduction to the Theory of Statistics; C. Griffin, Limited: London, UK, 1912. [Google Scholar]
  31. MacGillivray, H.I. Skewness and Asymmetry. Ann. Stat. 1986, 14, 994–1011. [Google Scholar] [CrossRef] [Scilit]
  32. Galton, F.; Hamilton, D. Family Likeness in Stature. Proc. R. Soc. London 1886, 40, 42–73. [Google Scholar] [CrossRef] [Scilit]
  33. Balanda, K.P.; Macgillivray, H.L. Kurtosis: A Critical Review. Am. Stat. 1988, 42, 111–119. [Google Scholar] [CrossRef] [Scilit]
  34. Moors, J.J. A Quantile Alternative to Kurtosis. J. R. Stat. Soc. Ser. D 1988, 37, 25–32. [Google Scholar] [CrossRef] [Scilit]
  35. Moors, J.J.A. The meaning of kurtosis: Darlington reexamined. Am. Stat. 1986, 40, 283–284. [Google Scholar] [CrossRef] [Scilit]
  36. Pinsky, E.; Klawansky, S. MAD (about Median) vs. Quantile-based Alternatives for Classical Standard Deviation, Skew, and Kurtosis. Front. Appl. Math. Stat. 2023, 9, 1206537. [Google Scholar] [CrossRef] [Scilit]
  37. Hosking, J.R.M. L-Moments: Analysis and Estimation of Distributions Using Linear Combinations of Order Statistics. J. R. Stat. Soc. Ser. B (Methodol.) 1990, 52, 105–124. [Google Scholar] [CrossRef] [Scilit]
  38. Balakrishnan, N.E. Handbook of Logistic Distribution; Marcel Dekker: New York, NY, USA, 1992. [Google Scholar]
  39. Pawitan, Y. All Likelihood: Statistical Modelling and Inference Using Likelihood; Oxford University Press: Oxford, UK, 2001. [Google Scholar] [CrossRef] [Scilit]
  40. Casella, G.; Berger, R. Statistical Inference; Duxbury: Pacific Grove, CA, USA, 2002. [Google Scholar]
  41. Stigler, S. The Epic Story of Maximum Likelihood. Stat. Sci. 2007, 22, 598–620. [Google Scholar] [CrossRef] [Scilit]
  42. Gelman, A.; Carlin, J.; Stern, H.; Dunson, D.; Vehtari, A.; Rubin, D.B. Bayesian Data Analysis, 3rd ed.; CRC Press: Boca Raton, FL, USA, 2013. [Google Scholar]
  43. Pearson, K. Contributions to the Mathematical Theory of Evolution. Philos. Trans. R. Soc. Lond. A 1894, 54, 71–110. [Google Scholar] [CrossRef] [Scilit]
  44. Dabye, A.S.; Gounoung, A.A.; Kutoyants, Y.A. Method of Moments Estimators and Multi–step MLE for Poisson Processes. J. Contemp. Math. Anal. 2018, 53, 237–246. [Google Scholar] [CrossRef] [Scilit]
  45. Hansen, L. Large Sample Properties of Generalized Method of Moments Estimators. Econometrica 1982, 50, 1029–1054. [Google Scholar] [CrossRef] [Scilit]
  46. Hansen, B. Generalized Shrinkage Estimators. J. Bus. Econ. Stat. 2012, 30, 541–552. [Google Scholar]
  47. Terry Dielman, C.L.; Pfaffenberger, R. A Comparison of Quantile Estimators. Commun. Stat.-Simul. Comput. 1994, 23, 355–371. [Google Scholar] [CrossRef] [Scilit]
  48. Koenker, R. Quantile Regression; Cambridge University Press: Cambridge, UK, 2005. [Google Scholar]
  49. Robert, C.; Casella, G. The Bayesian Choice: From Decision-Theoretic Foundations to Computational Implementation, 2nd ed.; Springer: New York, NY, USA, 2007. [Google Scholar] [CrossRef] [Scilit]
  50. Jaynes, E. Information Theory and Statistical Mechanics. Phys. Rev. 1957, 106, 620–630. [Google Scholar] [CrossRef] [Scilit]
  51. Cover, T.; Thomas, J. Elements of Information Theory, 2nd ed.; Wiley-Interscience: New York, NY, USA, 1999. [Google Scholar] [CrossRef] [Scilit]
  52. Wasserman, L. All of Statistics: A Concise Course in Statistical Inference; Springer: New York, NY, USA, 2006. [Google Scholar] [CrossRef] [Scilit]
  53. Alvarez, L.A.; Chiann, C.; Morettin, P.A. Inference on model parameters with many L-moments. J. Econom. 2025, 252, 106101. [Google Scholar] [CrossRef] [Scilit]
  54. Ianculescu, D.; Anghel, C.G. Innovative Explicit Relations for Weibull Distribution Parameters Based on K-Moments. Mathematics 2025, 13, 3473. [Google Scholar] [CrossRef] [Scilit]
  55. Cohen, A.C.; Whitten, B.J. Estimation in the Three-Parameter Lognormal Distribution. J. Am. Stat. Assoc. 1980, 75, 399–404. [Google Scholar] [CrossRef]
  56. Wingo, D.R. Fitting three-parameter lognormal models by numerical global optimization—An improved algorithm. Comput. Stat. Data Anal. 1984, 2, 13–25. [Google Scholar] [CrossRef] [Scilit]
  57. Zimmer, W.J.; Keats, J.B.; Wang, F.K. The Burr XII Distribution in Reliability Analysis. J. Qual. Technol. 1998, 30, 386–394. [Google Scholar] [CrossRef] [Scilit]
  58. Simwa, R.O.; Kithinji, M.M.; Otieno, J.A.M. Application of Burr XII Mixture Distributions to Model Unemployment Duration in Pricing Unemployment Insurance Assuming USA Data. Int. J. Stat. Distrib. Appl. 2016, 2, 27–34. [Google Scholar] [CrossRef] [Scilit]
  59. Tadikamalla, P.R. A Look at the Burr and Related Distributions. Int. Stat. Rev./Rev. Int. Stat. 1980, 48, 337–344. [Google Scholar] [CrossRef] [Scilit]
  60. Petković, M.S.; Neta, B.; Petković, L.D.; Džunić, J. Multipoint methods for solving nonlinear equations: A survey. Appl. Math. Comput. 2014, 226, 635–660. [Google Scholar] [CrossRef] [Scilit]
  61. Bishop, C. Pattern Recognition and Machine Learning; Springer: New York, NY, USA, 2016. [Google Scholar]
  62. Hastle, T. Elements of Statistical Learning; Pearson: London, UK, 2018. [Google Scholar]
  63. Hajji, M.; Benhala, B.; Hamdi, I. Survey of Gradient Descent Variants and Evaluation Criteria. In Proceedings of the 2024 4th International Conference on Innovative Research in Applied Science, Engineering and Technology (IRASET), Fez, Morocco, 16–17 May 2024; IEEE: Piscataway, NJ, USA, 2024; pp. 1–7. [Google Scholar] [CrossRef] [Scilit]
  64. Khoshvaght, H.; Permala, R.R.; Razmjou, A.; Khiadani, M. A critical review on selecting performance evaluation metrics for supervised machine learning models in wastewater quality prediction. J. Environ. Chem. Eng. 2025, 13, 119675. [Google Scholar] [CrossRef] [Scilit]
  65. Dudek, D.; Kuczmaszewska, A. Some practical and theoretical issues related to the quantile estimators. Stat. Pap. 2024, 65, 3917–3933. [Google Scholar] [CrossRef] [Scilit]
  66. Pan, Q.; Ko, Y.M.; Byon, E. Uncertainty Quantification for Extreme Quantile Estimation With Stochastic Computer Models. IEEE Trans. Reliab. 2021, 70, 134–145. [Google Scholar] [CrossRef] [Scilit]
  67. Li, Y. Performance Analysis of Efficient Sorting Algorithms in Big Data Processing. Procedia Comput. Sci. 2025, 262, 44–50. [Google Scholar] [CrossRef] [Scilit]
  68. Koutsoyiannis, D.; Dimitriadis, P. Towards Generic Simulation for Demanding Stochastic Processes. Sci 2021, 3, 34. [Google Scholar] [CrossRef] [Scilit]
  69. Pinsky, E.; Wen, Q. Estimation of Distribution Parameters by Mean Absolute Deviations of a Truncated Distribution Using Quantile Functions. Stat. Pap. 2026, 67, 31. [Google Scholar] [CrossRef] [Scilit]
  70. Gupta, A.; Nadarajah, S. Handbook of Beta Distributions and Its Applications; CRC Press, Taylor & Francis: New York, NY, USA, 2018. [Google Scholar]
  71. Pinsky, E.; Wen, Q. Simple Approximations and Interpretation of Pareto Index and Gini Coefficient Using Mean Absolute Deviations and Quantile Functions. Econometrics 2025, 13, 30. [Google Scholar] [CrossRef] [Scilit]
  72. Houghton, J.C. Birth of a parent: The Wakeby Distribution for modeling flood flows. Water Resour. Res. 1978, 14, 1105–1109. [Google Scholar] [CrossRef] [Scilit]
  73. Cochrane, J.H. Asset Pricing, revised ed.; Princeton University Press: Princeton, NJ, USA, 2005. [Google Scholar]
  74. Cont, R. Empirical properties of asset returns: Stylized facts and statistical issues. Quant. Financ. 2001, 1, 223–236. [Google Scholar] [CrossRef]
  75. Rachev, S.T.; Menn, C.; Fabozzi, F.J. Fat-Tailed and Skewed Asset Return Distributions: Implications for Risk Management, Portfolio Selection, and Option Pricing; Wiley: Hoboken, NJ, USA, 2005. [Google Scholar]
  76. Fama, E.F. The Behavior of Stock-Market Prices. J. Bus. 1965, 38, 34–105. [Google Scholar] [CrossRef] [Scilit]
  77. Applebaum, D. Lévy Processes and Stochastic Calculus, 2nd ed.; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar]
  78. Bertoin, J. Levy Processes; Cambridge University Press: Cambridge, UK, 1996. [Google Scholar]
  79. Sato, K.I. Lévy Processes and Infinitely Divisible Distributions; Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
  80. Schoutens, W. Lévy Processes in Finance: Pricing Financial Derivatives; Wiley: Chichester, UK, 2003. [Google Scholar]
  81. Eberlein, E.; Keller, U. Hyperbolic Distributions in Finance. Bernoulli 1995, 1, 281–299. [Google Scholar] [CrossRef]
  82. Eberlein, E. Application of Generalized Hyperbolic Lévy Motions to Finance. In Lévy Processes: Theory and Applications; Barndorff-Nielsen, O.E., Resnick, S.I., Mikosch, T., Eds.; Birkhäuser Boston: Boston, MA, USA, 2001; pp. 319–336. [Google Scholar] [CrossRef] [Scilit]
  83. Rachev, S.T.; Mittnik, S. Stable Paretian Models in Finance; Wiley: Chichester, UK, 2000. [Google Scholar]
  84. Embrechts, P.; Klüppelberg, C.; Mikosch, T. Modelling Extremal Events for Insurance and Finance; Springer: Berlin/Heidelberg, Germany, 1997. [Google Scholar] [CrossRef] [Scilit]
  85. Duffie, D. Dynamic Asset Pricing Theory, 3rd ed.; Princeton University Press: Princeton, NJ, USA, 2001. [Google Scholar]
  86. Merton, R.C. Theory of Rational Option Pricing. Bell J. Econ. Manag. Sci. 1973, 4, 141–183. [Google Scholar] [CrossRef] [Scilit]
  87. Tankov, P.; Cont, R. Financial Modeling with Jump Processes; Chapman and Hall/CRC: New York, NY, USA, 2004. [Google Scholar]
  88. Arratia, A.; Dorador, A. On the efficacy of stop-loss rules in the presence of overnight gaps. Quant. Financ. 2019, 19, 1857–1873. [Google Scholar] [CrossRef] [Scilit]
  89. Kelly, B.; Clark, A. The Overnight Return Puzzle. J. Financ. Econ. 2011, 100, 556–578. [Google Scholar] [CrossRef] [Scilit]
  90. Berkman, H.; Koch, P.D.; Tuttle, L.; Zhang, Y.J. Paying Attention: Overnight Returns and the Hidden Cost of Buying at the Open. J. Financ. Quant. Anal. 2012, 47, 715–741. [Google Scholar] [CrossRef] [Scilit]
  91. Lou, D.; Polk, C. Comomentum: Inferring Arbitrage Activity from Return Correlations. Rev. Financ. Stud. 2022, 35, 3272–3302. [Google Scholar] [CrossRef] [Scilit]
  92. Lou, D.; Polk, C.; Skouras, S. A Tug of War: Overnight Versus Intraday Expected Returns. J. Financ. Econ. 2019, 134, 192–213. [Google Scholar] [CrossRef] [Scilit]
  93. Zhang, X.; Pinsky, E. S&P-500 vs. Nasdaq-100 price movement prediction with LSTM for different daily periods. Mach. Learn. Appl. 2025, 19, 100617. [Google Scholar] [CrossRef] [Scilit]
  94. Kundu, T.; Pinsky, E. Predicting daily stock price directions with deep learning models. Mach. Learn. Appl. 2025, 22, 100744. [Google Scholar] [CrossRef] [Scilit]
  95. Lin, W.J. Weekly Seasonality in Overnight Effects of the Stock Market. Appl. Econ. Financ. 2025, 12, 30–46. [Google Scholar] [CrossRef] [Scilit]
  96. Bahcivan, H. Day and night expected returns under overnight information shocks: New tug-of-war pattern. Financ. Res. Lett. 2025, 86, 108591. [Google Scholar] [CrossRef] [Scilit]
  97. Yuan, X.; Long, J.; Li, X.; Zhao, C. Asymmetric connectedness in the Chinese stock sectors: Overnight and daytime return spillovers. Pac.-Basin Financ. J. 2025, 89, 102585. [Google Scholar] [CrossRef] [Scilit]
  98. Lachance, M.E. ETFs’ high overnight returns: The early liquidity provider gets the worm. J. Financ. Mark. 2021, 52, 100563. [Google Scholar] [CrossRef] [Scilit]
  99. Jung, J.; Lee, K.; Leung, T. Threshold overnight comovement analysis of intraday and overnight returns. Investig. Anal. J. 2025, 1–21. [Google Scholar] [CrossRef] [Scilit]
  100. Glasserman, P.; Krstovski, K.; Laliberte, P.; Mamaysky, H. Does Overnight News Explain Overnight Returns? arXiv 2025, arXiv:2507.04481. [Google Scholar] [CrossRef] [Scilit]
  101. Su, F.; Wang, F.; Zhai, L.; Zhou, Y.; Zhang, J. Asymmetric attention and asymmetric overnight momentum in China’s stock market. Asia-Pac. J. Account. Econ. 2025, 33, 339–363. [Google Scholar] [CrossRef] [Scilit]
  102. Frazzini, A.; Israel, R.; Moskowitz, T.J. Trading Costs. J. Financ. Econ. 2018, 130, 1–19. [Google Scholar] [CrossRef] [Scilit]
  103. Novy-Marx, R.; Velikov, M. A Taxonomy of Anomalies and Their Trading Costs. Rev. Financ. Stud. 2016, 29, 104–147. [Google Scholar] [CrossRef] [Scilit]
  104. Lesmond, D.A.; Schill, M.J.; Zhou, C. The Illusory Nature of Momentum Profits. J. Financ. Econ. 2004, 71, 349–380. [Google Scholar] [CrossRef] [Scilit]
  105. Korajczyk, R.A.; Sadka, R. Are Momentum Profits Robust to Trading Costs? J. Financ. 2004, 59, 103–139. [Google Scholar] [CrossRef] [Scilit]
  106. Amihud, Y. Illiquidity and Stock Returns: Cross-Section and Time-Series Effects. J. Financ. Mark. 2002, 5, 31–56. [Google Scholar] [CrossRef] [Scilit]
  107. Wharton School. Wharton Research Data Services (WRDS), 2024. Available online: https://wrds-www.wharton.upenn.edu/ (accessed on 2 April 2026).
  108. Zheng, Z.; Qiao, Z.; Takaishi, T.; Stanley, H.E.; Li, B. Realized Volatility and Absolute Return Volatility: A Comparison Indicating Market Risk. PLoS ONE 2014, 9, e102940. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  109. Chopra, V.K.; Ziemba, W.T. The Effect of Errors in Means, Variances, and Covariances on Optimal Portfolio Choice. J. Portf. Manag. 1993, 19, 6–11. [Google Scholar] [CrossRef] [Scilit]
  110. Konno, H.; Yamazaki, H. Mean-Absolute Deviation Portfolio Optimization Model and Its Applications to Tokyo Stock Market. Manag. Sci. 1991, 37, 519–531. [Google Scholar] [CrossRef] [Scilit]
  111. Mansini, R.; Ogryczak, W.; Speranza, M.G. Twenty Years of Linear Programming Based Portfolio Optimization. Eur. J. Oper. Res. 2014, 234, 518–535. [Google Scholar] [CrossRef] [Scilit]
  112. Simaan, Y. Estimation Risk in Portfolio Selection: The Mean Variance Model Versus the Mean Absolute Deviation Model. Manag. Sci. 1997, 43, 1437–1446. [Google Scholar] [CrossRef] [Scilit]
  113. Sharpe, W.F. Mutual Fund Performance. J. Bus. 1966, 39, 119–138. [Google Scholar] [CrossRef] [Scilit]
  114. Radford, A.; Wu, J.; Child, R.; Luan, D.; Amodei, D.; Sutskever, I. Language Models are Unsupervised Multitask Learners; Technical Report; OpenAI: San Francisco, CA, USA, 2019. [Google Scholar]
  115. Zhang, S.; Roller, S.; Goyal, N.; Artetxe, M.; Chen, M.; Chen, S.; Dewan, C.; Diab, M.; Li, X.; Lin, X.V.; et al. OPT: Open Pre-trained Transformer Language Models. arXiv 2022, arXiv:2205.01068. [Google Scholar] [CrossRef] [Scilit]
  116. Biderman, S.; Schoelkopf, H.; Anthony, Q.; Bradley, H.; O’Brien, K.; Hallahan, E.; Khan, M.A.; Purohit, S.; Prashanth, U.S.; Raff, E.; et al. Pythia: A Suite for Analyzing Large Language Models Across Training and Scaling. In Proceedings of the 40th International Conference on Machine Learning, Honolulu, HI, USA, 23–29 July 2023; pp. 2397–2430. [Google Scholar]
  117. Vaswani, A.; Shazeer, N.; Parmar, N.; Uszkoreit, J.; Jones, L.; Gomez, A.N.; Kaiser, Ł.; Polosukhin, I. Attention Is All You Need. In Advances in Neural Information Processing Systems; MIT Press: Cambridge, MA, USA, 2017; Volume 30, pp. 5998–6008. [Google Scholar]
  118. Yu, M.; De Sa, C. The Super Weight in Large Language Models. In Proceedings of the International Conference on Learning Representations, Singapore, 24–28 April 2025. [Google Scholar]
  119. Martin, C.H.; Mahoney, M.W. Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Training. J. Mach. Learn. Res. 2021, 22, 7479–7551. [Google Scholar]
  120. Martin, C.H.; Peng, T.; Mahoney, M.W. Predicting Trends in the Quality of State-of-the-Art Neural Networks Without Access to Training or Testing Data. Nat. Commun. 2021, 12, 4118. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  121. Lu, H.; Zhou, Y.; Liu, S.; Wang, Z.; Mahoney, M.W.; Yang, Y. AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Models. arXiv 2024, arXiv:2410.10912. [Google Scholar]
  122. Dettmers, T.; Lewis, M.; Belkada, Y.; Zettlemoyer, L. LLM.int8(): 8-bit matrix multiplication for transformers at scale. In Proceedings of the Advances in Neural Information Processing Systems, New Orleans, LA, USA, 28 November–9 December 2022. [Google Scholar]
  123. Xiao, G.; Lin, J.; Seznec, M.; Wu, H.; Demouth, J.; Han, S. SmoothQuant: Accurate and efficient post-training quantization for large language models. In International Conference on Machine Learning; PMLR: New York, NY, USA, 2023. [Google Scholar]
  124. Lin, J.; Tang, J.; Tang, H.; Yang, S.; Chen, W.M.; Wang, W.C.; Xiao, G.; Dang, X.; Gan, C.; Han, S. AWQ: Activation-aware weight quantization for LLM compression and acceleration. In Conference on Machine Learning and Systems (MLSys); Association for Computing Machinery: New York, NY, USA, 2024; Available online: https://proceedings.mlsys.org/paper_files/paper/2024/file/42a452cbafa9dd64e9ba4aa95cc1ef21-Paper-Conference.pdf (accessed on 18 May 2026).
  125. He, D.; Tu, S.; Jaiswal, A.; Shen, L.; Yuan, G.; Liu, S.; Yin, L. AlphaDecay: Module-wise Weight Decay for Heavy-Tailed Balancing in LLMs. arXiv 2025, arXiv:2506.14562. [Google Scholar] [CrossRef] [Scilit]
  126. Frantar, E.; Ashkboos, S.; Hoefler, T.; Alistarh, D. GPTQ: Accurate post-training quantization for generative pre-trained transformers. In International Conference on Learning Representations; ICLR: Appleton, WI, USA, 2023; Available online: https://api.semanticscholar.org/CorpusID:253237200 (accessed on 18 May 2026).
  127. Jiang, A.Q.; Sablayrolles, A.; Roux, A.; Mensch, A.; Savary, B.; Bamford, C.; Chaplot, D.S.; Casas, D.D.L.; Hanna, E.B.; Bress, F.; et al. Mixtral of experts. arXiv 2024, arXiv:2401.04088. [Google Scholar] [CrossRef] [Scilit]
  128. Touvron, H.; Lavril, T.; Izacard, G.; Martinet, X.; Lachaux, M.A.; Lacroix, T.; Rozière, B.; Goyal, N.; Hambro, E.; Azhar, F.; et al. LLaMA: Open and efficient foundation language models. arXiv 2023, arXiv:2302.13971. [Google Scholar] [CrossRef] [Scilit]
  129. Andrews, G.; Askey, R.; Roy, R. Special Functions; Cambridge University Press: Cambridge, UK, 2000. [Google Scholar]
  130. Gradshteyn, I.S.; Ryzhik, I.M. Table of Integrals, Series, and Products; Academic Press: New York, NY, USA, 1980. [Google Scholar]
  131. Olver, F. Introduction to Asymptotics and Special Functions, 1st ed.; Academic Press: New York, NY, USA, 1974. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.