Searcharxiv⌕ Search

arXiv subjects

Li Guo

Publications and source records attributed to Li Guo.

At least 19 recordsLinked to original sources

Induced quadratic structures of operated algebras with applications to multi-Novikov algebras

We formulate binary-quadratic induced structures for unary--binary operads by taking the arity-three part of the kernel of the substitution map for chosen induced binary operations. Our purpose is to identify all universal relations in this quadratic class; we make no claim that they generate the full kernel in every arity. For commutative associative algebras equipped with families of derivations, we determine these quadratic relations explicitly. In the noncommuting-derivation case they give the noncommuting multi-Novikov operad; imposing commutation of the derivations yields exactly the additional relations of the multi-Novikov operad. The one-derivation specialization recovers the usual Novikov operad. The calculations are self-contained at arity three and display how operator identities control induced binary-quadratic structures.

math.CT↗

A unified approach to Manin triples of Lie algebras and the corresponding bialgebra structures

We introduce self-module Lie bialgebras as a common framework for bialgebra structures associated with different types of Manin triples of Lie algebras. A self-module Lie algebra is a Lie algebra with a specified representation on its underlying vector space; equivalently, it is an NS-Lie algebra expressed in different notation. We define a generic Manin triple as a finite-dimensional Lie algebra equipped with a nondegenerate bilinear form and two complementary isotropic Lie subalgebras, and establish the equivalence among standard generic Manin triples, suitable matched pairs of Lie algebras, families of matched pairs of self-module Lie algebras and self-module Lie bialgebras. The framework recovers Lie, pre-Lie and anti-pre-Lie bialgebras as special cases and admits examples outside these three families. We also introduce the self-module Lie Yang-Baxter equation and show that its solutions yield self-module Lie bialgebras and admit the $\mathcal{O}$-operator characterization. Finally, we obtain solutions in semi-direct product self-module Lie algebras, including constructions arising from self-bimodule pre-Lie algebras.

math.RA↗

Anti-successors and anti-replicators, Manin products and Koszul duality

We develop an operadic theory of anti-splitting and anti-replicating for binary operads. For a binary operad $\opd$, we define its anti-bisuccessor $\ABSu(\opd)$ and anti-trisuccessor $\ATSu(\opd)$. Each generating operation is recovered as the negative sum of two or three split operations, yielding canonical operad morphisms $\opd\to\ABSu(\opd)$ and $\opd\to\ATSu(\opd)$. For binary quadratic operads, these constructions are described by Manin black products: \[ \ABSu(\opd)\cong\antiprelie\bullet\opd, \qquad \ATSu(\opd)\cong\antipostlie\bullet\opd. \] Dually, we also introduce the canonical quadratic anti-duplicator and anti-triplicator, together with their combinatorial counterparts defined by labeled planar binary trees. We show that they coincide precisely under a full-support condition. As applications, we obtain anti-dupli-com and anti-dupli-Lie algebras. We also display an example in which the two constructions differ. Furthermore, we establish the Koszul duality relations \[ \widehat{\ADup}(\opd^!) \cong\ABSu(\opd)^!, \qquad \widehat{\ATrip}(\opd^!) \cong\ATSu(\opd)^!, \] providing an effective description of the canonical quadratic anti-duplicator in terms of the Manin white product. The framework recovers known constructions, including anti-dendriform, anti-pre-Lie and anti-pre-Poisson algebras, and produces further examples and Koszul dual pairs.

math.RA↗

Tracking High-Frequency Trading Activity in China and Its Effects on Market Quality

We develop a new order-level proxy for high-frequency trading (HFT) activity based on precise order placement and study its effects on market quality. With quotes updating multiple times per second, millisecond-level order-book access makes high-frequency traders more likely to submit active exact-match orders, defined as limit orders priced exactly at the prevailing best opposite-side quote. Using Shenzhen Stock Exchange data, we validate the proxy: active exact-match orders respond faster to quote updates, cancel more rapidly, concentrate when depth imbalance is favorable and spreads are narrow, and predict mid-quote returns from 100 milliseconds through ten minutes. A difference-in-differences design exploiting cross-channel variation in order dissemination latency at the market open shows that lower latency increases active exact-match shares. This variation yields plausibly causal evidence that latency-induced HFT raises short-horizon price variation, wide-spread incidence, and adverse-selection exposure, while realized spreads decline and pricing error falls modestly. Unlike developed markets, China's T+1 constraint, absence of maker-taker rebates, and limits on rapid quote revision tilt speed advantages toward directional liquidity taking, highlighting how market design shapes the channel through which speed affects market quality.

q-fin.TR↗

Nijenhuis pre-Lie bialgebras, Nijenhuis Lie bialgebras and \sss-equation

We develop a bialgebraic framework for Nijenhuis operators on pre-Lie algebras and coalgebras. Starting from dual triangular pre-Lie bialgebras and weak pseudo-Hessian structures, we construct Nijenhuis operators on pre-Lie algebras and establish the corresponding coalgebraic construction. We introduce Nijenhuis pre-Lie bialgebras, characterize them through matched pairs, and identify compatibility conditions linking the two constructions. For triangular structures, we formulate the $S$-Nijenhuis $\mathbb{S}$-equation, give an operator characterization, and obtain constructions using relative Rota-Baxter operators. We also show that balanced Nijenhuis pre-Lie bialgebras give rise to Nijenhuis Lie bialgebras. Finally, we introduce crossed modules and braided Nijenhuis pre-Lie bialgebras, and characterize when compatible algebraic and coalgebraic data assemble into a Nijenhuis pre-Lie biproduct. These results connect Nijenhuis operators with pre-Lie bialgebra structures, Yang-Baxter-type equations, and constructions on representations.

math.QA↗

A Hopf Algebraic Theory of the Quantum Magnusian

We develop a Hopf-algebraic theory of graph coefficients arising in the quantum Magnus expansion. At the classical level, the expansion is governed by directed trees, whereas its quantum counterpart involves loop graphs, multiple edges, and several types of edge data. We introduce a contraction Hopf algebra of mixed quivers containing these diagrams and closed under contraction. On this algebra we define a character $e$ from normalized linear-extension data, directed-tadpole factors, and a prescription for undirected edges, and let $ω$ be its convolution inverse. Our main result is a universal closed formula for the connected function $ω_c$ on every finite mixed quiver, expressed as a finite sum over ordered set partitions of the vertices. We also construct a weighted vertex-splitting Hopf structure on the unlocalized mixed-quiver algebra, with convolution $\star_V$ and canonical edge-weight character $ζ_V$, such that $ω_c=\log_{\star_V}ζ_V$. Compatibility of the two coproducts and an explicit identity between their characters explain this equality. We further prove that the two-vertex contraction identity, tadpole factorization, vanishing on disconnected graphs, and boundary data uniquely determine $ω_c$. For acyclic quivers, the formula reduces to a permutation formula with coefficients depending only on descent numbers. We derive this formula independently from the quantum Magnus expansion using operator products and Wick contractions, showing that the physical graph coefficients are governed by the convolution structure of the contraction Hopf algebra. Further consequences include a refined quantum Murua formula and orientation-sum identities related to Tutte and chromatic polynomials.

math.CO↗

G$^3$VLA: Geometric Inductive Bias for Vision-Language-Action Models

Vision-language-action (VLA) models have rapidly advanced generalist robot manipulation by harnessing the semantic knowledge of pretrained vision-language backbones. However, their visual representations are typically grounded in 2D image coordinates rather than calibrated camera geometry. This limitation is especially pronounced in multi-camera systems, where views are coupled by known intrinsics and extrinsics but processed as independent images. We propose G$^3$VLA, a camera-aware geometric module that injects calibrated structure into the visual-token stream of a pretrained VLA without altering its action space or original action-learning objective. G$^3$VLA combines intrinsic-conditioned ray embeddings, projective positional encoding (PRoPE), and bidirectional cross-view fusion to establish geometrically consistent representations across camera views. Geometric supervision is provided by ground-truth point maps or confidence-gated $π^3$X teacher predictions, enabling training without depth sensors or manual geometric annotations. On $π_0$, G$^3$VLA consistently improves performance on LIBERO and RoboCasa24 under both supervision regimes, while ground-truth supervision improves five-task RoboTwin2.0 averages with three cameras. Experiments on camera-shifted LIBERO-Goal and real robots demonstrate improved robustness to unseen camera viewpoints. Controlled calibration studies across $π_0$ and $π_{0.5}$ show that these gains depend on correct camera geometry while remaining stable under mild calibration perturbations. These results demonstrate that grounding VLA visual tokens in calibrated camera geometry provides a simple and general mechanism for improving geometric consistency, multi-view reasoning, and viewpoint robustness in pretrained robot policies.

cs.RO↗

Monoidal structure on Rota-Baxter algebras via augmentation, and free cocycle bialgebras

A tensor product is known for commutative Rota--Baxter algebras through a universal construction, but its underlying algebra need not be the ordinary tensor product $A\otimes B$ and can be substantially larger. We show that, after passing to augmented Rota--Baxter algebras, the ordinary tensor product itself carries a natural Rota--Baxter operator which makes the category monoidal with the usual associator and unit constraints. The resulting structure is intrinsically nonsymmetric: over a field of characteristic zero, this operator and its flip-conjugated counterpart are the only possibilities among linear combinations of five natural terms, while over any field the full category admits no braiding. Its comonoid objects are precisely Rota--Baxter cocycle bialgebras. Moreover, the free Rota--Baxter adjunction yields a bimonad and free cocycle bialgebras on ordinary bialgebras, with compatible Hopf structures for connected filtered inputs, in both the associative and commutative settings.

math.CT↗

Decoder-Side Semantic Conditioning for Low-Bitrate Neural Speech Compression

Speech codecs are usually optimized for waveform fidelity, allocating bits to acoustic detail that can be inferred from linguistic structure. This leads to inefficient compression and degraded recognition performance. We propose SemDAC, a semantic-aware neural speech codec that adds hierarchical semantic conditioning to residual vector quantization (RVQ). The first RVQ quantizer is distilled from HuBERT features to produce semantic tokens capturing phonetic content, while later quantizers encode residual acoustics. The decoder is conditioned on semantic tokens via feature-wise linear modulation (FiLM), steering reconstruction toward information not explained by semantic abstraction. At 0.95 kbps, SemDAC matches or surpasses a 2.5 kbps DAC baseline on PESQ, STOI, SI-SNR, and Whisper WER, with comparable ViSQOL, and achieves higher subjective MOS than higher-bitrate DAC baselines. Results show that explicit semantic conditioning, rather than token disentanglement or increased model size alone, improves compression efficiency and recognition robustness.

cs.SD↗

REVA-PO: Stabilizing Reinforcement Learning for Chest X-ray Report Generation

Automated chest X-ray report generation has recently benefited from reinforcement learning (RL) and large language models. However, RL training often suffers from instability or limited exploration due to fixed Kullback-Leibler (KL) regularization and a static reference policy that accumulates KL pressure over time. We propose Response-Weighted and Validation-Anchored Policy Optimization (REVA-PO), a RL framework that stabilizes long-term training via Response-Weighted Regularization (RER) and Validation-Anchored Policy Reset (VAPR). RER dynamically adjusts per-response KL weights based on advantage and reference-policy entropy, relaxing constraints for high-quality responses while tightening them for low-quality ones. Complementarily, VAPR periodically synchronizes the reference and current policies to the best validation checkpoint, resetting accumulated regularization pressure to expand the viable exploration space. To ensure a robust starting point, we employ a three-stage pipeline consisting of warm-up training, classifier-guided supervised fine-tuning, and RL. Extensive evaluations on MIMIC-CXR and IU-Xray demonstrate that REVA-PO sets new state-of-the-art benchmarks in both linguistic quality and clinical accuracy. Notably, BLEU-4 improves by 5.1% on MIMIC-CXR and 3.6% on IU-Xray, while CheXpert F1 and RadGraph F1 scores increase by 4.5% and 12.8%, respectively, over prior leading methods. The code is publicly available at https://github.com/LiGuo12/REVA_PO/.

cs.CV↗

AdaptVPR: Route-Aware Hard Positive Generation for Robust Visual Place Recognition

Visual Place Recognition (VPR) localizes a query image by retrieving database images of the same or nearby place, yet its robustness is often degraded by domain shifts arising from illumination, weather, seasonal changes, and dynamic occlusions. One contributing factor is the limited appearance diversity of the same place in existing training data. To address this issue, we propose AdaptVPR, a route-aware generative augmentation framework that constructs same-place hard positives for robust VPR training. AdaptVPR first uses a vision language model to parse scene attributes and estimate editing feasibility, while a rule-based scheduler determines the generation route according to editability scores and risk constraints. The generation process is decomposed into three complementary routes: the Global Appearance Route introduces global scene changes in weather, illumination, and time of day; the Local Occlusion Route inserts plausible dynamic occluders; and the Dual Route combines both types of perturbations to produce more challenging appearance shifts. Each generated candidate is evaluated using a VPR-oriented verification scheme based on geometric consistency and appearance diversity, reducing the risk of structural drift while ensuring sufficient appearance variation. Global candidates are generated once and rejected if verification fails, while Local Occlusion and Dual candidates use verification feedback for limited prompt refinement and regeneration. Using this framework, we construct AdaptCities, containing 160K verified synthetic same-place hard positives. Experiments across multiple VPR baselines and vision foundation backbones show consistent gains on standard benchmarks and substantial improvements under challenging domain shifts, with R@1 gains of up to 9.2%. The source code and data resources are publicly available at https://github.com/chenshunpeng/AdaptVPR.

cs.CV↗

The Diagrammar of Quantum Magnusian

The logarithm of the time-evolution operator has been termed Magnusian, on account of the fact that its expansion describes the Magnus series. The diagrammatic expansion and computation of the classical Magnusian have been completely established in terms of tree graphs and their Hopf algebra. Recent works initiated extensions into quantum field theory, revealing general structures of loop expansions while finding intriguing relations between different diagrams. In this work, we advance the loop expansion further by providing an efficient diagrammatic algorithm to calculate the weight factor of each graph in the quantum Magnusian, known as the Murua coefficient. This is achieved by incorporating two complementary perspectives on the Magnusian at the same time: the color basis and the black-and-white basis. We extract the Murua coefficients from the Magnus series by utilizing these two bases while implementing an exponentiated Wick contraction. In turn, we identify the loop-level extension of Murua's recursive formula. Eventually, we establish a set of edge-contraction rules which facilitate a direct recursive computation of the Murua coefficients at the purely diagrammatic level, without referencing or directly manipulating the underlying Magnus expansion. This shows that the matrix elements of the quantum Magnusian can be computed from graph manipulations alone.

hep-th↗

Coordinating Treatment Allocation and Recommendation

We study a model in which a sender allocates limited treatment to agents with heterogeneous quality and later recommends selected agents to a receiver, seeking to maximize the number of agents accepted by the receiver. All agents value treatment, which improves agents' quality, but treatment must be allocated before the sender observes agents' initial quality; recommendation occurs only after quality is learned. A natural benchmark is to design the two instruments separately: allocate treatment randomly first, and then recommend agents from the top down afterward. Our main result shows that the sender can do strictly better by coordinating treatment allocation with recommendations. In the optimal joint mechanism, treatment is non-monotone in quality: an intermediate group has a lower treatment probability than both higher- and lower-quality agents, but is compensated with a guaranteed recommendation when treatment is realized. We provide an implementation through contracts that induce self-selection and discuss applications to education, industrial policy, and startup incubation.

econ.TH↗

SAGE: Spatial-visual Adaptive Graph Exploration for Efficient Visual Place Recognition

Visual Place Recognition (VPR) requires robust retrieval of geotagged images despite large appearance, viewpoint, and environmental variation. Prior methods focus on descriptor fine-tuning or fixed sampling strategies yet neglect the dynamic interplay between spatial context and visual similarity during training. We present SAGE (Spatial-visual Adaptive Graph Exploration), a unified training pipeline that enhances granular spatial-visual discrimination by jointly improving local feature aggregation, organize samples during training, and hard sample mining. We introduce a lightweight Soft Probing module that learns residual weights from training data for patch descriptors before bilinear aggregation, boosting distinctive local cues. During training we reconstruct an online geo-visual graph that fuses geographic proximity and current visual similarity so that candidate neighborhoods reflect the evolving embedding landscape. To concentrate learning on the most informative place neighborhoods, we seed clusters from high-affinity anchors and iteratively expand them with a greedy weighted clique expansion sampler. Implemented with a frozen DINOv2 backbone and parameter-efficient fine-tuning, SAGE achieves SOTA across eight benchmarks. Notably, our method obtains 100% Recall@10 on SPED only using 4096D global descriptors. The code and model are available at https://github.com/chenshunpeng/SAGE.

cs.CV↗

ICBCBench: An Industry Consortium Benchmark for Financial Deep Research

With the rapid advancement of Deep Research Agents in knowledge-intensive domains such as finance, establishing reliable and domain-aligned evaluation standards remains a critical challenge. Existing benchmarks focus on either closed-ended question answering or open-ended report evaluation, failing to jointly capture retrieval-reasoning accuracy and end-to-end research quality required in real-world workflows. We introduce ICBCBench, a consortium-driven benchmark for financial deep research, developed in collaboration with domain experts from a broad range of financial institutions and academia, involving over 50 experts across more than 40 organizations. It adopts a dual-track paradigm integrating objective tasks with verifiable answers and subjective long-form report evaluation, enabling complementary assessment of retrieval-reasoning accuracy and end-to-end report quality in terms of expert alignment, citation consistency, and source quality. Experiments on state-of-the-art DRAs and large language models reveal substantial gaps in complex reasoning, factual grounding, and report quality, highlighting the challenges of achieving industry-level performance. Our dataset and evaluation framework are available at https://github.com/DeepFin-Intelligence/ICBCBench.

cs.CE↗

WorldCup Sampling for Multi-bit LLM Watermarking

As large language models (LLMs) generate increasingly human-like text, watermarking has emerged as a promising solution for reliable attribution beyond mere detection. While multi-bit watermarking enables richer provenance encoding, existing approaches typically extend zero-bit watermarking schemes by introducing static logit perturbations and counting-based decoding strategies, which can degrade text quality and compromise decoding robustness as the payload increases. In this paper, we propose WorldCup, a multi-bit watermarking framework for LLMs that models the sampling process as a structured communication channel and embeds message bits through a hierarchical competition mechanism guided by complementary signals. Moreover, WorldCup incorporates entropy-aware modulation to preserve generation quality and enables robust message recovery via confidence-aware decoding that accounts for token-level reliability. Comprehensive experiments demonstrate that WorldCup achieves a strong balance across message capacity, detectability, robustness, text quality, and decoding efficiency, consistently outperforming prior baselines. We believe that this work establishes a scalable and principled foundation for future research on multi-bit watermarking in LLMs.

cs.CL↗

DualGuard: Dual-stream Large Language Model Watermarking Defense against Paraphrase and Spoofing Attack

With the rapid development of cloud-based services, large language models have become increasingly accessible through various web platforms. However, this accessibility has also led to growing risks of model abuse. LLM watermarking has emerged as an effective approach to mitigate such misuse and protect intellectual property. Existing watermarking algorithms, however, primarily focus on defending against paraphrase attacks while overlooking piggyback spoofing attacks, which can inject harmful content, compromise watermark reliability, and undermine trust in attribution. To address this limitation, we propose DualGuard, the first watermarking algorithm capable of defending against both paraphrase and spoofing attacks. DualGuard employs the adaptive dual-stream watermarking mechanism, in which two complementary watermark signals are dynamically injected based on the semantic content. This design enables DualGuard not only to detect but also to trace spoofing attacks, thereby ensuring reliable and trustworthy watermark detection. Extensive experiments conducted across multiple datasets and language models demonstrate that DualGuard achieves excellent detectability, robustness, traceability, and text quality, effectively advancing the state of LLM watermarking for real-world applications.

cs.CR↗

Region Matters: Efficient and Reliable Region-Aware Visual Place Recognition

Visual Place Recognition (VPR) determines a query image's geographic location by matching it against geotagged databases. However, existing methods struggle with perceptual aliasing caused by irrelevant regions and inefficient re-ranking due to rigid candidate scheduling. To address these issues, we introduce FoL++, a method combining robust discriminative region modeling with adaptive re-ranking. Specifically, we propose a Reliability Estimation Branch to generate spatial reliability maps that explicitly model occlusion resistance. This representation is further optimized by two spatial alignment losses (SAL and SCEL) to effectively align features and highlight salient regions. For weakly supervised learning without manual annotations, a pseudo-correspondence strategy generates dense local feature supervision directly from aggregation clusters. Our Adaptive Candidate Scheduler dynamically resizes candidate pools based on global similarity. By weighting local matches by reliability and adaptively fusing global and local evidence, FoL++ surpasses traditional independent matching systems. Extensive experiments across seven benchmarks demonstrate that FoL++ achieves state-of-the-art performance with a lightweight memory footprint, improving inference speed by 40% over FoL. Code and models will be released (and merged with FoL) at https://github.com/chenshunpeng/FoL.

cs.CV↗