ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “RL algorithms”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.AIcs.ROEmpiricalRecentOct 23, 2026

RobustRLlib: A Unified Library and Benchmark for Robust Reinforcement Learning Algorithms

Xi Chen, Fengqi Hu, Zeyu Shen, Jiaying Xu +4 more

The paper introduces RobustRLlib, a library and benchmark for robust reinforcement learning that improves reusability and provides an empirical capability map of current robust RL algorithms.

View →
cs.LGcs.AIRecentMay 29, 2026

When are LLMs Sufficient Policy Optimizers for Sequential RL Tasks?

Stephane Hatgis-Kessell, Emma Brunskill

The paper introduces Prompted Policy Optimization (PromptPO), an LLM-based method that successfully optimizes policies for various sequential RL tasks, demonstrating that LLMs can replace classical RL…

View →
cs.LGcs.CLEmpiricalRecentJul 1, 2026

Is One Layer Enough? Training A Single Transformer Layer Can Match Full-Parameter RL Training

Zijian Zhang, Rizhen Hu, Athanasios Glentis, Dawei Li +3 more

This paper studies the distribution of reinforcement learning (RL) adaptation across transformer layers in large language models and finds that training a single layer can recover most of the gains ob…

View →
cs.ROeess.SYEmpiricalRecentJul 27, 2026

Continual-RL for Generalization in Autonomous Racing on the RoboRacer Platform

Joel Siegert, Edoardo Ghignone, Michele Magno

This paper proposes a continual RL framework based on Continual Backpropagation for autonomous racing, able to train a generalistic policy on a set of tracks and fine-tune it within 15 minutes to outp…

View →
eess.SPTheoreticalRecentSep 18, 2026

The Impact of the Cauchy Interlace Theorem on the Convergence of the RLS Algorithm

Hans Georg Brachtendorf

This paper analyzes the convergence of the RLS algorithm using the Cauchy Interlace Theorem and presents an improved initialization method.

View →
cs.AIRecentMay 27, 2026

Efficient Post-training of LLMs for Code Generation With Offline Reinforcement Learning

Mingze Wu, Abhinav Anand, Shweta Verma, Mira Mezini

This paper proposes using offline reinforcement learning (RL) as an efficient alternative to online RL for post-training code-generating LLMs, demonstrating its effectiveness, especially for smaller m…

View →
cs.CLcs.SERecentMay 29, 2026

Combinatorial Synthesis: Scaling Code RLVR via Atomic Decomposition and Recombination

Jiasheng Zheng, Boxi Cao, Boxi Yu, Yuzhong Zhang +5 more

The paper introduces Atomic Decomposition and Recombination (ADR), a novel framework that generates genuinely novel and challenging verifiable code tasks, significantly improving the scalability of Re…

View →
cs.NEcs.AIcs.LGEmpiricalRecentJun 10, 2026

Mathematical perspective on genetic algorithms with optimization guided operators

Anna Brandenberger, Ilan Doron-Arad, Elchanan Mossel

This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.

View →
math.OCcs.DSTheoreticalRecentJun 10, 2026

On finding exact solutions of linear programs in the oracle model

Daniel Dadush, László A. Végh, Giacomo Zambelli

The paper presents an algorithm for solving linear programming problems in the oracle model with improved time complexity.

View →
math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

View →
cs.DSTheoreticalRecentAug 4, 2026

Bottleneck Paths Reduce to Deterministic Graphical Games: A Correction to a Claimed Linear-Time Algorithm

Egor Gorbachev

This paper provides a counterexample to a claimed linear-time comparison-based algorithm for solving deterministic graphical games (DGGs) and gives a deterministic linear-time reduction from the direc…

View →
cs.PLmath.OCTheoreticalRecentJun 9, 2026

Max-Policy Iteration, Revisited

David Monniaux, Helmut Seidl

This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.

View →
cs.NEEmpiricalRecentJul 24, 2026

On the Runtime Analysis of Reinforcement Learning Hyper-Heuristics

Pietro S. Oliveto, Zhenyu Wang, Peizhou Wu, Mengqing Xu

This paper rigorously proves that a Reinforcement Learning Hyper-heuristic (RLHH) optimizes the LeadingOnes benchmark function with optimal expected runtime using two random local search operators, ou…

View →
cs.CVcs.AIRecentMay 28, 2026

Reinforcement Learning with Robust Rubric Rewards

Ya-Qi Yu, Hao Wang, Fangyu Hong, Xiangyang Qu +14 more

The paper introduces $ ext{RLR}^3$, a novel framework that extends verifiable rewards in Reinforcement Learning to handle partially verifiable, multi-criteria vision-language tasks by integrating robu…

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
cs.DScs.LGTheoreticalRecentJun 17, 2026

Learning Augmented Exact Exponential Algorithms

Tatiana Belova, Yuriy Dementiev, Danil Sagunov

The paper proposes a general approach to augmenting exact exponential-time algorithms for NP-hard problems using machine-learned predictions.

View →