Image de couverture de livre

Top Feasible-Arm Subset Identification in Constrained Multi-Armed Bandit with Limited Budget

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Chang, Hyeong Soo
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Convergence Rate of MCTS for the Optimal Value Estimation in Markov Decision Processes
par: Chang, Hyeong Soo
Publié: (2024)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
par: Yahmed, Ahmed Ben, et autres
Publié: (2025)

Autonomous Air-Ground Vehicle Operations Optimization in Hazardous Environments: A Multi-Armed Bandit Approach
par: Choi, Jimin, et autres
Publié: (2025)

Best Arm Identification with LLM Judges and Limited Human
par: Ao, Ruicheng, et autres
Publié: (2026)

Cooperative Bandit Learning in Directed Networks with Arm-Access Constraints
par: Makridis, Evagoras, et autres
Publié: (2026)

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise
par: Kornilov, Nikita, et autres
Publié: (2024)

Contextual Bandits with Budgeted Information Reveal
par: Gan, Kyra, et autres
Publié: (2023)

Feasibility Evaluation of Quadratic Programs for Constrained Control
par: Rousseas, Panagiotis, et autres
Publié: (2025)

Welfare Maximization Algorithm for Solving Budget-Constrained Multi-Component POMDPs
par: Vora, Manav, et autres
Publié: (2023)

A Feasible Method for Constrained Derivative-Free Optimization
par: Xuan, Melody Qiming, et autres
Publié: (2024)

Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem
par: Cai, Junyang, et autres
Publié: (2024)

Guaranteed Feasibility in Differentially Private Linearly Constrained Convex Optimization
par: Benvenuti, Alexander, et autres
Publié: (2024)

A Specialized Simplex Algorithm for Budget-Constrained Total Variation-Regularized Problems
par: Yang, Dominic
Publié: (2025)

Uncertainty Partitioning with Probabilistic Feasibility and Performance Guarantees for Chance-Constrained Optimization
par: Cordiano, Francesco, et autres
Publié: (2025)

Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection
par: Zhang, Qixin, et autres
Publié: (2026)

Coordinating Drop-Off Locations and Pickup Routes: A Budget-Constrained Routing Perspective
par: Albareda-Sambola, Maria, et autres
Publié: (2025)

Multi-Armed Sampling Problem and the End of Exploration
par: Pedramfar, Mohammad, et autres
Publié: (2025)

Reach-Avoid Model Predictive Control with Guaranteed Recursive Feasibility via Input Constrained Backstepping
par: Ding, Jianqiang, et autres
Publié: (2026)

Constrained Online Convex Optimization with Polyak Feasibility Steps
par: Hutchinson, Spencer, et autres
Publié: (2025)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
par: He, Chang, et autres
Publié: (2025)

Identification of Feasible Regions Using R-Functions
par: Kucherenko, Segei, et autres
Publié: (2025)

Multi-armed Bandit for Stochastic Shortest Path in Mixed Autonomy
par: Bai, Yu, et autres
Publié: (2025)

A Constrained Optimisation Framework for Parameter Identification of the SIRD Model
par: Miniguano-Trujillo, Andrés, et autres
Publié: (2023)

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
par: Chakraborty, Abhishek, et autres
Publié: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
par: Majumdar, Angshul
Publié: (2026)

FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guarantees
par: Nguyen, Hoang T., et autres
Publié: (2025)

A Budget-Adaptive Allocation Rule for Optimal Computing Budget Allocation
par: Cao, Zirui, et autres
Publié: (2023)

Meta-Learning from Learning Curves for Budget-Limited Algorithm Selection
par: Nguyen, Manh Hung, et autres
Publié: (2024)

Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination
par: Zhu, Zhihan, et autres
Publié: (2025)

Constraint-Anchored Attribution: Feasibility-Certified Counterfactuals and Bonferroni-PAC Sufficient Subsets for Neural CO Policies
par: Lafifi, Sohaib
Publié: (2026)

Power Constrained Nonstationary Bandits with Habituation and Recovery Dynamics
par: Li, Fengxu, et autres
Publié: (2025)

Calibrated Adversarial Sampling: Multi-Armed Bandit-Guided Generalization Against Unforeseen Attacks
par: Wang, Rui, et autres
Publié: (2025)

Meta-Learning for Physically-Constrained Neural System Identification
par: Chakrabarty, Ankush, et autres
Publié: (2025)

Novel Multi-objective Switched Model Predictive Control with Feasibility and Stability Guarantees
par: Niepötter, Elias, et autres
Publié: (2025)

Bayesian Dissuasion with Bandit Exploration
par: DAntoni, Massimo, et autres
Publié: (2024)

A Privacy Preserving Distributed Model Identification Algorithm for Power Distribution Systems
par: Chang, Chin-Yao
Publié: (2023)

On the Fundamental Limit of the Stochastic Gradient Identification Algorithm Under Non-Persistent Excitation
par: Yao, Senhan, et autres
Publié: (2025)

FORWARD: A Feasible Radial Reconfiguration Algorithm for Multi-Source Distribution Networks
par: Gallart, Joan Vendrell, et autres
Publié: (2025)

Null Controllability for Degenerate Parabolic Equations with Internal Control Applied on a Measurable Subset
par: Yang, Donghui, et autres
Publié: (2026)

Multi-User Contextual Cascading Bandits for Personalized Recommendation
par: Park, Jiho, et autres
Publié: (2025)