Probabilistic prediction with locally weighted jackknife predictive system

Probabilistic predictions for regression problems are more popular than point predictions and interval predictions, since they contain more information for test labels. Conformal predictive system is a recently proposed non-parametric method to do reliable probabilistic predictions, which is computationally inefficient due to its learning process. To build faster conformal predictive system and make full use of training data, this paper proposes the predictive system based on locally weighted jackknife prediction approach. The theoretical property of our proposed method is proved with some regularity assumptions in the asymptotic setting, which extends our earlier theoretical researches from interval predictions to probabilistic predictions. In the experimental section, our method is implemented based on our theoretical analysis and its comparison with other predictive systems is conducted using 20 public data sets. The continuous ranked probability scores of the predictive distributions and the performance of the derived prediction intervals are compared. The better performance of our proposed method is confirmed with Wilcoxon tests. The experimental results demonstrate that the predictive system we proposed is not only empirically valid, but also provides more information than the other comparison predictive systems.


Introduction
Machine learning techniques been widely applied to many areas because of their expressive power with the help of gradient descent [13,15,19,23,24] and metaheuristics [1-3, 16, 17] for efficient parameter searching.Based on machine learning, one can build predictive models considering the uncertainty of outputs.This paper concentrates on the predictive system providing predictive distribution for the test label, which is desirable for all walks of life [11].For regression problems, the predictive distribution contains the full information of the uncertainty, as it can provide the probability of any event relevant to the test label and be transformed to prediction point or prediction interval by use of the corresponding first-order moment or quantiles.For many applications, especially the high-risk ones, the predictive distributions are required to be valid, which implies that the distributions or their derived prediction intervals have statistical compatibility with realizations, i.e., they ought to tell the truth [33].
Nowadays, many algorithms in the context of statistics or machine learning have been proposed to output predictive distributions for test labels.However, most of them such as Bayesian regression and Gaussian process regression are highly dependent on their prior distribution assumptions, which can be far away from being valid if the prior assumptions are not correct [6,18].Recently, some frequentist approaches of probabilistic prediction algorithms have been proposed with compatibility with realizations in mind [25,27].While these approaches concern more about frequentist probability, they are limited in applications due to their original parametric forms.This issue has been tackled by a collection of promising works about conformal predictive systems (CPSs) [31,33,34], which build predictive system using learning framework of conformal prediction [6,32] and extend the above frequentist approaches to a general nonparametric setting of being valid even in the small-sample cases.
The purpose of conformal prediction is to output valid prediction sets for test labels.One of the key characteristics of conformal prediction is that its p values calculated using conformity scores follows the uniform distribution on [0, 1] with the assumption of the samples being independent and identically distributed.This excellent property enables us to transform the unknown uncertainty from data to one of our most familiar distributions.CPSs utilize the p values of conformal prediction and transform them to the predictive distributions, which makes CPSs have the small-sample property of validity [31].
The pioneer work [31] first proposed CPSs with the classical least square procedure as the underlying algorithms and the asymptotic efficiency was proved with some strong assumptions.After that, [31] was done to answer some general questions about the existence and construction of consistent CPSs.In addition to the general theoretical studies above, two kinds of works concentrating on the applicability of CPSs were done.The first kind is to propose more flexible CPSs, whose representatives are [33] and [35].The former extends using the classical least square procedure as underlying algorithm to using a more powerful algorithm named kernel ridge regression, and the latter proposed conformal calibration whose underlying algorithms are existing predictive systems.The second kind is to speed up the learning process of CPSs, as CPSs inherit the computational issue from conformal prediction [14,20,30].To address this, there are two ways to try.One way is to modify the learning process of the original CPSs, such as split conformal predictive systems (SCPSs) and cross-conformal predictive systems (CCPSs) [34].SCPSs are also valid even in smallsample cases, but they may lose predictive efficiency, as they split the data into two parts, one of which is used to train the underlying algorithm and the other of which is used to calculate conformity scores.Although CCPSs do not have the theoretical guarantee of validity, they improve the prediction performance by making full use of the data.
Another way is to use a fast and well-performed underlying algorithm to compute the conformity scores, which was our previous work for building a fast probabilistic prediction algorithm [37].In that work, based on the Leave-One-Out CCPS and extreme learning machine [12], we proposed a fast CPS named LOO-CCPS-RELM and analysed its asymptotic property of validity.LOO-CCPS-RELM takes advantage of jackknife prediction of residuals and their closed-form formula to make the whole learning process fast, which is competent in real-time applications.
This work extends our previous work about LOO-CCP-S-RELM in two aspects.First, we design a more general learning framework in the spirit of LOO-CCPS-RELM to make probabilistic prediction, whose underlying algorithms can be any uniformly stable algorithm.Second, contrast with LOO-CCPS-RELM designed and proved to be asymptotically valid only for homoscedastic cases, the learning framework in this paper considers the heteroscedastic cases and a more general theoretical guarantee of the asymptotical validity is proved.The heteroscedastic cases are addressed by the idea of locally weighted jackknife prediction, whose theoretical analysis for prediction intervals has been conducted in our earlier work [38].This paper extends the related concepts and analytical techniques to the probabilistic prediction.Since the predictive system we proposed is based on the idea of locally weighted jackknife prediction, it is named as locally weighted jackknife predictive system (LW-JPS) in this paper.
In summary, to build valid and computationally efficient predictive system, we develop locally weighted jackknife prediction approach with asymptotic guarantee of validity with the contributions as follows: • A general predictive system based on the idea of locally weighted jackknife prediction is proposed for probabilistic prediction, which is easy-to-code and can learn fast if the underlying algorithms have the closed-form formula for leave-one-out residuals.• The asymptotical validity of our predictive system is proved with some regularity assumptions, which extends the analysis of LOO-CCPS-RELM by considering a more general setting and the heteroscedastic cases.
• The experiments with 20 public data sets are conducted, which empirically proves the effective and efficiency of the proposed predictive system.
The rest of this paper is organized as follows."Conformal predictive systems and locally weighted jackknife predictive system" reviews conformal predictive systems and defines the proposed LW-JPS."Asymptotic analysis of locally weighted jackknife predictive system" proves the asymptotic validity of LW-JPS with some regularity assumptions and conditions.In "Experiments", the experiments are designed to test the validity and efficiency of LW-JPS empirically and the conclusions of this paper are drawn in "Conclusion".

Conformal predictive systems and locally weighted jackknife predictive system
Throughout this paper, X ⊆ R n denotes the object space and Y ⊆ R the label space.The observation space is denoted by Z X × Y and each observation z (x, y) ∈ X × Y comprises its object x and corresponding label y.
) are independent and identically distributed and drawn from the distribution ρ on Z X × Y .T denotes a random number uniformly distributed on [0, 1], which is independent of all observations and its realization is denoted by t.
For a fixed training set zl and a test input object x 0 , the goal of predictive systems is to construct a predictive distribution on y ∈ R, which contains much of the information about y 0 .

Predictive system and randomized predictive system
We first give the definition of predictive system which is first formally defined in [35].

is a predictive system (PS) if it satisfies the following two conditions:
A. For each realization z l and x 0 , the function Q z l , (x 0 , y) is increasing in y ∈ R.
B. For each realization z l and x 0 , Next, the notion of randomized predictive system is needed to introduce conformal predictive system.

is a randomized predictive system (RPS) if it satisfies the following two conditions:
A. For each realization z l and x 0 , the function Q z l , (x 0 , y), t is increasing in y ∈ Rand t ∈ [0, 1].
B. For each realization z l and x 0 , In this paper, we use the shorthand notation Q z l , x 0 (y) Q z l , (x 0 , y) to explicitly regard it as a function of y dependent on z l and x 0 , and the shorthand notation Q z l , x 0 , t (y) Q z l , (x 0 , y), t to explicitly regard it as a function of y dependent on z l , x 0 and t.Q z l , x 0 (y) is the predictive distribution of PS, which is a cumulative distribution function (CDF) of Y 0 given z l and x 0 .Different from that, RPS introduces a random number t to build the predictive distribution Q z l , x 0 , t (y).For fixed training set z l and x 0 , the lower bound and upper bound of Q z l , x 0 , t (y) are Q z l , x 0 , 0 (y) and Q z l , x 0 , 1 (y), respectively.The gap Q z l , x 0 , 1 (y) − Q z l , x 0 , 0 (y) can converge to 0 quickly for the existing designed RPSs [31].Thus, one can use a CDF between or approximating Q z l , x 0 , 0 (y) and Q z l , x 0 , 1 (y) to remove the impact of t and build the predictive distribution of Y 0 .
A predictive system Q z l , x 0 (y) is valid, if the following holds: where Q Z l , X 0 (y) is a random function of y whose realization is Q z l , x 0 (y).In addition, Q z l , x 0 (y) is asymptotically valid if formula (1) holds asymptotically.Let q (η/2) z l , x 0 and q (1−η/2) z l , x 0 be the η/2 and 1 − η/2 quantiles of Q z l , x 0 (y).Then, the property of validity defined by formula (1) ensures that where is the prediction interval derived from Q z l , x 0 (y), whose expected coverage rate is 1 − η.
The predictive systems developed in the literature needs strong assumptions to be valid in small-sample cases [25,27].Therefore, to obtain validity in small-sample cases, randomized predictive system introduces the extra random number t, whose purpose is to define a similar property of validity for RPS as follows, is the p value of conformal prediction, the corresponding RPS is called conformal predictive system, which has the property of validity in small-sample cases defined by formula (3) and the equation-like formula (2) holds by introducing T .
Next, we review SCPSs and CCPSs to demonstrate how to construct the function Q z l , x 0 , t (y).

Split conformal predictive system
To build a CPS, the conformity scores of observations calculated by a conformity measure A(S, z) are needed, where S is a data set and z is an observation.The conformity measure evaluates the degree of agreement between S and z.In the context of SCPSs, A(S, z) should be a balance isotonic function [34].In general, with a regression algorithm u, A(S, z) can be designed as or where μ S and υ S are estimated mean function and conditional variance function learned from S, respectively.The learning process of SCPSs splits the training set z l into two parts, which are the proper training set z m 1 { x j , y j , j 1, 2, • • • , m} and the calibration set z l m { x j , y j , j m + 1, • • • , l}.For each possible label y ∈ R, l − m + 1 conformity scores can be computed as follows: where x 0 is a test input, y is the corresponding label of x 0 and i m + 1, m + 2, • • •, l.Based on the above calculation, Q z l , x 0 , t (y) can be obtained as formula (5) in [37].The theory in [34] shows that the above Q z l , x 0 , t (y) is a valid RPS.Different A(S, z) leads to different Q z l , x 0 , t (y).Suppose that formula (5) is the conformity measure and define C i as ∞.Then, the corresponding Q z l , x 0 , t (y) is calculated as formula (7) in [37], which can be further modified to become a formal CDF as formula (8) in [37], i.e., the empirical CDF of The split process of SCPSs may not make full use of the training data, which is the reason of the development of CCPSs.

Cross-conformal predictive system
Finally, the function Q z l , x 0 , t (y) of the CCPS is written as formula ( 9) in [37].
Suppose that formula ( 5) is the conformity measure and for j ∈ o i , C j, i is written as ∞.Then, the Q z l , x 0 , t (y) of the above CCPS can be written as formula (10) in [37], which can be further modified to become a formal CDF as formula (11) in [37], i.e., the empirical CDF of Leave-One-Out CCPS with formula (5) as conformity measure can be obtained by choosing k l, whose predictive distribution is the empirical CDF of {C i , i 1, • • • , l}, with C i being written as.
We summarize the Leave-One-Out CCPS in Algorithm 1, since our proposed predictive system based on locally weighted jackknife prediction is highly related to it.

Locally weighted jackknife predictive system
Jackknife prediction employs leave-one-out predictions for training data, which was proposed in the context of conformal prediction to build interval predictors [14,36,38].Here, we extend it to build predictive systems inspired by Leave-One-Out CCPS.Locally weighted jackknife prediction is the jackknife prediction with the square root of υ z l rithm 1 as the local weight.In fact, Algorithm 1 can be modified to base on locally weighted jackknife prediction by changing u z l respectively, which reduces the times of the computation for regressors from l to 1.In addition, one also needs a way of calculating or approximating v z l and v z l efficiently to build the predictive system.In this paper, we employ the way of approximating them developed in our previous works [36,38] about conformal prediction, which leads to our proposed predictive system based on locally weighted jackknife prediction in Algorithm 2.
5: For = 1,2, ⋯ , , calculate as follows, Algorithm 2 utilizes the jackknife prediction u z l and calculates the locally weighted leave-one-out residuals with the square root of v z l (i) (x i ) as the weight to build the predictive system.
Although Algorithm 2 needs to compute leave-one-out residuals, the learning process can be fast if the underlying algorithms u and v are linear smoothers [39], which have closed-form formula for computation.

Asymptotic analysis of locally weighted jackknife predictive system
This section provides the asymptotic analysis of LW-JPS.We first give the related definition, assumptions and conditions, and then prove the asymptotic validity of LW-JPS.

Definitions, assumptions and conditions
Throughout the paper, we assume that the labels are bounded by D, i.e., sup y∈Y |y| ≤ D. The regularity properties of the probability distribution ρ on Z X × Y will be assumed when it is needed as in [9].All observations Denote the marginal probability distribution of ρ on X as ρ X , which is ρ X (S) ρ(S × Y ) for the measurable set S ⊆ X.The conditional distribution of y given x is ρ(y|x) and the regression function of ρ is Therefore, based on Proposition 1.8 in [9], μ ρ is the minimizer of ξ ( f ) and for each f : It can be concluded that μ ρ is bounded by D as Y ≤ D.
For the regression problem, we assume that the samples satisfy Assumption 1, where f ∞ is the infinite norm of f on its domain, i.e., f where v ρ (X)is the conditional variance function and ζ is a random variable with zero mean and unit variance.
The formula in Assumption 1 is a standard assumption for regression problems with heteroscedastic setting, where the conditional variance of Y is dependent on An array of random variables X l for l ∈ N + converges to a random variable X in probability is written as X l → p X , whose definition can be found from the Definition 1 in [38].
To prove the asymptotic validity of LW-JPS, the following four conditions are needed for algorithms μ and v, which were also introduced in our earlier work about the theoretical analysis of locally weighted jackknife prediction [38].In the conditions, r represents a general regression algorithm and Z l is a general random data set for training r, whose samples are i.i.d.. r Z l is the learned regressor whose randomness is from Z l and r z l is the corresponding realization.
Condition 1.The regression algorithm r is symmetric in the observations, such that for each l, each z l and each permutation π of {1, • • • , l}, there holds Condition 2. The regressor r Z l uniformly converges in probability to the regression function μ ρ of Z, i.e., Condition 3. The regression algorithm r is a uniformly stable algorithm [8], whose uniform stability with respect to the square loss is β β(l), i.e., for each land each z l , where lim l→∞ β(l) 0.
Condition 4.For two fixed data sets z l {(x j , y j ), j 1, With the same mathematical skills in [38], we need the algorithm μ to satisfy Condition 1, 2, and 3 and v to satisfy Condition 1, 2 and 4 to prove the asymptotic validity of LW-JPS.The conditions are not too restrict for applications, which we have analyzed in section 3.3 of [38].

Asymptotic validity of LW-JPS
We introduce Lemma 1 to guarantee that v Z l is a consistent estimator for the conditional variance function in Algorithm 2, which has been proved in [38].
Lemma 1 With Assumption 1 being hold, μ satisfying Condition 2 and 3, and v satisfying Condition 2 and 4, we have We will prove in Theorem 1 that Algorithm 2 is asymptotically valid by showing that the corresponding predictive distribution Q z l , x 0 (y) satisfies which is an asymptotic version of formula (1).To do so, we need to prove that where q is the α quantile of Q z l , x 0 (y).Formula ( 7) is equivalent to where z l is the normalized residual defined by Denote the CDF of z l by F z l (b), i.e., and q (α) is the α quantile of F(b) in Assumption 1.Since Lemma 1 confirms that the estimator v z l uniformly converges to v ρ in probability and μ satisfying Condition 2, we can make the connection between z l and the normalized noise term of Assumption 1, which is and prove in Lemma 2 that Z l and q (α) are highly related as we show in Lemma 2 that q (α) Building on Lemma 2, formula (8) and formula (6) can be proved in turn and the conclusion of LW-JPS being asymptotically valid can be drawn in Theorem 1.
The analysis techniques in Lemma 2 was first introduced in [28] for linear regression problems with homoscedastic errors, which was further improved for nonlinear regression problems with heteroscedastic errors by our earlier work for locally weighted jackknife prediction [38].The above two works both concerns building interval prediction other than probabilistic prediction, which makes the detailed expressions different from this work.In addition, our work about LOO-CCPS-RELM [37] only considers nonlinear regression problems with homoscedastic errors, and its proofs are specific to extreme learning machine.Therefore, we introduce and prove Lemma 2, which is essential to proving Theorem 1 strictly in this paper.
and q (α) and for each l we can define a nonempty set B(l) as where g(l) is nonnegative and converges to 0 sufficiently slow.Then, we can construct an array of random variables z l by taking an arbitrary z l in B(l).As z l ∈ B(l), v min > 0 and g(l) converges to 0, there exists a l 1 , such that for all l > l 1 , there holds For all l > l 1 , by the definitions, we have ) , which guarantees that Since convergence in probability implies convergence in distribution and the CDF of ζ 0 is continuous, according to Proposition 1.16 of [26], we have The arbitrarily chosen z l from B(l) leads to which implies that formula ( 9) is correct [38].
Next, we prove formula (10).Since for every > 0, we have Thus, we need to show that P q (α) 123 whose distance from F(b) can be bounded by From formula (9) and the definition of leave-one-out samples, the bounded random variable sup b∈ R converges to 0 in probability.This leads to Let the CDF of the normalized leave-one-out residuals a l, i , i 1, • • • , l be denoted by F al (b).Therefore, F A l (b) and q (α) Z l are the corresponding random function and random variable by introducing the randomness of Z l .Define J l, i 1 {Al,i >q (α) + } , which is the indicator function of A l, i > q (α) + .As algorithms μ and v being exchangeable implies that J l, j , j 1, • • • , l are exchangeable, based on the property of quantile function [29], we have Since formula (11) holds, it follows that which implies that F l q (α) + > 0 for sufficiently large l.Thus, it follows from Markov's inequality that for sufficiently large l, the probability, where var and cov are the variance and covariance function, respectively.Therefore, to prove P q (α) Z l > q (α) + approaches 0, we need to prove cov J l, 1 , J l, 2 converges to 0 as l → ∞.
Based on the formula above and Eq. ( 12), we have Similarly, we can also prove that Thus, since the fact that P q (α) < q (α) − .and the two limit equations above hold, we have The following two theorems describe the statistical compatibility of the predictive distributions output by LW-JPS with observations in the asymptotic setting.Theorem 1 proves the asymptotic version of formula (1) and Theorem 2 proves a sufficient condition of the asymptotic version of formula (2), where quantiles can be set arbitrarily.

Theorem 1 Fix α ∈ (0, 1). If Assumption 1holds, μ satisfying Condition 1, 2 and 3, and vsatisfying Condition 1, 2 and 4, we have
Proof Based on Assumption 1, we have F q (α)  α.Therefore, From Lemma 2 and F(b) being continuous, we have F q (α) Z l − F q (α) → p 0 using Theorem 1.10 in [26] and sup b∈ R → p 0. Thus, we can conclude that which is equivalent to since for every α ∈ (0, 1), there holds For every such that 0 < < max{α, 1 − α}, by the definition of quantiles, we have and Based on formula (15), for every δ > 0, we have which combing formula (17) lead to Similarly, with formula (18), there holds Then, we have Since and δ are arbitrary, the conclusion of Theorem 1 can be drawn.
Based on the deduction of Theorem 1, we can obtain the following coverage guarantee for derived prediction intervals from Q z l , x 0 , which is desirable for practitioners for interval prediction.

Experiments
In this section, to test LW-JPS empirically, randomized kernel ridge regression with random Fourier features [21] is used as μ and k-nearest neighbor regression is used as v, respectively, since they satisfy the conditions we assumed in "Asymptotic analysis of locally weighted jackknife predictive system".Following [38], the number of random features were set to 1000 and k √ l for k-nearest neighbor regression.The ridge parameter with the least leave-one-out errors was chosen for LW-JPS.The comparison predictive systems are SPCS with support vector regression (SCPS-SVR), SCPS with random forests (SCPS-RF), CCPS with support vector regression (CCPS-SVR), CCPS with random forests (CCPS-RF) and CPS with random forests with outof-bag errors as conformity scores (OOB-CPS-RF).All the comparison algorithms employ formula (5) as the conformity measure based on the recently empirical evaluation research in [40].SCPS-SVR, SCPS-RF, CCPS-SVR and CCPS-RF use the same normalization for conformity measure as LW-JPS, whereas OOB-CPS-RF uses the standard deviation of out-of-bag predictions for normalization based on the approach in [40].OOB-CPS-RF was first proposed in [40], which extends the idea of the state-of-the-art conformal regressor with random forests [7].Following [37], for all SCPSs, 40 percent of the training data was used as calibration set and for all CCPSs, the number of folds was 5.In addition, the meta-parameters of all comparison algorithms were chosen using threefold cross-validation on the training set based on R 2 scores.SVR with Gaussian kernel was employed, whose regularization parameter C was chosen from 10 −5 , 10 −4 , • • • , 10 4 , 10 5 .For random forests, the number of trees was chosen from {100, 300, 500, 1000} and the minimum number of samples per tree leaf was chosen from {1, 3, 5}, respectively.The experiments were conducted on 20 public data sets, which are from Delve [22], KEEL [4] and UCI [5] repositories whose detailed information is summarized in Table 1.The features and labels were all normalized to [0, 1] with min-max normalization.Tenfold cross-validation was used to test the algorithms, i.e., each data set was randomly split into tenfolds, where each fold was used to evaluate the algorithms trained from the other ninefolds and the mean of ten results for each algorithm was reported.All the algorithms in this section were coded with python based on numpy and scikit-learn library and the experimental results were collected from the computer with 3.5 GHz CPU and 32 GB RAM.

Test the validity of LW-JPS
This section tests whether LW-JPS is a valid predictive system by the definition of formula (1).To do so, the values of the CDF of LW-JPS on the test data were collected and the frequency of the values being not more than α was calculated, whose results are shown in Table 2 with mean representing the mean value of each column.Table 2  the frequencies are compatible with corresponding α, which empirically proves the validity of LW-JPS.

demonstrates that
As we analyze in "Conformal predictive systems and locally weighted jackknife predictive system", the validity property of formula (1) implies the coverage guarantee by formula (2), which will be shown in the next experiment.

Comparison with the other CPSs
This section compares the performance of LW-JPS with SCP-S-SVR, SCPS-RF, CCPS-SVR, CCPS-RF and OOB-CP-S-RF.To compare the quality of the predictive distributions, the widely used continuous ranked probability score (CRPS) are employed whose definition can be found in [34].The lower the CRPS is, the better the predictive distribution is.The barplots of the mean of continuous ranked probability scores for different data sets are shown in Fig. 1, which demonstrates that LW-JPS performs better in most cases.Table 3 records the mean CRPS of all algorithms, with the least one of each data set shown in bold.For each data set, the rank of an algorithm is obtained and the mean rank in Table 3 is the mean value of all ranks for each algorithm.From Table 3, we can see that the LW-JPS performs better than the other predictive systems, which indicates the effectiveness of LW-JPS.
We also test the derived prediction intervals from the predictive distributions of all predictive systems.For a significance levelη, which is the expected coverage rate preset by practitioners, the derived prediction interval is based on formula (2) with the help of η/2 and 1 − η/2 quantiles.Two indicators are employed to describe the quality of prediction intervals.One is the prediction error rate, which is the frequency of the true label being out of the prediction intervals.The other is the average interval size, which measures the information efficiency of the prediction intervals.The smaller the average interval size, the more information the prediction intervals contain.We set the significance levels as 0.2, 0.1 and 0.05 and show the experimental results in Tables 4, 5 and 6 for error rates and in Tables 7, 8 and 9 for average interval sizes.We also summarize the error rates, the means and mean ranks of average interval sizes in Figs. 2, 3,  and 4.
From Tables 4, 5 and 6, we can see that all predictive systems are empirically valid for the data sets, which also empirically proves the coverage guarantee of LW-JPS.Besides, it is shown in Tables 7, 8 and 9 that prediction intervals of LW-JPS are more informationally efficient than those of the other algorithms, which is demonstrated in Figs. 3 and  4. The box plots of average interval size are also shown in  Bold indicates the mean CRPS of all algorithms, with the least one of each data set shown in bold Fig. 5, which also demonstrates that JPS performs better than other CPSs.We also conducted Wilcoxon test [10] to answer the question of whether LW-JPS performs better than other comparison algorithms significantly.Table 10 demonstrates the p values of the experimental results about CRPS and average interval sizes with η ∈ {0.2, 0.1, 0.05} and the bold values are less than 0.05, which shows the significant differences.From Table 10, we can see that LW-JPS significantly performs better than SCPS-SVR, SCPS-RF, CCPS-SVR and CCPS-RF, and the differences between LW-JPS and OOB-CPS-RF are not significant in most cases.Since OOB-CPS-RF represents the state-of-the-art process using conformal approach for regression problems, the statistical tests confirm the effectiveness of LW-JPS for probabilistic prediction.
For training speed, all of the algorithms are computationally efficient versions of CPSs and the mean values of  In summary, the experimental results in this section not only verifies the empirical validity of LW-JPS, but also shows its better performance than the other comparison algorithms, which indicates the effectiveness and efficiency of LW-JPS for probabilistic prediction.

Conclusion
This paper proposes a predictive system based on the idea of jackknife prediction, which is inspired by the leave-one-out cross-conformal predictive system.The proposed LW-JPS can transform any regression algorithm for point prediction to probabilistic prediction, which can describe the uncertainty of test labels.The asymptotic validity of LW-JPS is proved with some regularity assumptions and conditions.Based on the analysis, the empirical testing of LW-JPS with randomized kernel ridge regression and k-nearest neighbor regression was conducted.The empirical validity of LW-JPS was demonstrated in the experiments and its performance for probabilistic prediction compared favourably with the other comparison algorithms, which demonstrates the effectiveness and efficiency of LW-JPS for probabilistic prediction.
Although our method is empirically valid and shows better performance when compared with other comparison CPSs, we only employ two representative regression algorithms satisfying the related conditions in this paper.Therefore, future work about empirical studies with a wider range of regression algorithms needs to be done.Moreover, the approach of LW-JPS we proposed in this paper cannot be built on deep learning models efficiently for complex learning problems, such as image segmentation or image-to-image regression problems, since in those cases, there are no efficient ways to compute leave-one-out predictions on training data.Thus, future work about approximately computing leave-one-out predictions for deep neural networks is worth exploring, in order to make the jackknife prediction approach more tractable for complex problems.

Fig. 1
Fig. 1 Mean of continuous ranked probability scores for different algorithms trained on different data sets

Fig. 2 Fig. 3
Fig. 2 Mean of prediction error rates of the prediction intervals derived from the predictive

Fig. 4
Fig. 4 Mean rank of average interval sizes of the prediction intervals derived from the predictive distributions

Fig. 5
Fig. 5 Box plots of average interval sizes of the prediction intervals derived from the predictive distributions ) being the proper training set and z j | j ∈ o i the calibration set.The corresponding conformity scores are

Table 1
Data sets

Table 2
Validity test of LW-JPS

Table 3
The mean CRPS of all

Table 4
Error rate (η 0.2) Bold indicates the mean CRPS of all algorithms, with the least one of each data set shown in bold