Image de couverture de livre

HyperArm Bandit Optimization: A Novel approach to Hyperparameter Optimization and an Analysis of Bandit Algorithms in Stochastic and Adversarial Settings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Karroum, Samih, Mazhar, Saad
Format:	Preprint
Publié:	2025
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

Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits
par: Kang, Yue, et autres
Publié: (2023)

Best Arm Identification for Stochastic Rising Bandits
par: Mussi, Marco, et autres
Publié: (2023)

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

Optimal Arm Elimination Algorithms for Combinatorial Bandits
par: Wen, Yuxiao, et autres
Publié: (2025)

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

Stochastic Bandits Robust to Adversarial Attacks
par: Wang, Xuchuang, et autres
Publié: (2024)

Stochastic Matching Bandits with Rare Optimization Updates
par: Kim, Jung-hun, et autres
Publié: (2025)

Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
par: Yang, Sifan, et autres
Publié: (2025)

Semi-Bandit Learning for Monotone Stochastic Optimization
par: Agarwal, Arpit, et autres
Publié: (2023)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
par: Cheng, Zhuoyu, et autres
Publié: (2026)

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

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
par: Tatlı, Meltem, et autres
Publié: (2025)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
par: Ghaffari, Fatemeh, et autres
Publié: (2024)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
par: Oki, Taihei, et autres
Publié: (2024)

Adversarial Bandit over Bandits: Hierarchical Bandits for Online Configuration Management
par: Avin, Chen, et autres
Publié: (2025)

Best-Arm Identification in Unimodal Bandits
par: Poiani, Riccardo, et autres
Publié: (2024)

Does Feedback Help in Bandits with Arm Erasures?
par: Karakas, Merve, et autres
Publié: (2025)

EVaR-Optimal Arm Identification in Bandits
par: Ahmadipour, Mehrasa, et autres
Publié: (2025)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
par: Shibukawa, Yuki, et autres
Publié: (2026)

Lasso Bandit with Compatibility Condition on Optimal Arm
par: Lee, Harin, et autres
Publié: (2024)

Constrained Best Arm Identification in Grouped Bandits
par: Dharod, Sahil, et autres
Publié: (2024)

Multi-Agent Best Arm Identification in Stochastic Linear Bandits
par: Agrawal, Sanjana, et autres
Publié: (2024)

HyperQ-Opt: Q-learning for Hyperparameter Optimization
par: Hasan, Md. Tarek
Publié: (2024)

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
par: Bernasconi, Martino, et autres
Publié: (2024)

Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits
par: Wang, Zhiwei, et autres
Publié: (2024)

Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization
par: Jun, Kwang-Sung, et autres
Publié: (2024)

BanditLP: Large-Scale Stochastic Optimization for Personalized Recommendations
par: Nguyen, Phuc, et autres
Publié: (2026)

Thompson Sampling-like Algorithms for Stochastic Rising Bandits
par: Fiandri, Marco, et autres
Publié: (2025)

Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms
par: Varude, Chanakya, et autres
Publié: (2025)

Multi-thresholding Good Arm Identification with Bandit Feedback
par: Jiang, Xuanke, et autres
Publié: (2025)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
par: van Erven, Tim, et autres
Publié: (2025)

Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs
par: Kash, Ian A., et autres
Publié: (2022)

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
par: Ito, Shinji, et autres
Publié: (2025)

Consequences of Kernel Regularity for Bandit Optimization
par: Lee, Madison, et autres
Publié: (2025)

Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
par: Zuo, Shiliang
Publié: (2020)

Adversarial Multi-dueling Bandits
par: Gajane, Pratik
Publié: (2024)

Are Stochastic Multi-objective Bandits Harder than Single-objective Bandits?
par: Guan, Changkun, et autres
Publié: (2026)

Nearly Optimal Best Arm Identification for Semiparametric Bandits
par: Kim, Seok-Jin
Publié: (2026)

Stochastic Bandits for Egalitarian Assignment
par: Lim, Eugene, et autres
Publié: (2024)

Efficient Clustering in Stochastic Bandits
par: Chandran, G Dhinesh, et autres
Publié: (2026)