Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Chang, Hyeong Soo
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
di: Yahmed, Ahmed Ben, et al.
Pubblicazione: (2025)

Autonomous Air-Ground Vehicle Operations Optimization in Hazardous Environments: A Multi-Armed Bandit Approach
di: Choi, Jimin, et al.
Pubblicazione: (2025)

Best Arm Identification with LLM Judges and Limited Human
di: Ao, Ruicheng, et al.
Pubblicazione: (2026)

Cooperative Bandit Learning in Directed Networks with Arm-Access Constraints
di: Makridis, Evagoras, et al.
Pubblicazione: (2026)

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise
di: Kornilov, Nikita, et al.
Pubblicazione: (2024)

Contextual Bandits with Budgeted Information Reveal
di: Gan, Kyra, et al.
Pubblicazione: (2023)

Feasibility Evaluation of Quadratic Programs for Constrained Control
di: Rousseas, Panagiotis, et al.
Pubblicazione: (2025)

Welfare Maximization Algorithm for Solving Budget-Constrained Multi-Component POMDPs
di: Vora, Manav, et al.
Pubblicazione: (2023)

A Feasible Method for Constrained Derivative-Free Optimization
di: Xuan, Melody Qiming, et al.
Pubblicazione: (2024)

Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem
di: Cai, Junyang, et al.
Pubblicazione: (2024)

Guaranteed Feasibility in Differentially Private Linearly Constrained Convex Optimization
di: Benvenuti, Alexander, et al.
Pubblicazione: (2024)

A Specialized Simplex Algorithm for Budget-Constrained Total Variation-Regularized Problems
di: Yang, Dominic
Pubblicazione: (2025)

Uncertainty Partitioning with Probabilistic Feasibility and Performance Guarantees for Chance-Constrained Optimization
di: Cordiano, Francesco, et al.
Pubblicazione: (2025)

Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection
di: Zhang, Qixin, et al.
Pubblicazione: (2026)

Coordinating Drop-Off Locations and Pickup Routes: A Budget-Constrained Routing Perspective
di: Albareda-Sambola, Maria, et al.
Pubblicazione: (2025)

Multi-Armed Sampling Problem and the End of Exploration
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2025)

Reach-Avoid Model Predictive Control with Guaranteed Recursive Feasibility via Input Constrained Backstepping
di: Ding, Jianqiang, et al.
Pubblicazione: (2026)

Constrained Online Convex Optimization with Polyak Feasibility Steps
di: Hutchinson, Spencer, et al.
Pubblicazione: (2025)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
di: He, Chang, et al.
Pubblicazione: (2025)

Identification of Feasible Regions Using R-Functions
di: Kucherenko, Segei, et al.
Pubblicazione: (2025)

Multi-armed Bandit for Stochastic Shortest Path in Mixed Autonomy
di: Bai, Yu, et al.
Pubblicazione: (2025)

A Constrained Optimisation Framework for Parameter Identification of the SIRD Model
di: Miniguano-Trujillo, Andrés, et al.
Pubblicazione: (2023)

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
di: Chakraborty, Abhishek, et al.
Pubblicazione: (2026)

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

FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guarantees
di: Nguyen, Hoang T., et al.
Pubblicazione: (2025)

A Budget-Adaptive Allocation Rule for Optimal Computing Budget Allocation
di: Cao, Zirui, et al.
Pubblicazione: (2023)

Meta-Learning from Learning Curves for Budget-Limited Algorithm Selection
di: Nguyen, Manh Hung, et al.
Pubblicazione: (2024)

Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination
di: Zhu, Zhihan, et al.
Pubblicazione: (2025)

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

Power Constrained Nonstationary Bandits with Habituation and Recovery Dynamics
di: Li, Fengxu, et al.
Pubblicazione: (2025)

Calibrated Adversarial Sampling: Multi-Armed Bandit-Guided Generalization Against Unforeseen Attacks
di: Wang, Rui, et al.
Pubblicazione: (2025)

Meta-Learning for Physically-Constrained Neural System Identification
di: Chakrabarty, Ankush, et al.
Pubblicazione: (2025)

Novel Multi-objective Switched Model Predictive Control with Feasibility and Stability Guarantees
di: Niepötter, Elias, et al.
Pubblicazione: (2025)

Bayesian Dissuasion with Bandit Exploration
di: DAntoni, Massimo, et al.
Pubblicazione: (2024)

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

On the Fundamental Limit of the Stochastic Gradient Identification Algorithm Under Non-Persistent Excitation
di: Yao, Senhan, et al.
Pubblicazione: (2025)

FORWARD: A Feasible Radial Reconfiguration Algorithm for Multi-Source Distribution Networks
di: Gallart, Joan Vendrell, et al.
Pubblicazione: (2025)

Null Controllability for Degenerate Parabolic Equations with Internal Control Applied on a Measurable Subset
di: Yang, Donghui, et al.
Pubblicazione: (2026)

Multi-User Contextual Cascading Bandits for Personalized Recommendation
di: Park, Jiho, et al.
Pubblicazione: (2025)