Searcharxiv⌕ Search

arXiv subjects

Fei Li

Publications and source records attributed to Fei Li.

At least 19 recordsLinked to original sources

Second Harmonic Flexoelectricity

Flexoelectricity (polarization induced by strain gradients) is assumed to be insensitive to space inversion in all materials: flexoelectric polarization should not depend on whether a crystal is bent upwards or downwards. In this work, we show that this assumption is wrong for ferroelectrics of all thickness and at all curvatures, owing to an intrinsic quadratic contribution that persists down to strain gradients of 1 m-1 or less, which is millions of times smaller than conventional expectations for nonlinear flexoelectricity. As a consequence, ferroelectric crystals can generate second-harmonic voltage at twice the oscillation frequency of the bending.

cond-mat.mtrl-sci↗

Connecting Electroweak Fine-Tuning, Tens-of-GeV Dark Matter, and Exotic Higgs Decays in the GNMSSM

In the general next-to-minimal supersymmetric standard model (GNMSSM), we connect electroweak fine-tuning, a singlino dark matter candidate with mass around tens of GeV, and Exotic Higgs Decays, identifying a natural region characterized by the mass hierarchy $m_{\tilde{S}}<m_{\tilde{B}}<m_{\tilde{H}}$ and $μ_{\rm tot}\in [200, 500]$ GeV. For fine-tuning measure $Δ\leq 40$, the branching ratio $\mathrm{Br}(h\to a_sa_s)$ falls in the range 7\%$-$25\%, with the pseudoscalar mass $m_{a_s}$ lying mostly between 10 and 20 GeV. This region splits into two viable scenarios consistent with LZ 2024 direct detection: one where the lightest CP-even Higgs $h_1$ is SM-like ($h_1$ case), and another where the second-lightest $h_2$ is SM-like ($h_2$ case). LHC searches for $h\to a_sa_s \to b\bar{b}τ^+τ^-$ exclude 12\% (10\%) of samples with 12 GeV $\leq m_{a_s} \leq$ 15.5 GeV in the $h_1$ ($h_2$) case, while a substantial fraction remains accessible at the HL-LHC in the $h_2$ case. Our analysis unifies naturalness, dark matter, and observable exotic Higgs decays, yielding concrete targets for future experiments.

hep-ph↗

AscSpMM: Efficient SpMM on Ascend NPUs via Pipelined Vector-Cube Collaboration

Neural processing units (NPUs) provide high compute density and energy efficiency through specialized matrix engines and software-managed on-chip memory. However, their libraries primarily target dense computation. Sparse matrix-dense matrix multiplication (SpMM), a key kernel in graph analytics, sparse neural networks, and scientific computing, requires index-driven operand selection, indirect addressing, scattered memory accesses, and load balancing. These requirements conflict with the fixed shapes and contiguous layouts preferred by NPU matrix engines. GPU Tensor Core SpMM methods cannot be directly transferred to NPUs with decoupled vector and matrix engines. We present AscSpMM, which separates irregular operand preparation from regular matrix computation through a parameterized Vector-CSR representation. The vector engine decodes indices and gathers and reorganizes dense operands, while the Cube engine performs matrix multiply-accumulate operations. A double-slot ring buffer enables dependency-aware asynchronous pipelining, while operand reuse and runtime-adaptive tiling reduce cross-engine stalls. On an Ascend 910B3, AscSpMM achieves geometric-mean speedups of 2.36x over GEMM, 19.92x over an existing SpMM implementation, and 5.82x over cuSPARSE on an A100. It reduces matrix-input storage and peak HBM footprint by 48.24% and 22.98% on average, while remaining competitive with specialized GPU Tensor Core SpMM kernels. The code is available at https://github.com/LfLab-AI/Ascend-NPU-SpMM.

cs.AR↗

Delegation without Priors

A principal makes decisions relying on the private information held by a biased agent. Lacking a prior over the circumstances that may arise, she seeks a delegation rule that minimizes worst-case regret relative to the complete-information benchmark. The optimal delegation mechanism governs two distinct margins: whether to depart from a common default action, and how much discretion to grant conditional on departure. This rule pairs the default action with an action gap, followed by a discretionary interval with randomized boundaries designed to balance regret across states. This structure is globally optimal within the class of all stochastic, incentive-compatible mechanisms.

econ.TH↗

A 40 Gbit/s FPGA-based RoCEv2 transport for detector readout: development and performance

Recording the complete input of a detector trigger allows trigger algorithms to be replayed and studied offline. For the BESIII main drift chamber (MDC), this requires moving tens of Gbit/s from trigger FPGAs into server memory without loss. Remote direct memory access over Converged Ethernet (RoCEv2) lets commercial network adapters write such data into host memory. Detector readout also needs record boundaries that the receiver can check, replay from a verified copy, and host buffers that are reused only after consumption. We present a 40 Gbit/s FPGA RoCEv2 transport that provides these functions. Records are aggregated into CRC32C-checked blocks, and unacknowledged data are kept in DDR memory and verified before replay. Acknowledgment-aware retention writes to DDR only the data that are not acknowledged in time. The transport runs on a ZCU102 board and on the 9U VME Trigger Core Board (TCB). With records of 128 B to 4 KiB it comes within 0.4% of the packetization limit of the link, delivering 36.9 Gbit/s of payload at a path MTU of 1024 B, and its block latency is set by the time needed to fill a block. On a direct link, acknowledgment-aware retention cuts DDR writes for large blocks from 106% to 0.03% of the payload, and injected DDR access errors stay within their queue pair. On the TCB, three 16.4 TB transfers through two switches lost at most five packets each, all recovered by replay. An installation at the MDC is under test.

physics.ins-det↗

PAT: A Personality-Driven Augmentation and Transfer Learning Framework for Depression Detection on Social Media

Depression is a prevalent mental disorder that affects millions worldwide, with early detection crucial for effective intervention. While exist?ing methods have achieved promising results in automated depression detection, they face two key limitations: (1) noise in post screening: symptom-based semantic screening is easily misled by superficial lexical patterns, thereby introducing false-positive posts; (2) weak op?timization of the post encoder: relying solely on coarse user-level supervision signals pre?vents models from capturing depressive cues within individual posts. To address these limita?tions, we propose PAT, a Personality-driven Augmentation and Transfer learning frame?work. In the first phase, PAT optimizes a post?level encoder via a fine-grained contrastive learning objective, utilizing LLM-based data augmentation driven by classic personality the?ories to alleviate data scarcity. In the second phase, the trained post-level scorer is deployed for high-quality post filtering, while its en?coder parameters are seamlessly transferred for user-level tasks. Extensive experiments demon?strate that PAT significantly outperforms exist?ing methods. Furthermore, PAT delivers multi?granular interpretability by tracing post-level mental-state trajectories and highlighting key symptoms, thereby offering reliable diagnostic evidence for clinical practice.

cs.CL↗

Algorithmic Attention and Content Creation on Social Media Platforms

We study revenue-maximizing attention allocation on an ad-funded social media platform governed by recommendation algorithms. Attention is costly and can be monetized through advertising or allocated to increase creators' exposure, creating a trade-off between monetization and production incentives. In a two-sided model with heterogeneous viewers and creators under private information, the optimal recommendation mix includes content that is ex post suboptimal for some viewers to leverage network externalities. These distortions are targeted: low-ability creators are excluded, while high-ability creators are subsidized through exposure or monetary payments. Two-sided complementarities reshape content variety and quality, with implications for personalization regulation and advertising markets.

econ.TH↗

TESS: LLM-guided Translation, Exploration, Simulation, and Search for Embodied Task Planning

In this work we focus on the problem of embodied task planning, which requires an agent to accomplish a complex task by separating it into atomic actions. Recent studies have developed LLM-based methods to address this problem. However, the executability and correctness of the generated plans remain suboptimal in complex environments and tasks. On the other hand, classical search algorithms have the potential to solve the planning problems perfectly, yet they require fully observable environments, known state transitions and goal state, which are often unattainable in general task domains. Therefore, we propose to implement an LLM-guided search algorithm that makes the search process possible and efficient by incorporating LLMs' commonsense knowledge. Our method leverages LLMs to (1) translate natural language instructions into formatted goal conditions, (2) facilitate efficient exploration in partially observable environments, (3) implement a rule-based world simulator, and (4) prune the space of candidate actions to improve search efficiency. Experimental results on VirtualHome and ALFWorld demonstrate its superior performance.

cs.AI↗

Interpretation of chirality imprinted on photoelectron momentum spectra by three-dimensional light fields

Synthetic three-dimensional (3D) light fields provide a new route to imprinting chirality on achiral matter through light--matter interaction. Although previous work has numerically demonstrated that chirality can be imprinted on the photoelectron momentum spectrum of atoms, a transparent analytical physical picture that links the structure of the driving field to the chirality of the spectrum is still an open question. Here, using frequency-domain theory based on nonperturbative quantum electrodynamics (QED), we demonstrate that this chirality originates from coherence between adjacent quantum transition channels. We further find that a symmetry transformation introduces into the coherence term a symmetry-breaking phase shift ($Φ_{\mathrm{SBPS}}$), which can be tuned by varying the laser-field parameters to preserve or break the corresponding symmetry in the spectrum. Once all such symmetries are broken, the momentum spectrum becomes chiral. In particular, for the noncollinear two-color 3D light field considered here, the spectrum is chiral for even $f=ω_2/ω_1$ and achiral for odd $f$. Our results provide a microscopic interpretation of chirality imprinting and establish a framework for predicting and controlling chiral electron wave packets with synthetic 3D light fields.

physics.atom-ph↗

Robust Capital Budgeting

We study capital budgeting when a manager privately knows project productivity and her empire-building benefits, while headquarters lacks credible priors. Headquarters minimizes maximum regret relative to informed investment. Without compensation, the optimal policy is a spending cap balancing empire-building overinvestment against profitable investment forgone. Compensation helps when empire-building incentives are weak. The optimal payment incentivizes restraint, declines with investment, and reaches zero at the spending cap, supporting greater managerial discretion. When empire-building incentives are strong, compensation cannot distinguish productive investment from biased expansion; therefore, a spending cap alone is optimal.

econ.TH↗

DiscoVL: Unveiling Disentangled C ross-Modal Representation Learning via Orthogonal Adversarial Regularization for V ision-Language Models

Pre-trained vision-language models excel across varied perception tasks, but adapting them to novel downstream settings without sacrificing generalization remains non-trivial. Existing parameter-efficient prompt learning method often yields inconsistent representations and fails to account for semantic distribution shifts. In this work, we present DiscoVL, a disentangled cross-modal representation learning framework that couples orthogonal adversarial regularization with structured cross-modal alignment for vision-language models. To address the insufficient cross-modal interaction, our DiscoVL designs a multi-branch low-rank residual aligner that decomposes representations into subspaces and enables bidirectional cross-modal feedback between visual and textual streams at each layer. Furthermore, while conventional triplet constraints overfit features to class centroids, we design an orthogonal regularization for adversarial triplet loss, which prevents centroid collapse and substantially boosts generalization. Evaluations on 15 benchmarks demonstrate that DiscoVL delivers consistent improvements over state-of-the-art methods for base-to-novel generalization, cross-dataset evaluation, and few-shot learning

cs.CV↗

Evolution of Transversely Asymmetric Electron Beams in Hollow Plasma Channels

Plasma wakefield acceleration in hollow plasma channels has emerged as a promising approach for positron acceleration, since an electron beam can drive wakes with a transversely uniform accelerating field and no intrinsic defocusing force for positrons. Recently, it was proposed that a transversely asymmetric electron beam can excite quadrupole-dominated wakefield in a hollow channel, enabling the formation of accelerating and focusing fields suitable for positrons. However, the self-consistent evolution and stability of such asymmetric drivers, which are crucial for sustaining a usable wake over long distances, remain insufficiently understood. In this work, we investigate the evolution modes of wakefield driven by asymmetric electron beams in hollow plasma channels using fully three-dimensional particle-in-cell simulations. We identify two distinct unstable scenarios: a reversal of quadrupole field polarity and continuous penetration of the driver into the plasma wall. By analyzing the transverse dynamics of the driver and the restoring forces provided by the channel ions, we establish simple physical criteria that ensure stable propagation. These results clarify the fundamental constraints governing asymmetric-driver evolution, provide practical guidance for realizing long-lived, quasisteady wakes in hollow plasma channels, and indicate that the scheme can preserve mm$\cdot$mrad-level normalized positron emittance.

physics.plasm-ph↗

VideoResearchAgent: Grounded Task Synthesis and Sim-to-Real RL for Open-Web Video Research

Existing deep research agents are designed primarily for text- and image-based web sources, while video reasoning systems typically assume that relevant videos are provided in advance. We study open-web video research, where an agent must autonomously discover relevant videos, navigate their temporal content, and ground answers in visual evidence. Training such agents at scale is challenging as live video interaction is slow and unreliable, whereas fixed local simulation can induce retrieval-specific shortcuts that fail to transfer to the open web. We introduce VideoResearchAgent, a scalable training framework to address these challenges. First, we introduce controllable task synthesis pipeline to synthesize multi-hop research tasks from timestamped visual evidence while filtering text-only shortcuts. Second, we build a field-aligned local video simulator that preserves deployment-facing search and watch interactions while accelerating video search by a factor of 34.5-64.6. Third, we introduce Retrieval-Domain-Randomized GRPO (RDR-GRPO), which diversifies candidate rankings, distractors, metadata, and result structure during training to reduce overfitting to simulated retrieval. On Video-BrowseComp, the VideoResearchAgent trained using Qwen3.5-4B achieves 40.48% accuracy, comparable to Gemini-3-Flash-Preview, while reducing cumulative API-token consumption by 74.9% relative to the untrained model. Together, these results establish an accurate and efficient training recipe for open-web video research.

cs.AI↗

Resource-Efficient Speculative Decoding for Long-Context LLM Serving

Speculative decoding reduces sequential Target model calls by verifying multiple tokens from the Draft model in parallel. Yet KV Cache growth limits long-context serving under constrained GPU memory. Offloading KV to CPU memory relieves this pressure. However, existing offloading schemes restore the full KV history before attention and fail to fully exploit the benefits of KV sharing across queries within a verification round. Existing parallel speculative decoding methods also overlook idle GPU compute capacity while memory-bandwidth-bound Target verification waits for historical KV. We present SpecStream, a speculative decoding system that begins verification without waiting for the full KV history to be restored and exploits compute bubbles during KV transfers for concurrent drafting on the same GPUs. It offloads only Target-committed history, keeping candidate rollback local to the GPUs. Each streamed KV chunk serves all queries in the round, with online softmax preserving full attention. Target-priority scheduling controls Draft concurrent execution under resource limits to constrain interference with Target verification. Experiments show that SpecStream maintains task quality close to SGLang speculative decoding while supporting more concurrent requests under limited GPU memory. Across different datasets, it achieves average throughput speedups of 1.41$\times$ and 1.32$\times$ over the offloading baseline for Qwen3 and InternLM2.5, respectively. Compared with parallel speculative decoding on separate Target and Draft GPUs, SpecStream improves output throughput per GPU by an average of 55.4%.

cs.AR↗

Higgsino Dark Matter Interpretation of the LZ High-Recoil Event in the GNMSSM with TeV-Scale Gauginos

The nuclear recoil event at approximately 248 keV reported by the LUX-ZEPLIN collaboration motivates an investigation of endothermic dark matter scattering. We study this within the General Next-to-Minimal Supersymmetric Standard Model (GNMSSM), with Higgsino-dominated neutralino DM undergoing the $Z$-mediated transition $\widetildeχ_1^0N\to\widetildeχ_2^0N$. In the conventional thermal Higgsino limit of the MSSM, the observed relic abundance selects a mass near 1.1 TeV, while a neutralino splitting of a few hundred keV typically requires gaugino masses of order $10^7$ GeV. In the GNMSSM, Higgsino-Singlino mixing introduces an additional contribution to the splitting that can cancel the gaugino-induced contribution, allowing sub-MeV splitting with multi-TeV gauginos. This mixing also modifies the inelastic scattering coupling and annihilation rates, while coannihilation with sleptons provides freedom in obtaining the observed relic abundance. We present six benchmark points with DM masses of 0.6-1.1 TeV, neutralino splittings of 333-350 keV, and gaugino masses of 2-5 TeV. These points reproduce the observed relic abundance and satisfy direct-detection, Higgs, flavor, and collider constraints. Within the Standard Halo Model and extended-likelihood analysis, all six points yield $Δχ^2<1$ relative to the best fit. Our results show how the GNMSSM can accommodate the LZ high-recoil event without an ultraheavy gaugino sector. A quantitative assessment of solar-capture and neutrino-telescope constraints remains necessary for establishing viability.

hep-ph↗

Preference-Drift-Aware Subsequence Learning and Hierarchical Context Fusion for Long-Sequence Generative Recommendation

Long-sequence generative recommendation methods autoregressively model the user's interaction sequence to generate the next-item representation. Existing methods generally fall into two categories: efficient full-sequence modeling and target-aware context retrieval. Our experiments reveal that as the sequence length increases, the former incurs steadily growing computational cost while its accuracy gains quickly saturate and even degrade due to noise; the latter, though shortening the input sequence, is susceptible to noise that is semantically consistent yet preference-inconsistent, as well as to incomplete contexts. Both paradigms ignore the dynamic changes of user preferences and the cross-subsequence dependencies when handling historical information, thereby limiting accuracy and efficiency. To address these issues, we propose a preference-drift-aware subsequence learning and hierarchical context fusion for long-sequence generative recommendation. Specifically, we learn differentiable soft subsequence boundaries using multidimensional preference-drift information and aggregate items within each subsequence into preference-coherent representations via linear attention with soft assignment weights, thereby circumventing the expense of full-sequence attention. A cross-attention mechanism is then employed to capture dependencies between recent interactions and relevant subsequence contexts, mitigating noise in learning recent-item representations. Finally, a gated fusion mechanism adaptively combines the recent-item representation with the global subsequence context, allowing the resulting target representation to encode both recent and long-term preferences. Extensive experiments demonstrate that our method consistently outperforms existing baselines in both recommendation accuracy and computational efficiency.

cs.IR↗

Monitoring Hierarchies in Knowledge Production

We study peer monitoring design in knowledge production. A principal leads agents who work on different but related tasks. By working on their own tasks, agents acquire information that is useful for evaluating their peers' performance. We consider robust contracts under which effort by all agents is the unique rationalizable outcome. The optimal contract induces a hierarchy of monitoring authority: agents easier for the principal to monitor directly are assigned greater authority to evaluate other agents. Task diversity improves information value but weakens peer monitoring. This tension distorts optimal public task assignment toward the principal's core expertise. Confidential random assignment relaxes this distortion by decoupling information production from the perceived monitoring structure.

econ.TH↗

ReCite: Agentic Reasoning for Faithful Citation

Accurate citations are the foundation of academic writing, tracing intellectual origins and substantiating core claims. However, manually navigating the growing volume of scientific literature is increasingly difficult, prompting reliance on automatic citation recommendation. While modern retrieval-augmented architectures have largely mitigated the fabrication of non-existent papers, current systems relying on semantic similarity struggle with misattribution, often citing authentic papers that fail to logically support the author's claim. To address this challenge, we argue that accurate citation requires a shift from similarity-based search to active, claim-level reasoning. We propose ReCite, a decoupled agentic framework that orchestrates location perception, intent-aware query planning, and reflective verification. Trained on synthesized reasoning trajectories, our agent verifies claim-evidence consistency and triggers self-correction loops when retrieved candidates lack logical support. Experiments demonstrate that our lightweight framework outperforms state-of-the-art massive generative models in strict citation accuracy. By grounding literature matching in verifiable logic rather than semantic overlap, ReCite establishes a reliable foundation for automated academic writing.

cs.CL↗