Skip to content
conftrace_

Papers (including subtopics)

Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017 Open Problem: Meeting Times for Learning Random Automata COLT 2017 Open-World Probabilistic Databases: An Abridged Report IJCAI 2017 Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks ICML 2017 Optimal and Adaptive Off-policy Evaluation in Contextual Bandits ICML 2017 Optimal Escape Interdiction on Transportation Networks IJCAI 2017 Optimal Feature Selection for Decision Robustness in Bayesian Networks IJCAI 2017 Optimal learning via local entropies and sample compression COLT 2017 Optimal Rates for Multi-pass Stochastic Gradient Methods JMLR 2017 Optimal Sample Complexity of M-wise Data for Top-K Ranking NeurIPS 2017 Optimistic Planning for the Stochastic Knapsack Problem AISTATS 2017 Optimistic posterior sampling for reinforcement learning: worst-case regret bounds NeurIPS 2017 Optimized Pre-Processing for Discrimination Prevention NeurIPS 2017 Optimized Time Series Filters for Detecting Laughter and Filler Events Interspeech 2017 Optimizing Differentiable Relaxations of Coreference Evaluation Metrics CoNLL 2017 Optimizing Expected Word Error Rate via Sampling for Speech Recognition Interspeech 2017 OptNet: Differentiable Optimization as a Layer in Neural Networks ICML 2017 Oracle Complexity of Second-Order Methods for Finite-Sum Problems ICML 2017 Orthogonalized ALS: A Theoretically Principled Tensor Decomposition Algorithm for Practical Use ICML 2017 Outlier-Robust Tensor PCA CVPR 2017 Outta Control: Laws of Semantic Change and Inherent Biases in Word Representation Models EMNLP 2017 Overcoming Catastrophic Forgetting by Incremental Moment Matching NeurIPS 2017 PAC Learning Depth-3 AC^0 Circuits of Bounded Top Fanin ALT 2017 Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Space ICML 2017 Parallel Multiscale Autoregressive Density Estimation ICML 2017