Skip to content
conftrace_

feedback graph

26 papers

FG

Papers

Pure Exploration with Feedback Graphs AISTATS 2025 Reinforcement Learning with Intrinsically Motivated Feedback Graph for Lost-sales Inventory Control AISTATS 2025 Adversarial Online Learning with Temporal Feedback Graphs COLT 2024 Efficient Contextual Bandits with Uninformed Feedback Graphs ICML 2024 Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs ALT 2023 Online Learning with Feedback Graphs: The True Shape of Regret ICML 2023 On the Minimax Regret for Online Learning with Feedback Graphs NeurIPS 2023 Practical Contextual Bandits with Feedback Graphs NeurIPS 2023 A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs NeurIPS 2022 Learning on the Edge: Online Learning with Stochastic Feedback Graphs NeurIPS 2022 Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs NeurIPS 2022 Open Problem: Finite-Time Instance Dependent Optimality for Stochastic Online Learning with Feedback Graphs COLT 2022 Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality NeurIPS 2022 Beyond Bandit Feedback in Online Multiclass Classification NeurIPS 2021 Towards Best-of-All-Worlds Online Learning with Feedback Graphs NeurIPS 2021 Online Learning with Dependent Stochastic Feedback Graphs ICML 2020 Reinforcement Learning with Feedback Graphs NeurIPS 2020 Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020 Bandits with Feedback Graphs and Switching Costs NeurIPS 2019 Online learning with feedback graphs and switching costs AISTATS 2019 Online Learning with Sleeping Experts and Feedback Graphs ICML 2019 Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019 Online Learning with Abstention ICML 2018 Small-loss bounds for online learning with partial information COLT 2018 Online Learning with Feedback Graphs Without the Graphs ICML 2016