regret bound

Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NeurIPS 2020 Regret in Online Recommendation Systems NeurIPS 2020 Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and Tighter Regret Bounds for the Non-Episodic Setting NeurIPS 2020 Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020 Reinforcement Learning with Feedback Graphs NeurIPS 2020 Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension NeurIPS 2020 Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders ICML 2020 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NeurIPS 2020 Revisiting Online Quantum State Learning AAAI 2020 Riccati updates for online linear quadratic control L4DC 2020 Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret NeurIPS 2020 Robust Learning-Based Control via Bootstrapped Multiplicative Noise L4DC 2020 Robust Learning from Discriminative Feature Feedback AISTATS 2020 Robust Pricing in Dynamic Mechanism Design ICML 2020 SAdam: A Variant of Adam for Strongly Convex Functions ICLR 2020 Safe Linear Stochastic Bandits AAAI 2020 Scalable Decision-Theoretic Planning in Open and Typed Multiagent Systems AAAI 2020 Selfish Robustness and Equilibria in Multi-Player Bandits COLT 2020 Semi-bandit Optimization in the Dispersed Setting UAI 2020 Sequential Bayesian Experimental Design with Variable Cost Structure NeurIPS 2020 Simple and Fast Algorithm for Binary Integer and Online Linear Programming NeurIPS 2020 Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition NeurIPS 2020 SLIP: Learning to predict in unknown dynamical systems with long-term memory NeurIPS 2020 Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes COLT 2020 Smoothed Analysis of Online and Differentially Private Learning NeurIPS 2020