We also contribute with a novel knapsack factor, along with a linear-time algorithm for the corresponding dual decomposition subproblem.
10 becomes that of minimizing the sum of the losses with a penalty for the (weighted) variance of the vectors {0, u1, u2, u3}, regularizing the difference towards their average, as in Evgeniou and Pontil (2004).