SearcharxivSearch

arXiv subjects

Gaoxiang Zhao

Publications and source records attributed to Gaoxiang Zhao.

3 recordsLinked to original sources

Uncertainty Modeling for Multi-Objective RTA Interception with Distillation Acceleration

Real-Time Auction (RTA) interception decides which incoming advertising requests reach downstream systems, and therefore controls the quality of the data those systems learn from. At JD.com, off-site advertising produces on the order of hundreds of billions of requests per day, and the RTA channel alone serves up to hundreds of millions of requests per minute. Filtering low-quality and fraudulent traffic at this scale requires estimating each request's value with calibrated confidence, which we treat as an uncertainty modeling problem. Two obstacles stand in the way. First, advertising labels are severely imbalanced: deals are rare, and we show both analytically and empirically that standard weight-based uncertainty degrades under such sparsity, collapsing onto predicted probability and adding no signal. Second, methods such as SWAG and Bayesian neural networks require multiple stochastic forward passes per request, making full-traffic scoring prohibitively expensive. We address both problems with UMDA, a multi-objective framework that shares uncertainty across funnel-correlated objectives, using the reliable uncertainty of a balanced metric to compensate for the degenerate uncertainty of sparse ones. We then distill the multi-pass teacher into a single-pass student that reproduces both aleatoric and epistemic uncertainty at roughly one-tenth of the inference cost. On JD e-commerce dataset and the public Criteo dataset, UMDA supplies more effective samples to downstream tasks, and the distilled student preserves this capability. In production, it scores the full traffic in a near-line pipeline that feeds an hourly blacklist for online interception; a seven-day A/B test on 5% of live traffic cuts the click fraud rate by 3.59% and raises CVR by 4.01% at a matched interception ratio while leaving converted users essentially unchanged, and the model has since been deployed to full traffic.

cs.LG

AverageTime: Enhance Long-Term Time Series Forecasting with Simple Averaging

Multivariate long-term time series forecasting aims to predict future sequences by utilizing historical observations, with a core focus on modeling intra-sequence and cross-channel dependencies. Numerous studies have developed diverse architectures to capture these patterns, achieving significant improvements in forecasting accuracy. Among them, iTransformer, a representative method for channel information extraction, leverages the Transformer architecture to model channel-wise dependencies, thereby facilitating sequence transformation for enhanced forecasting performance. Building upon iTransformer's channel extraction concept, we propose AverageTime, a simple, efficient, and scalable forecasting model. Beyond iTransformer, AverageTime retains the original sequence information and reframes channel extraction as a stackable and extensible architecture. This allows the model to generate multiple novel sequences through various structural mechanisms, rather than being limited to transforming the original input. Moreover, the newly extracted sequences are not restricted to channel processing; other techniques such as series decomposition can also be incorporated to enhance predictive accuracy. Additionally, we introduce a channel clustering technique into AverageTime, which substantially improves training and inference efficiency with negligible performance loss. Experiments on real-world datasets demonstrate that with only two straightforward averaging operations, applied to both the extracted sequences and the original series. AverageTime surpasses state-of-the-art models in forecasting performance while maintaining near-linear complexity. This work offers a new perspective on time series forecasting: enriching sequence information through extraction and fusion. The source code is available at https://github.com/ UniqueoneZ/AverageTime.

cs.LG

A Mallows-like Criterion for Anomaly Detection with Random Forest Implementation

The effectiveness of anomaly signal detection can be significantly undermined by the inherent uncertainty of relying on one specified model. Under the framework of model average methods, this paper proposes a novel criterion to select the weights on aggregation of multiple models, wherein the focal loss function accounts for the classification of extremely imbalanced data. This strategy is further integrated into Random Forest algorithm by replacing the conventional voting method. We have evaluated the proposed method on benchmark datasets across various domains, including network intrusion. The findings indicate that our proposed method not only surpasses the model averaging with typical loss functions but also outstrips common anomaly detection algorithms in terms of accuracy and robustness.

stat.ML