paper-with-me

Papers

Solving a Real-World Optimization Problem Using Proximal Policy Optimization with Curriculum Learning and Reward Engineering

2024-04-03 · Abhijeet Pendyala, Asma Atamna, Tobias Glasmachers

We present a proximal policy optimization (PPO) agent trained through curriculum learning (CL) principles and meticulous reward engineering to optimize a real-world high-throughput waste sorting facility. Our work addresses the challenge of effectively balancing the competing objectives of operational safety, volume optimization, and minimizing resource usage. A vanilla agent trained from scratch on these multiple criteria fails to solve the problem due to its inherent complexities. This problem is particularly difficult due to the environment's extremely delayed rewards with long time horizons and class (or action) imbalance, with important actions being infrequent in the optimal policy. This forces the agent to anticipate long-term action consequences and prioritize rare but rewarding behaviours, creating a non-trivial reinforcement learning task. Our five-stage CL approach tackles these challenges by gradually increasing the complexity of the environmental dynamics during policy transfer while simultaneously refining the reward mechanism. This iterative and adaptable process enables the agent to learn a desired optimal policy. Results demonstrate that our approach significantly improves inference-time safety, achieving near-zero safety violations in addition to enhancing waste sorting plant efficiency.

📄 PDF Abstract BibTeX arXiv:2404.02577

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Inexact Proximal Gradient Methods for Non-convex and Non-smooth Optimization

2016-12-18 · Bin Gu, De Wang, Zhouyuan Huo, Heng Huang

In machine learning research, the proximal gradient methods are popular for solving various optimization problems with non-smooth regularization. Inexact proximal gradient methods are extremely important when exactly sol…

BIG-bench Machine Learning

Gradient Descent Methods for Regularized Optimization

2024-12-28 · Filip Nikolovski, Irena Stojkovska, Katerina Hadzi-Velkova Saneva, Zoran Hadzi-Velkov

Regularization is a widely recognized technique in mathematical optimization. It can be used to smooth out objective functions, refine the feasible solution set, or prevent overfitting in machine learning models. Due to …

Decentralized Inexact Proximal Gradient Method With Network-Independent Stepsizes for Convex Composite Optimization

2023-02-07 · Luyao Guo, Xinli Shi, Jinde Cao, ZiHao Wang

This paper proposes a novel CTA (Combine-Then-Adapt)-based decentralized algorithm for solving convex composite optimization problems over undirected and connected networks. The local loss function in these problems cont…

Asynchronous Stochastic Proximal Methods for Nonconvex Nonsmooth Optimization

2018-02-24 · Rui Zhu, Di Niu, Zongpeng Li

We study stochastic algorithms for solving nonconvex optimization problems with a convex yet possibly nonsmooth regularizer, which find wide applications in many practical machine learning applications. However, compared…

Solve Smart, Not Often: Policy Learning for Costly MILP Re-solving

2025-09-27 · Rui Ai, Hugo De Oliveira Barbalho, Sirui Li, Alexei Robsky 외 arxiv

A common challenge in real-time operations is deciding whether to re-solve an optimization problem or continue using an existing solution. While modern data platforms may collect information at high frequencies, many rea…

Reinforcement LearningChange Point Detection