SearcharxivSearch

arXiv subjects

Siye Wu

Publications and source records attributed to Siye Wu.

At least 19 recordsLinked to original sources

Consolidating RLVR Capabilities Across Domains: A Deep Dive into Fusion Paradigms

Reinforcement learning with verifiable rewards (RLVR) improves specific capabilities of large language models, but covering multiple capabilities often involves training separate domain experts and subsequently consolidating them. We organize three fusion paradigms by the artefacts they reuse: Merge combines expert task vectors, Mix RL pools their datasets, and multi-teacher on-policy distillation (MOPD) uses both. Because they have largely been studied in isolation, how they compare and how to choose among them remain unclear. We compare all three using shared experts and data across model scales and a multi-domain benchmark suite. Although their average performance differs by at most 1.4 points, the gap reaches 8.6 points on a single benchmark, with domain-level variation tracking cross-domain relations visible in task-vector geometry. Training dynamics expose distinct constraints: Mix RL depends on domain mixture proportions, MOPD remains bounded by its teachers, and Merge compresses all expert updates into one. All three improve single-sample accuracy without measurable gains in solution coverage or losses in held-out capabilities. These results yield a practical guideline: use Merge when experts already exist and cheap fusion is paramount; Mix RL when training a unified model without experts, with domain proportions adjusted for cross-domain transfer; and MOPD when preserving domain-specific gains matters more than surpassing teachers or minimizing end-to-end cost.

cs.CL

From AI Assistant to AI Scientist: Autonomous Discovery of LLM-RL Algorithms with LLM Agents

Discovering improved policy optimization algorithms for language models remains a costly manual process requiring repeated mechanism-level modification and validation. Unlike simple combinatorial code search, this problem requires searching over algorithmic mechanisms tightly coupled with training dynamics while reusing empirical evidence across iterations. We propose POISE, a closed-loop framework for automated discovery of policy optimization algorithms for language models. POISE maintains a structured, genealogically linked archive linking proposals, executable implementations, standardized evaluations, and natural-language reflections to support evidence-driven iteration. In mathematical reasoning experiments starting from GRPO, POISE evaluates 64 candidate algorithms and discovers improved mechanisms, including analytic-variance scaling and validity masking. The best variant improves weighted Overall from 47.8 to 52.5 (+4.6) and increases AIME25 pass@32 from 26.7% to 43.3%, demonstrating the feasibility of automated policy optimization discovery while supporting interpretable design principles.

cs.CL

CODA: Difficulty-Aware Compute Allocation for Adaptive Reasoning

The emergence of large reasoning models demonstrates that scaling inference-time compute significantly enhances performance on complex tasks. However, it often falls into another trap: overthinking simple problems, where repetitive rationales yield minimal accuracy gains at a disproportionately high cost. This motivates adaptive reasoning: dynamically aligning reasoning depth with instance difficulty. In this paper, we study adaptive reasoning from an optimality perspective, formalizing it as a utility maximization problem where tokens are allocated until the marginal accuracy gain falls below the incremental cost. Based on this, we propose CODA (Compute Allocation by Difficulty Awareness), a method that operationalizes this principle by allocating tokens via a policy-internal difficulty signal. Specifically, CODA estimates difficulty via group-based rollouts and maps it to two non-negative gates that modulate a length-dependent shaping term on top of the binary base reward. The easy-side gate penalizes verbosity on simple instances, whereas the hard-side gate encourages more deliberative rollouts on challenging ones. Across model scales and benchmarks, CODA achieves adaptive reasoning without external annotations or user-provided budgets: on easy tasks, CODA reduces token costs by over 60% while maintaining strong accuracy, whereas on hard tasks it incentivizes more deliberative rollouts to maximize performance.

cs.CL

On a new filtration of the variational bicomplex

We define a filtration on the variational bicomplex according to jet order. The filtration is preserved by the interior Euler operator, which is not a module homomorphism with respect to the ring of smooth functions on the jet space. However, the induced maps on the graded components of this filtration are. Furthermore, the space of functional forms in the image of the interior Euler operator inherits a filtration. Though the filtered subspaces are not submodules either, the graded components are isomorphic to linear spaces which do have module structures. This works for any fixed degree of the functional forms. In this way, the condition that a functional form vanishes can be stated concisely with a module basis. We work out explicitly two examples: one for functional forms of degree two in relation to the Helmholtz conditions and the other of arbitrary degree but with jet order one.

math.DG

ARM: Adaptive Reasoning Model

While large reasoning models demonstrate strong performance on complex tasks, they lack the ability to adjust reasoning token usage based on task difficulty. This often leads to the "overthinking" problem -- excessive and unnecessary reasoning -- which, although potentially mitigated by human intervention to control the token budget, still fundamentally contradicts the goal of achieving fully autonomous AI. In this work, we propose Adaptive Reasoning Model (ARM), a reasoning model capable of adaptively selecting appropriate reasoning formats based on the task at hand. These formats include three efficient ones -- Direct Answer, Short CoT, and Code -- as well as a more elaborate format, Long CoT. To train ARM, we introduce Ada-GRPO, an adaptation of Group Relative Policy Optimization (GRPO), which addresses the format collapse issue in traditional GRPO. Ada-GRPO enables ARM to achieve high token efficiency, reducing tokens by an average of 30%, and up to 70%, while maintaining performance comparable to the model that relies solely on Long CoT. Furthermore, not only does it improve inference efficiency through reduced token generation, but it also brings a 2x speedup in training. In addition to the default Adaptive Mode, ARM supports two additional reasoning modes: 1) Instruction-Guided Mode, which allows users to explicitly specify the reasoning format via special tokens -- ideal when the appropriate format is known for a batch of tasks. 2) Consensus-Guided Mode, which aggregates the outputs of the three efficient formats and resorts to Long CoT in case of disagreement, prioritizing performance with higher token usage.

cs.CL

BRST Noether Theorem and Corner Charge Bracket

We provide a proof of the BRST Noether 1.5th theorem, conjectured in [JHEP 10 (2024) 055], for a broad class of rank-1 BV theories including supergravity and 2-form gauge theories. The theorem asserts that the BRST Noether current of any BRST invariant gauge fixed Lagrangian decomposes on-shell into a sum of a BRST-exact term and a corner term that defines Noether charges. This extends the holographic consequences of Noether's second theorem to gauge fixed theories and, in particular, offers a universal gauge independent Lagrangian derivation of the invariance of the S-matrix under asymptotic symmetries. Furthermore, we show that these corner Noether charges are inherently non-integrable. To address this non-integrability, we introduce a novel charge bracket that accounts for potential symplectic flux and anomalies, providing an honest canonical representation of the asymptotic symmetry algebra. We also highlight a general origin of a BRST cocycle associated with asymptotic symmetries.

hep-th

How Easily do Irrelevant Inputs Skew the Responses of Large Language Models?

By leveraging the retrieval of information from external knowledge databases, Large Language Models (LLMs) exhibit enhanced capabilities for accomplishing many knowledge-intensive tasks. However, due to the inherent flaws of current retrieval systems, there might exist irrelevant information within those retrieving top-ranked passages. In this work, we present a comprehensive investigation into the robustness of LLMs to different types of irrelevant information under various conditions. We initially introduce a framework to construct high-quality irrelevant information that ranges from semantically unrelated, partially related, and related to questions. Furthermore, our analysis demonstrates that the constructed irrelevant information not only scores highly on similarity metrics, being highly retrieved by existing systems, but also bears semantic connections to the context. Our investigation reveals that current LLMs still face challenges in discriminating highly semantically related information and can be easily distracted by these irrelevant yet misleading content. Besides, we also find that current solutions for handling irrelevant information have limitations in improving the robustness of LLMs to such distractions. All the resources are available on GitHub at https://github.com/Di-viner/LLM-Robustness-to-Irrelevant-Information.

cs.CL

From Persona to Personalization: A Survey on Role-Playing Language Agents

Recent advancements in large language models (LLMs) have significantly boosted the rise of Role-Playing Language Agents (RPLAs), i.e., specialized AI systems designed to simulate assigned personas. By harnessing multiple advanced abilities of LLMs, including in-context learning, instruction following, and social intelligence, RPLAs achieve a remarkable sense of human likeness and vivid role-playing performance. RPLAs can mimic a wide range of personas, ranging from historical figures and fictional characters to real-life individuals. Consequently, they have catalyzed numerous AI applications, such as emotional companions, interactive video games, personalized assistants and copilots, and digital clones. In this paper, we conduct a comprehensive survey of this field, illustrating the evolution and recent progress in RPLAs integrating with cutting-edge LLM technologies. We categorize personas into three types: 1) Demographic Persona, which leverages statistical stereotypes; 2) Character Persona, focused on well-established figures; and 3) Individualized Persona, customized through ongoing user interactions for personalized services. We begin by presenting a comprehensive overview of current methodologies for RPLAs, followed by the details for each persona type, covering corresponding data sourcing, agent construction, and evaluation. Afterward, we discuss the fundamental risks, existing limitations, and future prospects of RPLAs. Additionally, we provide a brief review of RPLAs in AI applications, which reflects practical user demands that shape and drive RPLA research. Through this work, we aim to establish a clear taxonomy of RPLA research and applications, and facilitate future research in this critical and ever-evolving field, and pave the way for a future where humans and RPLAs coexist in harmony.

cs.CL

Quantisation of a Family of Phase Spaces

We explain that when quantising phase spaces with varying symplectic structures, the bundle of quantum Hilbert spaces over the parameter space has a natural unitary connection. We then focus on symplectic vector spaces and their fermionic counterparts. After reviewing how the quantum Hilbert space depends on physical parameters such as the Hamiltonian and unphysical parameters such as choices of polarisations, we study the connection, curvature and phases of the Hilbert space bundle when the phase space structure itself varies. We apply the results to the two-sphere family of symplectic structures on a hyper-Kähler vector space and to their fermionic analogue, and conclude with possible generalisations.

math-ph

Second Order Langevin Equation and Definition of Quantum Gravity By Stochastic Quantisation

Euclidean quantum gravity might be defined by stochastic quantisation that is governed by a higher order Langevin equation rather than a first order stochastic equation. In a transitory phase where the Lorentz time cannot be defined, the parameter that orders the evolution of quantum gravity phenomena is the stochastic time. This changes the definition of causality in the period of primordial cosmology. The prediction of stochastically quantised gravity is that there will a transition from an oscillating quantum phase to a semi-classical one, when the Lorentz time emerges. The end of the transition, as it can be observed from now and described by inflation models, is a diluted Universe, following the inflation phenomenological evolution. It is filled at the beginning with scattered classical primordial black holes. The smallest ones will quickly decay in matter, with a standard quantum field theory evolution till our period. The stable heavier black holes will remain, forming a good fraction of the dark matter and the large black holes observed in the galaxies. In a theoretically related way, this framework suggests the possibility of a gravitational parton content for "point-like" particles, in the same five dimensional quantum field theory context as in the primordial cosmology, with a (+----) signature for the 5d metrics. The very precise and explicit result expressed in this paper is actually far more modest than its motivation. We compute explicitly the meaning of a second order Langevin equation in zero dimensions and define precisely what is second order stochastic quantisation in a soluble case.

hep-th

The multi-degree of coverings on Lie groups

We associate to each covering map of simple Lie groups a sequence of integers, called the multi-degree of the covering; extend Schubert calculus to evaluate the invariant; and apply the results to solve two outstanding topological problems arising from the studies of the Wess-Zumino-Witten models and the topological Gauge theories. The main tool in our approach is the Chow rings of Lie groups, introduced by Grothendieck in 1958.

math.AT

Weyl Symmetry in Stochastic Quantum Gravity

We propose that the gauge principle of d-dimensional Euclidean quantum gravity is Weyl invariance in its stochastic (d+1)-dimensional bulk. Observables are defined as depending only on conformal classes of d-dimensional metrics. We work with the second order stochastic quantization of Einstein equations in a (d+1)-dimensional bulk. There, the evolution is governed by the stochastic time, which foliates the bulk into Euclidean d-dimensional leaves. The internal metric of each leaf can be parametrized by its unimodular part and conformal factor. Additional bulk metric components are the ADM stochastic lapse and a stochastic shift. The Langevin equation determines the acceleration of the leaf as the sum of a quantum noise, a drift force proportional to Einstein equations and a viscous first order force. Using Weyl covariant decomposition, this Langevin equation splits into irreducible stochastic equations, one for the unimodular part of the metric and one for its conformal factor. For the first order Langevin equation, the unphysical fields are the conformal factor, which is a classical spectator, and the stochastic lapse and shift. These fields can be gauge-fixed in a BRST invariant way in function of the initial data of the process. One gets observables that are covariant with respect to internal reparametrization in each leaf, and invariant under arbitrary reparametrization of the stochastic time. The interpretation of physical observable at finite stochastic time is encoded in a transitory (d+1)-dimensional phase where the Lorentz time cannot be defined. The latter emerges in the infinite stochastic time limit by an abrupt phase transition from quantum to classical gravity.

hep-th

Representations of fermionic star product algebras and the projectively flat connection

We construct a family of fermionic star products generalising the fermionic Moyal product. The parameter space contains the polarisations necessary to define a quantum Hilbert space. We find a star product of fermionic functions on sections of the pre-quantum line bundle and show that the star product of any function on a quantum state remain a quantum state. Associativity implies a representation of the fermionic star product algebra on the quantum Hilbert space. The star product is compatible with both the flat connection on the bundle of fermionic functions and the projectively flat connection on the bundle of Hilbert spaces over the space of polarisations.

math-ph

Testing S-duality with non-orientable surfaces

Kapustin and Witten showed that a twisted version of N=4 gauge theory in four dimensions compactifies to a two-dimensional sigma-model whose target space is the Hitchin moduli space. In this talk, I consider the reduction of the gauge theory on a four dimensional orientable spacetime manifold which is not a global product of two surfaces but contains embedded non-orientable surfaces. The low energy theory is a sigma-model on a two dimensional worldsheet whose boundary components end on branes constructed from the Hitchin moduli space associated to a non-orientable surface. I will also compare the discrete topological fluxes in four and two dimensional theories and verify the mirror symmetry on branes as predicted by the S-duality in gauge theory. This provides another non-trivial test of $S$-duality using reduction along possibly non-orientable surfaces. Finally, I consider the quantisation of the Hitchin moduli space from a non-orientable surface as an example of quantisation via branes and mirror symmetry.

hep-th

Non-orientable surfaces and electric-magnetic duality

We consider the reduction along two compact directions of a twisted N=4 gauge theory on a 4-dimensional orientable manifold which is not a global product of two surfaces but contains a non-orientable surface. The low energy theory is a sigma-model on a 2-dimensional worldsheet with a boundary which lives on branes constructed from the Hitchin moduli space of the non-orientable surface. We modify 't Hooft's notion of discrete electric and magnetic fluxes in gauge theory due to the breaking of discrete symmetry and we match these fluxes with the homotopy classes of maps in sigma-model. We verify the mirror symmetry of branes as predicted by S-duality in gauge theory.

hep-th

Hitchin's equations on a nonorientable manifold

We define Hitchin's moduli space for a principal bundle $P$, whose structure group is a compact semisimple Lie group $K$, over a compact non-orientable Riemannian manifold $M$. We use the Donaldson-Corlette correspondence, which identifies Hitchin's moduli space with the moduli space of flat $K^\mathbb{C}$-connections, which remains valid when M is non-orientable. This enables us to study Hitchin's moduli space both by gauge theoretical methods and algebraically by using representation varieties. If the orientable double cover $\tilde{M}$ of $M$ is a Kähler manifold with odd complex dimension and if the Kähler form is odd under the non-trivial deck transformation on $\tilde{M}$, Hitchin's moduli space of the pull-back bundle $\tilde{P}$ over $\tilde{M}$ has a hyper-Kähler structure and admits an involution induced by the deck transformation. The fixed-point set is symplectic or Lagrangian with respect to various symplectic structures on Hitchin's moduli space over $\tilde{M}$. We show that there is a local diffeomorphism from Hitchin's moduli space over (the nonorientable manifold) $M$ to the fixed point set of the Hitchin's moduli space over (its orientable double cover) $\tilde{M}$. We compare the gauge theoretical constructions with the algebraic approach using representation varieties.

math.DG

Conditions of smoothness of moduli spaces of flat connections and of character varieties

We use gauge theoretic and algebraic methods to examine sufficient conditions for smooth points on the moduli space of flat connections on a compact manifold and on the character variety of a finitely generated and presented group. We give a complete proof of the slice theorem for the action of the group of gauge transformations on the space of flat connections. Consequently, the slice is smooth if the second cohomology of the manifold with coefficients in the semisimple part of the adjoint bundle vanishes. On the other hand, we find that the smoothness of the slice for the character variety of a finitely generated and presented group depends not only on the second group cohomology but also on the relation module of the presentation. However, when there is a single relator or if there is no relation among the relators in the presentation, our condition reduces to the minimality of the second group cohomology. This is also verified using Fox calculus. Finally, we compare the conditions of smoothness in the two approaches.

math.DG

Topology and Flux of T-Dual Manifolds with Circle Actions

We present an explicit formula for the topology and H-flux of the T-dual of a general type II compactification, significantly generalizing earlier results. Our results apply to T-dualities with respect to any circle action on spacetime. As before, T-duality exchanges type IIA and type IIB string theories. A new consequence is that the T-dual spacetime is a singular space when the fixed point set is non-empty; the singularities correspond to Kaluza-Klein monopoles. We propose that the Ramond-Ramond charges of type II string theories on the singular dual are classified by twisted equivariant cohomology groups. We also include the K-theory approach.

hep-th