摘要：Approximation analysis of Pareto optimization，proposed an analysis framework，can be the best approximation algorithm，Apply to subset selection，selective ensemble problem: Pareto ensemble pruning，sparse regression problem: Pareto sparse regression，Well parallelizable algorithm，With theoretical justifications, we aim at solving learningproblems better.With increasing number of processors, the number of iterations can becontinuously reduced, eventually to a constant.
