Non-autoregressive Personalized Bundle Generation

• URL: http://arxiv.org/abs/2406.06925v1
• Date: Tue, 11 Jun 2024 03:44:17 GMT
• Title: Non-autoregressive Personalized Bundle Generation
• Abstract summary: We propose to perform the bundle generation via non-autoregressive mechanism and design a novel encoder-decoder framework named BundleNAT. In detail, we propose to adopt pre-training techniques and graph neural network to fully embed user-based preference and item-based compatibility information. We then design a permutation-equivariant decoding architecture that is able to directly output the desired bundle in a one-shot manner.
• Score: 39.83349922956341
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The personalized bundle generation problem, which aims to create a preferred bundle for user from numerous candidate items, receives increasing attention in recommendation. However, existing works ignore the order-invariant nature of the bundle and adopt sequential modeling methods as the solution, which might introduce inductive bias and cause a large latency in prediction. To address this problem, we propose to perform the bundle generation via non-autoregressive mechanism and design a novel encoder-decoder framework named BundleNAT, which can effectively output the targeted bundle in one-shot without relying on any inherent order. In detail, instead of learning sequential dependency, we propose to adopt pre-training techniques and graph neural network to fully embed user-based preference and item-based compatibility information, and use a self-attention based encoder to further extract global dependency pattern. We then design a permutation-equivariant decoding architecture that is able to directly output the desired bundle in a one-shot manner. Experiments on three real-world datasets from Youshu and Netease show the proposed BundleNAT significantly outperforms the current state-of-the-art methods in average by up to 35.92%, 10.97% and 23.67% absolute improvements in Precision, Precision+, and Recall, respectively.

Related papers

• Preference-Drift-Aware Subsequence Learning and Hierarchical Context Fusion for Long-Sequence Generative Recommendation [20.33597628832828]
  Long-sequence generative recommendation methods autoregressively model the user's interaction sequence to generate the next-item representation.<n>Existing methods fall into two categories: efficient full-sequence modeling and target-aware context retrieval.<n>We propose a preference-drift-aware subsequence learning and hierarchical context fusion for long-sequence generative recommendation.
  arXiv  Detail & Related papers  (2026-09-11T08:01:29Z)
• GenRec: A Preference-Oriented Generative Framework for Large-Scale Recommendation [14.663434490160016]
  We present GenRec, a preference-oriented generative framework deployed on the JD App.<n>In month-long online A/B tests, GenRec achieves 9.5% improvement in click count and 8.7% in transaction count over the existing pipeline.
  arXiv  Detail & Related papers  (2026-04-16T11:07:05Z)
• MoToRec: Sparse-Regularized Multimodal Tokenization for Cold-Start Recommendation [6.78317230214304]
  We present Sparse-Regularized Multimodal Tokenization for Cold-Start Recommendation (MoToRec)<n>MoToRec is a framework centered on a sparsely-regularized Residual Quantized Variational Autoencoder (RQ-VAE) that generates a compositional semantic code of discrete, interpretable tokens.<n>Extensive experiments on three large-scale datasets demonstrate MoToRec's superiority over state-of-the-art methods in both overall and cold-start scenarios.
  arXiv  Detail & Related papers  (2026-02-11T17:31:14Z)
• Breaking the Likelihood Trap: Consistent Generative Recommendation with Graph-structured Model [8.011282322871958]
  Reranking, as the final stage of recommender systems, demands real-time inference, accuracy, and diversity.<n>We propose Consistent Graph-structured Generative Recommendation (Congrats), a novel generative reranking framework.<n>Congrats has been evaluated on a large-scale video-sharing app, Kuaishou, with over 300 million daily active users.
  arXiv  Detail & Related papers  (2025-10-11T09:21:01Z)
• CHORD: Customizing Hybrid-precision On-device Model for Sequential Recommendation with Device-cloud Collaboration [28.97362695603172]
  We propose a framework for underlinetextbfCustomizing underlinetextbfHybrid-precision underlinetextbfOn-device model for sequential underlinetextbfRecommendation with underlinetextbfDevice-cloud collaboration (textbfCHORD)<n>CHORD delivers dynamic model adaptation and accelerated inference without backpropagation, eliminating costly retraining cycles.
  arXiv  Detail & Related papers  (2025-10-03T14:20:45Z)
• Preference Trajectory Modeling via Flow Matching for Sequential Recommendation [50.077447974294586]
  Sequential recommendation predicts each user's next item based on their historical interaction sequence.<n>FlowRec is a simple yet effective sequential recommendation framework.<n>We construct a personalized behavior-based prior distribution to replace Gaussian noise and learn a vector field to model user preference trajectories.
  arXiv  Detail & Related papers  (2025-08-25T02:55:42Z)
• SpecRouter: Adaptive Routing for Multi-Level Speculative Decoding in Large Language Models [21.933379266533098]
  Large Language Models (LLMs) present a critical trade-off between inference quality and computational cost.<n>Existing serving strategies often employ fixed model scales or static two-stage speculative decoding.<n>This paper introduces systemname, a novel framework that reimagines LLM inference as an adaptive routing problem.
  arXiv  Detail & Related papers  (2025-05-12T15:46:28Z)
• Autoregressive Image Generation with Randomized Parallel Decoding [28.352741116124538]
  We introduce ARPG, a novel visual autoregressive model that enables randomized parallel generation.<n>ARPG achieves over a 30 times speedup in inference and a 75 percent reduction in memory consumption.<n>On the ImageNet-1K 256 benchmark, our approach attains an FID of 1.83 with only 32 sampling steps.
  arXiv  Detail & Related papers  (2025-03-13T17:19:51Z)
• BRIDGE: Bundle Recommendation via Instruction-Driven Generation [2.115789253980982]
  BRIDGE is a novel framework for bundle recommendation. It consists of two main components namely the correlation-based item clustering and the pseudo bundle generation modules. Results validate the superiority of our models over state-of-the-art ranking-based methods across five benchmark datasets.
  arXiv  Detail & Related papers  (2024-12-24T02:07:53Z)
• Diffusion-based Contrastive Learning for Sequential Recommendation [6.3482831836623355]
  We propose a Context-aware Diffusion-based Contrastive Learning for Sequential Recommendation, named CaDiRec. CaDiRec employs a context-aware diffusion model to generate alternative items for the given positions within a sequence. We train the entire framework in an end-to-end manner, with shared item embeddings between the diffusion model and the recommendation model.
  arXiv  Detail & Related papers  (2024-05-15T14:20:37Z)
• Fast Ensembling with Diffusion Schrödinger Bridge [17.334437293164566]
  Deep Ensemble (DE) approach is a straightforward technique used to enhance the performance of deep neural networks by training them from different initial points, converging towards various local optima. We propose a novel approach called Diffusion Bridge Network (DBN) to address this challenge. By substituting the heavy ensembles with this lightweight neural network DBN, we achieved inference with reduced computational cost while maintaining accuracy and uncertainty scores on benchmark datasets such as CIFAR-10, CIFAR-100, and TinyImageNet.
  arXiv  Detail & Related papers  (2024-04-24T11:35:02Z)
• Random Aggregate Beamforming for Over-the-Air Federated Learning in Large-Scale Networks [66.18765335695414]
  We consider a joint device selection and aggregate beamforming design with the objectives of minimizing the aggregate error and maximizing the number of selected devices. To tackle the problems in a cost-effective manner, we propose a random aggregate beamforming-based scheme. We additionally use analysis to study the obtained aggregate error and the number of the selected devices when the number of devices becomes large.
  arXiv  Detail & Related papers  (2024-02-20T23:59:45Z)
• Diffusion Augmentation for Sequential Recommendation [47.43402785097255]
  We propose a Diffusion Augmentation for Sequential Recommendation (DiffuASR) for a higher quality generation. The augmented dataset by DiffuASR can be used to train the sequential recommendation models directly, free from complex training procedures. We conduct extensive experiments on three real-world datasets with three sequential recommendation models.
  arXiv  Detail & Related papers  (2023-09-22T13:31:34Z)
• Precision-Recall Divergence Optimization for Generative Modeling with GANs and Normalizing Flows [54.050498411883495]
  We develop a novel training method for generative models, such as Generative Adversarial Networks and Normalizing Flows. We show that achieving a specified precision-recall trade-off corresponds to minimizing a unique $f$-divergence from a family we call the textitPR-divergences. Our approach improves the performance of existing state-of-the-art models like BigGAN in terms of either precision or recall when tested on datasets such as ImageNet.
  arXiv  Detail & Related papers  (2023-05-30T10:07:17Z)
• Enhancing Few-shot NER with Prompt Ordering based Data Augmentation [59.69108119752584]
  We propose a Prompt Ordering based Data Augmentation (PODA) method to improve the training of unified autoregressive generation frameworks. Experimental results on three public NER datasets and further analyses demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2023-05-19T16:25:43Z)
• Deep Model Reassembly [60.6531819328247]
  We explore a novel knowledge-transfer task, termed as Deep Model Reassembly (DeRy) The goal of DeRy is to first dissect each model into distinctive building blocks, and then selectively reassemble the derived blocks to produce customized networks. We demonstrate that on ImageNet, the best reassemble model achieves 78.6% top-1 accuracy without fine-tuning.
  arXiv  Detail & Related papers  (2022-10-24T10:16:13Z)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.