regret bound

Improved Path-length Regret Bounds for Bandits COLT 2019 Improved Regret Bounds for Bandit Combinatorial Optimization NeurIPS 2019 Incorporating Behavioral Constraints in Online AI Systems AAAI 2019 Incremental Randomized Sketching for Online Kernel Learning ICML 2019 Individual Regret in Cooperative Nonstochastic Multi-Armed Bandits NeurIPS 2019 Information-Theoretic Confidence Bounds for Reinforcement Learning NeurIPS 2019 Large Scale Learning of Agent Rationality in Two-Player Zero-Sum Games AAAI 2019 Large Scale Markov Decision Processes with Changing Rewards NeurIPS 2019 Learning from Delayed Outcomes via Proxies with Applications to Recommender Systems ICML 2019 Learning in Generalized Linear Contextual Bandits with Stochastic Delays NeurIPS 2019 Learning Linear-Quadratic Regulators Efficiently with only √T Regret ICML 2019 Learning to Collaborate in Markov Decision Processes ICML 2019 Leveraging Observations in Bandits: Between Risks and Benefits AAAI 2019 Lifelong Optimization with Low Regret AISTATS 2019 Linear Stochastic Bandits Under Safety Constraints NeurIPS 2019 Logarithmic Regret for Online Control NeurIPS 2019 Matrix-Free Preconditioning in Online Learning ICML 2019 Maximum Expected Hitting Cost of a Markov Decision Process and Informativeness of Rewards NeurIPS 2019 Minimax Online Prediction of Varying Bernoulli Process under Variational Approximation ACML 2019 Model-Based Reinforcement Learning Exploiting State-Action Equivalence ACML 2019 Model Selection for Contextual Bandits NeurIPS 2019 Mo' States Mo' Problems: Emergency Stop Mechanisms from Observation NeurIPS 2019 Multi-armed Bandit Problems with Strategic Arms COLT 2019 Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing JMLR 2019 Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits COLT 2019