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,742 papers · 148 categories

Trend · papers per month

2725448151,087 · Jun 202019922001200920172026
48 results for Group Relative Policy Optimization

GRPO optimizes LLMs with verifiable rewards, amplifying policy success.

problem Improving LLMs' reasoning under verifiable binary rewards.
method Introduces GRPO, analyzes variants of reward normalization and regularization.
result GRPO amplifies policy success, converging to a fixed point exceeding the reference.

Improved text-to-image and multimodal understanding through adaptive generation order optimization.

problem Determining optimal generation sequences in text-to-image synthesis and multimodal understanding.
method Introduced a learnable control module trained via Group Relative Policy Optimization (GRPO) to determine the generation order.
result Learning the control block substantially improves text-to-image alignment and multimodal understanding in DLMs.

CoDistill-GRPO improves small models in GRPO by distilling knowledge from a larger model.

problem Small models in GRPO struggle with sparse rewards on difficult tasks.
method Simultaneously trains a large and small model using co-distillation and GRPO objectives.
result Significant improvement in small model performance over standard GRPO on mathematical benchmarks.

A fair policy for hiring candidates from different groups is proposed in a linear contextual bandit problem.

problem Selecting candidates from different sensitive groups in a fair manner.
method A greedy policy that constructs a ridge regression estimate and computes relative rank using empirical cumulative distribution function.
result The greedy policy achieves fair pseudo-regret of order dT\sqrt{dT} after TT rounds, satisfying demographic parity.

SAGE enhances reinforcement learning by injecting hints to prevent model stagnation.

problem Sparse rewards cause large language models to stall under relative policy optimization.
method SAGE injects privileged hints during training to increase within-group outcome diversity.
result SAGE consistently outperforms GRPO on 6 benchmarks with LLMs, achieving significant improvements.

Reinforcement Patching optimizes dynamic sequence patching for efficient time series forecasting.

problem Efficiently learning data-adaptive representations for long-horizon sequence data, especially continuous sequences.
method Reinforcement Patching (ReinPatch) uses reinforcement learning to optimize dynamic patching policies and sequence backbones.
result ReinPatch achieves compelling performance in time-series forecasting compared to state-of-the-art methods.

The paper tackles fair sharing of exploration costs across groups in online learning.

problem Sharing the cost of exploration fairly across multiple groups in online learning.
method The paper introduces the 'grouped' bandit model and uses axiomatic bargaining theory, specifically the Nash bargaining solution, to formalize fairness.
result The paper derives policies that are optimally fair and regret-optimal, showing that regret-optimal policies can be unfair.

SPO optimizes LLMs by eliminating group-based baselines and variance issues.

problem Frequent degenerate groups and synchronization barriers in group-based policy optimization methods.
method Single-stream Policy Optimization (SPO) replaces per-group baselines with a persistent, KL-adaptive value tracker and global advantage normalization.
result SPO converges more smoothly and attains higher accuracy than GRPO, improving maj@32 by +3.4 pp across five math benchmarks.

SFPO optimizes LLM reasoning by repositioning before updating, improving stability and efficiency.

problem Noisy gradients from low-quality rollouts cause instability and inefficient exploration in on-policy RL algorithms.
method Decomposes each step into three stages: a short fast trajectory, repositioning, and slow correction, preserving the objective and rollout process unchanged.
result SFPO consistently improves stability, reduces rollouts, and accelerates convergence, outperforming GRPO on math reasoning benchmarks.

Develops a new model to predict training dynamics of large language models.

problem Lack of mechanistic understanding of training dynamics in large language models.
method A first-principles reduced-order model of training dynamics, predicting group-size invariance and stability thresholds.
result Closed-form model predicts training dynamics with high accuracy and provides new diagnostics.

Study minimax off-policy evaluation in multi-armed bandits with known and unknown behavior policies.

problem Evaluate policies in multi-armed bandits with unknown behavior policies.
method Develop minimax rate-optimal procedures for known and unknown behavior policies, including the Switch estimator and Chebyshev polynomial-based estimator.
result Plug-in estimator achieves optimal competitive ratio up to a logarithmic factor when behavior policy is unknown.

Extends reinforcement learning alignment to scalar rewards, improving math reasoning.

problem Designing reinforcement learning algorithms for general LLM alignment.
method Introduces f-GRPO and f-HAL, estimating f-divergences between reward-aligned and unaligned distributions.
result Improves math reasoning RLVR tasks and mitigates reward hacking.

DFL framework improves action and outcome fairness in policy learning.

problem Fairness in policy learning, especially action and outcome fairness.
method Integrates action and outcome fairness into a multi-objective optimization problem using a lexicographic weighted Tchebyshev method.
result DFL framework improves both action and outcome fairness with minimal value reduction.

ADPO optimizes relative advantage in reinforcement learning from human feedback.

problem Optimizing policy alignment in reinforcement learning from human preferences.
method ADPO explicitly parameterizes the optimal structure through anchored logits, decoupling response quality from prior popularity.
result Empirically, ADPO achieves state-of-the-art performance on reasoning tasks, outperforming GRPO by 30.9 percent.

This work extends ME-RL using diffusion models to sample optimal policies.

problem Sampling from the optimal policy trajectory distribution in ME-RL.
method Introducing Diffusion-Augmented Markov Decision Processes (DA-MDPs) to minimize reverse KL divergence.
result DA-MDPs enable seamless integration into various ME-RL methods and outperform baselines.

Active-GRPO improves molecular optimization by actively deciding when to imitate or self-improve.

problem Training robust and efficient molecular optimization models with large language models.
method Active-GRPO combines imitation and reinforcement learning, upgrading references and policies dynamically.
result Improves molecular optimization performance, achieving statistically significant gains.

Develops an anytime-valid framework for optimal policy identification from logged contextual bandit data.

problem Selecting the optimal policy from a candidate policy class while monitoring evidence continuously.
method Constructs a time-indexed set that retains the true optimal policy set uniformly over time.
result The procedure allows the analyst to monitor policy values, eliminate clearly suboptimal policies, and stop at data-dependent times without invalidating inference.

Study uses causal machine learning to assess coupon campaign impact on retailer sales.

problem Assessing the causal effect of a coupon campaign on retailer sales.
method Causal machine learning algorithms, subgroup analysis, optimal policy learning.
result Only two coupon categories (drugstore and other food) have a significant positive impact on sales.

Investigates optimal pension policies in PAYG systems with forward utility and ageing population.

problem Optimal investment and pension policies in PAYG systems with sustainability and adequacy constraints.
method Non-zero volatility forward CRRA utilities, closed-form optimal policies, detailed numerical analysis.
result Characterization of optimal policies and detailed impact analysis under various scenarios.

A new approach optimizes weights in DLP for better risk-adjusted performance.

problem Optimizing time-varying weights in Double Linear Policy (DLP) for better risk-adjusted performance.
method Stochastic Model Predictive Control (SMPC) framework to maximize risk-adjusted returns while enforcing constraints.
result Empirical results show improved risk-adjusted performance and drawdown control.

Success conditioning optimizes policies by imitating successful trajectories, solving a trust-region optimization problem.

problem Improving policies through random actions that lead to desired outcomes.
method Success conditioning, which involves collecting and updating policies based on successful trajectories.
result Success conditioning solves a trust-region optimization problem, maximizing policy improvement with a χ2χ^2 divergence constraint.

Unified framework for risk-aware policy learning in contextual bandits.

problem Optimizing decision rules in high-stakes domains with adverse outcomes.
method Distributional framework for Lipschitz-continuous risk functionals, with novel empirical concentration inequalities.
result Data-dependent suboptimality bounds with an ildeO(1/n) ilde{\mathcal{O}}(1/\sqrt{n}) rate, matching risk-neutral offline policy optimization.

Three training methods for language models are shown to be variations of one another.

problem Training language models to reason effectively using different methods.
method Three training methods: GRPO, Dr. GRPO, and DAPO.
result All three methods adjust a single number: standard deviation, measuring disagreement in answers.

The Exploration-Exploitation tradeoff arises in Reinforcement Learning when one cannot tell if a policy is optimal. Then, there is a constant need to explore new actions instead of exploiting past experience. In practice, it is common to resolve the tradeoff by using a fixed exploration mechanism, such as εε-greedy ex…

2018-12-13abs ↗pdf ↗

Policy gradient methods with aggregated states can achieve better performance than approximate policy iteration.

problem Approximation errors in policy and value function approximations.
method State-aggregated representations and policy gradient methods.
result Policy gradient methods can achieve a per-period regret bounded by ε, while approximate policy iteration and value iteration have a higher regret.

Methods for learning to search for structured prediction typically imitate a reference policy, with existing theoretical guarantees demonstrating low regret compared to that reference. This is unsatisfactory in many applications where the reference policy is suboptimal and the goal of learning is to improve upon it. Ca…

2015-02-08abs ↗pdf ↗

GOPO optimizes large models in Hilbert space, avoiding Kullback-Leibler's curvature.

problem Optimizing large language models with Kullback-Leibler divergence's curvature issues.
method GOPO uses Hilbert space L2(pi_k) with orthogonality constraints and a work-dissipation functional.
result GOPO achieves competitive generalization with stable gradient dynamics and entropy preservation.

This paper uses NLDT to find interpretable control rules from complex DRL policies.

problem Complex, non-interpretable policies from black-box AI methods.
method Evolutionary optimization of NLDT for hierarchical control rules.
result Interpretable control rules with similar performance to black-box DRL.

We consider a market consisting of one safe and one risky asset, which offer constant investment opportunities. Taking into account both proportional transaction costs and linear price impact, we derive optimal rebalancing policies for representative investors with constant relative risk aversion and a long horizon.

2014-02-21abs ↗pdf ↗

An investor with constant relative risk aversion trades a safe and several risky assets with constant investment opportunities. For a small fixed transaction cost, levied on each trade regardless of its size, we explicitly determine the leading-order corrections to the frictionless value function and optimal policy.

2013-06-12abs ↗pdf ↗

POTEC tackles off-policy learning in large action spaces, improving effectiveness.

problem Existing OPL methods fail in large discrete action spaces due to bias or variance issues.
method Two-stage algorithm: cluster selection via policy-based approach, action selection via regression-based approach.
result POTEC provides substantial improvements in off-policy learning effectiveness, especially in large and structured action spaces.