Skip to content
conftrace_

Papers (including subtopics)

Multi-armed Bandits with Compensation NeurIPS 2018 Multi-Fidelity Black-Box Optimization with Hierarchical Partitions ICML 2018 Multi-Level Metric Learning via Smoothed Wasserstein Distance IJCAI 2018 Multinomial Logit Bandit with Linear Utility Functions IJCAI 2018 Multi-objective Contextual Bandit Problem with Similarity Information AISTATS 2018 Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint NeurIPS 2018 Multi-objective Model-based Policy Search for Data-efficient Learning with Sparse Rewards CoRL 2018 Multi-Objective Optimization Through Pareto Minimal Correction Subsets IJCAI 2018 Multi-Path Transport for RDMA in Datacenters NSDI 2018 {Multi-Player Bandits Revisited} ALT 2018 Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games NeurIPS 2018 Multi-Robot Motion Planning with Dynamics Guided by Multi-Agent Search IJCAI 2018 Multi-scale Nystrom Method AISTATS 2018 Multi-Scale Weighted Nuclear Norm Image Restoration CVPR 2018 Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming NAACL 2018 Multi-talker Speech Separation Based on Permutation Invariant Training and Beamforming Interspeech 2018 Multiwinner Voting with Fairness Constraints IJCAI 2018 Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness IJCAI 2018 Natasha 2: Faster Non-Convex Optimization Than SGD NeurIPS 2018 Nearly Optimal Robust Subspace Tracking ICML 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 Frequent Directions for Sketching Dense and Sparse Matrices ICML 2018 Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NeurIPS 2018 Negotiation Strategies for Agents with Ordinal Preferences IJCAI 2018