Searcharxiv⌕ Search

arXiv subjects

Ying Li

Publications and source records attributed to Ying Li.

At least 91 records · Page 5Linked to original sources

From Feedback Loops to Policy Updates: Reinforcement Fine-Tuning for LLM-Based Alpha Factor Discovery

Modern quantitative trading increasingly relies on systematic models to extract predictive signals from large-scale financial data, where alpha factor discovery plays a central role in transforming market observations into tradable signals. Recent LLM-based methods have shown promise in automating factor generation, but most of them still rely on prompt-level generation--evaluation--feedback loops for iterative optimization. As the loop becomes longer, repeatedly appended historical candidates and feedback can cause context explosion, increase inference cost, dilute useful information, and introduce feedback drift. Moreover, these methods often depend on very large LLMs whose stable generation preferences may lead to structurally similar expressions, redundant candidates, and search stagnation. To address these limitations, we propose \textsc{QuantEvolver}, a self-evolving alpha factor discovery framework based on reinforcement fine-tuning. Instead of accumulating feedback in the prompt, \textsc{QuantEvolver} converts executable quantitative evaluation into policy updates, enabling a Miner LLM to internalize historical optimization experience through parameter learning. Specifically, \textsc{QuantEvolver} constructs high-quality seed factors, builds diverse seed--time-window training tasks, generates executable Factor DSL expressions, evaluates them through Regime Backtest, and optimizes the Miner LLM with Diversity-Complementarity Reward. During training, high-quality factors are continuously accumulated in a Mined Factor Database, which serves as the final discovered factor library. Extensive experiments on three realistic market benchmarks demonstrate the effectiveness of \textsc{QuantEvolver}, which consistently improves the primary evaluation metric of each task over existing LLM-based alpha factor discovery baselines, produces higher-quality and more complementary factor pools.

cs.CE↗

No Attack Required: Semantic Fuzzing for Specification Violations in Agent Skills

LLM-powered agents can silently delete documents, leak credentials, or transfer funds on a routine user request, not because the agent was attacked, but because the skill it invoked broke its own declared safety rules. We call these specification violations: benign inputs cause a skill to breach the natural-language guardrails in its own specification, typically because the guardrail's semantics are undefined for autonomous execution, or because the implementation silently ignores the documented constraint. These violations are invisible to static analyzers, traditional fuzzers, and prompt-injection defenses alike, yet they undermine the very contract a user trusts when installing a skill. We present Sefz, a goal-directed semantic fuzzing framework that automatically discovers specification violations in agent skills. Sefz translates each guardrail into a reachability goal over an annotated execution trace, reducing violation checking to a deterministic graph query. An LLM-based mutator generates benign inputs whose traces progressively approach the violation patterns, guided by a multi-armed bandit that uses goal-proximity as its reward signal. On 402 real-world skills from the largest public agent-skill marketplace, Sefz finds specification violations in 120 (29.9%), including 26 previously unknown exploitable guardrail violations in deployed skills. Six recurring specification pitfalls explain the bulk of the failures, suggesting concrete principles for safer skill design.

cs.CR↗

Options, Not Clicks: Lattice Refinement for Consent-Driven MCP Authorization

As Model Context Protocol adoption grows, securing tool invocations via meaningful user consent has become a critical challenge, as existing methods, broad always allow toggles or opaque LLM-based decisions, fail to account for dangerous call arguments and often lead to consent fatigue. In this work, we present Conleash, a client-side middleware that enforces boundary-scoped authorization by utilizing a risk lattice to auto-permit safe calls within known boundaries while escalating risks, a policy engine for user-defined invariants, and a refinement loop that converts user decisions into reusable rules. Evaluated on 984 real-world traces, Conleash achieved 98.2% accuracy, caught 99.4% of escalations, and added only 8.2 ms of overhead for policy verification; furthermore, in a user study where N=16, participants significantly preferred Conleash scoped permissions over traditional methods, citing higher trust and reduced prompting.

cs.CR↗

VEGA: Visual Encoder Grounding Alignment for Spatially-Aware Vision-Language-Action Models

Precise spatial reasoning is fundamental to robotic manipulation, yet the visual backbones of current vision-language-action (VLA) models are predominantly pretrained on 2D image data without explicit 3D geometric supervision, resulting in representations that lack accurate spatial awareness. Existing implicit spatial grounding methods partially address this by aligning VLA features with those of 3D-aware foundation models, but they rely on empirical layer search and perform alignment on LLM-level visual tokens where spatial structure has already been entangled with linguistic semantics, limiting both generalizability and geometric interpretability. We propose VEGA (Visual Encoder Grounding Alignment), a simple yet effective framework that directly aligns the output of the VLA's visual encoder with spatially-aware features from DINOv2-FiT3D, a DINOv2 model fine-tuned with multi-view consistent 3D Gaussian Splatting supervision. By performing alignment at the visual encoder output level, VEGA grounds spatial awareness before any linguistic entanglement occurs, offering a more interpretable and principled alignment target. The alignment is implemented via a lightweight projector trained with a cosine similarity loss alongside the standard action prediction objective, and is discarded at inference time, introducing no additional computational overhead. Extensive experiments on simulation benchmark and real-world manipulation tasks demonstrate that VEGA consistently outperforms existing implicit spatial grounding baselines, establishing a new state-of-the-art among implicit spatial grounding methods for VLA models.

cs.RO↗

Towards Robust LLM Post-Training: Automatic Failure Management for Reinforcement Fine-Tuning

Reinforcement fine-tuning (RFT) has become a core paradigm for post-training large language models, yet its training process remains highly fragile. Existing efforts mainly improve reliability at the system level or address specific issues in individual subproblems by modifying RFT algorithms. Despite their effectiveness, they largely overlook the problem of failure management at the training-process level. When training goes wrong, practitioners still rely heavily on expert-driven manual inspection and correction, and automatic failure management for RFT remains largely unexplored. In this paper, we take a first step toward systematic failure management for reinforcement fine-tuning. To understand the empirical structure of RFT failures, we first construct RFT-FaultBench, the first benchmark for fine-grained failures in reinforcement fine-tuning, covering 5 fault families, 16 fault types, 779 training runs, 22,549 train-step records, and 1,457,288 trajectory-level records. Based on this benchmark, we conduct a comprehensive empirical study showing that RFT failures are both observable from training dynamics and distinguishable through their empirical fault fingerprints. Building on these findings, we propose RFT-FM, an automatic failure management framework for reinforcement fine-tuning that unifies anomaly detection, failure diagnosis, and auto remediation in a closed loop. Experimental results show that RFT-FaultBench is neither trivial nor saturated: it exhibits clear anomaly structure while still posing substantial challenges, especially under subtle fault settings. Moreover, RFT-FM shows strong capability in detecting, diagnosing, and mitigating RFT failures.

cs.SE↗

WGAN based Inverse Design of Active Dual Band FSS with Switchable Transmission

This letter presents a novel design method for switchable dual band transmissive frequency selective surface (FSS). The proposed FSS possesses characteristics of maintaining passband characteristics at high frequencies, while switching from transmission to reflection at low frequencies with pin diodes states altering. Specifically, we propose a crystal growth-based topology generation strategy, and utilize a simplified U-Net Wasserstein GAN (WGAN) neural network model to establish an inverse mapping model from electromagnetic response to structure topology parameters. The trained WGAN achieves training and validation accuracies of 95.59% and 90.84%, while the simplified U-Net attains training and validation accuracies of 98.5% and 94.1%. Using the trained WGAN. The generated structural topologies were validated through full-wave simulations and experimental measurements. The proposed method enhances the design flexibility and overcomes the time- consuming drawbacks of conventional FSS design.

physics.app-ph↗

Analysis and Design of Double-Transmitting Coil Systems based on Parity-Time Symmetry

The wireless power transfer (WPT) system based on parity-time (PT) symmetry has the advantages of robustness, stability, and efficient power transmission. However, traditional PT symmetry structures have limited voltage power output and are susceptible to horizontal misalignment effects. Multiple transmission coils have been proven to improve the power and misalignment tolerance of WPT systems, but variations in inter-coil coupling significantly affect transmission power. Towards this end, this article proposes a double-transmitting coil WPT system based on PT symmetry, which is innovative in that a novel negative resistance structure based on operational amplifier (OA) is proposed, and the parallel structure of double-transmitting coil is applied to this negative resistance structure. Compared with the traditional WPT system based on a single-transmitting coil PT, this system improves the power and misalignment tolerance in the PT symmetry region. The large-sized and small-sized receiving coils increase the load power to 313% and 185% respectively. Moreover, in the symmetry region, the displacement of the receiving coil in the horizontal and vertical directions results in variations of the equivalent coupling coefficient, which can achieve stable power transmission in three dimensions. The voltage fluctuation rate of both receiving coils does not exceed 3.4%, greatly improving the degree of freedom of the receiving system.

physics.app-ph↗

Semia: Auditing Agent Skills via Constraint-Guided Representation Synthesis

An agent skill is a configuration package that equips an LLM-driven agent with a concrete capability, such as reading email, executing shell commands, or signing blockchain transactions. Each skill is a hybrid artifact-a structured half declares executable interfaces, while a prose half dictates when and how those interfaces fire-and the prose is reinterpreted probabilistically on every invocation. Conventional static analyzers parse the structured half but ignore the prose; LLM-based tools read the prose but cannot reproducibly prove that a tainted input reaches a high-impact sink. We present Semia, a static auditor for agent skills. Semia lifts each skill into the Skill Description Language (SDL), a Datalog fact base that captures LLM-triggered actions, prose-defined conditions, and human-in-the-loop checkpoints. Synthesizing a fact base that is both structurally sound and semantically faithful to the original prose is the central challenge; we address it with Constraint-Guided Representation Synthesis (CGRS), a propose-verify-evaluate loop that refines LLM candidates until convergence. Security properties (e.g., indirect injection, secret leakage, confused deputies, unguarded sinks, etc.) over an agent skill can then be reduced to Datalog reachability queries. We evaluate Semia on 13,728 real-world skills from public marketplaces. Semia renders all of them auditable and finds that more than half carry at least one critical semantic risk. On a stratified sample of 541 expert-labeled skills, Semia achieves 97.7% recall and an F1 of 90.6%, substantially outperforming signature-based scanners and LLM baselines.

cs.CR↗

FineSteer: A Unified Framework for Fine-Grained Inference-Time Steering in Large Language Models

Large language models (LLMs) often exhibit undesirable behaviors, such as safety violations and hallucinations. Although inference-time steering offers a cost-effective way to adjust model behavior without updating its parameters, existing methods often fail to be simultaneously effective, utility-preserving, and training-efficient due to their rigid, one-size-fits-all designs and limited adaptability. In this work, we present FineSteer, a novel steering framework that decomposes inference-time steering into two complementary stages: conditional steering and fine-grained vector synthesis, allowing fine-grained control over when and how to steer internal representations. In the first stage, we introduce a Subspace-guided Conditional Steering (SCS) mechanism that preserves model utility by avoiding unnecessary steering. In the second stage, we propose a Mixture-of-Steering-Experts (MoSE) mechanism that captures the multimodal nature of desired steering behaviors and generates query-specific steering vectors for improved effectiveness. Through tailored designs in both SCS and MoSE, FineSteer maintains robust performance on general queries while adaptively optimizing steering vectors for targeted inputs in a training-efficient manner. Extensive experiments on safety and truthfulness benchmarks show that FineSteer outperforms state-of-the-art methods in overall performance, achieving stronger steering performance with minimal utility loss. Code is available at https://github.com/YukinoAsuna/FineSteer

cs.LG↗

Solving bound-state equations in $\text{QCD}_2$ with bosonic and fermionic quarks

We investigate the bound-state equations (BSEs) in two-dimensional QCD in the $N_c\to \infty$ limit, viewed from both the infinite momentum frame (IMF) and the finite momentum frame (FMF). The BSE of a meson in the original 't Hooft model, viz., spinor $\text{QCD}_2$ containing only fermionc quarks, has been extensively studied in literature. In this work, we focus on the BSEs pertaining to two types of "exotic" hadrons, a "tetraquark" which is composed of a bosonic quark and bosonic antiquark, and a "baryon" which is composed of a bosonic antiquark and a fermionic quark. Utilizing the Hamiltonian approach, we derive the corresponding BSEs for both types of "exotic" hadrons, from the perspectives of the light-front and equal-time quantization, and confirm the known results. The recently available BSEs for "tetraquark" in FMF has also been recovered with the aid of the diagrammatic approach. For the first time we also present the BSEs of a "baryon" in FMF in the extended 't Hooft model. By solving various BSEs numerically, we obtain the mass spectra pertaining to "tetraquark" and "baryon" and the corresponding bound-state wave functions of the lowest-lying states. It is numerically demonstrated that, when a "tetraquark" or "baryon" is continuously boosted, the forward-moving component of the bound-state wave function approaches the corresponding light-cone wave function, while the backward-moving component fades away.

hep-ph↗

PostureObjectstitch: Anomaly Image Generation Considering Assembly Relationships in Industrial Scenarios

Image generation technology can synthesize condition-specific images to supplement real-world industrial anomaly data and enhance anomaly detection model performance. Existing generation techniques rarely account for the pose and orientation of industrial components in assembly, making the generated images difficult to utilize for downstream application. To solve this, we propose a novel image synthesis approach, called PostureObjectStitch, that achieves accurate generation to meet the requirement of industrial assembly. A condition decoupling approach is introduced to separate input multi-view images into high-frequency, texture, and RGB features. The feature temporal modulation mechanism adapts these features across diffusion model time-steps, enabling progressive generation from coarse to fine details while maintaining consistency. To ensure semantic accuracy, we introduce a conditional loss that enhances critical industrial elements and a geometric prior that guides component positioning for correct assembly relationships. Comprehensive experimental results on the MureCom dataset, our newly contributed DreamAssembly dataset, and the downstream application validate the outstanding performance of our method.

cs.CV↗

E2E-REME: Towards End-to-End Microservices Auto-Remediation via Experience-Simulation Reinforcement Fine-Tuning

Contemporary microservice systems continue to grow in scale and complexity, leading to increasingly frequent and costly failures. While recent LLM-based auto-remediation approaches have emerged, they primarily translate textual instructions into executable Ansible playbooks and rely on expert-crafted prompts, lacking runtime knowledge guidance and depending on large-scale general-purpose LLMs, which limits their accuracy and efficiency. We introduce \textit{End-to-End Microservice Remediation} (E2E-MR), a new task that requires directly generating executable playbooks from diagnosis reports to autonomously restore faulty systems. To enable rigorous evaluation, we build \textit{MicroRemed}, a benchmark that automates microservice deployment, failure injection, playbook execution, and post-repair verification. We further propose \textit{E2E-REME}, an end-to-end auto-remediation model trained via experience-simulation reinforcement fine-tuning. Experiments on public and industrial microservice platforms, compared with nine representative LLMs, show that E2E-REME achieves superior accuracy and efficiency.

cs.SE↗

Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes

We propose a fault-tolerant quantum computation scheme that is broadly applicable to quantum low-density parity-check (qLDPC) codes. The scheme achieves constant qubit overhead and a time overhead of $O(d^{a+o(1)})$ for any $[[n,k,d]]$ qLDPC code with constant encoding rate and distance $d = Ω(n^{1/a})$. For good qLDPC codes, the time overhead is minimized and reaches $O(d^{1+o(1)})$. In contrast, code surgery based on gauging measurement and brute-force branching requires a time overhead of $O(dw^{1+o(1)})$, where $d\leq w\leq n$. Thus, our scheme is asymptotically faster for all codes with $a < 2$. This speedup is achieved by developing techniques that enable parallelized code surgery under constant qubit overhead and leverage classical locally testable codes for efficient resource state preparation. These results establish a new paradigm for accelerating fault-tolerant quantum computation on qLDPC codes, while maintaining low overhead and broad applicability.

quant-ph↗

CAD 100K: A Comprehensive Multi-Task Dataset for Car Related Visual Anomaly Detection

Multi-task visual anomaly detection is critical for car-related manufacturing quality assessment. However, existing methods remain task-specific, hindered by the absence of a unified benchmark for multi-task evaluation. To fill in this gap, We present the CAD Dataset, a large-scale and comprehensive benchmark designed for car-related multi-task visual anomaly detection. The dataset contains over 100 images crossing 7 vehicle domains and 3 tasks, providing models a comprehensive view for car-related anomaly detection. It is the first car-related anomaly dataset specialized for multi-task learning(MTL), while combining synthesis data augmentation for few-shot anomaly images. We implement a multi-task baseline and conduct extensive empirical studies. Results show MTL promotes task interaction and knowledge transfer, while also exposing challenging conflicts between tasks. The CAD dataset serves as a standardized platform to drive future advances in car-related multi-task visual anomaly detection.

cs.CV↗

GroundingAnomaly: Spatially-Grounded Diffusion for Few-Shot Anomaly Synthesis

The performance of visual anomaly inspection in industrial quality control is often constrained by the scarcity of real anomalous samples. Consequently, anomaly synthesis techniques have been developed to enlarge training sets and enhance downstream inspection. However, existing methods either suffer from poor integration caused by inpainting or fail to provide accurate masks. To address these limitations, we propose GroundingAnomaly, a novel few-shot anomaly image generation framework. Our framework introduces a Spatial Conditioning Module that leverages per-pixel semantic maps to enable precise spatial control over the synthesized anomalies. Furthermore, a Gated Self-Attention Module is designed to inject conditioning tokens into a frozen U-Net via gated attention layers. This carefully preserves pretrained priors while ensuring stable few-shot adaptation. Extensive evaluations on the MVTec AD and VisA datasets demonstrate that GroundingAnomaly generates high-quality anomalies and achieves state-of-the-art performance across multiple downstream tasks, including anomaly detection, segmentation, and instance-level detection.

cs.CV↗

Extinction Distributions in Nearby Star-resolved Galaxies. II. M33

Extinction maps are essential for tracing interstellar dust and enabling accurate stellar population studies in galaxies. Here, a high-resolution extinction distribution of nearby galaxy M33 is constructed by fitting multiband color indexes of the individually resolved red giant branch (RGB) stars from the Panchromatic Hubble Andromeda Treasury: Triangulum Extended Region (PHATTER) survey. Achieving an angular resolution of approximately 6$^{\prime\prime}$ ($\sim$ 24.4 pc), the extinction map reveals the intricate and heterogeneous distribution of dust throughout the entire disk of M33, with distinct delineation of spiral arms, inter-arm regions, and compact dust clouds. In addition, it exhibits strong spatial correspondence with the distributions of total hydrogen, H I, and CO, underscoring the reliability of the extinction map for tracing both diffuse and dense components of the interstellar medium. The derived $V$-band extinction reaches up to 2.5 mag per pixel, with a mean value of about 1.05 mag. Beyond providing new insights into the dust structure of M33, the extinction map offers a robust foundation for accurate extinction corrections and will support future studies, including upcoming observations with the Chinese Space Station Telescope.

astro-ph.GA↗

Semileptonic neutral current decays of $Ξ_b$ with dileptons or dineutrinos in the final state

We perform a detailed analysis of semileptonic $Ξ_b$ decays mediated by flavor-changing neutral currents ($b\to s$ and $b\to d$) with dilepton or dineutrino final states within the perturbative QCD framework. All independent form factors including vector, axial-vector, tensor, and pseudotensor currents are calculated and are used to analyze the decay branching fractions and angular distributions. Our numerical results for the branching fractions of $Ξ_b\to Ξ\ell^+\ell^-$ decays suggest they are within measurable reach for the LHCb experiment in the near future. Furthermore, we show that a measurement of the ratio $\mathcal{B}(Ξ_b^-\to Σ^- μ^+μ^-) / \mathcal{B}(Ξ_b^-\to Ξ^- μ^+μ^-)$ will allow for an independent determination of $|V_{td}/V_{ts}|$. For the case of unpolarized $Ξ_b$ baryons, we derive several angular observables, which can provide new and complementary constraints on Wilson coefficients in semileptonic FCNC transitions compared to those from mesonic decays. Finally, we present a combined analysis of dilepton and dineutrino channels, comparing various observables in detail. Our results offer further insights into the long-standing anomalies observed in $B$ meson decays.

hep-ph↗

The dynamically generated $N(1535)$ state in the $Λ_c^+ \to p\bar{K}^0 π^0$ decay

We present a theoretical analysis of the process $Λ_c^+ \to p\bar{K}^0 π^0$ within the chiral unitary approach, with particular emphasis on the dynamically generated $N(1535)$ resonance. In addition to $N(1535)$, our model incorporates contributions from other intermediate resonances including $N(1650)$, $K^*(892)$, $K_0^*(1430)$, $N(1440)$, and $Σ(1750)$. The calculated invariant mass distributions and Dalitz plot are in good agreement with the recent Belle measurements. Our analysis highlights the crucial role of $N(1535)$ state in this decay channel and supports its interpretation as a dynamically generated state arising from coupled-channel meson-baryon interactions.

hep-ph↗