conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Replication-proof Bandit Mechanism Design with Bayesian Agents AAAI 2025
Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback AAAI 2025
Revisiting Projection-Free Online Learning with Time-Varying Constraints AAAI 2025
Imprecise Multi-Armed Bandits: Representing Irreducible Uncertainty as a Zero-Sum Game JMLR 2025
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback IJCAI 2025
Optimal and Efficient Algorithms for Decentralized Online Convex Optimization JMLR 2025
A Hybrid Weighted Nearest Neighbour Classifier for Semi-Supervised Learning JMLR 2025
Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits AAAI 2025
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting AAAI 2025
Adaptive Market Making with Inventory Constraints via Online Learning AAAI 2025
Heterogeneous Multi-Agent Bandits with Parsimonious Hints AAAI 2025
Neural Combinatorial Clustered Bandits for Recommendation Systems AAAI 2025
Online MDP with Prototypes Information: A Robust Adaptive Approach AAAI 2025
On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games NIPS 2024
On the Necessity of Collaboration for Online Model Selection with Decentralized Data NIPS 2024
PrIsing: Privacy-Preserving Peer Effect Estimation via Ising Model AISTATS 2024
How Does Variance Shape the Regret in Contextual Bandits? NIPS 2024
Improved Bayes Regret Bounds for Multi-Task Hierarchical Bayesian Bandit Algorithms NIPS 2024
Stochastic Multi-Armed Bandits with Strongly Reward-Dependent Delays AISTATS 2024
Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits NIPS 2024
Stochastic contextual bandits with graph feedback: from independence number to MAS number NIPS 2024
Functional Graphical Models: Structure Enables Offline Data-Driven Optimization AISTATS 2024
Multiclass Transductive Online Learning NIPS 2024
Online Classification with Predictions NIPS 2024