Skip to content
conftrace_

Papers (including subtopics)

CodeSLAM — Learning a Compact, Optimisable Representation for Dense Visual SLAM CVPR 2018 COLA: Decentralized Linear Learning NeurIPS 2018 Collaboratively Weighting Deep and Classic Representation via l_2 Regularization for Image Classification ACML 2018 Collecting Diverse Natural Language Inference Problems for Sentence Representation Evaluation EMNLP 2018 Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search NeurIPS 2018 Combinatorial Penalties: Which structures are preserved by convex relaxations? AISTATS 2018 Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018 Combining Natural Gradient with Hessian Free Methods for Sequence Training Interspeech 2018 Combining Opinion Pooling and Evidential Updating for Multi-Agent Consensus IJCAI 2018 Communication Algorithms via Deep Learning ICLR 2018 Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation AISTATS 2018 Communication Compression for Decentralized Training NeurIPS 2018 Communication-Computation Efficient Gradient Coding ICML 2018 Communication Efficient Parallel Algorithms for Optimization on Manifolds NeurIPS 2018 Community Detection and Stochastic Block Models: Recent Developments JMLR 2018 Community Detection in Hypergraphs: Optimal Statistical Limit and Efficient Algorithms AISTATS 2018 Community Exploration: From Offline Optimization to Online Learning NeurIPS 2018 Compact Feedforward Sequential Memory Networks for Small-footprint Keyword Spotting Interspeech 2018 Comparing Dynamics: Deep Neural Networks versus Glassy Systems ICML 2018 Compiling Combinatorial Prediction Games ICML 2018 Composite Marginal Likelihood Methods for Random Utility Models ICML 2018 Computational Approaches for Stochastic Shortest Path on Succinct MDPs IJCAI 2018 Computational Challenges for Polysynthetic Languages COLING 2018 Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm ICML 2018 Computing Higher Order Derivatives of Matrix and Tensor Expressions NeurIPS 2018