Generative Recommendation (GenRec) has emerged as a significant evolutionary direction in the field of recommendation systems in recent years. However, during the reinforcement learning (RL) alignment stage of end-to-end GenRec, a core challenge is that the low signal-to-noise ratio (SNR) of feedback signals triggers reward hacking, which in turn leads to severe distributional drift. Massive click noise and sparse rewards result in highly unstable policy gradients, making it difficult to balance reward optimization and generative stability. To address this, we propose AIPO (Adaptive Anchored Intent-aware Policy Optimization) framework. AIPO synergistically enhances both optimization stability and performance from both data and prior anchoring perspectives. First, it introduces an intent-aware asymmetric resampling mechanism to purify high-confidence conversion intent data, thereby amplifying the gradient contribution of high-value paths. Second, it introduces a prior anchoring mechanism, which dynamically regulates its intensity through a barrier mapping based on the degree of policy distributional drift, mitigating distributional drift and reward hacking caused by low-SNR data. Offline experiments on both public benchmarks and JD's industrial datasets validated the superior performance of AIPO.

The ranking stage serves as the central optimization and allocation hub in advertising systems, governing economic value distribution through eCPM and orchestrating the user-centric blending of organic and advertising content. Prevailing ranking models often rely on fragmented modules and hand-crafted features, limiting their ability to interpret complex user intent. This challenge is further amplified in location-based services such as food delivery, where user decisions are shaped by dynamic spatial, temporal, and individual contexts. To address these limitations, we propose a novel generative framework that reframes ranking as a context comprehension task, modeling heterogeneous signals in a unified architecture. Our architecture consists of two core components: the Generative Contextual Encoder (GCE) and the Generative Contextual Fusion (GCF). The GCE comprises three specialized modules: a Personalized Context Enhancer (PCE) for user-specific modeling, a Collective Context Enhancer (CCE) for group-level patterns, and a Dynamic Context Enhancer (DCE) for real-time situational adaptation. The GCF module then seamlessly integrates these contextual representations through low-rank adaptation. Extensive experiments confirm that our method achieves significant gains in critical business metrics, including click-through rate and platform revenue. We have successfully deployed our method on a large-scale food delivery advertising platform, demonstrating its substantial practical impact. This work pioneers a new perspective on generative recommendation and highlights its practical potential in industrial advertising systems.

Although existing fully-supervised defocus blur detection (DBD) models significantly improve performance, training such deep models requires abundant pixel-level manual annotation, which is highly time-consuming and error-prone. Addressing this issue, this paper makes an effort to train a deep DBD model without using any pixel-level annotation. The core insight is that a defocus blur region/focused clear area can be arbitrarily pasted to a given realistic full blurred image/full clear image without affecting the judgment of the full blurred image/full clear image. Specifically, we train a generator G in an adversarial manner against dual discriminators Dcand Db. G learns to produce a DBD mask that generates a composite clear image and a composite blurred image through copying the focused area and unfocused region from corresponding source image to another full clear image and full blurred image. Then, Dcand Dbcan not distinguish them from realistic full clear image and full blurred image simultaneously, achieving a self-generated DBD by an implicit manner to define what a defocus blur area is. Besides, we propose a bilateral triplet-excavating constraint to avoid the degenerate problem caused by the case one discriminator defeats the other one. Comprehensive experiments on two widely-used DBD datasets demonstrate the superiority of the proposed approach. Source codes are available at: https://github.com/shangcai1/SG.