Searcharxiv⌕ Search

arXiv subjects

Ying Zhang

Publications and source records attributed to Ying Zhang.

At least 55 records · Page 3Linked to original sources

Strichartz estimates to fractional Schrödinger equations

In this paper, we firstly study Strichartz estimates $\|e^{it D^α} u_0\|_{L_t^q(\mathbb{R};L_x^r(\mathbb{R}^d))}\leq C(d,α,q,r,s)\|u_0\|_{\dot{H}^s}.$ We show some counterexamples for $(q,r) = (2,\infty)$. Then we consider the embedding $X^{s,b}_α\hookrightarrow L_t^q(\mathbb{R};L_x^r(\mathbb{R}^d))$, where $\|u\|_{X_α^{s,b}}:=\|\langleξ\rangle^s\langle τ-|ξ|^α\rangle^b\hat{u}(τ,ξ)\|_{L^2_{τ,ξ}}$. We present the necessary and sufficient conditions for this embedding.

math.AP↗

Thermal width shift of $Δ^{++}$ in a pion gas

We compute the thermal width shift of the $Δ^{++}$ resonance induced by a pion gas within a nonrelativistic effective field theory framework. The $Δ^{++}$ self-energy is evaluated from pion-forward-scattering diagrams with intermediate proton and $Δ$ states, weighted by the thermal pion distribution. Analytical expressions for the imaginary part of the self-energy yield the temperature-dependent width correction $δΓ(T)$. The width increases with temperature, reaching approximately $6$~MeV at $T \approx 160$~MeV. When the temperature-dependent $Δ$ and nucleon masses from an NJL-model chiral restoration scenario are incorporated, the width shift becomes non-monotonic, peaking near $T \approx 140$~MeV---a consequence of the competition between collisional broadening and the shrinking $Δ\to Nπ$ phase space as the $N$--$Δ$ mass gap closes. Applying our formalism to STAR data for $Δ^{++}$ in d+Au collisions at $\sqrt{s_{NN}} = 200$~GeV, we extract a temperature $T \approx 300$~MeV at $p_t = 900$~MeV, consistent with the experimental extraction within errors. This value significantly exceeds the hadronic-phase temperature, explicitly demonstrating that the observed $Δ^{++}$ width shift is not solely of pion-gas origin---genuine hot-medium and collective-flow contributions must be substantial.

hep-ph↗

Multi-Modal Graph Interaction for Multi-Graph Convolution Network in Urban Spatiotemporal Forecasting

Graph convolution network based approaches have been recently used to model region-wise relationships in region-level prediction problems in urban computing. Each relationship represents a kind of spatial dependency, like region-wise distance or functional similarity. To incorporate multiple relationships into spatial feature extraction, we define the problem as a multi-modal machine learning problem on multi-graph convolution networks. Leveraging the advantage of multi-modal machine learning, we propose to develop modality interaction mechanisms for this problem, in order to reduce generalization error by reinforcing the learning of multimodal coordinated representations. In this work, we propose two interaction techniques for handling features in lower layers and higher layers respectively. In lower layers, we propose grouped GCN to combine the graph connectivity from different modalities for more complete spatial feature extraction. In higher layers, we adapt multi-linear relationship networks to GCN by exploring the dimension transformation and freezing part of the covariance structure. The adapted approach, called multi-linear relationship GCN, learns more generalized features to overcome the train-test divergence induced by time shifting. We evaluated our model on ridehailing demand forecasting problem using two real-world datasets. The proposed technique outperforms state-of-the art baselines in terms of prediction accuracy, training efficiency, interpretability and model robustness.

cs.LG↗

MaliciousSkillBench: A Comprehensive Benchmark for Malicious Agent Skill Detection

Agent Skills extend LLM agents with reusable instruction packages that may also include scripts, resources, and service configuration. This creates a direct distribution channel for malicious behavior, yet existing malicious-Skill datasets are fragmented across sources, artifact formats, evidence regimes, and benign coverage; duplicated and structurally related content further complicates direct aggregation and evaluation. We present MaliciousSkillBench, a comprehensive benchmark for malicious Agent Skill detection. We consolidate 13 public sources, 11 of which contribute Core malicious artifacts, and reduce 8,414 raw malicious records to 7,539 normalized-unique identities in 4,588 operational structural families. After conservative cross-label conflict exclusion, the primary benchmark contains 9,740 Skills: 7,505 malicious and 2,235 benign. To characterize its coverage, we harmonize 11 attack categories for 4,983 malicious identities with supported source-native mappings and find substantial differences in threat composition across sources. We then evaluate three learned text detectors and three off-the-shelf Skill scanners. Learned detectors achieve 0.882-0.932 Random Macro-F1 but only 0.653-0.665 under Source-Disjoint evaluation; the strongest word TF-IDF SVM scores 0.932/0.916/0.665 on Random/structural-disjoint/Source-Disjoint while retaining 95.6% malicious recall but producing 62.4% benign FPR on held-out sources. Off-the-shelf scanners occupy different but also unsatisfactory operating regimes, reducing false positives only at the cost of sharply lower malicious recall. Together, these results show that reliable malicious-Skill detection requires both broader cross-source benchmark coverage and evaluation that jointly measures attack detection and benign over-flagging.

cs.CR↗

Physics-Informed Sliding-Window Particle Filtering for Tactile-Only In-Hand 6-DoF Object Pose Refinement

This paper studies tactile-only 6-DoF pose refinement and belief maintenance for grasped objects in static and short quasi-static in-hand configurations where vision is unavailable or heavily occluded. The key difficulty is tactile partial observability: whole-hand taxel contacts are sparse, intermittent, and ambiguous under limited excitation and object symmetries. We propose a physics-informed particle filter on $\mathrm{SE}(3)$ that updates pose beliefs from dense whole-hand tactile measurements. The likelihood combines active-contact signed-distance consistency, force-normal alignment, friction-cone feasibility, zero-force negative evidence, and optional feasibility guards. A sliding-window log-likelihood fuses recent tactile frames to reduce single-frame ambiguity, while a potential-field-guided proposal steers particles away from hand--object penetration. Symmetry-aware resampling preserves multiple plausible modes. Experiments on an Allegro Hand V5 with five objects show lower normalized ADD-S than tactile-only geometric, particle-filter, and learning baselines, and ablations confirm the benefits of temporal fusion, potential guidance, and mode preservation.

cs.RO↗

BrainLinear: A Linear Model for Brain Network Analysis in Sparse Tangent Subspaces

Functional connectome analysis examines brain-region interactions to understand and identify disorders such as autism spectrum disorder and Alzheimer's disease. Existing methods typically use GNNs and Transformers to model the full functional connectivity matrix. However, processing tens of thousands of connections introduces redundancy and noise, increases computational cost, and limits connection-level interpretability. This raises a central question: do we really need complex interaction modeling, or is identifying a small set of disease-relevant connectivity patterns sufficient? To answer this question, we propose BrainLinear, a lightweight geometry-aware framework for mining disease-discriminative connectome patterns. BrainLinear first maps each functional connectivity matrix to a shared tangent space centered at the Fréchet mean of the training set, capturing subject-specific deviations while respecting matrix geometry. It then scores each ROI-pair tangent direction by its classification contribution and disease--control difference, retaining Top-$K$ directions as a compact representation. Finally, a shallow multilayer perceptron performs classification on the selected representation. Experiments on ABIDE and ADNI show that BrainLinear matches or exceeds strong GNN and Transformer baselines at a fraction of their cost: it improves AUC and ACC over the best baseline for each metric by up to $3.54$ and $1.39$ percentage points, while reducing runtime and peak GPU memory by $84.0\%$ and $68.4\%$ relative to the closest baseline in AUC. The selected directions are directionally consistent with between-group displacements and organized across major functional systems, supporting connection-level interpretation.

cs.GR↗

Role of the $δ$ Meson in Softening the Symmetry Energy within the DDRHF Model

We investigate the effects of the isovector-scalar $δ$ meson on the density dependence of the symmetry energy within the density-dependent relativistic Hartree--Fock (DDRHF) framework. As a baseline, we generate $1006$ accepted DDRHF parametrizations including the $σ$, $ω$, $ρ$, and $π$ mesons by imposing empirical constraints on the saturation properties of nuclear matter. The resulting symmetry-energy slope parameters are confined to relatively large values, $L\simeq65$--$110~\mathrm{MeV}$. Two representative parametrizations, denoted RHF-NK1 and RHF-NK2, are randomly selected from this ensemble. Starting from these two parametrizations, we introduce the $δ$ meson and readjust the meson--nucleon couplings under the same saturation-property constraints. The numerical optimization shows that small values of $L$ are obtained most efficiently when the $δ$ coupling is taken to be constant. In this case, $L$ is reduced from approximately $73$ to $32~\mathrm{MeV}$, while the binding energy per nucleon, saturation density, symmetry energy, and incompressibility coefficient remain nearly unchanged. A channel-by-channel decomposition shows that the softening is not caused by the direct $δ$-meson contribution alone, but by a redistribution among the $δ$, $ρ$, and $π$ mesons together with the isoscalar Fock contributions. The resulting neutron-star mass--radius relations shift toward smaller radii, indicating that the $δ$ meson provides an efficient additional degree of freedom for controlling the isovector properties of DDRHF models.

nucl-th↗

An Agentic Generative Large Language Model for Treatment Planning of Colorectal Cancer

Treatment planning in precision oncology requires synthesizing heterogeneous patient information with rapidly evolving clinical guidelines to ensure guideline-concordant care. While large language models (LLMs) show promise in many diagnostic tasks, their adoption for high-stakes treatment planning is hindered by complex reasoning, adherence to timely clinical guidelines, and safety concerns. In this study, we present GatorOnco, an agentic LLM for colorectal cancer (CRC) treatment planning. GatorOnco is developed using a total of 282 billion tokens of biomedical text, including healthcare system-scale clinical text comprising 166 billion tokens from UF Health. We implemented a domain-adaptation method that integrates pre-training, model merging, a two-stage post-training approach, and agent-based reinforcement learning. An agentic retrieval-augmented generation (RAG) approach dynamically integrates time-sensitive clinical guidelines into the reasoning process. In a blind, randomized clinical evaluation conducted by five UF Health oncologists, GatorOnco significantly outperformed open-source LLMs (P < 0.01) and achieved expert-level performance comparable to UF Health oncologists. Compared with expert oncologists, GatorOnco received significantly higher ratings for readability (4.46 vs. 4.19, P < 0.01) and completeness (3.91 vs. 3.52, P < 0.01), while showing statistically comparable performance in correctness (4.09 vs. 4.11, P = 0.921), currency (4.04 vs. 3.98, P = 0.478), and safety (4.22 vs. 4.22, P = 0.999). These findings demonstrate that integrating agentic reasoning with large-scale domain adaptation can help bridge the gap for generative AI in high-stakes cancer treatment planning.

cs.CL↗

CognixShield: PoV-Guided Vulnerable API Usage Detection in Large Codebases via LLMs

The integration of open-source libraries in Java development introduces severe security risks through vulnerable APIs. Existing program analysis and deep learning tools face the challenge of capturing inter-procedural vulnerability semantics at scale. While LLMs show promise for semantic reasoning, they cannot handle large codebases because of context limits and a lack of vulnerability-specific understanding needed to determine exploitability. We present CognixShield, an LLM-powered framework for detecting vulnerable API usage through three core components. First, semantic-preserving AST-based fragmentation partitions large codebases while maintaining syntactic completeness within LLM context-window limits. Second, vulnerability-aware multi-agent RAG traces relevant program context across these fragments, iteratively assembling security-critical context spanning functions and files. Third, PoV-guided semantic reasoning leverages Proof-of-Vulnerability tests that encode precise triggering conditions and exploitation mechanics for vulnerability determination. CognixShield achieves 84% precision, 95% recall, 84% accuracy, and an 89% F1-score on 57 real-world Java applications, outperforming state-of-the-art tools. Our results show that vulnerability detection requires specialized architectural innovations beyond generic LLM applications.

cs.SE↗

Large-Small Model Collaboration for Enhancing Edge-Deployed Small Models

Edge devices host domain-specific small language models (SLMs) with limited resources, while private clouds offer larger LLMs. We propose G-Boost, an adaptive edge-cloud framework that improves a deployed SLM's task performance without parameter updates. It formulates reasoning as a tree search, choosing at each step between SLM-only inference and SLM-LLM logit fusion---which transfers domain knowledge from the SLM's adapted version to the cloud LLM without exposing private data. A process reward model guides Monte Carlo tree search to select beneficial collaboration steps dynamically. The edge runs the SLM and search controller; the cloud hosts the LLM and reward model, exchanging only current context. Evaluated on GSM8K and MATH-500 with Qwen2.5 and LLaMA2, G-Boost outperforms the SLM alone, static fusion, and fine-tuned baselines, gaining up to 8.6 and 10.7 percentage points over MCTS and Proxy-Tuning, respectively. Results confirm that step-level, reward-guided dynamic collaboration enhances reasoning and domain utilization for deployed edge SLMs.

cs.CL↗

BulkPR-Bench: Benchmarking Queue-Level Governance of Interacting Pull Requests

Coding-agent benchmarks increasingly cover long-horizon, end-to-end, and interactive development, but typically retain one requested outcome or a fixed change sequence. Sequential policies can process a pull-request (PR) queue one candidate at a time, but when queued PRs interact, maximizing safe delivery can require jointly deciding which changes to merge and in what order. We introduce BulkPR-Bench, an executable benchmark in which an agent must recover consequential PR relations and return a large safe subset in executable order under a rolling-release protocol. The suite contains 581 newly authored candidate PRs on frozen snapshots of 18 real repositories. Registered state-by-state repository execution, including hidden safety checks, validates the gold relation graph; an exact oracle then computes the largest safe subset. Our primary metric, Relational Delivery Score (RDS), scores safe delivery and correct rejection over relation groups from the realized merge trace; Global Safety-Gated Yield (Global-SGY) separately measures strict delivery of the realized whole-queue plan. Under the buffered primary protocol with batch size $K=32$, the three highest RDS estimates among the six models are 66.6%, 62.0%, and 57.9%, compared with 53.1% for the strongest sequential baseline. Only 8 of 324 model runs complete a queue exactly. Critical-relation recall ranges from 35.2% to 57.7%, and diagnostic runs supplied with the gold relations show substantial remaining headroom. Gains on relation groups therefore do not yet translate into dependable whole-queue governance.

cs.SE↗

WebCoderBench: Benchmarking Web Application Generation with Comprehensive and Interpretable Evaluation Metrics

Web applications (web apps) have become a key arena for large language models (LLMs) to demonstrate their code generation capabilities and commercial potential. However, building a benchmark for LLM-generated web apps remains challenging due to the need for real-world user requirements, generalizable evaluation metrics without relying on ground-truth implementations or test cases, and interpretable evaluation results. To address these challenges, we introduce WebCoderBench, the first real-world-collected, generalizable, and interpretable benchmark for web app generation. WebCoderBench comprises 1,572 real user requirements, covering diverse modalities and expression styles that reflect realistic user intentions. WebCoderBench provides 24 fine-grained evaluation metrics across 9 perspectives, combining rule-based and LLM-as-a-judge paradigm for fully automated, objective, and general evaluation. Moreover, WebCoderBench adopts human-preference-aligned weights over metrics to yield interpretable overall scores. Experiments across 12 representative LLMs and 2 LLM-based agents show that there exists no dominant model across all evaluation metrics, offering an opportunity for LLM developers to optimize their models in a targeted manner for a more powerful version.

cs.SE↗

Progressive$^2$: A Teacher-Student Progressive Co-Evolving Knowledge Distillation Method for Substantial Model Compression

Knowledge distillation (KD) is a widely utilized technique for transferring knowledge from a large model (the teacher) to a smaller model (the student). Owing to its flexibility and broad applicability, KD has been extensively applied in the compression of server-side models to meet the Quality of Service (QoS) requirements of client users. Despite significant advancements, the performance of distillation is substantially compromised when a large disparity exists between the capabilities of the server and the requirements of the client. To alleviate this problem, we propose a novel distillation approach, named Progressive$^2$, which operates through the combination of a progressively stronger teacher and a progressively smaller student. On the side of the teacher, rather than involving all layers simultaneously, we progressively select additional layers for distillation following a raw-to-rich semantic progression, establishing a systematic learning curriculum. Furthermore, we design a teacher-side multi-feature fusion adapter for the teacher to improve training stability, which is theoretically supported by the framework of Lipschitz continuity. On the side of the student, rather than directly training a tiny model, we gradually reduce the size of the network to facilitate an iterative co-evolution with the teacher. Progressive$^2$ serves as a flexible framework; the progressive strategy of the teacher can be deployed independently to achieve an optimal balance between accuracy and training efficiency, while the joint integration of the teacher and the student yields further improvements in overall performance.

cs.LG↗

Multi-User Localization via Active Sensing with Electromagnetically Reconfigurable Antennas

This paper investigates multi-user localization in uplink wireless systems assisted by electromagnetically reconfigurable antennas (ERAs). Unlike traditional localization schemes, we formulate an active sensing problem where a base station (BS) exploits historical pilot observations accumulated over previous sensing stages to adapt the shared ERA configuration and progressively refine position estimates. To capture both theoretical flexibility and practical hardware constraints, we establish a unified wideband geometric signal model accommodating two complementary ERA paradigms: a synthesis-based model utilizing spherical-harmonic basis functions, and a finite-state model based on measured radiation codebooks. Because analytically solving the resulting joint design problem is highly intractable due to the high-dimensional observation and the shared-aperture coupling among multiple users, we develop a learning-based active sensing framework. Specifically, pilot-matched wideband observations are compressed into compact user-wise features and sequentially accumulated by a long short-term memory (LSTM) module. These temporal features are then processed by a graph neural network (GNN) to capture multi-user shared-aperture coupling. Model-specific output heads generate either continuous synthesis coefficients or finite-state ERA selections, while a localization head produces stage-wise position estimates. Numerical results under a specific channel distribution show that the proposed ERA-assisted active sensing framework achieves progressive localization refinement across sensing stages and obtains better performance than conventional non-reconfigurable arrays and representative ablation baselines.

eess.SP↗

Magnetic hopfions at room temperature

Hopfions are three-dimensional (3D) topological solitons predicted to exist in diverse magnetic systems, yet their practical utility has been largely restricted to cryogenic environments. Here, we overcome this temperature constraint by demonstrating stable magnetic hopfions in the chiral magnet Co8Zn8Mn4 at and above room temperature. Using a transmission electron microscope equipped for in situ optical excitation, we generate magnetic hopfions with femtosecond laser pulses. Long-term observations further reveal Brownian-like motion at room temperature and thermally activated collapse upon approaching the high-temperature regime. Together with micromagnetic simulations and homotopy group analysis, our experimental observations uncover the hopfion formation mechanism through the fusion of bimeron pairs. These findings establish room-temperature magnetic hopfions and provide a framework for their further studies under technologically relevant conditions.

cond-mat.mtrl-sci↗

PRISM: Prompt Refinement via Image-grounded Self-rewarding Mechanism for Text-to-Image Generation

Text-to-image generation models can synthesize high-quality images from natural language descriptions, but their performance remains highly sensitive to prompt formulation. Existing prompt optimization methods mainly rely on text-side rewriting, prompt expansion, or external reward signals, offering limited image-grounded diagnosis and weak support for learning reusable optimisation policies. In this paper, we propose PRISM, a Prompt Refinement framework via Image-grounded Self-rewarding Mechanism. PRISM closes the prompt-image-feedback loop by interpreting generated images with structured visual diagnosis and scoring them along semantic consistency, aesthetic quality, and human preference alignment. It first initializes a unified VLM through multi-task supervised fine-tuning, and then improves the prompt policy via self-rewarding optimization with a hybrid ideal-point and Chebyshev reward. Extensive experiments show that PRISM improves holistic image quality and fine-grained semantic alignment, while providing interpretable feedback for targeted prompt refinement. The code is available at https://anonymous.4open.science/r/PRISM-FF81.

cs.CV↗

PreMoE: Proactive Inference for Efficient Mixture-of-Experts

Mixture-of-Experts (MoE) models offer dynamic computation, but are typically deployed as static full-capacity models, missing opportunities for deployment-specific specialization. We introduce PreMoE, a training-free framework that proactively compiles sparse MoE variants for targeted deployment scenarios. At its core is Predicted Expert Utility (PEU), a robust metric for estimating expert importance from router logits through high-confidence threshold filtering and logit transformation, which together stabilize utility estimation under aggressive sparsity. Using PEU scores computed on a small calibration set, PreMoE produces domain-aware expert rankings that can be used to compile either domain-specific specialists or high-efficiency multi-domain generalists, without any retraining. Across MoE models ranging from 30B to 718B parameters, PreMoE achieves up to 50\% sparsity with nearly no performance loss. It further exposes a practical deployment trade-off: specialists maximize in-domain efficiency, while synthesized generalists retain broader cross-domain capability at the same sparsity budget. Code: https://github.com/JarvisPei/PreMoE

cs.LG↗

Rewarding Better Thinking for LLM Preference Alignment

LLM preference alignment aims to optimize models toward human preferences across diverse user instructions. Reinforcement learning has become a major post-training approach for this goal, but existing proxy rewards are often outcome-level, mainly evaluating the final response while providing limited guidance for the reasoning trajectory. This can make credit assignment coarse when multiple responses receive similar final scores, leaving trajectory-level preferences under-specified. To address this limitation, we propose Thinking Checklist Reward (TCR), a process-oriented reward for RL-based preference alignment. TCR converts preference pairs into sample-specific thinking checklists and uses them to evaluate whether the generated reasoning trace addresses the preference-implied considerations. To reduce overlap with outcome-level supervision, TCR further introduces an exponential moving average (EMA) residual formulation to isolate a complementary thinking surplus beyond what is predictable from the outcome reward. Experiments on five models from three model families show that TCR consistently improves alignment performance across diverse benchmarks, with ablations further validating the importance of EMA-based residual formulation and sample-specific checklist supervision.

cs.AI↗