Skip to content
conftrace_

regret bound

2,284 papers

RB

Papers

On Efficiency in Hierarchical Reinforcement Learning NeurIPS 2020 Online Algorithm for Unsupervised Sequential Selection with Contextual Information NeurIPS 2020 Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice NeurIPS 2020 Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach ICLR 2020 Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints AISTATS 2020 Online Convex Optimization in the Random Order Model ICML 2020 Online Convex Optimization Over Erdos-Renyi Random Networks NeurIPS 2020 Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks AISTATS 2020 Online Data Poisoning Attacks L4DC 2020 Online Influence Maximization under Linear Threshold Model NeurIPS 2020 Online Learning for Active Cache Synchronization ICML 2020 Online Learning Using Only Peer Prediction AISTATS 2020 Online Learning with Dependent Stochastic Feedback Graphs ICML 2020 Online learning with dynamics: A minimax perspective NeurIPS 2020 Online Learning with Imperfect Hints ICML 2020 Online Learning with Primary and Secondary Losses NeurIPS 2020 Online Linear Optimization with Many Hints NeurIPS 2020 Online Matrix Completion with Side Information NeurIPS 2020 Online Multitask Learning with Long-Term Memory NeurIPS 2020 Online Non-Convex Learning: Following the Perturbed Leader is Optimal ALT 2020 Online Parameter-Free Learning of Multiple Low Variance Tasks UAI 2020 Online Positive and Unlabeled Learning IJCAI 2020 Online Second Price Auction with Semi-Bandit Feedback under the Non-Stationary Setting AAAI 2020 On Regret with Multiple Best Arms NeurIPS 2020 Open Problem: Fast and Optimal Online Portfolio Selection COLT 2020