Mathematics & Optimization

Reducibility and Statistical-Computational Gaps from Secret Leakage COLT 2020 Reduction and Local Search for Weighted Graph Coloring Problem AAAI 2020 Refined bounds for algorithm configuration: The knife-edge of dual class approximability ICML 2020 Refining Tournament Solutions via Margin of Victory AAAI 2020 Regression under Human Assistance AAAI 2020 Regret Bound for Safe Gaussian Process Bandit Optimization L4DC 2020 Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NeurIPS 2020 Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020 Regularity as Regularization: Smooth and Strongly Convex Brenier Potentials in Optimal Transport AISTATS 2020 Regularized Gaussian Belief Propagation with Nodes of Arbitrary Size JMLR 2020 Regularized Optimal Transport is Ground Cost Adversarial ICML 2020 Regularized Wasserstein Means for Aligning Distributional Data AAAI 2020 Reinforcement Learning for Integer Programming: Learning to Cut ICML 2020 Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020 Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes AAAI 2020 Reinforcement Mechanism Design: With Applications to Dynamic Pricing in Sponsored Search Auctions AAAI 2020 Relation Inference among Sensor Time Series in Smart Buildings with Metric Learning AAAI 2020 Relative Interior Rule in Block-Coordinate Descent CVPR 2020 Reliable and Efficient Anytime Skeleton Learning AAAI 2020 Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach AAAI 2020 Representative Solutions for Bi-Objective Optimisation AAAI 2020 Reservoir Computing meets Recurrent Kernels and Structured Transforms NeurIPS 2020 Residual Neural Processes AAAI 2020 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NeurIPS 2020 Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity NeurIPS 2020