Back to feed
News Story
量子位
1 sources

Tsinghua AIR Proposes High-Order Action Supervision: Focusing on First-Order Temporal Information, Significant Gains with 10k Small Data

The Institute for AI Industry Research (AIR) at Tsinghua University has proposed a high-order action supervision method that additionally constrains the first-order temporal changes of actions in policy learning to address issues such as robot control jitter and overreaction in autonomous driving. The method requires no policy network redesign, covers deterministic, stochastic, and flow matching policies, and can be integrated into value learning and policy optimization in offline reinforcement learning. The paper validates its effectiveness on tasks like maze navigation, showing significant gains with 10k small data, and has been accepted to NeurIPS 2026.

SynthePulse Insight · AI deep readingMembers

One Extra Loss Term Teaches Policies the "Rate of Action Change": A Reading of Tsinghua AIR's Higher-Order Action Supervision

Version 1 · 1 source

A NeurIPS 2026 accepted paper from Tsinghua University's Institute for AI Industry Research (AIR) proposes "higher-order action supervision": without changing the policy network architecture, it adds only a first-order action constraint term to the loss, letting deterministic, Gaussian stochastic, and flow-matching policies as well as offline reinforcement learning value learning exploit local change information in continuous trajectories. The paper self-reports performance gains on the 10k small-data settings of OGBench and D4RL, and makes action changes smoother.

  • The paper is titled "Higher-Order Action Supervision Makes A Strong Policy Class," accepted at NeurIPS 2026, with authors including Peng Cheng, Yunxian Hou, Zhi Zhou, Xianyuan Zhan, and others, from Tsinghua University's Institute for AI Industry Research (AIR) and Zhenxiao Intelligence.
  • The core change is expanding the training objective from fitting only single-point action labels to simultaneously fitting the first-order change of actions over time, i.e., the rate of action change; it does not require reconstructing the policy network, only adding an extra first-order action constraint term to the original loss.
  • This idea covers three types of policies: deterministic policies, Gaussian stochastic policies, and flow-matching policies; for Gaussian policies it uses an OU process to characterize the temporal correlation of sampling perturbations, while for flow-matching policies it supervises the directional derivative of the velocity field with respect to the state.
Open section navigationThe Problem Is Not Single-Step Actions, but the Jumps Between Actions

The Problem Is Not Single-Step Actions, but the Jumps Between Actions

Mainstream imitation learning and reinforcement learning usually supervise only zero-order actions—given state s, what action a should be output. But continuous control scenarios differ: robot joint torques, vehicle steering angles, and drone thrust all evolve continuously over time, and even if adjacent actions are each reasonable, the jumps between them can still cause trajectory deviation, mechanical wear, and extra energy consumption. The paper gives an intuitive example with maze navigation: ordinary behavior cloning fits only action labels, the first-order action direction swings frequently, and the agent ultimately takes a suboptimal path; after adding higher-order action supervision, both zero-order and first-order actions become smoother, and the agent reaches the goal along a more stable path.

The first-order action here is the rate of action change, approximated in discrete data by the difference between adjacent actions. The paper's core claim is: expand the training objective from fitting only single-point action labels to simultaneously fitting the first-order change of actions over time. This change does not require reconstructing the policy network, only adding an extra first-order action constraint term to the original loss.

Why Not Just Have the Network Output an Extra First-Order Action

One simple and direct idea is to have the policy network output both the action a and the first-order action ȧ, but the paper argues this is not reasonable: the two live in different action spaces, and the added output term would not only enlarge the optimization problem but could also introduce multi-task gradient conflicts. The paper chooses another path—adding an extra first-order action constraint term without changing the original policy network framework.

Specifically, for consecutive samples (s,a,s′,a′) in offline trajectories, the authors adopt a unit time interval and write the state change and action change as ṡ=s'-s and ȧ=a'-a, respectively. After differentiating the policy π(s) along physical time, the chain rule gives the core formula: the derivative of the policy along the state trajectory direction corresponds to the first-order action. During training, one only needs to make this directional derivative close to the action difference in the data; for the most basic deterministic behavior cloning, the added term is the squared error between the policy directional derivative and the true action difference.

Free for now

Read the full analysis

5 more sections of analysis, plus the full takeaway

Loading

Credibility boundary

This article is compiled based on QbitAI's coverage of the NeurIPS 2026 accepted work from Tsinghua University's Institute for AI Industry Research (AIR). The paper title, authors, affiliations, arXiv number, method mechanism, and experimental setup are facts confirmed by the source; all specific performance improvement numbers (such as 26→61, 0→88, 2.7→82.3, etc.) are self-reported by the paper, and the source provides no third-party independent reproduction or verification, so they should be regarded as source claims rather than confirmed conclusions. The source does not explain whether the arXiv number is consistent with the conference timeline, deployment validation on real robots or industrial control systems, comparisons with more baselines or at larger data scales, the selection of the first-order supervision term weight and hyperparameter sensitivity, or the applicable boundaries on non-continuous-time or non-stationary data.

Primary report

量子位

Primary source