Skip to content
conftrace_

Papers (including subtopics)

Open Problem: Model Selection for Contextual Bandits COLT 2020 Open Problem: Tight Convergence of SGD in Constant Dimension COLT 2020 Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020 Optimal Adaptive Electrode Selection to Maximize Simultaneously Recorded Neuron Yield NeurIPS 2020 Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization JMLR 2020 Optimal Algorithms for Multiplayer Multi-Armed Bandits AISTATS 2020 Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards NeurIPS 2020 Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NeurIPS 2020 Optimal approximation for unconstrained non-submodular minimization ICML 2020 Optimal Approximation of Doubly Stochastic Matrices AISTATS 2020 Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions NeurIPS 2020 Optimal Best-arm Identification in Linear Bandits NeurIPS 2020 Optimal Bounds between f-Divergences and Integral Probability Metrics ICML 2020 Optimal Common Contract with Heterogeneous Agents AAAI 2020 Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms JMLR 2020 Optimal Epoch Stochastic Gradient Descent Ascent Methods for Min-Max Optimization NeurIPS 2020 Optimal Group Testing COLT 2020 Optimal Iterative Sketching Methods with the Subsampled Randomized Hadamard Transform NeurIPS 2020 Optimality, Accuracy, and Efficiency of an Exact Functional Test IJCAI 2020 Optimal Learning from Verified Training Data NeurIPS 2020 Optimal least-squares solution to the hand-eye calibration problem CVPR 2020 Optimally Guarding Perimeters and Regions with Mobile Range Sensors RSS 2020 Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information Sharing ICML 2020 Optimal Margin Distribution Learning in Dynamic Environments AAAI 2020 Optimal Non-parametric Learning in Repeated Contextual Auctions with Strategic Buyer ICML 2020