Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
This paper studies several versions of the sparse optimization problem in statistical
estimation defined by a pairwise separation objective. The sparsity (ie, ℓ 0) function is …
estimation defined by a pairwise separation objective. The sparsity (ie, ℓ 0) function is …
Research on scoring mechanism of spoken English self-study system taking into account artificial intelligence technology and speech knowledge recognition …
N Li - International Journal of Information and …, 2024 - inderscienceonline.com
With the development of computers and the continuous progress of speech recognition
technology, the use of computer-assisted language learning (CALL) system for self-study of …
technology, the use of computer-assisted language learning (CALL) system for self-study of …
Global resolution of the support vector machine regression parameters selection problem with LPCC
Support vector machine regression is a robust data fitting method to minimize the sum of
deducted residuals of regression, and thus is less sensitive to changes of data near the …
deducted residuals of regression, and thus is less sensitive to changes of data near the …
A branch-and-bound algorithm for instrumental variable quantile regression
This paper studies a statistical problem called instrumental variable quantile regression
(IVQR). We model IVQR as a convex quadratic program with complementarity constraints …
(IVQR). We model IVQR as a convex quadratic program with complementarity constraints …