:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ozbay, Eren, Golgoon, Ashkan
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2410.12086
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Maximal Objectives in the Multi-armed Bandit with Applications
by: Ozbay, Eren, et al.
Published: (2020)

Mechanistic interpretability of large language models with applications to the financial services industry
by: Golgoon, Ashkan, et al.
Published: (2024)

MBExplainer: Multilevel bandit-based explanations for downstream models with augmented graph embeddings
by: Golgoon, Ashkan, et al.
Published: (2024)

Agentic AI Systems Applied to tasks in Financial Services: Modeling and model risk management crews
by: Okpala, Izunna, et al.
Published: (2025)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
by: Jin, Tianyuan, et al.
Published: (2024)

High-dimensional Contextual Bandit Problem without Sparsity
by: Komiyama, Junpei, et al.
Published: (2023)

Network Embedding Exploration Tool (NEExT)
by: Dehghan, Ashkan, et al.
Published: (2025)

Navigating Sparsities in High-Dimensional Linear Contextual Bandits
by: Zhao, Rui, et al.
Published: (2025)

Infrequent Exploration in Linear Bandits
by: Lee, Harin, et al.
Published: (2025)

Design Experiments to Compare Multi-armed Bandit Algorithms
by: Meng, Huiling, et al.
Published: (2026)

A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
by: Nakamura, Shintaro, et al.
Published: (2023)

Neural Exploitation and Exploration of Contextual Bandits
by: Ban, Yikun, et al.
Published: (2023)

Replicable Bandits with UCB based Exploration
by: Deb, Rohan, et al.
Published: (2026)

Pure Exploration in Bandits with Linear Constraints
by: Carlsson, Emil, et al.
Published: (2023)

Pure Exploration in Asynchronous Federated Bandits
by: Wang, Zichen, et al.
Published: (2023)

The Batch Complexity of Bandit Pure Exploration
by: Tuynman, Adrienne, et al.
Published: (2025)

HR-Bandit: Human-AI Collaborated Linear Recourse Bandit
by: Cao, Junyu, et al.
Published: (2024)

Decoding Funded Research: Comparative Analysis of Topic Models and Uncovering the Effect of Gender and Geographic Location
by: Kafiabad, Shirin Tavakoli, et al.
Published: (2025)

Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, et al.
Published: (2025)

Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits
by: Özyıldırım, Emre, et al.
Published: (2026)

Robust Pareto Set Identification with Contaminated Bandit Feedback
by: Korkmaz, İlter Onat, et al.
Published: (2022)

Deceptive Exploration in Multi-armed Bandits
by: Vurankaya, I. Arda, et al.
Published: (2025)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)

Efficient and Interpretable Bandit Algorithms
by: Mukherjee, Subhojyoti, et al.
Published: (2023)

RIE-Greedy: Regularization-Induced Exploration for Contextual Bandits
by: Li, Tong, et al.
Published: (2026)

Collaborating in Multi-Armed Bandits with Strategic Agents
by: Barnea, Idan, et al.
Published: (2026)

Fairness and Sparsity within Rashomon sets: Enumeration-Free Exploration and Characterization
by: Langlade, Lucas, et al.
Published: (2025)

Incentivized Exploration of Non-Stationary Stochastic Bandits
by: Chakraborty, Sourav, et al.
Published: (2024)

Contextual Bandit with Herding Effects: Algorithms and Recommendation Applications
by: Xu, Luyue, et al.
Published: (2024)

BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms
by: Hou, Yunlong, et al.
Published: (2025)

The Fragility of Optimized Bandit Algorithms
by: Fan, Lin, et al.
Published: (2021)

Adaptive Exploration for Latent-State Bandits
by: Jin, Jikai, et al.
Published: (2026)

A Framework for Feasible Counterfactual Exploration incorporating Causality, Sparsity and Density
by: Markou, Kleopatra, et al.
Published: (2024)

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
by: Esmaeili, Seyed A., et al.
Published: (2023)

Efficient and Adaptive Posterior Sampling Algorithms for Bandits
by: Hu, Bingshan, et al.
Published: (2024)

Optimal Streaming Algorithms for Multi-Armed Bandits
by: Jin, Tianyuan, et al.
Published: (2024)

Improved Algorithms for Nash Welfare in Linear Bandits
by: Sarkar, Dhruv, et al.
Published: (2026)

Optimal and Practical Batched Linear Bandit Algorithm
by: Yu, Sanghoon, et al.
Published: (2025)