SearcharxivSearch

arXiv subjects

Kaibin Qiu

Publications and source records attributed to Kaibin Qiu.

2 recordsLinked to original sources

PRIME: Mitigating Subgroup Optimization Competition in Shared CTR Top Networks with Plug-in Residual Input-Conditioned Mixture of Expert

Click-through rate (CTR) models vary in feature-interaction design, yet their top networks usually remain a single multilayer perceptron shared by all examples. Heterogeneous user, item, and context subgroups therefore update the same parameters; weakly aligned learning signals make the aggregate gradient a compromise among competing directions. We study the competition on Avazu with 4 models and 4 semantic fields. Across all architectures, semantic subgroups show lower Top-NN gradient cosine similarity than random groups matched by sample size and label ratio, with reductions of 0.23-0.37. This competition motivates input-conditioned experts, but directly replacing an established Dense mapping changes its initial function, sharing pattern, and capacity, obscuring the source of gains. We introduce PRIME (Plug-in Residual Input-conditioned Mixture of Experts), a Dense-anchored mixture of low-rank residual experts. PRIME anchors the original prediction and uses zero-residual initialization to match the Dense baseline exactly at training onset. Input-dependent routing weights low-rank experts for example-specific logit corrections; multi-bag aggregation and EMA load biases stabilize conditional estimation. We evaluate PRIME on held-out Avazu and Criteo test sets across 13 CTR architectures and five paired seeds. Median paired AUC gains are +0.0022 and +0.0066, with LogLoss reductions of 0.0011 and 0.0081, respectively. On FiBiNET and DCNv2, PRIME outperforms APG in all ten seed-level AUC comparisons while using fewer parameters and lower inference latency on both backbones. These results show that function-preserving conditional residuals add input-dependent capacity while preserving the Dense path and its optimization stability. Code is available at https://github.com/YH-learning/PRIME.

cs.LG

Stellar Spectra Classification and Feature evaluation Based on Random Forest

With the availability of multi-object spectrometers and the designing \& running of some large scale sky surveys, we are obtaining massive spectra. Therefore, it becomes more and more important to deal with the massive spectral data efficiently and accurately. This work investigated the classification problem of stellar spectra under the assumption that there is no perfect absolute flux calibration, for example, the spectra from Guoshoujing Telescope (the Large Sky Area Multi-Object Fiber Spectroscopic Telescope, LAMOST). The proposed scheme consists of the following two procedures: Firstly, a spectrum is normalized based on a 17th polynomial fitting; Secondly, a random forest (RF) is utilized to classifying the stellar spectra. The experiments on four stellar spectral libraries show that RF has a good classification performance. This work also studied the spectral feature evaluation problem based on RF. The evaluation is helpful in understanding the results of the proposed stellar classification scheme and exploring its potential improvements in future.

astro-ph.IM