Skip to content
conftrace_

regret optimization

9 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (3) multi-armed bandit (2) convex optimization (2) federated causal discovery (1) causal network (1) huffman coding (1) discounted mdp (1) binary search tree (1) infinite horizon (1) distributionally robust control (1)

Papers

Scenario-Based Robust Optimization of Tree Structures AAAI 2025 Wasserstein distributionally robust regret-optimal control over infinite-horizon L4DC 2024 Nothing but Regrets — Privacy-Preserving Federated Causal Discovery AISTATS 2023 Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time NeurIPS 2023 Optimizing Optimizers: Regret-optimal gradient descent algorithms COLT 2021 Regret-Optimal Filtering AISTATS 2021 Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality NeurIPS 2020 Volumetric Spanners: an Efficient Exploration Basis for Learning COLT 2014 Parametric Bandits: The Generalized Linear Case NeurIPS 2010