SearcharxivSearch

arXiv subjects

Weizhen Han

Publications and source records attributed to Weizhen Han.

2 recordsLinked to original sources

Explicit Formulas for $\mu$-Bases of Planar Rational Quartic Curves

The $\mu$-basis is an algebraic tool originating from the theory of moving curves and moving surfaces, and it is widely used in the study of rational curves and surfaces. In this paper, we give the explicit formulas for the $\mu$-basis of planar quartic rational parametric curves based on redefined vector polynomials, and several illustrative examples are provided. Meanwhile, we also discuss the corresponding cases for quadratic and cubic curves.

math.AG

CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space

Hybrid action space, which combines discrete choices and continuous parameters, is prevalent in domains such as robot control and game AI. However, efficiently modeling and optimizing hybrid discrete-continuous action space remains a fundamental challenge, mainly due to limited policy expressiveness and poor scalability in high-dimensional settings. To address this challenge, we view the hybrid action space problem as a fully cooperative game and propose a \textbf{Cooperative Hybrid Diffusion Policies (CHDP)} framework to solve it. CHDP employs two cooperative agents that leverage a discrete and a continuous diffusion policy, respectively. The continuous policy is conditioned on the discrete action's representation, explicitly modeling the dependency between them. This cooperative design allows the diffusion policies to leverage their expressiveness to capture complex distributions in their respective action spaces. To mitigate the update conflicts arising from simultaneous policy updates in this cooperative setting, we employ a sequential update scheme that fosters co-adaptation. Moreover, to improve scalability when learning in high-dimensional discrete action space, we construct a codebook that embeds the action space into a low-dimensional latent space. This mapping enables the discrete policy to learn in a compact, structured space. Finally, we design a Q-function-based guidance mechanism to align the codebook's embeddings with the discrete policy's representation during training. On challenging hybrid action benchmarks, CHDP outperforms the state-of-the-art method by up to $19.3\%$ in success rate.

cs.AI