paper-with-me

Papers

Anchored Regularized Direct Least Squares (ARDLS): Integrating Established Prioritization Operators for Priority Elicitation in the Analytic Hierarchy Process

2026-08-21 · Kevin Kam Fung Yuen arxiv

Pairwise reciprocal matrices are fundamental to the Analytic Hierarchy Process (AHP), a decision-making model. While the Direct Least Squares (DLS) method provides an intuitive mechanism for deriving priority vectors without complex transformations, the DLS provides multiple solutions. Under high levels of inconsistency, such as cyclic contradictions, this non-convexity yields multiple distinct global minima, resulting in unstable priority rankings that critically depend on initial algorithmic guesses. To overcome this structural deficiency, this paper introduces the Anchored Regularized Direct Least Squares (ARDLS) optimization model. ARDLS integrates uniquely determined established prioritization operators, such as normalization techniques, the Eigenvector method, Singular Value Decomposition, Cosine Maximization, and the Pseudo-Inverse Gram Matrix (the closed-form solution of Weighted Least Squares), as theoretical anchors within a regularization penalty. This integration systematically breaks mathematical symmetries, tilting the optimization landscape to guarantee convergence upon a single, unique global minimum. Comprehensive numerical experiments and simulations validate that the ARDLS framework successfully reduces root mean square error among established priority operators, while guaranteeing strict mathematical uniqueness. The proposed ARDLS may be the ideal alternative for the AHP applied to many application domains.

📄 PDF Abstract BibTeX arXiv:2608.21187

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squares

2021-02-08 · NeurIPS 2021 12 · Hiroaki Yamada, Makoto Yamada

A recently introduced technique for a sparse optimization problem called "safe screening" allows us to identify irrelevant variables in the early stage of optimization. In this paper, we first propose a flexible framewor…

A Risk Comparison of Ordinary Least Squares vs Ridge Regression

2011-05-04 · Paramveer S. Dhillon, Dean P. Foster, Sham M. Kakade, Lyle H. Ungar

We compare the risk of ridge regression to a simple variant of ordinary least squares, in which one simply projects the data onto a finite dimensional subspace (as specified by a Principal Component Analysis) and then pe…

regression

Finite Sample System Identification: Improved Rates and the Role of Regularization

2020-06-08 · L4DC 2020 6 · Yue Sun, Samet Oymak, Maryam Fazel

This paper studies low-order linear system identification via regularized regression. The nuclear norm of the system’s Hankel matrix is added as a regularizer to the least-squares cost function due to the following advan…

Bayesian $l_0$-regularized Least Squares

2017-05-31 · Nicholas G. Polson, Lei Sun

Bayesian $l_0$-regularized least squares is a variable selection technique for high dimensional predictors. The challenge is optimizing a non-convex objective function via search over model space consisting of all possib…

Computational EfficiencyVariable Selection

Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimization

2020-06-10 · NeurIPS 2020 12 · Jonathan Lacotte, Mert Pilanci

We propose a new randomized algorithm for solving L2-regularized least-squares problems based on sketching. We consider two of the most popular random embeddings, namely, Gaussian embeddings and the Subsampled Randomized…