Skip to content
conftrace_

Papers (including subtopics)

Probabilistic Recurrent State-Space Models ICML 2018 Probability–Revealing Samples AISTATS 2018 Probably Approximately Metric-Fair Learning ICML 2018 (Probably) Concave Graph Matching NeurIPS 2018 Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs ICML 2018 Product Kernel Interpolation for Scalable Gaussian Processes AISTATS 2018 Profile-Based Bandit with Unknown Profiles JMLR 2018 Profitable Bandits ACML 2018 Progressive Blockwise Knowledge Distillation for Neural Network Acceleration IJCAI 2018 Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018 Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy ICML 2018 Provable Defenses against Adversarial Examples via the Convex Outer Adversarial Polytope ICML 2018 Provable Estimation of the Number of Blocks in Block Models AISTATS 2018 Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function NAACL 2018 Provable Variable Selection for Streaming Features ICML 2018 Provable Variational Inference for Constrained Log-Submodular Models NeurIPS 2018 Provably Correct Automatic Sub-Differentiation for Qualified Programs NeurIPS 2018 Proximal Backpropagation ICLR 2018 Proximal Graphical Event Models NeurIPS 2018 Proximal SCOPE for Distributed Sparse Learning NeurIPS 2018 Proximity Variational Inference AISTATS 2018 Pruning Basic Elements for Better Automatic Evaluation of Summaries NAACL 2018 Pyconstruct: Constraint Programming Meets Structured Prediction IJCAI 2018 Pyramidal Recurrent Unit for Language Modeling EMNLP 2018 Quantifying Algorithmic Improvements over Time IJCAI 2018