Mathematics & Optimization

Properly Learning Poisson Binomial Distributions in Almost Polynomial Time COLT 2016 Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NeurIPS 2016 Provable Non-convex Phase Retrieval with Outliers: Median TruncatedWirtinger Flow ICML 2016 Provable Tensor Methods for Learning Mixtures of Generalized Linear Models AISTATS 2016 Proximal Riemannian Pursuit for Large-Scale Trace-Norm Minimization CVPR 2016 Proximal Stochastic Methods for Nonsmooth Nonconvex Finite-Sum Optimization NeurIPS 2016 Pruning Random Forests for Prediction on a Budget NeurIPS 2016 Pseudo-Marginal Slice Sampling AISTATS 2016 Pure Exploration of Multi-armed Bandit Under Matroid Constraints COLT 2016 Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation JMLR 2016 Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods ICML 2016 Quantized Random Projections and Non-Linear Estimation of Cosine Similarity NeurIPS 2016 Quantum Perceptron Models NeurIPS 2016 Quasi-Monte Carlo Feature Maps for Shift-Invariant Kernels JMLR 2016 Random Features for Sparse Signal Classification CVPR 2016 Random Forest for the Contextual Bandit Problem AISTATS 2016 Randomization and The Pernicious Effects of Limited Budgets on Auction Experiments AISTATS 2016 Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices JMLR 2016 Reconstructing Parameters of Spreading Models from Partial Observations NeurIPS 2016 Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates NeurIPS 2016 Recovery guarantee of weighted low-rank approximation via alternating minimization ICML 2016 Recycling Randomness with Structure for Sublinear time Kernel Expansions ICML 2016 Refined Lower Bounds for Adversarial Bandits NeurIPS 2016 Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits COLT 2016 Regret of Queueing Bandits NeurIPS 2016