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

Pietro S. Oliveto

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Neural Computing×2AI×1Algorithms×1Optimization and Control×1

Frequent co-authors

Zhenyu Wang1×
Peizhou Wu1×
Mengqing Xu1×
Benjamin Doerr1×
John Alasdair Warwicker1×

Research Timeline

2026
Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without manual parameter tuning.

On the Runtime Analysis of Reinforcement Learning Hyper-Heuristics

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, outperforming the Generalised Random Gradient HH.

Highlighted terms show continued research focus across papers

Papers

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.NEcs.AIcs.DSRecent
May 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

View →