Copertina

Parallel Best Arm Identification in Heterogeneous Environments

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Karpov, Nikolai, Zhang, Qin
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Machine Learning Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Problem of Best Arm Retention
di: Chen, Houshuang, et al.
Pubblicazione: (2025)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
di: Karpov, Nikolai, et al.
Pubblicazione: (2025)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
di: Chen, Yixin, et al.
Pubblicazione: (2021)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
di: Assadi, Sepehr, et al.
Pubblicazione: (2023)

The Cost of Parallelizing Boosting
di: Lyu, Xin, et al.
Pubblicazione: (2024)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
di: Cui, Shuang, et al.
Pubblicazione: (2023)

Best Agent Identification for General Game Playing
di: Stephenson, Matthew, 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)

TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
di: Hines, Christian L., et al.
Pubblicazione: (2025)

Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
di: Qin, Yilong, et al.
Pubblicazione: (2023)

On Learning Parallel Pancakes with Mostly Uniform Weights
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
di: Gupta, Shivam, et al.
Pubblicazione: (2024)

Private Selection with Heterogeneous Sensitivities
di: Antonova, Daniela, et al.
Pubblicazione: (2025)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
di: Kim, Jung-hun, et al.
Pubblicazione: (2021)

Engineering Optimal Parallel Task Scheduling
di: Akram, Matthew, et al.
Pubblicazione: (2024)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
di: Jambulapati, Arun, et al.
Pubblicazione: (2024)

On the query complexity of sampling from non-log-concave distributions
di: He, Yuchen, et al.
Pubblicazione: (2025)

Language Generation in the Limit: Noise, Loss, and Feedback
di: Bai, Yannan, et al.
Pubblicazione: (2025)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
di: He, Yuchen, et al.
Pubblicazione: (2024)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2025)

A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature
di: Gu, Xiang, et al.
Pubblicazione: (2026)

High-Probability Bounds For Heterogeneous Local Differential Privacy
di: Aliakbarpour, Maryam, et al.
Pubblicazione: (2025)

GEFL: Extended Filtration Learning for Graph Classification
di: Zhang, Simon, et al.
Pubblicazione: (2024)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
di: Silwal, Sandeep, et al.
Pubblicazione: (2025)

Parallel Sampling via Counting
di: Anari, Nima, et al.
Pubblicazione: (2024)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2023)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
di: Zhang, Guangyi, et al.
Pubblicazione: (2026)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
di: Mishra, Nina, et al.
Pubblicazione: (2025)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
di: Zhang, Keyuan, et al.
Pubblicazione: (2024)

Learning CNF formulas from uniform random solutions in the local lemma regime
di: Feng, Weiming, et al.
Pubblicazione: (2025)

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
di: Gu, Yuzhou, et al.
Pubblicazione: (2024)

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
di: Chen, Peng, et al.
Pubblicazione: (2025)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
di: Chen, Chi-Yeh
Pubblicazione: (2025)

Deletion Robust Submodular Maximization over Matroids
di: Dütting, Paul, et al.
Pubblicazione: (2022)

A Faster $k$-means++ Algorithm
di: Liang, Jiehao, et al.
Pubblicazione: (2022)

Constant matters: Fine-grained Complexity of Differentially Private Continual Observation
di: Fichtenberger, Hendrik, et al.
Pubblicazione: (2022)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
di: Lee, Russell, et al.
Pubblicazione: (2022)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
di: Esposito, Emmanuel, et al.
Pubblicazione: (2022)

Learning Low Degree Hypergraphs
di: Balkanski, Eric, et al.
Pubblicazione: (2022)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
di: Hu, Hang, et al.
Pubblicazione: (2022)