The CC chair was present at this year's International Conference on Parallel Architectures and Compilation Techniques (PACT), one of the top venues for compilers for parallel architectures. At PACT, Andres presented PolyGym: Polyhedral Optimizations as an Environment for Reinforcement Learning, a joint work with Alex that defines loop optimizations in the polyhedral framework as a problem that can be solved with machine learning methods. The work also highlights the challenges of the current heuristics and presents a search space that contains significantly better-performing loop variants. We are looking forward to improved polyhedral schedule heuristics in follow-up work!