Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

0111 · Nov 201719922001200920172026
7 results for PRMs

Paper analyzes impact of PRM on binary random variables and distribution shifts.

problem Impact of performative risk minimization on binary random variables and distribution shifts.
method Formulated two measures of impact, derived explicit formulas for full information, and provided estimators for partial information.
result PRM can have amplified side effects compared to methods that do not model data shift.

Efficient RL in PRMs with improved regret bound.

problem Reinforcement learning in probabilistic reward machines with non-Markovian rewards.
method Design of an algorithm with a new regret bound of O~(HOAT+H2O2A3/2+HT)\widetilde{O}(\sqrt{HOAT} + H^2O^2A^{3/2} + H\sqrt{T}).
result Improved regret bound over existing methods, matching lower bound up to a logarithmic factor.

Calibrated PRMs improve inference efficiency for LLMs by dynamically adjusting compute budgets.

problem Poor calibration of PRMs leads to overestimation of success probabilities in partial reasoning steps.
method Quantile regression for calibration, instance-adaptive scaling (IAS) framework.
result Calibrated PRMs reduce inference costs while maintaining accuracy, especially on confident problems.

Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.

problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.