Top-K Ranking Deep Contextual Bandits for Information Selection Systems

• URL: http://arxiv.org/abs/2201.13287v1
• Date: Fri, 28 Jan 2022 15:10:44 GMT
• Title: Top-K Ranking Deep Contextual Bandits for Information Selection Systems
• Authors: Jade Freeman and Michael Rawson
• Abstract summary: We propose a novel approach to top-K rankings under the contextual multi-armed bandit framework. We model the reward function with a neural network to allow non-linear approximation to learn the relationship between rewards and contexts.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In today's technology environment, information is abundant, dynamic, and heterogeneous in nature. Automated filtering and prioritization of information is based on the distinction between whether the information adds substantial value toward one's goal or not. Contextual multi-armed bandit has been widely used for learning to filter contents and prioritize according to user interest or relevance. Learn-to-Rank technique optimizes the relevance ranking on items, allowing the contents to be selected accordingly. We propose a novel approach to top-K rankings under the contextual multi-armed bandit framework. We model the stochastic reward function with a neural network to allow non-linear approximation to learn the relationship between rewards and contexts. We demonstrate the approach and evaluate the the performance of learning from the experiments using real world data sets in simulated scenarios. Empirical results show that this approach performs well under the complexity of a reward structure and high dimensional contextual features.

Related papers

• SynerGraph: An Integrated Graph Convolution Network for Multimodal Recommendation [1.3812010983144802]
  This article presents a novel approach to multimodal recommendation systems, focusing on integrating and purifying multimodal data. We developed a filter to remove noise from various types of data, making the recommendations more reliable. We studied the impact of top-K sparsification on different datasets, finding optimal values that strike a balance between underfitting and overfitting concerns.
  arXiv  Detail & Related papers  (2024-05-29T12:18:32Z)
• Enhancing Neural Subset Selection: Integrating Background Information into Set Representations [53.15923939406772]
  We show that when the target value is conditioned on both the input set and subset, it is essential to incorporate an textitinvariant sufficient statistic of the superset into the subset of interest. This ensures that the output value remains invariant to permutations of the subset and its corresponding superset, enabling identification of the specific superset from which the subset originated.
  arXiv  Detail & Related papers  (2024-02-05T16:09:35Z)
• Sample Complexity of Preference-Based Nonparametric Off-Policy Evaluation with Deep Networks [58.469818546042696]
  We study the sample efficiency of OPE with human preference and establish a statistical guarantee for it. By appropriately selecting the size of a ReLU network, we show that one can leverage any low-dimensional manifold structure in the Markov decision process.
  arXiv  Detail & Related papers  (2023-10-16T16:27:06Z)
• Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Sampling [15.88678122212934]
  Real-world applications of contextual bandits often exhibit non-stationarity due to seasonality, serendipity, and evolving social trends. We introduce a novel non-stationary contextual bandit algorithm that addresses these concerns. It combines a scalable, deep-neural-network-based architecture with a carefully designed exploration mechanism.
  arXiv  Detail & Related papers  (2023-10-11T18:15:55Z)
• Beyond Accuracy: Measuring Representation Capacity of Embeddings to Preserve Structural and Contextual Information [1.8130068086063336]
  We propose a method to measure the textitrepresentation capacity of embeddings. The motivation behind this work stems from the importance of understanding the strengths and limitations of embeddings. The proposed method not only contributes to advancing the field of embedding evaluation but also empowers researchers and practitioners with a quantitative measure.
  arXiv  Detail & Related papers  (2023-09-20T13:21:12Z)
• Enhancing Human-like Multi-Modal Reasoning: A New Challenging Dataset and Comprehensive Framework [51.44863255495668]
  Multimodal reasoning is a critical component in the pursuit of artificial intelligence systems that exhibit human-like intelligence. We present Multi-Modal Reasoning(COCO-MMR) dataset, a novel dataset that encompasses an extensive collection of open-ended questions. We propose innovative techniques, including multi-hop cross-modal attention and sentence-level contrastive learning, to enhance the image and text encoders.
  arXiv  Detail & Related papers  (2023-07-24T08:58:25Z)
• An Empirical Evaluation of Federated Contextual Bandit Algorithms [27.275089644378376]
  Federated learning can be done using implicit signals generated as users interact with applications of interest. We develop variants of prominent contextual bandit algorithms from the centralized seting for the federated setting. Our experiments reveal the surprising effectiveness of the simple and commonly used softmax in balancing the well-know exploration-exploitation tradeoff.
  arXiv  Detail & Related papers  (2023-03-17T19:22:30Z)
• Deep networks for system identification: a Survey [56.34005280792013]
  System identification learns mathematical descriptions of dynamic systems from input-output data. Main aim of the identified model is to predict new data from previous observations. We discuss architectures commonly adopted in the literature, like feedforward, convolutional, and recurrent networks.
  arXiv  Detail & Related papers  (2023-01-30T12:38:31Z)
• Incorporating Relevance Feedback for Information-Seeking Retrieval using Few-Shot Document Re-Ranking [56.80065604034095]
  We introduce a kNN approach that re-ranks documents based on their similarity with the query and the documents the user considers relevant. To evaluate our different integration strategies, we transform four existing information retrieval datasets into the relevance feedback scenario.
  arXiv  Detail & Related papers  (2022-10-19T16:19:37Z)
• Information Ranking Using Optimum-Path Forest [5.696039065328918]
  Performance of Optimum-Path Forest (OPF)-based approaches was compared to the well-known SVM-Rank pairwise technique and a baseline based on distance calculation. Experiments showed competitive results concerning precision and outperformed traditional techniques in terms of computational load.
  arXiv  Detail & Related papers  (2021-02-16T02:01:29Z)
• Deep Learning feature selection to unhide demographic recommender systems factors [63.732639864601914]
  The matrix factorization model generates factors which do not incorporate semantic knowledge. DeepUnHide is able to extract demographic information from the users and items factors in collaborative filtering recommender systems.
  arXiv  Detail & Related papers  (2020-06-17T17:36:48Z)

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.