SearcharxivSearch

arXiv subjects

Yihong Wang

Publications and source records attributed to Yihong Wang.

At least 19 recordsLinked to original sources

FMC-DETR: Frequency-Decoupled Multi-Domain Coordination for Aerial-View Object Detection

Remote sensing object detection is a critical technology for real-world applications such as natural resource monitoring, traffic management, and UAV-based rescue. Detecting tiny objects in high-resolution aerial imagery remains challenging due to weak visual cues and insufficient global context modeling in complex scenes. Existing methods often suffer from delayed contextual interaction and limited nonlinear reasoning, which restrict their ability to effectively refine shallow representations and ultimately lead to suboptimal performance. To address these challenges, we propose FMC-DETR, a frequency-decoupled fusion framework for aerial-view object detection. First, we propose the Wavelet Kolmogorov-Arnold Transformer (WeKat) backbone, which employs cascaded wavelet transforms to enhance global low-frequency structure perception in shallow features while preserving fine-grained details, and further leverages Kolmogorov-Arnold networks for adaptive nonlinear modeling of multi-scale dependencies. Second, we introduce the Multi-Domain Feature Coordination (MDFC) module, which refines cross-scale fused representations through partial-channel spatial, spectral, and structural coordination, thereby strengthening small-object-related feature responses in cluttered scenes. Finally, we design the Compact Partial Fusion (CPF) module, which performs compact multi-branch aggregation with progressive partial refinement to improve feature diversity and multi-scale interaction while preserving stable information flow and reducing redundant perturbation. Extensive experiments across multiple remote sensing benchmarks demonstrate that FMC-DETR achieves state-of-the-art performance and significantly outperforming the baseline detector. Code is available at https://github.com/bloomingvision/FMC-DETR.

cs.CV

Algebraic Consistency and Explicit Construction of One-Loop BCJ Numerators of Yang-Mills and Related Theories

We study the algebraic structure of one-loop BCJ numerators in Yang-Mills and related theories. Starting from the propagator matrix that connects colour-ordered integrands to numerators, we identify the consistency conditions that ensure the existence of Jacobi-satisfying numerator solutions and determine the unique construction. The relation between one-loop numerators and forward-limit tree numerators is clarified, together with the additional physical conditions required for a consistent double-copy interpretation. We propose a two-step expansion strategy for obtaining explicit one-loop numerators. The Yang-Mills integrand is first decomposed into scalar-loop Yang-Mills-scalar building blocks, which are then expanded into bi-adjoint scalar integrands. We derive explicit results for up to three external gluons, showing how the kinematic consistency conditions uniquely determine the coefficients in each case. Similar results for Einstein-Yang-Mills and gravity amplitudes are also presented.

hep-th

Making Language Model a Hierarchical Classifier

Decoder-only language models, such as GPT and LLaMA, generally decode on the last layer. Motivated by human's hierarchical thinking capability, we propose that a hierarchical decoder architecture could be built with different layers decoding texts simultaneously. Due to limited time and computationally resources, we choose to adapt a pretrained language model into this form of hierarchical decoder. Language heads of the last layer are copied to different selected intermediate layers, and fine-tuned with different task inputs. By thorough experiments, we validate that these selective intermediate layers could be adapted to speak meaningful and reasonable contents, and this paradigm of hierarchical decoder can obtain state-of-the-art performances on multiple tasks such as hierarchical text classification, classification-guided generation, and hierarchical text generation. HdLM outperforms all baselines on WoS, DBpedia, ESconv, EmpatheticDialogues, and several cognitive tests. We also provide thorough theoretical analysis to validate the convergence and computational savings of our methodology. This study suggests the possibility of a generalized hierarchical reasoner, pretraining from scratch.

cs.CL

Predicting Neoadjuvant Chemotherapy Response in Triple-Negative Breast Cancer Using Pre-Treatment Histopathologic Images

Triple-negative breast cancer (TNBC) remains a major clinical challenge due to its aggressive behavior and lack of targeted therapies. Accurate early prediction of response to neoadjuvant chemotherapy (NACT) is essential for guiding personalized treatment strategies and improving patient outcomes. In this study, we present an attention-based multiple instance learning (MIL) framework designed to predict pathologic complete response (pCR) directly from pre-treatment hematoxylin and eosin (H&E)-stained biopsy slides. The model was trained on a retrospective in-house cohort of 174 TNBC patients and externally validated on an independent cohort (n = 30). It achieved a mean area under the curve (AUC) of 0.85 during five-fold cross-validation and 0.78 on external testing, demonstrating robust predictive performance and generalizability. To enhance model interpretability, attention maps were spatially co-registered with multiplex immuno-histochemistry (mIHC) data stained for PD-L1, CD8+ T cells, and CD163+ macrophages. The attention regions exhibited moderate spatial overlap with immune-enriched areas, with mean Intersection over Union (IoU) scores of 0.47 for PD-L1, 0.45 for CD8+ T cells, and 0.46 for CD163+ macrophages. The presence of these biomarkers in high-attention regions supports their biological relevance to NACT response in TNBC. This not only improves model interpretability but may also inform future efforts to identify clinically actionable histological biomarkers directly from H&E-stained biopsy slides, further supporting the utility of this approach for accurate NACT response prediction and advancing precision oncology in TNBC.

q-bio.QM

HEFT Numerators from Kinematic Algebra

We derive the kinematic numerator factors for heavy-mass effective field theory from the field theory limit of the string theory vertex operator kinematic algebra introduced in arXiv:1806.09584. The kinematic numerators are derived as correlators of nested commutators of gluon vertex operators evaluated between massive tachyonic vertex operators. The resulting numerators are given by products of structure constants of the vertex operator algebra which yield gauge invariant expressions. The computation of the nested commutators leads to a natural organisation in the form of rooted trees, endowed with an order that facilitates the enumeration of the various contributions. This kinematic algebra gives a string theory understanding of the field theory fusion rules for constructing the heavy-mass effective field theory numerator of arXiv:2104.11206 and arXiv:2111.15649.

hep-th

LaMsS: When Large Language Models Meet Self-Skepticism

Hallucination is a major challenge for large language models (LLMs), preventing their further application in some fields. The skeptical thinking of humankind could be useful for LLMs to self-cognition, self-reflection and alleviate their hallucinations. Inspired by this consideration, we propose a novel approach called LaMsS, which combines the semantic understanding capability of LLMs with self-skepticism. By introducing a series of skepticism tokens and augmenting them into the vocabulary, we conduct both pertaining and finetuning, which allow the LLM to decode each normal token followed by a skeptical token, representing different skepticism levels. By calculating the response skepticism given a query, one can define a new self-aware LLM which is only willing to answer with relative lower skepticism level than the threshold. By examining the accuracy, AUC and AP of willingly answering questions, we demonstrate that LaMsS achieves better performance than baselines on both multi-choice questions and open-domain question-answering benchmarks, and can generalize to multi-task and out-of-domain settings. Our study sheds some lights on the self-skepticism modeling on further artificial intelligence. Project code and model checkpoints can be found in https://anonymous.4open.science/r/SM-1E76.

cs.CL

Large Language Model Can Be a Foundation for Hidden Rationale-Based Retrieval

Despite the recent advancement in Retrieval-Augmented Generation (RAG) systems, most retrieval methodologies are often developed for factual retrieval, which assumes query and positive documents are semantically similar. In this paper, we instead propose and study a more challenging type of retrieval task, called hidden rationale retrieval, in which query and document are not similar but can be inferred by reasoning chains, logic relationships, or empirical experiences. To address such problems, an instruction-tuned Large language model (LLM) with a cross-encoder architecture could be a reasonable choice. To further strengthen pioneering LLM-based retrievers, we design a special instruction that transforms the retrieval task into a generative task by prompting LLM to answer a binary-choice question. The model can be fine-tuned with direct preference optimization (DPO). The framework is also optimized for computational efficiency with no performance degradation. We name this retrieval framework by RaHoRe and verify its zero-shot and fine-tuned performance superiority on Emotional Support Conversation (ESC), compared with previous retrieval works. Our study suggests the potential to employ LLM as a foundation for a wider scope of retrieval tasks. Our codes, models, and datasets are available on https://github.com/flyfree5/LaHoRe.

cs.IR

Building Momentum Kernel from Shapovalov Form

These notes are an extended version of the talks given by the authors at the XIV International Workshop on Lie Theory and Its Applications in Physics, Sofia, Bulgaria, 20-26 June 2021. The concise version published in the proceedings of the workshop contains additional discussions for the $q$-deformed scenario: \noindent\href{https://link.springer.com/chapter/10.1007/978-981-19-4751-3_23}{https://link.springer.com/chapter/10.1007/978-981-19-4751-3\_23}. In these notes we identify KLT kernel with the Shapovalov form on Verma module with its highest/lowest weight given by the reference momentum and rest of the momenta as roots. We then take a step forward and show how the Feynman diagrams emerge naturally as the Shapovalov duals of the Verma module basis vectors. We show such algebraic construct offers a compact expression for the BCJ numerators. Explicit examples are shown for the nonlinear sigma model and the HEFT pre-numerators.

hep-th

Cluster Alphabets from Generalized Worldsheets: A Geometric Approach to Finite Types

We provide a systematic derivation of cluster alphabets of finite types. The construction is based on a geometric realization of the generalized worldsheets by gluing and folding a pair of polygons. The cross ratios of the worldsheet z variables are evolved using the Y-system equations. By a new gauge choice, we obtain a simpler set of cluster alphabets than the known ones.

hep-th

LB-KBQA: Large-language-model and BERT based Knowledge-Based Question and Answering System

Generative Artificial Intelligence (AI), because of its emergent abilities, has empowered various fields, one typical of which is large language models (LLMs). One of the typical application fields of Generative AI is large language models (LLMs), and the natural language understanding capability of LLM is dramatically improved when compared with conventional AI-based methods. The natural language understanding capability has always been a barrier to the intent recognition performance of the Knowledge-Based-Question-and-Answer (KBQA) system, which arises from linguistic diversity and the newly appeared intent. Conventional AI-based methods for intent recognition can be divided into semantic parsing-based and model-based approaches. However, both of the methods suffer from limited resources in intent recognition. To address this issue, we propose a novel KBQA system based on a Large Language Model(LLM) and BERT (LB-KBQA). With the help of generative AI, our proposed method could detect newly appeared intent and acquire new knowledge. In experiments on financial domain question answering, our model has demonstrated superior effectiveness.

cs.CL

ITRE: Low-light Image Enhancement Based on Illumination Transmission Ratio Estimation

Noise, artifacts, and over-exposure are significant challenges in the field of low-light image enhancement. Existing methods often struggle to address these issues simultaneously. In this paper, we propose a novel Retinex-based method, called ITRE, which suppresses noise and artifacts from the origin of the model, prevents over-exposure throughout the enhancement process. Specifically, we assume that there must exist a pixel which is least disturbed by low light within pixels of same color. First, clustering the pixels on the RGB color space to find the Illumination Transmission Ratio (ITR) matrix of the whole image, which determines that noise is not over-amplified easily. Next, we consider ITR of the image as the initial illumination transmission map to construct a base model for refined transmission map, which prevents artifacts. Additionally, we design an over-exposure module that captures the fundamental characteristics of pixel over-exposure and seamlessly integrate it into the base model. Finally, there is a possibility of weak enhancement when inter-class distance of pixels with same color is too small. To counteract this, we design a Robust-Guard module that safeguards the robustness of the image enhancement process. Extensive experiments demonstrate the effectiveness of our approach in suppressing noise, preventing artifacts, and controlling over-exposure level simultaneously. Our method performs superiority in qualitative and quantitative performance evaluations by comparing with state-of-the-art methods.

cs.CV

Notes on Worldsheet-Like Variables for Cluster Configuration Spaces

We continue the exploration of various appearances of cluster algebras in scattering amplitudes and related topics in physics. The cluster configuration spaces generalize the familiar moduli space ${\mathcal M}_{0,n}$ to finite-type cluster algebras. We study worldsheet-like variables, which for classical types have also appeared in the study of the symbol alphabet of Feynman integrals. We provide a systematic derivation of these variables from $Y$-systems, which allows us to express the dihedral coordinates in terms of them and to write the corresponding cluster string integrals in compact forms. We mainly focus on the $D_n$ type and show how to reach the boundaries of the configuration space, and write the saddle-point equations in terms of these variables. Moreover, these variables make it easier to study various topological properties of the space using a finite-field method. We propose conjectures about quasi-polynomial point count, dimensions of cohomology, and the number of saddle points for the $D_n$ space up to $n=10$, which greatly extend earlier results.

hep-th

Gradient Domain Weighted Guided Image Filtering

Guided image filter is a well-known local filter in image processing. However, the presence of halo artifacts is a common issue associated with this type of filter. This paper proposes an algorithm that utilizes gradient information to accurately identify the edges of an image. Furthermore, the algorithm uses weighted information to distinguish flat areas from edge areas, resulting in sharper edges and reduced blur in flat areas. This approach mitigates the excessive blurring near edges that often leads to halo artifacts. Experimental results demonstrate that the proposed algorithm significantly suppresses halo artifacts at the edges, making it highly effective for both image denoising and detail enhancement.

cs.CV

Adaptive Gradient Descent Methods for Computing Implied Volatility

In this paper, a new numerical method based on adaptive gradient descent optimizers is provided for computing the implied volatility from the Black-Scholes (B-S) option pricing model. It is shown that the new method is more accurate than the close form approximation. Compared with the Newton-Raphson method, the new method obtains a reliable rate of convergence and tends to be less sensitive to the beginning point.

q-fin.CP

Baseline-free scanned-wavelength direct absorption spectroscopy: theoretical analysis and experimental validation

Applicability and accuracy of traditional scanned-wavelength direct absorption spectroscopy (SDAS) diagnostic method is largely affected by combustion state such as temperature and pressure. To resolve this problem, an innovative baseline-free scanned-wavelength direct absorption spectroscopy (BF-SDAS) method is proposed in this work. This method does not need the zero-absorption regions for baseline fitting and can exclude the influence of baseline fitting error on the final result. It is especially suitable for the cases when the scanning range is too narrow or the absorption linewidth is too large to acquire the baseline. In this paper, the BF-SDAS is first derived and theoretically analyzed based on the Fourier analysis, and then the accuracy of this method is validated by measuring the concentration of H2O molecules in a static gas absorption cell at room temperature.

physics.ins-det

On the very accurate evaluation of the Voigt/complex error function with small imaginary argument

A rapidly convergent series, based on Taylor expansion of the imaginary part of the complex error function, is presented for highly accurate approximation of the Voigt/complex error function with small imaginary argument (Y less than 0.1). Error analysis and run-time tests in double-precision computing platform reveals that in the real and imaginary parts the proposed algorithm provides average accuracy exceeding 10^-15 and 10^-16, respectively, and the calculation speed is as fast as that of reported in recent publications. An optimized MATLAB code providing rapid computation with high accuracy is presented.

cs.MS

Super-accuracy calculation for the width of a Voigt profile

A simple approximation scheme to describe the width of the Voigt profile as a function of the relative contributions of Gaussian and Lorentzian broadening is presented. The proposed approximation scheme is highly accurate and provides accuracy better than 10^-17 for arbitrary aLaG ratios. In particular, the accuracy reaches an astonishing 10^-34 (quadruple precision) in the domain aLaG less than 0.2371 and aLaG greater than 33.8786.

physics.atom-ph

An accurate algorithm for calibration-free wavelength modulation spectroscopy based on even-order harmonics

This paper proposes an accurate algorithm to implement calibration-free wavelength modulation spectroscopy based on even-order harmonics. The proposed algorithm, analytically deduced from a much more accurate Voigt function model, enabling not only speedy measurement down to milliseconds, but also a general suitability for various degrees of line-shape broadening. The proposed method is validated by condition-controlled experiment, indicating calculation of gas temperature with the relative error less than 2.4% in the experiments.

physics.ins-det