Online convex optimization for cumulative constraints
원문 초록
We propose the algorithms for online convex optimization which lead to cumulative squared constraint violations of the form $\sum\limits_{t=1}^T\big([g(x_t)]_+\big)^2=O(T^{1-\beta})$, where $\beta\in(0,1)$. Previous literature has focused on long-term constraints of the form $\sum\limits_{t=1}^Tg(x_t)$. There, strictly feasible solutions can cancel out the effects of violated constraints. In contrast, the new form heavily penalizes large constraint violations and cancellation effects cannot occur. Furthermore, useful bounds on the single step constraint violation $[g(x_t)]_+$ are derived. For convex objectives, our regret bounds generalize existing bounds, and for strongly convex objectives we give improved regret bounds. In numerical experiments, we show that our algorithm closely follows the constraint boundary leading to low cumulative violation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Writing-RL: Advancing Long-form Writing via Adaptive Curriculum Reinforcement Learning
SuperWriter: Reflection-Driven Long-Form Generation with Large Language Models
How Does Response Length Affect Long-Form Factuality
MedScore: Factuality Evaluation of Free-Form Medical Answers
Frankentext: Stitching random text fragments into long-form narratives
Teaching Large Language Models to Maintain Contextual Faithfulness via Synthetic Tasks and Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.