Skip to content
conftrace_

Papers (including subtopics)

Convergence guarantees for kernel-based quadrature rules in misspecified settings NeurIPS 2016 Convergence of an Alternating Maximization Procedure JMLR 2016 Convex Block-sparse Linear Regression with Expanders – Provably AISTATS 2016 Coordinated and Efficient Huge Page Management with Ingens OSDI 2016 Coordinate-wise Power Method NeurIPS 2016 Coordinating Multiple Disparity Proposals for Stereo Computation CVPR 2016 Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016 Correlation Clustering and Biclustering with Locally Bounded Errors ICML 2016 Covariance-based Clustering in Multivariate and Functional Data Analysis JMLR 2016 Cross-Graph Learning of Multi-Relational Associations ICML 2016 Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions AISTATS 2016 CVXPY: A Python-Embedded Modeling Language for Convex Optimization JMLR 2016 Cyclades: Conflict-free Asynchronous Machine Learning NeurIPS 2016 Data-driven Rank Breaking for Efficient Rank Aggregation JMLR 2016 Delay and Cooperation in Nonstochastic Bandits COLT 2016 Designing smoothing functions for improved worst-case competitive ratio in online optimization NeurIPS 2016 Determinantal Regularization for Ensemble Variable Selection AISTATS 2016 Differentially Private Data Releasing for Smooth Queries JMLR 2016 Dimension-Free Iteration Complexity of Finite Sum Optimization Problems NeurIPS 2016 Distributed Coordinate Descent Method for Learning with Big Data JMLR 2016 Distributed Submodular Maximization JMLR 2016 Double Thompson Sampling for Dueling Bandits NeurIPS 2016 DSA: Decentralized Double Stochastic Averaging Gradient Algorithm JMLR 2016 Dual Decomposed Learning with Factorwise Oracle for Structural SVM of Large Output Domain NeurIPS 2016 Dual Space Gradient Descent for Online Learning NeurIPS 2016