Copertina

A more efficient method for large-sample model-free feature screening via multi-armed bandits

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ouyang, Xiaxue, Kang, Xinlai, Li, Mengyu, Dou, Zhenxing, Yu, Jun, Meng, Cheng
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Computation
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Leveraging priors on distribution functions for multi-arm bandits
di: Vashishtha, Sumit, et al.
Pubblicazione: (2025)

Trading off rewards and errors in multi-armed bandits
di: Erraqabi, Akram, et al.
Pubblicazione: (2026)

Minimax-optimal trust-aware multi-armed bandits
di: Cai, Changxiao, et al.
Pubblicazione: (2024)

Functional multi-armed bandit and the best function identification problems
di: Dorn, Yuriy, et al.
Pubblicazione: (2025)

Information maximization for a broad variety of multi-armed bandit games
di: Barbier-Chebbah, Alex, et al.
Pubblicazione: (2025)

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
di: Qin, Hao, et al.
Pubblicazione: (2025)

UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
di: Han, Qiyang, et al.
Pubblicazione: (2024)

Softmax gradient policy for variance minimization and risk-averse multi armed bandits
di: Turinici, Gabriel
Pubblicazione: (2026)

HELLINGER-UCB: A novel algorithm for stochastic multi-armed bandit problem and cold start problem in recommender system
di: Yang, Ruibo, et al.
Pubblicazione: (2024)

A survey on multi-player bandits
di: Boursier, Etienne, et al.
Pubblicazione: (2022)

AngelSlim: A more accessible, comprehensive, and efficient toolkit for large model compression
di: Cen, Rui, et al.
Pubblicazione: (2026)

Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates
di: Mei, Jincheng, et al.
Pubblicazione: (2025)

Prior-informed optimization of treatment recommendation via bandit algorithms trained on large language model-processed historical records
di: Nessari, Saman, et al.
Pubblicazione: (2025)

Extreme bandits
di: Carpentier, Alexandra, et al.
Pubblicazione: (2026)

Continuous-time multi-armed bandits under random intervention times
di: Noba, Kei, et al.
Pubblicazione: (2026)

Asymptotic properties of a multicolored random reinforced urn model with an application to multi-armed bandits
di: Yang, Li, et al.
Pubblicazione: (2024)

Spectral bandits
di: Kocák, Tomáš, et al.
Pubblicazione: (2026)

Importance Sparsification for Sinkhorn Algorithm
di: Li, Mengyu, et al.
Pubblicazione: (2023)

Adversarial bandit optimization for approximately linear functions
di: Cheng, Zhuoyu, et al.
Pubblicazione: (2025)

Solving multi-armed bandit problems using a chaotic microresonator comb
di: Cuevas, Jonathan, et al.
Pubblicazione: (2023)

Unified theory of upper confidence bound policies for bandit problems targeting total reward, maximal reward, and more
di: Kikkawa, Nobuaki, et al.
Pubblicazione: (2024)

Efficient kernelized bandit algorithms via exploration distributions
di: Hu, Bingshan, et al.
Pubblicazione: (2025)

Performance-bounded Online Ensemble Learning Method Based on Multi-armed bandits and Its Applications in Real-time Safety Assessment
di: Hu, Songqiao, et al.
Pubblicazione: (2025)

Information-directed sampling for bandits: a primer
di: Hirling, Annika, et al.
Pubblicazione: (2025)

Active clustering with bandit feedback
di: Thuot, Victor, et al.
Pubblicazione: (2024)

Ensemble sampling for linear bandits: small ensembles suffice
di: Janz, David, et al.
Pubblicazione: (2023)

Positive region preserved random sampling: an efficient feature selection method for massive data
di: Bai, Hexiang, et al.
Pubblicazione: (2025)

Variance-sensitive Thompson sampling for generalised linear bandits, revisited
di: Perneczky, Tom, et al.
Pubblicazione: (2026)

Redundant feature screening method for human activity recognition based on attention purification mechanism
di: Li, Xiaoyang, et al.
Pubblicazione: (2025)

Instance-dependent Stochastic Lipschitz bandit
di: Potfer, Marius, et al.
Pubblicazione: (2026)

Spectral bandits for smooth graph functions
di: Valko, Michal, et al.
Pubblicazione: (2026)

Approximate information maximization for bandit games
di: Barbier-Chebbah, Alex, et al.
Pubblicazione: (2023)

Online learning in bandits with predicted context
di: Guo, Yongyi, et al.
Pubblicazione: (2023)

Regularization can make diffusion models more efficient
di: Taheri, Mahsa, et al.
Pubblicazione: (2025)

Sequential query prediction based on multi‑armed bandits with ensemble of transformer experts and immediate feedback
di: Puthiya Parambath, Shameem A, et al.
Pubblicazione: (2024)

Risk and optimal policies in bandit experiments
di: Adusumilli, Karun
Pubblicazione: (2021)

Multi‐armed bandit based online model selection for concept‐drift adaptation
di: Jobin Wilson, et al.
Pubblicazione: (2024)

Linear bandits with polylogarithmic minimax regret
di: Lumbreras, Josep, et al.
Pubblicazione: (2024)

Revealing graph bandits for maximizing local influence
di: Carpentier, Alexandra, et al.
Pubblicazione: (2026)

On the optimal regret of collaborative personalized linear bandits
di: Huang, Bruce, et al.
Pubblicazione: (2025)