Computer simulation of the difference between Lasso and Lars

In order to correct the error that Efron et al pointed out that the modified Lars is a fast algorithm for lasso problem, computer simulation is carried out with data. The simulation results show that when a variable is removed first and then entered in the lasso problem, the variables selected by lasso and Lars cannot be the same. At this time, no matter how to modify the size of the variables selected by Lars, the lasso problem cannot be solved. The computer simulation method is used to correct the errors of Efron et al in this paper, and contribute to development of world data computing.