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

0111 · May 201019922001200920172026
11 results for SPG

Study compares SPG and PPO for racing games, finding SPG more stable with weighted actions.

problem Training continuous action reinforcement learning algorithms for racing games.
method Introduced novel racing environment, tested SPG and PPO with modifications and experience replay.
result Experience replay not beneficial for PPO in continuous action spaces, SPG more stable with weighted actions.

Interpolates between SPG and NeuRD with Capped Implicit Exploration.

problem Combining SPG and NeuRD for better performance in non-stationary environments.
method Introduces Capped Implicit Exploration (CIX) to interpolate between SPG and NeuRD.
result NeuRD-CIX performs well more consistently than NeuRD while retaining NeuRD's advantages.

Many problems at the intersection of combinatorics and computer science require solving for a permutation that optimally matches, ranks, or sorts some data. These problems usually have a task-specific, often non-differentiable objective function that data-driven algorithms can use as a learning signal. In this paper, w…

2018-05-18abs ↗pdf ↗

New method controls gradient error for sparse MRFs.

problem Efficient learning for sparse discrete MRFs with NP-hard inference.
method Stochastic proximal gradient (SPG) with controlled gradient approximation error.
result Novel bounds control gradient approximation quality.

New approach uses SPG for semantic communication without a known channel model.

problem Designing efficient semantic communication systems without a known channel model.
method Applying Stochastic Policy Gradient (SPG) for reinforcement learning.
result Achieves comparable performance to model-aware approaches with a decreased convergence rate.

New PG methods tackle nonconvex optimization with auto-conditioned stepsizes.

problem Optimizing nonconvex functions over convex sets.
method Auto-conditioned projected gradient (AC-PG) methods and stochastic variants.
result Achieved optimal iteration complexity for finding approximate stationary points.

We propose expected policy gradients (EPG), which unify stochastic policy gradients (SPG) and deterministic policy gradients (DPG) for reinforcement learning. Inspired by expected sarsa, EPG integrates across the action when estimating the gradient, instead of relying only on the action in the sampled trajectory. We es…

2017-06-15abs ↗pdf ↗

Sequence prediction models can be learned from example sequences with a variety of training algorithms. Maximum likelihood learning is simple and efficient, yet can suffer from compounding error at test time. Reinforcement learning such as policy gradient addresses the issue but can have prohibitively poor exploration …

2018-11-24abs ↗pdf ↗

New reinforcement learning algorithms improve policy optimization with entropy regularization.

problem Improving policy optimization in reinforcement learning.
method Soft policy gradient theorem (SPGT) and new policy optimization algorithms.
result New algorithms outperform prior works on various benchmark tasks.

We propose expected policy gradients (EPG), which unify stochastic policy gradients (SPG) and deterministic policy gradients (DPG) for reinforcement learning. Inspired by expected sarsa, EPG integrates (or sums) across actions when estimating the gradient, instead of relying only on the action in the sampled trajectory…

2018-01-10abs ↗pdf ↗