Skip to content
conftrace_

Papers (including subtopics)

Multi-Objective Optimization Through Pareto Minimal Correction Subsets IJCAI 2018 Multiphase MCMC Sampling for Parameter Inference in Nonlinear Ordinary Differential Equations AISTATS 2018 Multiple Concurrent Sound Source Tracking Based on Observation-Guided Adaptive Particle Filter Interspeech 2018 Multiple-Step Greedy Policies in Approximate and Online Reinforcement Learning NeurIPS 2018 Multi-Robot Motion Planning with Dynamics Guided by Multi-Agent Search IJCAI 2018 Multi-Task Learning as Multi-Objective Optimization NeurIPS 2018 Multi-Task Learning for Document Ranking and Query Suggestion ICLR 2018 Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semantics CVPR 2018 Multi-value Rule Sets for Interpretable Classification with Feature-Efficient Representations NeurIPS 2018 Multivariate Bayesian Structural Time Series Model JMLR 2018 Multivariate Convolutional Sparse Coding for Electromagnetic Brain Signals NeurIPS 2018 MX-LSTM: Mixing Tracklets and Vislets to Jointly Forecast Trajectories and Head Poses CVPR 2018 N2N learning: Network to Network Compression via Policy Gradient Reinforcement Learning ICLR 2018 Naive Bayesian Classifiers with Extreme Probability Features PGM 2018 Narrative Schema Stability in News Text COLING 2018 N-ary Relation Extraction using Graph-State LSTM EMNLP 2018 Natasha 2: Faster Non-Convex Optimization Than SGD NeurIPS 2018 Natural Gradients in Practice: Non-Conjugate Variational Inference in Gaussian Process Models AISTATS 2018 Navigating with Graph Representations for Fast and Scalable Decoding of Neural Language Models NeurIPS 2018 Nearly second-order optimality of online joint detection and estimation via one-sample update schemes AISTATS 2018 Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes NeurIPS 2018 Near-Optimal Budgeted Data Exchange for Distributed Loop Closure Detection RSS 2018 Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes NeurIPS 2018 Near-Optimal Machine Teaching via Explanatory Teaching Sets AISTATS 2018 Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities COLT 2018