A Contextual-Bandit Approach to Personalized News Article Recommendation
arXiv:1003.0146 · doi:10.1145/1772690.1772758
Abstract
Personalized web services strive to adapt their services (advertisements, news articles, etc) to individual users by making use of both content and user information. Despite a few recent advances, this problem remains challenging for at least two reasons. First, web service is featured with dynamically changing pools of content, rendering traditional collaborative filtering methods inapplicable. Second, the scale of most web services of practical interest calls for solutions that are both fast in learning and computation. In this work, we model personalized recommendation of news articles as a contextual bandit problem, a principled approach in which a learning algorithm sequentially selects articles to serve users based on contextual information about the users and articles, while simultaneously adapting its article-selection strategy based on user-click feedback to maximize total user clicks. The contributions of this work are three-fold. First, we propose a new, general contextual bandit algorithm that is computationally efficient and well motivated from learning theory. Second, we argue that any bandit algorithm can be reliably evaluated offline using previously recorded random traffic. Finally, using this offline evaluation method, we successfully applied our new algorithm to a Yahoo! Front Page Today Module dataset containing over 33 million events. Results showed a 12.5% click lift compared to a standard context-free bandit algorithm, and the advantage becomes even greater when data gets more scarce.
arXiv comment10 pages, 5 figures
Cited by in corpus (520)
- Theory-guided Data Science: A New Paradigm for Scientific Discovery from Data
- Deep Learning based Recommender System: A Survey and New Perspectives
- Weight Uncertainty in Neural Networks
- Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems
- Conservative Q-Learning for Offline Reinforcement Learning
- Deep Reinforcement Learning: An Overview
- Unbiased Offline Evaluation of Contextual-bandit-based News Article Recommendation Algorithms
- Advances and Challenges in Conversational Recommender Systems: A Survey
- How Algorithmic Confounding in Recommendation Systems Increases Homogeneity and Decreases Utility
- D4RL: Datasets for Deep Data-Driven Reinforcement Learning
- Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
- Contextual Bandits with Similarity Information
- An Efficiency-boosting Client Selection Scheme for Federated Learning with Fairness Guarantee
- Towards Long-term Fairness in Recommendation
- Contextual Bandit Algorithms with Supervised Learning Guarantees
- Real-Time Bidding with Multi-Agent Reinforcement Learning in Display Advertising
- Survey on reinforcement learning for language processing
- Online Learning: A Comprehensive Survey
- Personalized News Recommendation with Context Trees
- Doubly Robust Policy Evaluation and Optimization
- Counterfactual Risk Minimization: Learning from Logged Bandit Feedback
- KuaiRand: An Unbiased Sequential Recommendation Dataset with Randomly Exposed Videos
- Neural Interactive Collaborative Filtering
- Finite-Time Analysis of Kernelised Contextual Bandits
- Reinforcement and Imitation Learning via Interactive No-Regret Learning
- Reinforcement Learning for Ridesharing: An Extended Survey
- An Efficient Bandit Algorithm for Realtime Multivariate Optimization
- MetaKG: Meta-learning on Knowledge Graph for Cold-start Recommendation
- Contextual Hybrid Session-based News Recommendation with Recurrent Neural Networks
- Learning from Logged Implicit Exploration Data
- Machine Learning Testing: Survey, Landscapes and Horizons
- Multi-Armed Bandits for Intelligent Tutoring Systems
- Science Concierge: A fast content-based recommendation system for scientific publications
- Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users
- Distributed Clustering of Linear Bandits in Peer to Peer Networks
- Online Clustering of Bandits
- The Missing Piece in Complex Analytics: Low Latency, Scalable Model Management and Serving with Velox
- A Survey on Contextual Multi-armed Bandits
- Deep reinforcement learning for search, recommendation, and online advertising: a survey
- Deep Reinforcement Learning based Recommendation with Explicit User-Item Interactions Modeling
- Best-Arm Identification in Linear Bandits
- Making Contextual Decisions with Low Technical Debt
- Online Interactive Collaborative Filtering Using Multi-Armed Bandit with Dependent Arms
- Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation
- Learning Contextual Bandits in a Non-stationary Environment
- Leveraging Side Observations in Stochastic Bandits
- Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits
- From Bandits to Experts: On the Value of Side-Observations
- Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits
- Plan Online, Learn Offline: Efficient Learning and Exploration via Model-Based Control
- Distributed Online Learning in Social Recommender Systems
- What Doubling Tricks Can and Can't Do for Multi-Armed Bandits
- Spectral bandits for smooth graph functions
- RecSim: A Configurable Simulation Platform for Recommender Systems
- A Contextual Bandit Bake-off
- Learning Graph Meta Embeddings for Cold-Start Ads in Click-Through Rate Prediction
- Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactions
- An Actor-Critic Contextual Bandit Algorithm for Personalized Mobile Health Interventions
- Reinforcement Learning Applications
- Differentially-Private Federated Linear Bandits
- Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
- Knowledge-guided Deep Reinforcement Learning for Interactive Recommendation
- Comparison-based Conversational Recommender System with Relative Bandit Feedback
- Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound
- Off-policy evaluation for slate recommendation
- Context-Aware Hierarchical Online Learning for Performance Maximization in Mobile Crowdsourcing
- Policy Teaching via Environment Poisoning: Training-time Adversarial Attacks against Reinforcement Learning
- Carousel Personalization in Music Streaming Apps with Contextual Bandits
- Multi-objective Contextual Multi-armed Bandit with a Dominant Objective
- Offline Contextual Multi-armed Bandits for Mobile Health Interventions: A Case Study on Emotion Regulation
- Hedging the Drift: Learning to Optimize under Non-Stationarity
- Neural Thompson Sampling
- Thompson Sampling for Budgeted Multi-armed Bandits
- Sequential Batch Learning in Finite-Action Linear Contextual Bandits
- Scalable Generalized Linear Bandits: Online Computation and Hashing
- A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players
- Sliding Spectrum Decomposition for Diversified Recommendation
- Beyond Preferences in AI Alignment
- Statistical Inference for Online Decision-Making: In a Contextual Bandit Setting
- Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity
- Multi-Task Learning for Contextual Bandits
- The Digital Transformation in Health: How AI Can Improve the Performance of Health Systems
- Online Learning under Delayed Feedback
- Sketch-based Creativity Support Tools using Deep Learning
- Visual Intelligence through Human Interaction
- Modeling Rabbit-Holes on YouTube
- Exploring Personalized Health Support through Data-Driven, Theory-Guided LLMs: A Case Study in Sleep Health
- Online Machine Learning in Big Data Streams
- Estimation Considerations in Contextual Bandits
- On Multi-Armed Bandit Designs for Dose-Finding Clinical Trials
- Exploration in Interactive Personalized Music Recommendation: A Reinforcement Learning Approach
- Reinforcement Learning in Modern Biostatistics: Constructing Optimal Adaptive Interventions
- Adapting multi-armed bandits policies to contextual bandits scenarios
- From Data to Decisions: The Transformational Power of Machine Learning in Business Recommendations
- From Predictions to Prescriptions in Multistage Optimization Problems
- Meta Dynamic Pricing: Transfer Learning Across Experiments
- Bootstrapping Upper Confidence Bound
- Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective
- RELEAF: An Algorithm for Learning and Exploiting Relevance
- Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity
- Benchmarks for Deep Off-Policy Evaluation
- Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes
- Doubly-Robust Lasso Bandit
- Personalized HeartSteps: A Reinforcement Learning Algorithm for Optimizing Physical Activity
- Deep Reinforcement Learning in Computer Vision: A Comprehensive Survey
- Model Selection for Offline Reinforcement Learning: Practical Considerations for Healthcare Settings
- Federated Bandit: A Gossiping Approach
- Logarithmic Regret for Reinforcement Learning with Linear Function Approximation
- Streaming kernel regression with provably adaptive mean, variance, and regularization
- Policy Gradients for Contextual Recommendations
- Beyond Ads: Sequential Decision-Making Algorithms in Law and Public Policy
- Action-Manipulation Attacks Against Stochastic Bandits: Attacks and Defense
- User Tampering in Reinforcement Learning Recommender Systems
- A Practical Method for Solving Contextual Bandit Problems Using Decision Trees
- Fully adaptive algorithm for pure exploration in linear bandits
- Adversarial Attacks on Linear Contextual Bandits
- Neural Contextual Bandits with Deep Representation and Shallow Exploration
- Counterfactual Estimation and Optimization of Click Metrics for Search Engines
- Optimal Best-arm Identification in Linear Bandits
- Improving drug sensitivity predictions in precision medicine through active expert knowledge elicitation
- Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization
- Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits
- Stochastic Bandits with Context Distributions
- Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs
- An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints
- Statistical Inference for Online Decision Making via Stochastic Gradient Descent
- Inference for Batched Bandits
- Multi-Agent Multi-Armed Bandits with Limited Communication
- Partially Observable Markov Decision Process for Recommender Systems
- Optimal No-regret Learning in Repeated First-price Auctions
- Federated Linear Contextual Bandits
- Federated Multi-armed Bandits with Personalization
- Instructions and Guide for Diagnostic Questions: The NeurIPS 2020 Education Challenge
- Stochastic Contextual Bandits with Known Reward Functions
- BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback
- Hierarchical Exploration for Accelerating Contextual Bandits
- Simple Regret Minimization for Contextual Bandits
- Learning Triggers for Heterogeneous Treatment Effects
- Impatient Bandits: Optimizing Recommendations for the Long-Term Without Delay
- SHAPFUZZ: Efficient Fuzzing via Shapley-Guided Byte Selection
- Variational inference for the multi-armed contextual bandit
- Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques
- Locally Differentially Private (Contextual) Bandits Learning
- Bilinear Bandits with Low-rank Structure
- Post-Contextual-Bandit Inference
- Output-Weighted Sampling for Multi-Armed Bandits with Extreme Payoffs
- Off-Policy Evaluation and Learning for External Validity under a Covariate Shift
- Greybox fuzzing as a contextual bandits problem
- Automated Creative Optimization for E-Commerce Advertising
- Ranked bandits in metric spaces: learning optimally diverse rankings over large document collections
- Stochastic Structured Prediction under Bandit Feedback
- We Know What You Want: An Advertising Strategy Recommender System for Online Advertising
- Regret Bound Balancing and Elimination for Model Selection in Bandits and RL
- Graph Neural News Recommendation with Long-term and Short-term Interest Modeling
- Reinforcement Learning for Personalized Dialogue Management
- A Bandit Approach to Posterior Dialog Orchestration Under a Budget
- Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits
- Semiparametric Contextual Bandits
- A Context-aware Radio Resource Management in Heterogeneous Virtual RANs
- Graphical Models for Bandit Problems
- Bandit Online Learning with Unknown Delays
- Exploration in Online Advertising Systems with Deep Uncertainty-Aware Learning
- Speaker Diarization as a Fully Online Learning Problem in MiniVox
- Do Offline Metrics Predict Online Performance in Recommender Systems?
- Simulating Non Stationary Operators in Search Algorithms
- New Insights into Bootstrapping for Bandits
- State Encoders in Reinforcement Learning for Recommendation: A Reproducibility Study
- Graph Clustering Bandits for Recommendation
- Off-Policy Risk Assessment in Contextual Bandits
- Selfish Robustness and Equilibria in Multi-Player Bandits
- Latent Bandits Revisited
- On component interactions in two-stage recommender systems
- Deep Neural Linear Bandits: Overcoming Catastrophic Forgetting through Likelihood Matching
- PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits
- Large-scale Interactive Recommendation with Tree-structured Policy Gradient
- Meta-Learning for Contextual Bandit Exploration
- Online learning with Corrupted context: Corrupted Contextual Bandits
- EE-Net: Exploitation-Exploration Neural Networks in Contextual Bandits
- Using Adaptive Bandit Experiments to Increase and Investigate Engagement in Mental Health
- A Re-classification of Information Seeking Tasks and Their Computational Solutions
- On Ensuring that Intelligent Machines Are Well-Behaved
- Graph Neural Bandits
- A Neural Networks Committee for the Contextual Bandit Problem
- Deep Contextual Multi-armed Bandits
- Towards Practical Lipschitz Bandits
- Beyond Personalization: Social Content Recommendation for Creator Equality and Consumer Satisfaction
- Fairness of Exposure in Stochastic Bandits
- Reinforcement Learning for Combining Search Methods in the Calibration of Economic ABMs
- RecInDial: A Unified Framework for Conversational Recommendation with Pretrained Language Models
- Optimal Baseline Corrections for Off-Policy Contextual Bandits
- Sequential Experimental Design for Transductive Linear Bandits
- An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Sampling
- Recommender System for News Articles using Supervised Learning
- The closed loop between opinion formation and personalised recommendations
- Policy Teaching in Reinforcement Learning via Environment Poisoning Attacks
- Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication
- OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits
- Hierarchical Adaptive Contextual Bandits for Resource Constraint based Recommendation
- Cold-start Problems in Recommendation Systems via Contextual-bandit Algorithms
- Online learning in MDPs with side information
- Designing and Deploying Online Field Experiments
- Deep density networks and uncertainty in recommender systems
- Real-Time Optimization Of Web Publisher RTB Revenues
- contextual: Evaluating Contextual Multi-Armed Bandit Problems in R
- Online Learning in Contextual Bandits using Gated Linear Networks
- Debiased Off-Policy Evaluation for Recommendation Systems
- Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback
- Getting too personal(ized): The importance of feature choice in online adaptive algorithms
- Machine Translation System Selection from Bandit Feedback
- Corralling a Band of Bandit Algorithms
- Diffusion Approximations for Thompson Sampling in the Small Gap Regime
- Online Semi-Supervised Learning with Bandit Feedback
- Empirical Bayes Regret Minimization
- Stochastic Linear Bandits Robust to Adversarial Attacks
- Stochastic Bandits with Linear Constraints
- Kernel Methods for Cooperative Multi-Agent Contextual Bandits
- Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret
- Ed-Fed: A generic federated learning framework with resource-aware client selection for edge devices
- Markov Decision Processes with Continuous Side Information
- Adaptive Exploration in Linear Contextual Bandit
- Federated Multi-Armed Bandits
- Unknowable Manipulators: Social Network Curator Algorithms
- RL4health: Crowdsourcing Reinforcement Learning for Knee Replacement Pathway Optimization
- Managing Risk of Bidding in Display Advertising
- Charging control of electric vehicles using contextual bandits considering the electrical distribution grid
- Bandit Algorithms for Precision Medicine
- Improved Algorithm on Online Clustering of Bandits
- Local Differential Privacy for Bayesian Optimization
- Sequential Monte Carlo Bandits
- Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis
- Hidden Incentives for Auto-Induced Distributional Shift
- Best-Arm Identification in Correlated Multi-Armed Bandits
- Conversational Dueling Bandits in Generalized Linear Models
- Human Language Modeling
- Efficient Contextual Bandits with Continuous Actions
- A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem
- Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
- Nonparametric Stochastic Contextual Bandits
- Lessons from Contextual Bandit Learning in a Customer Support Bot
- Multi-Objective Generalized Linear Bandits
- Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue
- Thompson Sampling for Contextual Bandit Problems with Auxiliary Safety Constraints
- Contextual Bandits for adapting to changing User preferences over time
- Contextual Bandit with Missing Rewards
- Meta-learning with Stochastic Linear Bandits
- Reward Constrained Interactive Recommendation with Natural Language Feedback
- Hyper-parameter Tuning for the Contextual Bandit
- Nonstationary Stochastic Multiarmed Bandits: UCB Policies and Minimax Regret
- On the Power of Multitask Representation Learning in Linear MDP
- Towards Validating Long-Term User Feedbacks in Interactive Recommendation Systems
- Bayesian Optimization with LLM-Based Acquisition Functions for Natural Language Preference Elicitation
- Chameleon: Foundation Models for Fairness-aware Multi-modal Data Augmentation to Enhance Coverage of Minorities
- Thresholded Lasso Bandit
- Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluation
- Sparsity-Agnostic Lasso Bandit
- Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimation
- Meta-Learning Bandit Policies by Gradient Ascent
- Group Fairness in Bandit Arm Selection
- Fatigue-Aware Ad Creative Selection
- Empirical Likelihood for Contextual Bandits
- The Intrinsic Robustness of Stochastic Bandits to Strategic Manipulation
- Handling Cold-Start Collaborative Filtering with Reinforcement Learning
- Accurate Inference for Adaptive Linear Models
- Structured Stochastic Linear Bandits
- Mobile Recommender Systems Methods: An Overview
- Asynchronous Parallel Empirical Variance Guided Algorithms for the Thresholding Bandit Problem
- Dynamic Product Image Generation and Recommendation at Scale for Personalized E-commerce
- Multi-Armed Bandits with Fairness Constraints for Distributing Resources to Human Teammates
- Unified Dual-Intent Translation for Joint Modeling of Search and Recommendation
- InferLine: ML Prediction Pipeline Provisioning and Management for Tight Latency Objectives
- MergeDTS: A Method for Effective Large-Scale Online Ranker Evaluation
- A Practical Guide of Off-Policy Evaluation for Bandit Problems
- Social Explorative Attention based Recommendation for Content Distribution Platforms
- ASAC: Active Sensing using Actor-Critic models
- Learning Optimal Data Augmentation Policies via Bayesian Optimization for Image Classification Tasks
- Nonparametric Contextual Bandits in an Unknown Metric Space
- Risk-Aware Continuous Control with Neural Contextual Bandits
- Mitigating Bias in Adaptive Data Gathering via Differential Privacy
- Rapidly Personalizing Mobile Health Treatment Policies with Limited Data
- Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits
- Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
- Quantum contextual bandits and recommender systems for quantum data
- Knowledge Infused Policy Gradients for Adaptive Pandemic Control
- Adapting to Misspecification in Contextual Bandits with Offline Regression Oracles
- Exploration in two-stage recommender systems
- Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks
- Adaptive Keywords Extraction with Contextual Bandits for Advertising on Parked Domains
- Data Poisoning Attacks in Contextual Bandits
- Uplift Modeling for Multiple Treatments with Cost Optimization
- Adaptive Experimentation with Delayed Binary Feedback
- Neural Bandit with Arm Group Graph
- Modeling User Exposure in Recommendation
- Deep Reinforcement Learning for Adaptive Learning Systems
- A Linear Bandit for Seasonal Environments
- Randomized Allocation with Nonparametric Estimation for Contextual Multi-Armed Bandits with Delayed Rewards
- Impact of Representation Learning in Linear Bandits
- Autonomous Drug Design with Multi-Armed Bandits
- A sequential transit network design algorithm with optimal learning under correlated beliefs
- Collaborative Filtering Bandits
- Sublinear Optimal Policy Value Estimation in Contextual Bandits
- An End-to-End Deep RL Framework for Task Arrangement in Crowdsourcing Platforms
- Online Evaluation of Audiences for Targeted Advertising via Bandit Experiments
- Online Learning to Estimate Warfarin Dose with Contextual Linear Bandits
- Deep Bayesian Bandits: Exploring in Online Personalized Recommendations
- Reducing Exploration of Dying Arms in Mortal Bandits
- Finite-time Analysis of Globally Nonstationary Multi-Armed Bandits
- ADARES: Adaptive Resource Management for Virtual Machines
- Explore-Exploit: A Framework for Interactive and Online Learning
- Personalized Product Assortment with Real-time 3D Perception and Bayesian Payoff Estimation
- A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits
- Dynamic Global Sensitivity for Differentially Private Contextual Bandits
- Efficient Online Bayesian Inference for Neural Bandits
- When Collaborative Filtering Meets Reinforcement Learning
- Refining Recency Search Results with User Click Feedback
- Tractable contextual bandits beyond realizability
- X2T: Training an X-to-Text Typing Interface with Online Learning from User Feedback
- Episodic Multi-armed Bandits
- PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
- Evaluation of Explore-Exploit Policies in Multi-result Ranking Systems
- Sample-efficient Nonstationary Policy Evaluation for Contextual Bandits
- Contextual Bandits with Side-Observations
- Thompson Sampling for a Fatigue-aware Online Recommendation System
- Balanced Linear Contextual Bandits
- Contextual Bandits with Stochastic Experts
- Discovering Valuable Items from Massive Data
- Stochastic Linear Contextual Bandits with Diverse Contexts
- Estimation of Warfarin Dosage with Reinforcement Learning
- Linear Contextual Bandits with Adversarial Corruptions
- Online Preselection with Context Information under the Plackett-Luce Model
- The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits
- Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations
- Edge Computing in the Dark: Leveraging Contextual-Combinatorial Bandit and Coded Computing
- Old Dog Learns New Tricks: Randomized UCB for Bandit Problems
- Recommandation mobile, sensible au contexte de contenus évolutifs: Contextuel-E-Greedy
- Multi-Armed Bandits for Correlated Markovian Environments with Smoothed Reward Feedback
- Automatic Representation for Lifetime Value Recommender Systems
- Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation
- Towards the D-Optimal Online Experiment Design for Recommender Selection
- Online Limited Memory Neural-Linear Bandits with Likelihood Matching
- Online learning in bandits with predicted context
- Interactive Visualization Recommendation with Hier-SUCB
- Learning to Use Learners' Advice
- Context-Aware Bandits
- Decentralized, Adaptive, Look-Ahead Particle Filtering
- Revisiting Clustering of Neural Bandits: Selective Reinitialization for Mitigating Loss of Plasticity
- Federated Multi-Armed Bandits Under Byzantine Attacks
- R-UCB: a Contextual Bandit Algorithm for Risk-Aware Recommender Systems
- Off-Policy Evaluation of Bandit Algorithm from Dependent Samples under Batch Update Policy
- Online Algorithm for Unsupervised Sequential Selection with Contextual Information
- Computational Causal Inference
- Contextual Bandit with Adaptive Feature Extraction
- Thompson Sampling for Noncompliant Bandits
- Task Offloading and Replication for Vehicular Cloud Computing: A Multi-Armed Bandit Approach
- Stochastic Lipschitz Q-Learning
- Interactive Exploration and Discovery of Scientific Publications with PubVis
- Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits
- Active Collaborative Sensing for Energy Breakdown
- Improved Confidence Bounds for the Linear Logistic Model and Applications to Linear Bandits
- Policy Optimization with Model-based Explorations
- Robust Actor-Critic Contextual Bandit for Mobile Health (mHealth) Interventions
- Weighted Gaussian Process Bandits for Non-stationary Environments
- A Hidden Markov Restless Multi-armed Bandit Model for Playout Recommendation Systems
- Contextual Bandit Applications in Customer Support Bot
- Multi-Faceted Ranking of News Articles using Post-Read Actions
- Online Batch Decision-Making with High-Dimensional Covariates
- Bandits with Knapsacks beyond the Worst-Case
- Decision Making Problems with Funnel Structure: A Multi-Task Learning Approach with Application to Email Marketing Campaigns
- Budget-constrained Edge Service Provisioning with Demand Estimation via Bandit Learning
- Dimension Reduction in Contextual Online Learning via Nonparametric Variable Selection
- Conservative Contextual Combinatorial Cascading Bandit
- Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits
- Incentivizing Exploration in Linear Bandits under Information Gap
- Reinforcement Learning for Strategic Recommendations
- Universal and data-adaptive algorithms for model selection in linear contextual bandits
- Doubly Robust Interval Estimation for Optimal Policy Evaluation in Online Learning
- Adversarial Bandits with Multi-User Delayed Feedback: Theory and Application
- Inverse Contextual Bandits: Learning How Behavior Evolves over Time
- Banker Online Mirror Descent
- BanditMF: Multi-Armed Bandit Based Matrix Factorization Recommender System
- Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms
- New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
- Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation
- Linear Contextual Bandits with Hybrid Payoff: Revisited
- Leveraging the Power of Conversations: Optimal Key Term Selection in Conversational Contextual Bandits
- Actively Learning to Attract Followers on Twitter
- Multitask Bandit Learning Through Heterogeneous Feedback Aggregation
- Concentration bounds for temporal difference learning with linear function approximation: The case of batch data and uniform sampling
- A Load Balanced Recommendation Approach
- Evolution of the user's content: An Overview of the state of the art
- Multi-armed Bandit Requiring Monotone Arm Sequences
- Non-Stationary Off-Policy Optimization
- Control Variates for Slate Off-Policy Evaluation
- Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
- Combining Online Learning and Offline Learning for Contextual Bandits with Deficient Support
- Optimized Recommender Systems with Deep Reinforcement Learning
- Efficient Inference Without Trading-off Regret in Bandits: An Allocation Probability Test for Thompson Sampling
- Toward an Integrated Framework for Automated Development and Optimization of Online Advertising Campaigns
- Self-Concordant Analysis of Generalized Linear Bandits with Forgetting
- An Arm-Wise Randomization Approach to Combinatorial Linear Semi-Bandits
- Metric-Free Individual Fairness with Cooperative Contextual Bandits
- AutoML for Contextual Bandits
- Improving Offline Contextual Bandits with Distributional Robustness
- PHYRE: A New Benchmark for Physical Reasoning
- Adversarial Linear Contextual Bandits with Graph-Structured Side Observations
- Deep Reinforcement Learning for Personalized Search Story Recommendation
- Fast Physical Activity Suggestions: Efficient Hyperparameter Learning in Mobile Health
- Counterfactual Contextual Multi-Armed Bandit: a Real-World Application to Diagnose Apple Diseases
- Rarely-switching linear bandits: optimization of causal effects for the real world
- Adaptive Doubly Robust Estimator from Non-stationary Logging Policy under a Convergence of Average Probability
- Challenges in Statistical Analysis of Data Collected by a Bandit Algorithm: An Empirical Exploration in Applications to Adaptively Randomized Experiments
- Three Methods for Training on Bandit Feedback
- Hawkes Process Multi-armed Bandits for Disaster Search and Rescue
- An Active Learning Framework for Efficient Robust Policy Search
- Acting Selfish for the Good of All: Contextual Bandits for Resource-Efficient Transmission of Vehicular Sensor Data
- Thompson Sampling Algorithms for Cascading Bandits
- Incentivized Exploration for Multi-Armed Bandits under Reward Drift
- Combinatorial Bandits for Incentivizing Agents with Dynamic Preferences
- Scalable Multi-Class Bayesian Support Vector Machines for Structured and Unstructured Data
- Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack
- UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits
- Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests
- Predicting Tomorrow's Headline using Today's Twitter Deliberations
- Causal Simulations for Uplift Modeling
- AdaLinUCB: Opportunistic Learning for Contextual Bandits
- Recommending Dream Jobs in a Biased Real World
- Lipschitz Bandit Optimization with Improved Efficiency
- Predicting next shopping stage using Google Analytics data for E-commerce applications
- Bandit Learning for Diversified Interactive Recommendation
- Optimal Recommendation to Users that React: Online Learning for a Class of POMDPs
- Algorithms for Linear Bandits on Polyhedral Sets
- Differentially Private Online Learning for Cloud-Based Video Recommendation with Multimedia Big Data in Social Networks
- Robust Contextual Bandit via the Capped- norm
- Sequential Matrix Completion
- Action Centered Contextual Bandits
- Predicting Counterfactuals from Large Historical Data and Small Randomized Trials
- Freshness-Aware Thompson Sampling
- Personalized Web Search
- Contextual Online Learning for Multimedia Content Aggregation
- Targeted Advertising on Social Networks Using Online Variational Tensor Regression
- Solving Multi-Arm Bandit Using a Few Bits of Communication
- Koopman Q-learning: Offline Reinforcement Learning via Symmetries of Dynamics
- Stochastic Multi-Armed Bandits with Control Variates
- Residual Overfit Method of Exploration
- Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures
- Survey Bandits with Regret Guarantees
- Generalized Translation and Scale Invariant Online Algorithm for Adversarial Multi-Armed Bandits
- Neural News Recommendation with Collaborative News Encoding and Structural User Encoding
- An Empirical Analysis on Transparent Algorithmic Exploration in Recommender Systems
- Contextual Bandits with Sparse Data in Web setting
- Streamlined Empirical Bayes Fitting of Linear Mixed Models in Mobile Health
- GuideBoot: Guided Bootstrap for Deep Contextual Bandits
- A Map of Bandits for E-commerce
- The Use of Bandit Algorithms in Intelligent Interactive Recommender Systems
- DTR Bandit: Learning to Make Response-Adaptive Decisions With Low Regret
- The Lingering of Gradients: Theory and Applications
- An Adversarial Learning based Multi-Step Spoken Language Understanding System through Human-Computer Interaction
- On Adaptive Estimation for Dynamic Bernoulli Bandits
- CBA: Contextual Quality Adaptation for Adaptive Bitrate Video Streaming (Extended Version)
- The Assistive Multi-Armed Bandit
- Offline Contextual Bandits with Overparameterized Models
- Guaranteed Fixed-Confidence Best Arm Identification in Multi-Armed Bandits: Simple Sequential Elimination Algorithms
- Active Offline Policy Selection
- Lower Bounds for Multi-armed Bandit with Non-equivalent Multiple Plays
- Multi-objective drift-aware MLOps agent for model retraining
- Contextual Bandits with Random Projection
- Online Action Learning in High Dimensions: A Conservative Perspective
- Recommending with Recommendations
- Deep Upper Confidence Bound Algorithm for Contextual Bandit Ranking of Information Selection
- Apple Tasting Revisited: Bayesian Approaches to Partially Monitored Online Binary Classification
- A Real-Time Framework for Task Assignment in Hyperlocal Spatial Crowdsourcing
- The Adaptive Doubly Robust Estimator for Policy Evaluation in Adaptive Experiments and a Paradox Concerning Logging Policy
- Diversity-Preserving K-Armed Bandits, Revisited
- Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles
- AdSEE: Investigating the Impact of Image Style Editing on Advertisement Attractiveness
- An Unbiased Data Collection and Content Exploitation/Exploration Strategy for Personalization
- Online Semi-Supervised Learning in Contextual Bandits with Episodic Reward
- Learning Efficient and Effective Exploration Policies with Counterfactual Meta Policy
- Local Optimality of User Choices and Collaborative Competitive Filtering
- Leveraging heterogeneous spillover in maximizing contextual bandit rewards
- Towards Fundamental Limits of Multi-armed Bandits with Random Walk Feedback
- Decomposition-Coordination Method for Finite Horizon Bandit Problems
- DART: aDaptive Accept RejecT for non-linear top-K subset identification
- Spectral bandits for smooth graph functions with applications in recommender systems
- MBExplainer: Multilevel bandit-based explanations for downstream models with augmented graph embeddings
- Towards Bursting Filter Bubble via Contextual Risks and Uncertainties
- Neural Contextual Bandits without Regret
- The Nah Bandit: Modeling User Non-compliance in Recommendation Systems
- A Simple Geometric Method for Cross-Lingual Linguistic Transformations with Pre-trained Autoencoders
- Pessimistic Off-Policy Optimization for Learning to Rank
- A Methodology for Discovering how to Adaptively Personalize to Users using Experimental Comparisons
- Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
- Thompson Sampling for Bandits with Clustered Arms
- Multi-level Feedback Web Links Selection Problem: Learning and Optimization
- A Smoothed Analysis of Online Lasso for the Sparse Linear Contextual Bandit Problem
- Greedy Bandits with Sampled Context
- An Opportunistic Bandit Approach for User Interface Experimentation
- Green Offloading in Fog-Assisted IoT Systems: An Online Perspective Integrating Learning and Control
- Robust Bandit Learning with Imperfect Context
- Client-Based Intelligence for Resource Efficient Vehicular Big Data Transfer in Future 6G Network
- Minimizing the Age of Information from Sensors with Common Observations
- Learning Orthogonal Projections in Linear Bandits
- Unifying Clustered and Non-stationary Bandits
- Spatio-temporal Edge Service Placement: A Bandit Learning Approach
- Random Forest for the Contextual Bandit Problem - extended version
- Neural News Recommendation with Negative Feedback
- A Time and Space Efficient Algorithm for Contextual Linear Bandits
- DORB: Dynamically Optimizing Multiple Rewards with Bandits
- Privacy-Preserving Bandits
- Robust Counterfactual Inferences using Feature Learning and their Applications
- Contributions to Representation Learning with Graph Autoencoders and Applications to Music Recommendation
- Active Inference in Contextual Multi-Armed Bandits for Autonomous Robotic Exploration
- Improved Algorithms for Conservative Exploration in Bandits
- The Impact of Batch Learning in Stochastic Bandits
- AI Online Filters to Real World Image Recognition
- Linear Bandit algorithms using the Bootstrap
- Unbiased Estimation of the Value of an Optimized Policy
- D2RLIR : an improved and diversified ranking function in interactive recommendation systems based on deep reinforcement learning
- Sayer: Using Implicit Feedback to Optimize System Policies
- Understanding individual behaviour: from virtual to physical patterns
- Multiscale Non-stationary Stochastic Bandits