Search arXiv⌕ Search

arXiv subjects

Yang Li

Publications and source records attributed to Yang Li.

At least 523 records · Page 29Linked to original sources

UAVD-Mamba: Deformable Token Fusion Vision Mamba for Multimodal UAV Detection

Unmanned Aerial Vehicle (UAV) object detection has been widely used in traffic management, agriculture, emergency rescue, etc. However, it faces significant challenges, including occlusions, small object sizes, and irregular shapes. These challenges highlight the necessity for a robust and efficient multimodal UAV object detection method. Mamba has demonstrated considerable potential in multimodal image fusion. Leveraging this, we propose UAVD-Mamba, a multimodal UAV object detection framework based on Mamba architectures. To improve geometric adaptability, we propose the Deformable Token Mamba Block (DTMB) to generate deformable tokens by incorporating adaptive patches from deformable convolutions alongside normal patches from normal convolutions, which serve as the inputs to the Mamba Block. To optimize the multimodal feature complementarity, we design two separate DTMBs for the RGB and infrared (IR) modalities, with the outputs from both DTMBs integrated into the Mamba Block for feature extraction and into the Fusion Mamba Block for feature fusion. Additionally, to improve multiscale object detection, especially for small objects, we stack four DTMBs at different scales to produce multiscale feature representations, which are then sent to the Detection Neck for Mamba (DNM). The DNM module, inspired by the YOLO series, includes modifications to the SPPF and C3K2 of YOLOv11 to better handle the multiscale features. In particular, we employ cross-enhanced spatial attention before the DTMB and cross-channel attention after the Fusion Mamba Block to extract more discriminative features. Experimental results on the DroneVehicle dataset show that our method outperforms the baseline OAFA method by 3.6% in the mAP metric. Codes will be released at https://github.com/GreatPlum-hnu/UAVD-Mamba.git.

cs.CV↗

Brain-inspired and Self-based Artificial Intelligence

The question "Can machines think?" and the Turing Test to assess whether machines could achieve human-level intelligence is one of the roots of AI. With the philosophical argument "I think, therefore I am", this paper challenge the idea of a "thinking machine" supported by current AIs since there is no sense of self in them. Current artificial intelligence is only seemingly intelligent information processing and does not truly understand or be subjectively aware of oneself and perceive the world with the self as human intelligence does. In this paper, we introduce a Brain-inspired and Self-based Artificial Intelligence (BriSe AI) paradigm. This BriSe AI paradigm is dedicated to coordinating various cognitive functions and learning strategies in a self-organized manner to build human-level AI models and robotic applications. Specifically, BriSe AI emphasizes the crucial role of the Self in shaping the future AI, rooted with a practical hierarchical Self framework, including Perception and Learning, Bodily Self, Autonomous Self, Social Self, and Conceptual Self. The hierarchical framework of the Self highlights self-based environment perception, self-bodily modeling, autonomous interaction with the environment, social interaction and collaboration with others, and even more abstract understanding of the Self. Furthermore, the positive mutual promotion and support among multiple levels of Self, as well as between Self and learning, enhance the BriSe AI's conscious understanding of information and flexible adaptation to complex environments, serving as a driving force propelling BriSe AI towards real Artificial General Intelligence.

cs.AI↗

Continual Adaptation: Environment-Conditional Parameter Generation for Object Detection in Dynamic Scenarios

In practice, environments constantly change over time and space, posing significant challenges for object detectors trained based on a closed-set assumption, i.e., training and test data share the same distribution. To this end, continual test-time adaptation has attracted much attention, aiming to improve detectors' generalization by fine-tuning a few specific parameters, e.g., BatchNorm layers. However, based on a small number of test images, fine-tuning certain parameters may affect the representation ability of other fixed parameters, leading to performance degradation. Instead, we explore a new mechanism, i.e., converting the fine-tuning process to a specific-parameter generation. Particularly, we first design a dual-path LoRA-based domain-aware adapter that disentangles features into domain-invariant and domain-specific components, enabling efficient adaptation. Additionally, a conditional diffusion-based parameter generation mechanism is presented to synthesize the adapter's parameters based on the current environment, preventing the optimization from getting stuck in local optima. Finally, we propose a class-centered optimal transport alignment method to mitigate catastrophic forgetting. Extensive experiments conducted on various continuous domain adaptive object detection tasks demonstrate the effectiveness. Meanwhile, visualization results show that the representation extracted by the generated parameters can capture more object-related information and strengthen the generalization ability.

cs.CV↗

Narrow beam and low-sidelobe two-dimensional beam steering on thin-film lithium niobate optical phased array

Optical beam steering has become indispensable in free-space optical communications, light detection and ranging (LiDAR), mapping, and projection. Optical phased array (OPA) leads this field, yet conventional versions still suffer from a narrow steering field of view (FOV), insufficient sidelobe suppression, and limited angular resolution. Thin-film lithium niobate (LN), with its strong Pockels electro-optic (EO) effect, offers a powerful integrated-photonics platform to overcome these limitations. Here we present a two-dimensional (2D) EO-steered OPA based on a non-uniformly spaced X-cut thin-film LN ridge-waveguide array. A superlattice ridge design suppresses optical crosstalk to -20 dB, enabling low-sidelobe far-field radiation. Using particle swarm optimization (PSO) method, we transform a uniformly spaced array into an optimized non-uniform design, largely improving angular resolution while maintaining sidelobe suppression. When combined with a single-radiating trapezoidal end-fire emitter incorporating an etched grating, the device produces a main-lobe beam width of 0.99 degree*0.63 degree from an aperture of only 140 um*250 um, achieving a wide 2D steering range of 47 degree*9.36 degree with a 20 dB sidelobe-suppression ratio. These results highlight thin-film LN OPA as a compelling route toward heterogeneous, compact, and high-performance EO beam-steering modules and ultra-miniaturized optical modulators.

physics.optics↗

Mixture of Experts-augmented Deep Unfolding for Activity Detection in IRS-aided Systems

In the realm of activity detection for massive machine-type communications, intelligent reflecting surfaces (IRS) have shown significant potential in enhancing coverage for devices lacking direct connections to the base station (BS). However, traditional activity detection methods are typically designed for a single type of channel model, which does not reflect the complexities of real-world scenarios, particularly in systems incorporating IRS. To address this challenge, this paper introduces a novel approach that combines model-driven deep unfolding with a mixture of experts (MoE) framework. By automatically selecting one of three expert designs and applying it to the unfolded projected gradient method, our approach eliminates the need for prior knowledge of channel types between devices and the BS. Simulation results demonstrate that the proposed MoE-augmented deep unfolding method surpasses the traditional covariance-based method and black-box neural network design, delivering superior detection performance under mixed channel fading conditions.

cs.LG↗

Kimi-VL Technical Report

We present Kimi-VL, an efficient open-source Mixture-of-Experts (MoE) vision-language model (VLM) that offers advanced multimodal reasoning, long-context understanding, and strong agent capabilities - all while activating only 2.8B parameters in its language decoder (Kimi-VL-A3B). Kimi-VL demonstrates strong performance across challenging domains: as a general-purpose VLM, Kimi-VL excels in multi-turn agent tasks (e.g., OSWorld), matching flagship models. Furthermore, it exhibits remarkable capabilities across diverse challenging vision language tasks, including college-level image and video comprehension, OCR, mathematical reasoning, and multi-image understanding. In comparative evaluations, it effectively competes with cutting-edge efficient VLMs such as GPT-4o-mini, Qwen2.5-VL-7B, and Gemma-3-12B-IT, while surpassing GPT-4o in several key domains. Kimi-VL also advances in processing long contexts and perceiving clearly. With a 128K extended context window, Kimi-VL can process diverse long inputs, achieving impressive scores of 64.5 on LongVideoBench and 35.1 on MMLongBench-Doc. Its native-resolution vision encoder, MoonViT, further allows it to see and understand ultra-high-resolution visual inputs, achieving 83.2 on InfoVQA and 34.5 on ScreenSpot-Pro, while maintaining lower computational cost for common tasks. Building upon Kimi-VL, we introduce an advanced long-thinking variant: Kimi-VL-Thinking-2506. Developed through long chain-of-thought (CoT) supervised fine-tuning (SFT) and reinforcement learning (RL), the latest model exhibits strong long-horizon reasoning capabilities (64.0 on MMMU, 46.3 on MMMU-Pro, 56.9 on MathVision, 80.1 on MathVista, 65.2 on VideoMMMU) while obtaining robust general abilities. Code and models are publicly accessible at https://github.com/MoonshotAI/Kimi-VL.

cs.CV↗

Auto-Regressive Surface Cutting

Surface cutting is a fundamental task in computer graphics, with applications in UV parameterization, texture mapping, and mesh decomposition. However, existing methods often produce technically valid but overly fragmented atlases that lack semantic coherence. We introduce SeamGPT, an auto-regressive model that generates cutting seams by mimicking professional workflows. Our key technical innovation lies in formulating surface cutting as a next token prediction task: sample point clouds on mesh vertices and edges, encode them as shape conditions, and employ a GPT-style transformer to sequentially predict seam segments with quantized 3D coordinates. Our approach achieves exceptional performance on UV unwrapping benchmarks containing both manifold and non-manifold meshes, including artist-created, and 3D-scanned models. In addition, it enhances existing 3D segmentation tools by providing clean boundaries for part decomposition.

cs.GR↗

Relativistic dynamics of charmonia in strong magnetic fields

We investigate the properties of charmonium systems in strong external magnetic fields using a relativistic light-front Hamiltonian approach within the Basis Light-Front Quantization (BLFQ) framework. By solving the eigenvalue problem for the invariant mass squared operator with confinement potentials and one-gluon-exchange interactions, we obtain the mass spectrum and wave functions under varying magnetic fields. Our results reveal significant spectral modifications via the Zeeman effect, including $η_c$-$J/ψ$ mixing and magnetic sublevel splitting. Momentum density analysis demonstrates wave function deformation, with transverse momentum broadening and longitudinal narrowing under strong fields, alongside structural shifts in parton distributions such as double-hump profiles in excited states. Relativistic corrections and center-of-mass coupling critically drive these dynamics, highlighting the necessity of a relativistic framework for QCD bound states in extreme magnetic environments.

hep-ph↗

Ring-lite: Scalable Reasoning via C3PO-Stabilized Reinforcement Learning for LLMs

We present Ring-lite, a Mixture-of-Experts (MoE)-based large language model optimized via reinforcement learning (RL) to achieve efficient and robust reasoning capabilities. Built upon the publicly available Ling-lite model, a 16.8 billion parameter model with 2.75 billion activated parameters, our approach matches the performance of state-of-the-art (SOTA) small-scale reasoning models on challenging benchmarks (e.g., AIME, LiveCodeBench, GPQA-Diamond) while activating only one-third of the parameters required by comparable models. To accomplish this, we introduce a joint training pipeline integrating distillation with RL, revealing undocumented challenges in MoE RL training. First, we identify optimization instability during RL training, and we propose Constrained Contextual Computation Policy Optimization(C3PO), a novel approach that enhances training stability and improves computational throughput via algorithm-system co-design methodology. Second, we empirically demonstrate that selecting distillation checkpoints based on entropy loss for RL training, rather than validation metrics, yields superior performance-efficiency trade-offs in subsequent RL training. Finally, we develop a two-stage training paradigm to harmonize multi-domain data integration, addressing domain conflicts that arise in training with mixed dataset. We will release the model, dataset, and code.

cs.CL↗

KG-FGNN: Knowledge-guided GNN Foundation Model for Fertilisation-oriented Soil GHG Flux Prediction

Precision soil greenhouse gas (GHG) flux prediction is essential in agricultural systems for assessing environmental impacts, developing emission mitigation strategies and promoting sustainable agriculture. Due to the lack of advanced sensor and network technologies on majority of farms, there are challenges in obtaining comprehensive and diverse agricultural data. As a result, the scarcity of agricultural data seriously obstructs the application of machine learning approaches in precision soil GHG flux prediction. This research proposes a knowledge-guided graph neural network framework that addresses the above challenges by integrating knowledge embedded in an agricultural process-based model and graph neural network techniques. Specifically, we utilise the agricultural process-based model to simulate and generate multi-dimensional agricultural datasets for 47 countries that cover a wide range of agricultural variables. To extract key agricultural features and integrate correlations among agricultural features in the prediction process, we propose a machine learning framework that integrates the autoencoder and multi-target multi-graph based graph neural networks, which utilises the autoencoder to selectively extract significant agricultural features from the agricultural process-based model simulation data and the graph neural network to integrate correlations among agricultural features for accurately predict fertilisation-oriented soil GHG fluxes. Comprehensive experiments were conducted with both the agricultural simulation dataset and real-world agricultural dataset to evaluate the proposed approach in comparison with well-known baseline and state-of-the-art regression methods. The results demonstrate that our proposed approach provides superior accuracy and stability in fertilisation-oriented soil GHG prediction.

cs.LG↗

MMWiLoc: A Multi-Sensor Dataset and Robust Device-Free Localization Method Using Commercial Off-The-Shelf Millimeter Wave Wi-Fi Devices

Device-free Wi-Fi sensing has numerous benefits in practical settings, as it eliminates the requirement for dedicated sensing devices and can be accomplished using current low-cost Wi-Fi devices. With the development of Wi-Fi standards, millimeter wave Wi-Fi devices with 60GHz operating frequency and up to 4GHz bandwidth have become commercially available. Although millimeter wave Wi-Fi presents great promise for Device-Free Wi-Fi sensing with increased bandwidth and beam-forming ability, there still lacks a method for localization using millimeter wave Wi-Fi. Here, we present two major contributions: First, we provide a comprehensive multi-sensor dataset that synchronously captures human movement data from millimeter wave Wi-Fi, 2.4GHz Wi-Fi, and millimeter wave radar sensors. This dataset enables direct performance comparisons across different sensing modalities and facilitates reproducible researches in indoor localization. Second, we introduce MMWiLoc, a novel localization method that achieves centimeter-level precision with low computational cost. MMWiLoc incorporates two components: beam pattern calibration using Expectation Maximization and target localization through Multi-Scale Compression Sensing. The system processes beam Signal-to-Noise Ratio (beamSNR) information from the beam-forming process to determine target Angle of Arrival (AoA), which is then fused across devices for localization. Our extensive evaluation demonstrates that MMWiLoc achieves centimeter-level precision, outperforming 2.4GHz Wi-Fi systems while maintaining competitive performance with high-precision radar systems. The dataset and examples processing code will be released after this paper is accepted at https://github.com/wowoyoho/MMWiLoc.

eess.SP↗

Shapley Machine: A Game-Theoretic Framework for N-Agent Ad Hoc Teamwork

Open multi-agent systems are increasingly important in modeling real-world applications, such as smart grids, swarm robotics, etc. In this paper, we aim to investigate a recently proposed problem for open multi-agent systems, referred to as n-agent ad hoc teamwork (NAHT), where only a number of agents are controlled. Existing methods tend to be based on heuristic design and consequently lack theoretical rigor and ambiguous credit assignment among agents. To address these limitations, we model and solve NAHT through the lens of cooperative game theory. More specifically, we first model an open multi-agent system, characterized by its value, as an instance situated in a space of cooperative games, generated by a set of basis games. We then extend this space, along with the state space, to accommodate dynamic scenarios, thereby characterizing NAHT. Exploiting the justifiable assumption that basis game values correspond to a sequence of n-step returns with different horizons, we represent the state values for NAHT in a form similar to $λ$-returns. Furthermore, we derive Shapley values to allocate state values to the controlled agents, as credits for their contributions to the ad hoc team. Different from the conventional approach to shaping Shapley values in an explicit form, we shape Shapley values by fulfilling the three axioms uniquely describing them, well defined on the extended game space describing NAHT. To estimate Shapley values in dynamic scenarios, we propose a TD($λ$)-like algorithm. The resulting reinforcement learning (RL) algorithm is referred to as Shapley Machine. To our best knowledge, this is the first time that the concepts from cooperative game theory are directly related to RL concepts. In experiments, we demonstrate the effectiveness of Shapley Machine and verify reasonableness of our theory.

cs.MA↗

Study of Stability and Consistency of EAS Thermal Neutron Detection at ENDA-64

Introduction:Electron-Neutron Detector Array (ENDA) is designed to measure thermal neutrons produced by hadronic interactions between cosmic ray extensive air showers (EAS) and the surrounding environment as well as electrons around the cores of EAS. ENDA is located within Large High Altitude Air Shower Observatory (LHAASO). ENDA was expanded from an initial 16 detectors to 64 detectors in April 2023, so called ENDA-64, and has been running alongside LHAASO. The stability and consistency of neutron detection are crucial for laying a solid foundation for subsequent data analysis and physical results. Methods:We obtain the stability by studying variations of event rate and thermal neutron rate in each cluster and the consistency by comparing distribution of number of thermal neutrons between clusters. Additionally, we investigate the specific influences of the rainy and dry seasons, as well as the presence or absence of sand cubes under the detectors, to examine the environmental factors affecting neutron measurement performance. Results:The calibration results indicate good consistency in thermal neutron detection across the clusters, with the maximum inconsistency of 6.85%. The maximum instability of event rate and thermal neutron rate over time are 4.68% and 11.0% respectively. The maximum inconsistency between the clusters without the sand cubes is 18%. The use of sand cubes is effective in protecting the target material from rainwater, and the sand cubes help the cluster to increase collection of neutrons generated by EAS events.

hep-ex↗

TextSquare: Scaling up Text-Centric Visual Instruction Tuning

Text-centric visual question answering (VQA) has made great strides with the development of Multimodal Large Language Models (MLLMs), yet open-source models still fall short of leading models like GPT4V and Gemini, partly due to a lack of extensive, high-quality instruction tuning data. To this end, we introduce a new approach for creating a massive, high-quality instruction-tuning dataset, Square-10M, which is generated using closed-source MLLMs. The data construction process, termed Square, consists of four steps: Self-Questioning, Answering, Reasoning, and Evaluation. Our experiments with Square-10M led to three key findings: 1) Our model, TextSquare, considerably surpasses open-source previous state-of-the-art Text-centric MLLMs and sets a new standard on OCRBench(62.2%). It even outperforms top-tier models like GPT4V and Gemini in 6 of 10 text-centric benchmarks. 2) Additionally, we demonstrate the critical role of VQA reasoning data in offering comprehensive contextual insights for specific questions. This not only improves accuracy but also significantly mitigates hallucinations. Specifically, TextSquare scores an average of 75.1% across four general VQA and hallucination evaluation datasets, outperforming previous state-of-the-art models. 3) Notably, the phenomenon observed in scaling text-centric VQA datasets reveals a vivid pattern: the exponential increase of instruction tuning data volume is directly proportional to the improvement in model performance, thereby validating the necessity of the dataset scale and the high quality of Square-10M.

cs.CV↗

Gradient flow in the kernel learning problem

This is a sequel to our paper `On the kernel learning problem'. We identify a canonical choice of Riemannian gradient flow, to find the stationary points in the kernel learning problem. In the presence of Gaussian noise variables, this flow enjoys the remarkable property of having a continuous family of Lyapunov functionals, and the interpretation is the automatic reduction of noise. PS. We include an extensive discussion in the postcript explaining the comparison with the 2-layer neural networks. Readers looking for additional motivations are encouraged to read the postscript immediately following the introduction.

math.OC↗

Automating Exploratory Multiomics Research via Language Models

This paper introduces PROTEUS, a fully automated system that produces data-driven hypotheses from raw data files. We apply PROTEUS to clinical proteogenomics, a field where effective downstream data analysis and hypothesis proposal is crucial for producing novel discoveries. PROTEUS uses separate modules to simulate different stages of the scientific process, from open-ended data exploration to specific statistical analysis and hypothesis proposal. It formulates research directions, tools, and results in terms of relationships between biological entities, using unified graph structures to manage complex research processes. We applied PROTEUS to 10 clinical multiomics datasets from published research, arriving at 360 total hypotheses. Results were evaluated through external data validation and automatic open-ended scoring. Through exploratory and iterative research, the system can navigate high-throughput and heterogeneous multiomics data to arrive at hypotheses that balance reliability and novelty. In addition to accelerating multiomic analysis, PROTEUS represents a path towards tailoring general autonomous systems to specialized scientific domains to achieve open-ended hypothesis generation from data.

cs.AI↗

Optimal Fluctuations for Nonlinear Chemical Reaction Systems with General Rate Law

This paper investigates optimal fluctuations for chemical reaction systems with N species, M reactions, and general rate law. In the limit of large volume, large fluctuations for such models occur with overwhelming probability in the vicinity of the so-called optimal path, which is a basic consequence of the Freidlin-Wentzell theory, and is vital in biochemistry as it unveils the almost deterministic mechanism concealed behind rare noisy phenomena such as escapes from the attractive domain of a stable state and transitions between different metastable states. In this study, an alternative description for optimal fluctuations is proposed in both non-stationary and stationary settings by means of a quantity called prehistory probability in the same setting, respectively. The evolution law of each of them is derived, showing their relationship with the time reversal of a specified family of probability distributions respectively. The law of large numbers and the central limit theorem for the reversed processes are then proved. In doing so, the prehistorical approach to optimal fluctuations for Langevin dynamics is naturally generalized to the present case, thereby suggesting a strong connection between optimal fluctuations and the time reversal of the chemical reaction model.

math.PR↗

Fourth- and higher-order finite element methods for the incompressible Navier-Stokes equations with Dirichlet boundary conditions

Inspired by the unconstrained pressure Poisson equation (PPE) formulation [Liu, Liu, \& Pego, Comm. Pure Appl. Math. 60 (2007): 1443-1487], we previously proposed the generic projection and unconstrained PPE (GePUP) formulation [Zhang, J. Sci. Comput. 67 (2016): 1134-1180] for numerically solving the incompressible Navier-Stokes equations (INSE) with no-slip boundary conditions. In GePUP, the main evolutionary variable does not have to be solenoidal with its divergence controlled by a heat equation. This work presents high-order finite-element solvers for the INSE under the framework of method-of-lines. Continuous Lagrange finite elements of equal order are utilized for the velocity and pressure finite element spaces to discretize the weak form of GePUP in space, while high-order implicit-explicit Runge-Kutta methods are then employed to treat the stiff diffusion term implicitly and the other terms explicitly. Due to the implicit treatment of the diffusion term, the time step size is only restricted by convection. The solver is efficient in that advancing the solution at each time step only involves solving a sequence of linear systems either on the velocity or on the pressure with geometric multigrid methods. Furthermore, the solver is enhanced with adaptive mesh refinement so that the multiple length scales and time scales in flows at moderate or high Reynolds numbers can be efficiently resolved. Numerical tests with various Reynolds numbers are performed for the single-vortex test, the lid-driven cavity, and the flow past a cylinder/sphere, demonstrating the high-order accuracy of GePUP-FEM both in time and in space and its capability of accurately and efficiently capturing the right physics. Moreover, our solver offers the flexibility in choosing velocity and pressure finite element spaces and is free of the standard inf-sup condition.

math.NA↗