arXiv AI By Koki Takeshita, Kenji Uebayashi, Hikaru Tomonari, Masaya Tsunokake, Koichiro Yawata, Tatsuya Sasaki, Yusuke Ohtsubo, Kota Dohi, Yasuhiro Sogawa

Pareto-Optimal RTL Code Generation via Multi-Objective Reinforcement Learning with Large Language Models

Read the original on arXiv AI →

The paper introduces a reinforcement learning framework that uses large language models to generate RTL circuits while optimizing for Pareto-optimality across power, performance, and area (PPA). It proposes a generation-based training pipeline and a Hypervolume Contribution reward to improve both the quality and diversity of the entire set of generated circuits. Experiments on the RTLLM v2 benchmark show significant gains in hypervolume and diversity compared to baseline and single-objective methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 7

HLS-Seek: QoR-Aware Code Generation for High-Level Synthesis via Proxy Comparative Reward Reinforcement Learning

HLS-Seek is a natural‑language‑to‑High‑Level‑Synthesis framework that optimizes Quality of Results (QoR) such as latency and resource usage by using a comparative proxy reward model instead of full synthesis‑in‑the‑loop reinforcement learning. The system achieves high syntax and functional correctness (84.7% and 81.4% respectively) with only 7 B parameters, surpasses GPT‑5.1 on functional pass@5, and trains 8.5× faster than real‑reward RL. In QoR evaluation, HLS‑Seek attains the lowest latency on 19 of 30 kernels and Pareto‑dominates baseline HLS tools on 9 kernels.

By Qingyun Zou, Feng Yu, Hongshi Tan, Yao Chen, Bingsheng He, WengFai Wong