Skip to content
conftrace_

Papers (including subtopics)

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 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 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 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 Revisiting Online Quantum State Learning AAAI 2020 Revisiting Stochastic Extragradient AISTATS 2020 Riccati updates for online linear quadratic control L4DC 2020 Ridge Rider: Finding Diverse Solutions by Following Eigenvectors of the Hessian NeurIPS 2020 RM-CVaR: Regularized Multiple β-CVaR Portfolio IJCAI 2020 RoboCoDraw: Robotic Avatar Drawing with GAN-Based Style Transfer and Time-Efficient Path Optimization AAAI 2020 Robust k-means++ UAI 2020 Robust, Accurate Stochastic Optimization for Variational Inference NeurIPS 2020 Robust Algorithms for Online k-means Clustering ALT 2020