Skip to content
conftrace_

Papers (including subtopics)

On the universality of deep learning NeurIPS 2020 On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness ICML 2020 On the Value of Out-of-Distribution Testing: An Example of Goodhart's Law NeurIPS 2020 On the Variance of the Adaptive Learning Rate and Beyond ICLR 2020 On the weak link between importance and prunability of attention heads EMNLP 2020 On Thompson Sampling for Smoother-than-Lipschitz Bandits AISTATS 2020 On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm ICML 2020 On Uniform Convergence and Low-Norm Interpolation Learning NeurIPS 2020 On Universal Equivariant Set Networks ICLR 2020 On Validation and Planning of An Optimal Decision Rule with Application in Healthcare Studies ICML 2020 On Warm-Starting Neural Network Training NeurIPS 2020 Opening the Black Box: Automatically Characterizing Software for Algorithm Selection (Student Abstract) AAAI 2020 Open Problem: Fast and Optimal Online Portfolio Selection COLT 2020 Open Problem: Information Complexity of VC Learning COLT 2020 Open Problem: Model Selection for Contextual Bandits COLT 2020 Open Problem: Tight Convergence of SGD in Constant Dimension COLT 2020 Opportunistic Decoding with Timely Correction for Simultaneous Translation ACL 2020 Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020 Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization JMLR 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 - Smoothness Tradeoffs for Soft-Max Functions NeurIPS 2020 Optimal Attack against Autoregressive Models by Manipulating the Environment AAAI 2020 Optimal Auction Based Automated Negotiation in Realistic Decentralised Market Environments AAAI 2020 Optimal Bipartite Network Clustering JMLR 2020