Searcharxiv⌕ Search

arXiv subjects

Zhiqiang Wei

Publications and source records attributed to Zhiqiang Wei.

At least 37 records · Page 2Linked to original sources
arXiv2025

TagRouter: Learning Route to LLMs through Tags for Open-Domain Text Generation Tasks

Model routing allocates queries to the suitable model, improving system performance while reducing costs. However, existing routing methods face practical limitations that hinder scalability in large-scale applications and struggle to keep up with the rapid growth of the large language model (LLM) ecosystem. To tackle these challenges, we propose TagRouter, a training-free model routing method designed to optimize the synergy among multiple LLMs for open-domain text generation tasks. Experimental results demonstrate that TagRouter outperforms 13 baseline methods, increasing the accept rate of system by 6.15% and reducing costs by 17.20%, achieving optimal cost-efficiency. Our findings provides the LLM community with an efficient and scalable solution for model ensembling, offering users an evolvable "super model."

cs.CL↗
arXiv2025

HSANET: A Hybrid Self-Cross Attention Network For Remote Sensing Change Detection

The remote sensing image change detection task is an essential method for large-scale monitoring. We propose HSANet, a network that uses hierarchical convolution to extract multi-scale features. It incorporates hybrid self-attention and cross-attention mechanisms to learn and fuse global and cross-scale information. This enables HSANet to capture global context at different scales and integrate cross-scale features, refining edge details and improving detection performance. We will also open-source our model code: https://github.com/ChengxiHAN/HSANet.

cs.CV↗
arXiv2025

Existence of Branched covers $S^{2}\rightarrow S^{2}$ with prescribed branching data

Building on techniques from complex analysis and topology, we establish a remarkable property of branched covers and formulate a complete criterion for the existence of specific types of branched covers between 2-spheres. Our results extend and unify previous work by Jiang (2004), Pervova-Petronio (2006), Zhu (2019), and Wei-Wu-Xu (2024). As applications of our criterion, we present several new families of exceptional branching data.

math.GT↗
arXiv2025

Isometric immersions of constant curvature one metrics on the 2-sphere with two conical singularities into Euclidean 3-space: A partial solution to the Gálvez-Hauswirth-Mira problem

In this paper, we establish a geometric correspondence between constant curvature one metrics with two conical singularities on $S^{2}$ and isometric immersions into Euclidean 3-space $\mathbb{E}^{3}$. Specifically, we explicitly construct a family of surfaces with constant curvature one, each of which is endowed with two conical singularities. This construction provides a partial solution to an open problem proposed by Gálvez, Hauswirth, and Mira (Adv in Math. 241(2013) 103-126).

math.DG↗
arXiv2025

Information-Theoretic Limits of Bistatic Integrated Sensing and Communication

Bistatic sensing refers to scenarios where the transmitter (illuminating the target) and the sensing receiver (estimating the target state) are physically separated, in contrast to monostatic sensing, where both functions are co-located. In practical settings, bistatic sensing may be required either due to inherent system constraints or as a means to mitigate the strong self-interference encountered in monostatic configurations. A key practical challenge in bistatic radio-frequency radar systems is the synchronization and calibration of the separate transmitter and sensing receiver. In this paper, we are not concerned with these signal processing aspects and take a complementary information-theoretic perspective on bistatic integrated sensing and communication (ISAC). Namely, we aim to characterize the capacity-distortion function-the fundamental tradeoff between communication capacity and sensing accuracy. We consider a general discrete channel model for a bistatic ISAC system and derive a multi-letter representation of its capacity-distortion function. Then, we establish single-letter upper and lower bounds and provide exact single-letter characterizations for degraded bistatic ISAC channels. Furthermore, we extend our analysis to a bistatic ISAC broadcast channel and derive the capacity-distortion region with a single-letter characterization in the degraded case. Numerical examples illustrate the theoretical results, highlighting the benefits of ISAC over separate communication and sensing, as well as the role of leveraging communication to assist sensing in bistatic systems.

cs.IT↗
arXiv2024

PhyTracker: An Online Tracker for Phytoplankton

Phytoplankton, a crucial component of aquatic ecosystems, requires efficient monitoring to understand marine ecological processes and environmental conditions. Traditional phytoplankton monitoring methods, relying on non-in situ observations, are time-consuming and resource-intensive, limiting timely analysis. To address these limitations, we introduce PhyTracker, an intelligent in situ tracking framework designed for automatic tracking of phytoplankton. PhyTracker overcomes significant challenges unique to phytoplankton monitoring, such as constrained mobility within water flow, inconspicuous appearance, and the presence of impurities. Our method incorporates three innovative modules: a Texture-enhanced Feature Extraction (TFE) module, an Attention-enhanced Temporal Association (ATA) module, and a Flow-agnostic Movement Refinement (FMR) module. These modules enhance feature capture, differentiate between phytoplankton and impurities, and refine movement characteristics, respectively. Extensive experiments on the PMOT dataset validate the superiority of PhyTracker in phytoplankton tracking, and additional tests on the MOT dataset demonstrate its general applicability, outperforming conventional tracking methods. This work highlights key differences between phytoplankton and traditional objects, offering an effective solution for phytoplankton monitoring.

cs.CV↗
arXiv2024

Low-Complexity Minimum BER Precoder Design for ISAC Systems: A Delay-Doppler Perspective

Orthogonal time frequency space (OTFS) modulation is anticipated to be a promising candidate for supporting integrated sensing and communications (ISAC) systems, which is considered as a pivotal technique for realizing next generation wireless networks. In this paper, we develop a minimum bit error rate (BER) precoder design for an OTFS-based ISAC system. In particular, the BER minimization problem takes into account the maximum available transmission power budget and the required sensing performance. Different from prior studies that considered ISAC in the time-frequency (TF) domain, we devise the precoder from the perspective of the delay-Doppler (DD) domain by exploiting the equivalent DD domain channel due to the fact that the DD domain channel generally tends to be sparse and quasi-static, which can facilitate a low-overhead ISAC system design. To address the non-convex optimization design problem, we resort to optimizing the lower bound of the derived average BER by adopting Jensen's inequality. Subsequently, the formulated problem is decoupled into two independent sub-problems via singular value decomposition (SVD) methodology. We then theoretically analyze the feasibility conditions of the proposed problem and present a low-complexity iterative solution via leveraging the Lagrangian duality approach. Simulation results verify the effectiveness of our proposed precoder compared to the benchmark schemes and reveal the interplay between sensing and communication for dual-functional precoder design, indicating a trade-off where transmission efficiency is sacrificed for increasing transmission reliability and sensing accuracy.

eess.SP↗
arXiv2024

Analysis of Cross-Domain Message Passing for OTFS Transmissions

In this paper, we investigate the performance of the cross-domain iterative detection (CDID) framework with orthogonal time frequency space (OTFS) modulation, where two distinct CDID algorithms are presented. The proposed schemes estimate/detect the information symbols iteratively across the frequency domain and the delay-Doppler (DD) domain via passing either the a posteriori or extrinsic information. Building upon this framework, we investigate the error performance by considering the bias evolution and state evolution. Furthermore, we discuss their error performance in convergence and the DD domain error state lower bounds in each iteration. Specifically, we demonstrate that in convergence, the ultimate error performance of the CDID passing the a posteriori information can be characterized by two potential convergence points. In contrast, the ultimate error performance of the CDID passing the extrinsic information has only one convergence point, which, interestingly, aligns with the matched filter bound. Our numerical results confirm our analytical findings and unveil the promising error performance achieved by the proposed designs.

cs.IT↗
arXiv2024

Geometric structure and existence of reducible spherical conical metrics

A conformal metric ${\rm d}s^{2}$ with finitely many conical singularities of constant Gaussian curvature $K=1$ on a compact Riemann surface is referred to as a spherical conical metric. When the associated monodromy group of ${\rm d}s^{2}$ is diagonalizable, we refer to ${\rm d}s^{2}$ as a reducible spherical conical metric. The simplest case of a reducible spherical conical metric is a `football', which denotes a 2-sphere with a spherical conical metric that has precisely two singularities separated by a distance of $π$. This study delves into the intrinsic geometric structure and existence of reducible spherical conical metrics on compact Riemann surfaces. We demonstrate that any such spherical surface can be divided into a finite number of pieces by cutting along a set of suitable geodesics, which connect the conical singularities and some smooth points of the metric. Especially, each piece is isometric to a portion obtained by cutting a football along a geodesic that joins the two conical singularities. As an application, an angle condition for the existence of such a metric is presented. Most notably, our study demonstrates the existence of a reducible spherical conical metric where all the saddle points of a Morse function are located on the same geodesic.

math.DG↗
arXiv2024

Channel Estimation for RIS-Aided MIMO Systems: A Partially Decoupled Atomic Norm Minimization Approach

Channel estimation (CE) plays a key role in reconfigurable intelligent surface (RIS)-aided multiple-input multiple-output (MIMO) communication systems, while it poses a challenging task due to the passive nature of RIS and the cascaded channel structures. In this paper, a partially decoupled atomic norm minimization (PDANM) framework is proposed for CE of RIS-aided MIMO systems, which exploits the three-dimensional angular sparsity of the channel. In particular, PDANM partially decouples the differential angles at the RIS from other angles at the base station and user equipment, reducing the computational complexity compared with existing methods. A reweighted PDANM (RPDANM) algorithm is proposed to further improve CE accuracy, which iteratively refines CE through a specifically designed reweighing strategy. Building upon RPDANM, we propose an iterative approach named RPDANM with adaptive phase control (RPDANM-APC), which adaptively adjusts the RIS phases based on previously estimated channel parameters to facilitate CE, achieving superior CE accuracy while reducing training overhead. Numerical simulations demonstrate the superiority of our proposed approaches in terms of running time, CE accuracy, and training overhead. In particular, the RPDANM-APC approach can achieve higher CE accuracy than existing methods within less than 30 percent training overhead while reducing the running time by tens of times.

cs.IT↗
arXiv2024

Resource Allocation Design for Next-Generation Multiple Access: A Tutorial Overview

Multiple access is the cornerstone technology for each generation of wireless cellular networks and resource allocation design plays a crucial role in multiple access. In this paper, we present a comprehensive tutorial overview for junior researchers in this field, aiming to offer a foundational guide for resource allocation design in the context of next-generation multiple access (NGMA). Initially, we identify three types of channels in future wireless cellular networks over which NGMA will be implemented, namely: natural channels, reconfigurable channels, and functional channels. Natural channels are traditional uplink and downlink communication channels; reconfigurable channels are defined as channels that can be proactively reshaped via emerging platforms or techniques, such as intelligent reflecting surface (IRS), unmanned aerial vehicle (UAV), and movable/fluid antenna (M/FA); and functional channels support not only communication but also other functionalities simultaneously, with typical examples including integrated sensing and communication (ISAC) and joint computing and communication (JCAC) channels. Then, we introduce NGMA models applicable to these three types of channels that cover most of the practical communication scenarios of future wireless communications. Subsequently, we articulate the key optimization technical challenges inherent in the resource allocation design for NGMA, categorizing them into rate-oriented, power-oriented, and reliability-oriented resource allocation designs. The corresponding optimization approaches for solving the formulated resource allocation design problems are then presented. Finally, simulation results are presented and discussed to elucidate the practical implications and insights derived from resource allocation designs in NGMA.

cs.IT↗
arXiv2024

RIS-aided MIMO Beamforming: Piece-Wise Near-field Channel Model

This paper proposes a joint active and passive beamforming design for reconfigurable intelligent surface (RIS)-aided wireless communication systems, adopting a piece-wise near-field channel model. While a traditional near-field channel model, applied without any approximations, offers higher modeling accuracy than a far-field model, it renders the system design more sensitive to channel estimation errors (CEEs). As a remedy, we propose to adopt a piece-wise near-field channel model that leverages the advantages of the near-field approach while enhancing its robustness against CEEs. Our study analyzes the impact of different channel models, including the traditional near-field, the proposed piece-wise near-field and far-field channel models, on the interference distribution caused by CEEs and model mismatches. Subsequently, by treating the interference as noise, we formulate a joint active and passive beamforming design problem to maximize the spectral efficiency (SE). The formulated problem is then recast as a mean squared error (MSE) minimization problem and a suboptimal algorithm is developed to iteratively update the active and passive beamforming strategies. Simulation results demonstrate that adopting the piece-wise near-field channel model leads to an improved SE compared to both the near-field and far-field models in the presence of CEEs. Furthermore, the proposed piece-wise near-field model achieves a good trade-off between modeling accuracy and system's degrees of freedom (DoF).

cs.IT↗
arXiv2024

A note on Rational Maps with three branching points on the Riemann sphere

Studying the existence of rational functions with given branching datum is a classical problem in the field of complex analysis and algebraic geometry. This problem dates back to Hurwitz and remains open to this day. In this paper, we utilize complex analysis to establish a property of rational functions with 3 branching points on the Riemann sphere. Given two compact Riemann surfaces $M$ and $N$, a pair $(d,\mathcal{D})$ of an integer $d\geq2$ and a collection $\mathcal{D}$ of nontrivial partitions of $d$ is called a candidate branching datum if it satisfies the Riemann-Hurwitz formula. And a candidate branching datum is exceptional if there does not exist a rational function realization it. As applications, we present some new types of exceptional branching datum. These results cover some previous results mentioned in \cite{EKS84,PP06,Zhu19}. We also deduce the realizability of a certain type of candidate branching datum on the Riemann sphere.

math.CV↗
arXiv2024

Networked Integrated Sensing and Communications for 6G Wireless Systems

Integrated sensing and communication (ISAC) is envisioned as a key pillar for enabling the upcoming sixth generation (6G) communication systems, requiring not only reliable communication functionalities but also highly accurate environmental sensing capabilities. In this paper, we design a novel networked ISAC framework to explore the collaboration among multiple users for environmental sensing. Specifically, multiple users can serve as powerful sensors, capturing back scattered signals from a target at various angles to facilitate reliable computational imaging. Centralized sensing approaches are extremely sensitive to the capability of the leader node because it requires the leader node to process the signals sent by all the users. To this end, we propose a two-step distributed cooperative sensing algorithm that allows low-dimensional intermediate estimate exchange among neighboring users, thus eliminating the reliance on the centralized leader node and improving the robustness of sensing. This way, multiple users can cooperatively sense a target by exploiting the block-wise environment sparsity and the interference cancellation technique. Furthermore, we analyze the mean square error of the proposed distributed algorithm as a networked sensing performance metric and propose a beamforming design for the proposed network ISAC scheme to maximize the networked sensing accuracy and communication performance subject to a transmit power constraint. Simulation results validate the effectiveness of the proposed algorithm compared with the state-of-the-art algorithms.

eess.SP↗
arXiv2024

Fundamentals of Delay-Doppler Communications: Practical Implementation and Extensions to OTFS

The recently proposed orthogonal time frequency space (OTFS) modulation, which is a typical Delay-Doppler (DD) communication scheme, has attracted significant attention thanks to its appealing performance over doubly-selective channels. In this paper, we present the fundamentals of general DD communications from the viewpoint of the Zak transform. We start our study by constructing DD domain basis functions aligning with the time-frequency (TF)-consistency condition, which are globally quasi-periodic and locally twisted-shifted. We unveil that these features are translated to unique signal structures in both time and frequency, which are beneficial for communication purposes. Then, we focus on the practical implementations of DD Nyquist communications, where we show that rectangular windows achieve perfect DD orthogonality, while truncated periodic signals can obtain sufficient DD orthogonality. Particularly, smoothed rectangular window with excess bandwidth can result in a slightly worse orthogonality but better pulse localization in the DD domain. Furthermore, we present a practical pulse shaping framework for general DD communications and derive the corresponding input-output relation under various shaping pulses. Our numerical results agree with our derivations and also demonstrate advantages of DD communications over conventional orthogonal frequency-division multiplexing (OFDM).

cs.IT↗
arXiv2024

Accelerating Heterogeneous Tensor Parallelism via Flexible Workload Control

Transformer-based models are becoming deeper and larger recently. For better scalability, an underlying training solution in industry is to split billions of parameters (tensors) into many tasks and then run them across homogeneous accelerators (e.g., GPUs). However, such dedicated compute cluster is prohibitively expensive in academia and moderate companies. An economic replacement is to aggregate existing heterogeneous devices and share resources among multi-tenants. Nevertheless, static hardware configurations and dynamic resource contention definitely cause straggling tasks, which heavily slows down the overall training efficiency. Existing works feature contributions mainly tailored for traditional data parallelism. They cannot work well for the new tensor parallelism due to strict communication and correctness constraints. In this paper we first present ZERO-resizing, a novel dynamic workload balancing technique without any data migration. We tune workloads in real-time by temporarily resizing matrices involved in core tensor-related computations. We particularly design data imputation and priority selection policies to respectively satisfy consistency constraint required by normal training and reduce the accuracy loss. We also give a lightweight data migration technique without loss of accuracy, to cope with heavy heterogeneity. Our final SEMI-migration solution is built on top of these two techniques and can adaptively distinguish their respective balancing missions, to achieve an overall success in efficiency and accuracy. Extensive experiments on the representative Colossal-AI platform validate the effectiveness of our proposals.

cs.DC↗
arXiv2024

LR-CNN: Lightweight Row-centric Convolutional Neural Network Training for Memory Reduction

In the last decade, Convolutional Neural Network with a multi-layer architecture has advanced rapidly. However, training its complex network is very space-consuming, since a lot of intermediate data are preserved across layers, especially when processing high-dimension inputs with a big batch size. That poses great challenges to the limited memory capacity of current accelerators (e.g., GPUs). Existing efforts mitigate such bottleneck by external auxiliary solutions with additional hardware costs, and internal modifications with potential accuracy penalty. Differently, our analysis reveals that computations intra- and inter-layers exhibit the spatial-temporal weak dependency and even complete independency features. That inspires us to break the traditional layer-by-layer (column) dataflow rule. Now operations are novelly re-organized into rows throughout all convolution layers. This lightweight design allows a majority of intermediate data to be removed without any loss of accuracy. We particularly study the weak dependency between two consecutive rows. For the resulting skewed memory consumption, we give two solutions with different favorite scenarios. Evaluations on two representative networks confirm the effectiveness. We also validate that our middle dataflow optimization can be smoothly embraced by existing works for better memory reduction.

cs.DC↗