Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Hybrid optimization framework for improving Kolmogorov-Arnold network in federated learning
Zhi JIANG, Xuebin CHEN, Changyin LUO, Ziye ZHEN
Journal of Computer Applications    2026, 46 (4): 1023-1033.   DOI: 10.11772/j.issn.1001-9081.2025050536
Abstract69)   HTML9)    PDF (1022KB)(38)       Save

For addressing issues such as data heterogeneity, tendency of gradients to converge to local optimum, and high computational and communication overhead in federated learning, a hybrid training framework of “key edge screening-early-stopping genetic evolution-local fine-tuning” was developed for Kolmogorov-Arnold Network (KAN), called KB-GA-KAN. First, key edges on each client were selected dynamically according to kernel function amplitude and activation sensitivity, and only the kernel coefficients of these edges were evolved genetically, enabling a global search for good initial solutions. Then, an early-stopping criterion was introduced, and collaborative optimization was achieved by combining the evolution with local Stochastic Gradient Descent (SGD). Experimental results on five Non-Independent and Identically Distributed (Non-IID) datasets demonstrate that compared to KAN framework with pure gradient training, KB-GA-KAN has test accuracy raised by an average of 1.34%, and the number of convergence rounds lowered by 42%, and it improves the robustness of heterogeneous scenarios with a slight additional computational cost. Visual results of the kernel functions further confirm that KB-GA-KAN enhances model interpretability. It can be seen that KB-GA-KAN offers a new route to balance accuracy, convergence speed, and computational cost of efficient SGD KAN under privacy-restricted conditions.

Table and Figures | Reference | Related Articles | Metrics
Analysis of coordinated transmission pre-coding in distributed wireless communication system
YANG Jun ZHANG Zheng-xiao LI Min-zhi JIANG Zhan-jun
Journal of Computer Applications    2012, 32 (04): 910-912.   DOI: 10.3724/SP.J.1087.2012.00910
Abstract1194)      PDF (473KB)(451)       Save
In distributed wireless communication and Coordinated Multi-Point (CoMP) system, the deterioration of channel quality seriously affect the system receptivity of edge users, and therefore the coordinated coding processing is used to improve the quality of reception. A coordinated transmission and joint pre-coding method was proposed in this paper. Coordinated Remote Antenna Units (RAU) were processed jointly. According to the state information of channel, different pre-coding rules were adopted by each RAU to transmit data to the same user. A Maximal-Ratio Combining (MRC) algorithm was used to calculate the received signals of terminals. The simulation results show that the proposed method can effectively decrease the Bit Error Rate (BER) and improve the transmission reliability.
Reference | Related Articles | Metrics
Chessboard grid corners detection based on geometric symmetry
Xiao-jun TAN Zhi-hao GUO Zhi JIANG
Journal of Computer Applications   
Abstract1917)      PDF (488KB)(1421)       Save
A new algorithm was proposed based on the geometric symmetry to detect grid corners. The method can be utilized in camera calibration where chessboard-like patterns were often used. Based on the observation of the geometric symmetry of such patterns, the new algorithm could be regarded as a coarse-to-fine process. Coarse detection defined the corner candidates and then precise extraction was used based on symmetry analysis. Experimental results show that the algorithm assures an efficient and accurate detection and the procedure can be carried out automatically.
Related Articles | Metrics
Algorithm of finding the best reduction based on reduction significance
Jing-zhi JIANG
Journal of Computer Applications   
Abstract1826)      PDF (422KB)(1132)       Save
To solve the problem of choosing a best reduction from several reductions of one decision table, after thinking about the average significance of attributes in reduction and the number of attributes, a new definition named attribute significance was proposed and proved in detail. Then the algorithm of finding the best reduction was presented based on this new definition. Finally, examples demonstrate the usefulness of the algorithm.
Related Articles | Metrics