Image de couverture de livre

Comparative Performance of Collaborative Bandit Algorithms: Effect of Sparsity and Exploration Intensity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ozbay, Eren, Golgoon, Ashkan
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Maximal Objectives in the Multi-armed Bandit with Applications
par: Ozbay, Eren, et autres
Publié: (2020)

Mechanistic interpretability of large language models with applications to the financial services industry
par: Golgoon, Ashkan, et autres
Publié: (2024)

MBExplainer: Multilevel bandit-based explanations for downstream models with augmented graph embeddings
par: Golgoon, Ashkan, et autres
Publié: (2024)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
par: Jin, Tianyuan, et autres
Publié: (2024)

High-dimensional Contextual Bandit Problem without Sparsity
par: Komiyama, Junpei, et autres
Publié: (2023)

Agentic AI Systems Applied to tasks in Financial Services: Modeling and model risk management crews
par: Okpala, Izunna, et autres
Publié: (2025)

Network Embedding Exploration Tool (NEExT)
par: Dehghan, Ashkan, et autres
Publié: (2025)

Infrequent Exploration in Linear Bandits
par: Lee, Harin, et autres
Publié: (2025)

Navigating Sparsities in High-Dimensional Linear Contextual Bandits
par: Zhao, Rui, et autres
Publié: (2025)

Design Experiments to Compare Multi-armed Bandit Algorithms
par: Meng, Huiling, et autres
Publié: (2026)

A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
par: Nakamura, Shintaro, et autres
Publié: (2023)

Neural Exploitation and Exploration of Contextual Bandits
par: Ban, Yikun, et autres
Publié: (2023)

Replicable Bandits with UCB based Exploration
par: Deb, Rohan, et autres
Publié: (2026)

Pure Exploration in Bandits with Linear Constraints
par: Carlsson, Emil, et autres
Publié: (2023)

Pure Exploration in Asynchronous Federated Bandits
par: Wang, Zichen, et autres
Publié: (2023)

The Batch Complexity of Bandit Pure Exploration
par: Tuynman, Adrienne, et autres
Publié: (2025)

HR-Bandit: Human-AI Collaborated Linear Recourse Bandit
par: Cao, Junyu, et autres
Publié: (2024)

Near Optimal Pure Exploration in Logistic Bandits
par: Rivera, Eduardo Ochoa, et autres
Publié: (2024)

Exploration via Feature Perturbation in Contextual Bandits
par: Yi, Seouh-won, et autres
Publié: (2025)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
par: Huang, Ziyi, et autres
Publié: (2024)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
par: Goyal, Tanmay, et autres
Publié: (2025)

Efficient and Interpretable Bandit Algorithms
par: Mukherjee, Subhojyoti, et autres
Publié: (2023)

Deceptive Exploration in Multi-armed Bandits
par: Vurankaya, I. Arda, et autres
Publié: (2025)

RIE-Greedy: Regularization-Induced Exploration for Contextual Bandits
par: Li, Tong, et autres
Publié: (2026)

Decoding Funded Research: Comparative Analysis of Topic Models and Uncovering the Effect of Gender and Geographic Location
par: Kafiabad, Shirin Tavakoli, et autres
Publié: (2025)

Collaborating in Multi-Armed Bandits with Strategic Agents
par: Barnea, Idan, et autres
Publié: (2026)

Fairness and Sparsity within Rashomon sets: Enumeration-Free Exploration and Characterization
par: Langlade, Lucas, et autres
Publié: (2025)

Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits
par: Özyıldırım, Emre, et autres
Publié: (2026)

Incentivized Exploration of Non-Stationary Stochastic Bandits
par: Chakraborty, Sourav, et autres
Publié: (2024)

Robust Pareto Set Identification with Contaminated Bandit Feedback
par: Korkmaz, İlter Onat, et autres
Publié: (2022)

Contextual Bandit with Herding Effects: Algorithms and Recommendation Applications
par: Xu, Luyue, et autres
Publié: (2024)

BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms
par: Hou, Yunlong, et autres
Publié: (2025)

The Fragility of Optimized Bandit Algorithms
par: Fan, Lin, et autres
Publié: (2021)

Efficient and Adaptive Posterior Sampling Algorithms for Bandits
par: Hu, Bingshan, et autres
Publié: (2024)

Optimal Streaming Algorithms for Multi-Armed Bandits
par: Jin, Tianyuan, et autres
Publié: (2024)

Improved Algorithms for Nash Welfare in Linear Bandits
par: Sarkar, Dhruv, et autres
Publié: (2026)

Optimal and Practical Batched Linear Bandit Algorithm
par: Yu, Sanghoon, et autres
Publié: (2025)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
par: Iwazaki, Shogo
Publié: (2026)

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
par: Zhang, Raymond, et autres
Publié: (2025)

Pure Exploration for a Good Policy in Reinforcement Learning with Bandit Feedback
par: Li, Zitian, et autres
Publié: (2026)