Methods › Reinforcement Learning › Policy Gradient Methods › TayPO

Taylor Expansion Policy Optimization

TayPO

1 paper tagged archive 2025-07-28

Introduced by Yunhao Tang et al. in Taylor Expansion Policy Optimization

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

TayPO, or Taylor Expansion Policy Optimization, refers to a set of algorithms that apply the k-th order Taylor expansions for policy optimization. This generalizes prior work, including TRPO as a special case. It can be thought of unifying ideas from trust-region policy optimization and off-policy corrections. Taylor expansions share high-level similarities with both trust region policy search and off-policy corrections. To get high-level intuitions of such similarities, consider a simple 1D example of Taylor expansions. Given a sufficiently smooth real-valued function on the real line f : ℝ →ℝ, the k-th order Taylor expansion of f(x) at x₀ is

fₖ(x) = f(x₀)+∑ᵏᵢ₌₁[f⁽ⁱ⁾(x₀)/i!](x−x₀)ⁱ

where f⁽ⁱ⁾(x₀) are the i-th order derivatives at x₀. First, a common feature shared by Taylor expansions and trust-region policy search is the inherent notion of a trust region constraint. Indeed, in order for convergence to take place, a trust-region constraint is required |x − x₀| < R(f, x₀)¹. Second, when using the truncation as an approximation to the original function f_K(x) ≈f(x), Taylor expansions satisfy the requirement of off-policy evaluations: evaluate target policy with behavior data. Indeed, to evaluate the truncation f_K(x) at any x (target policy), we only require the behavior policy "data" at x₀ (i.e., derivatives f⁽ⁱ⁾(x₀)).

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 1 · with a code link: 0 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 1 tagged papers has a Syntology run on record

Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

4 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Off-policy evaluation1
Reinforcement Learning1
Reinforcement Learning (RL)1
reinforcement-learning1

Usage over time archive 2025-07-28

Papers per year tagged with TayPO: 2020 to 2020, peak 1 1 0 2020: 1 paper 2020
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Policy Gradient Methods

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections