Faster estimation of the transformation-free linear simplicial-simplicial regression via constrained iterative reweighted least squares
By: Michail Tsagris
Potential Business Impact:
Makes computer math faster and use less memory.
Simplicial-simplicial regression refers to the regression setting where both the responses and predictor variables lie within the simplex space, i.e. they are compositional. \cite{fiksel2022} proposed a transformation-free linear regression model, that minimizes the Kullback-Leibler divergence from the observed to the fitted compositions, where the EM algorithm is used to estimate the regression coefficients. We formulate the model as a constrained logistic regression, in the spirit of \cite{tsagris2025}, and we estimate the regression coefficients using constrained iteratively reweighted least squares. The simulation studies depict that this algorithm makes the estimation procedure significantly faster, uses less memory, and in some cases gives a better solution.
Similar Papers
Scalable approximation of the transformation-free linear simplicial-simplicial regression via constrained iterative reweighted least squares
Methodology
Speeds up math for analyzing parts of a whole.
Transformation-free linear simplicial-simplicial regression via constrained iterative reweighted least squares
Methodology
Makes computer math on tricky data much faster.
Estimation and inference in generalised linear models with constrained iteratively-reweighted least squares
Methodology
Helps math models follow rules for better answers.