Skip to content
conftrace_

regret bound

2,284 papers

RB

Papers

Online Market Making and the Value of Observing the Order Book COLT 2026 On Randomized Algorithms in Online Strategic Classification COLT 2026 On the Sublinear Regret of Continuous K-Max Bandits UAI 2026 Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs COLT 2026 ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning AAAI 2026 Policy Optimization for Adversarial Linear Mixture MDPs with Unknown Transitions and Bandit Feedback UAI 2026 Policy Zooming: Adaptive Discretization-based Infinite-Horizon Average-Reward Reinforcement Learning AAAI 2026 Probably Correct Optimal Stable Matching under Two-Sided Uncertainty UAI 2026 Provably Efficient Multi-Objective Bandit Algorithms Under Preference-Centric Customization AAAI 2026 Provably Efficient Reinforcement Learning in Continuous-Time Episodic MDPs with Poisson Decision Epochs UAI 2026 Quantum Lipschitz Bandits AAAI 2026 Quantum Non-Linear Bandit Optimization AAAI 2026 Recycling History: Efficient Recommendations from Contextual Dueling Bandits ALT 2026 Refined Risk Bounds for Unbounded Losses via Transductive Priors JMLR 2026 Riemannian Manifold Learning for Stackelberg Games with Neural Flow Representations AAAI 2026 Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise UAI 2026 Robust Decentralized Multi-armed Bandits: From Corruption-Resilience to Byzantine-Resilience AAAI 2026 Robust Online Learning ALT 2026 Score-Based Diffusion Priors for Adaptive Conformal Inference under Distribution Shift UAI 2026 Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression COLT 2026 Sharp analysis of linear ensemble sampling COLT 2026 Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction COLT 2026 Swap Regret Minimization Through Response-Based Approachability COLT 2026 Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Bandits COLT 2026 The Hidden Cost of Approximation in Online Mirror Descent COLT 2026