Skip to content
conftrace_

Papers (including subtopics)

Efficient Regret Minimization in Non-Convex Games ICML 2017 Efficient Sampling from Time-Varying Log-Concave Distributions JMLR 2017 Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NeurIPS 2017 Efficient Techniques for Crowdsourced Top-k Lists IJCAI 2017 Efficient Use of Limited-Memory Accelerators for Linear Learning on Heterogeneous Systems NeurIPS 2017 Efficient Weighted Model Integration via SMT-Based Predicate Abstraction IJCAI 2017 Elastic Shape-From-Template With Spatially Sparse Deforming Forces CVPR 2017 Elementary Symmetric Polynomials for Optimal Experimental Design NeurIPS 2017 Emulating the Expert: Inverse Optimization through Online Learning ICML 2017 Encrypted Accelerated Least Squares Regression AISTATS 2017 Enumerating Distinct Decision Trees ICML 2017 Enumeration of Extractive Oracle Summaries EACL 2017 Evaluating Trajectory Collision Probability through Adaptive Importance Sampling for Safe Motion Planning RSS 2017 Exact MAP Inference by Avoiding Fractional Vertices ICML 2017 Exact tensor completion with sum-of-squares COLT 2017 Exclusivity Regularized Machine: A New Ensemble SVM Classifier IJCAI 2017 Experimental Design for Learning Causal Graphs with Latent Variables NeurIPS 2017 Exploiting Strong Convexity from Data with Primal-Dual First-Order Algorithms ICML 2017 Fair Allocation based on Diminishing Differences IJCAI 2017 Fair and Efficient Social Choice in Dynamic Settings IJCAI 2017 Fair Division of a Graph IJCAI 2017 FALKON: An Optimal Large Scale Kernel Method NeurIPS 2017 Fast Black-box Variational Inference through Stochastic Trust-Region Optimization NeurIPS 2017 Fast column generation for atomic norm regularization AISTATS 2017 Faster and Non-ergodic O(1/K) Stochastic Alternating Direction Method of Multipliers NeurIPS 2017