Robustness enhancement and feature selection are the two crucial issues to be resolved in robust palmprint recognition. However, existing regression-based methods are insufficient to handle outliers and select significant features. From a statistical viewpoint, we present a general framework to intrinsically resolve the two issues. By investigating the role of outliers in the formation of coding errors, we devise a double-Laplacian mixture-error model to faithfully fit the error distribution. Additionally, we design a supervised group-sparse regularizer to enforce the locality and group sparsity of the codes. Integrating the two parts into the framework produces a nonconvex constrained problem, for which we develop an iteratively reweighted <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${l} _{ {1}}$ </tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${l} _{{1}}$ </tex-math></inline-formula> minimization algorithm by combining the majorization-minimization strategy and the alternating direction method of multipliers. The weighted vector learned from the error model and the local group sparsity enforced by the regularizer enable our method to better handle outliers and select more significant features than the state-of-the-art methods. Extensive experimental results verify the flexibility and robustness of our method to various contaminations.