Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization
원문 초록
In this paper, we propose a strategy to construct a multi-objective optimization algorithm from a single-objective optimization algorithm by using the B\'ezier simplex model. Also, we extend the stability of optimization algorithms in the sense of Probability Approximately Correct (PAC) learning and define the PAC stability. We prove that it leads to an upper bound on the generalization with high probability. Furthermore, we show that multi-objective optimization algorithms derived from a gradient descent-based single-objective optimization algorithm are PAC stable. We conducted numerical experiments and demonstrated that our method achieved lower generalization errors than the existing multi-objective optimization algorithm.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Lean Formalization of Generalization Error Bound by Rademacher Complexity
Prospective Learning: Learning for a Dynamic Future
Optimistic Rates for Learning from Label Proportions
Towards a theory of model distillation
SAT-Based PAC Learning of Description Logic Concepts
Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.