Imagen de Portada

Matroid Semi-Bandits in Sublinear Time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Tzeng, Ruo-Chun, Ohsaka, Naoto, Ariu, Kaito
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Role of Contextual Information in Best Arm Identification
por: Kato, Masahiro, et al.
Publicado: (2021)

On Universally Optimal Algorithms for A/B Testing
por: Wang, Po-An, et al.
Publicado: (2023)

Best Arm Identification with Fixed Budget: A Large Deviation Perspective
por: Wang, Po-An, et al.
Publicado: (2023)

Consensus Group Relative Policy Optimization for Text Generation
por: Ichihara, Yuki, et al.
Publicado: (2026)

Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model
por: Ariu, Kaito, et al.
Publicado: (2023)

Optimal Clustering from Noisy Binary Feedback
por: Ariu, Kaito, et al.
Publicado: (2019)

Policy Testing in Markov Decision Processes
por: Ariu, Kaito, et al.
Publicado: (2025)

Learning from Delayed Feedback in Games via Extra Prediction
por: Fujimoto, Yuma, et al.
Publicado: (2025)

Linear Convergence in Games with Delayed Feedback via Extra Prediction
por: Fujimoto, Yuma, et al.
Publicado: (2026)

Adaptively Perturbed Mirror Descent for Learning in Games
por: Abe, Kenshi, et al.
Publicado: (2023)

Safe Collaborative Filtering
por: Togashi, Riku, et al.
Publicado: (2023)

Efficient Matroid Bandit Linear Optimization Leveraging Unimodality
por: Delage, Aurélien, et al.
Publicado: (2025)

Return-Aligned Decision Transformer
por: Tanaka, Tsunehiko, et al.
Publicado: (2024)

Filtered Direct Preference Optimization
por: Morimura, Tetsuro, et al.
Publicado: (2024)

Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
por: Wen, Dongxie, et al.
Publicado: (2024)

Oracle-Efficient Combinatorial Semi-Bandits
por: Kim, Jung-hun, et al.
Publicado: (2025)

Terminal Embeddings in Sublinear Time
por: Cherapanamjeri, Yeshwanth, et al.
Publicado: (2021)

Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise
por: Tani, Naoto, et al.
Publicado: (2026)

On the Power of Perturbation under Sampling in Solving Extensive-Form Games
por: Masaka, Wataru, et al.
Publicado: (2025)

Multi-Play Combinatorial Semi-Bandit Problem
por: Nakamura, Shintaro, et al.
Publicado: (2025)

Dynamic Correlation Clustering in Sublinear Update Time
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Training Overparametrized Neural Networks in Sublinear Time
por: Deng, Yichuan, et al.
Publicado: (2022)

Alphabet Reduction for Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2024)

Tight Inapproximability of Target Set Reconfiguration
por: Ohsaka, Naoto
Publicado: (2024)

Gap Preserving Reductions Between Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2022)

On Approximate Reconfigurability of Label Cover
por: Ohsaka, Naoto
Publicado: (2023)

Gap Amplification for Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2023)

On the Parameterized Intractability of Determinant Maximization
por: Ohsaka, Naoto
Publicado: (2022)

Sublinear Time Quantum Sensitivity Sampling
por: Song, Zhao, et al.
Publicado: (2025)

Stochastic Online Conformal Prediction with Semi-Bandit Feedback
por: Ge, Haosen, et al.
Publicado: (2024)

Fast-MWEM: Private Data Release in Sublinear Time
por: Haris, Themistoklis, et al.
Publicado: (2026)

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

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
por: Chen, Botao, et al.
Publicado: (2025)

Sublinear Time Quantum Algorithm for Attention Approximation
por: Song, Zhao, et al.
Publicado: (2026)

Revisiting the Seasonal Trend Decomposition for Enhanced Time Series Forecasting
por: Panta, Sanjeev, et al.
Publicado: (2026)

Semi-Bandit Learning for Monotone Stochastic Optimization
por: Agarwal, Arpit, et al.
Publicado: (2023)

Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays
por: Chen, Ziqun, et al.
Publicado: (2024)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
por: Li, Mengmeng, et al.
Publicado: (2025)

SubGen: Token Generation in Sublinear Time and Memory
por: Zandieh, Amir, et al.
Publicado: (2024)

Online Learning with Sublinear Best-Action Queries
por: Russo, Matteo, et al.
Publicado: (2024)