Learning Theory

Probably Approximately Metric-Fair Learning ICML 2018 Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs ICML 2018 Quantifying Learning Guarantees for Convex but Inconsistent Surrogates NeurIPS 2018 Query Complexity of Bayesian Private Learning NeurIPS 2018 Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm (Extended Abstract) IJCAI 2018 Recurrent Neural Networks as Weighted Language Recognizers NAACL 2018 Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure COLT 2018 Regional Multi-Armed Bandits AISTATS 2018 Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NeurIPS 2018 Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NeurIPS 2018 Regret Minimization for Partially Observable Deep Reinforcement Learning ICML 2018 Residual Connections Encourage Iterative Inference ICLR 2018 Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks JMLR 2018 Sensitivity and Generalization in Neural Networks: an Empirical Study ICLR 2018 Sentiment analysis under temporal shift EMNLP 2018 Sequential prediction with coded side information under logarithmic loss ALT 2018 SGD Learns Over-parameterized Networks that Provably Generalize on Linearly Separable Data ICLR 2018 SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach EMNLP 2018 Size-Independent Sample Complexity of Neural Networks COLT 2018 Sparse Concordance-assisted Learning for Optimal Treatment Decision JMLR 2018 Sparsity, variance and curvature in multi-armed bandits ALT 2018 Stability and Generalization of Learning Algorithms that Converge to Global Optima ICML 2018 State Abstractions for Lifelong Reinforcement Learning ICML 2018 Stronger Generalization Bounds for Deep Nets via a Compression Approach ICML 2018 Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds NeurIPS 2018