conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14,207 papers

Papers per year

Papers

Combinatorial Multi-Armed Bandit with General Reward Functions NIPS 2016
SEBOOST - Boosting Stochastic Learning Using Subspace Optimization Techniques NIPS 2016
Multistage Campaigning in Social Networks NIPS 2016
Global Optimality of Local Search for Low Rank Matrix Recovery NIPS 2016
Optimistic Bandit Convex Optimization NIPS 2016
Minimax Optimal Alternating Minimization for Kernel Nonparametric Tensor Learning NIPS 2016
Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\epsilon)$ NIPS 2016
Fast Algorithms for Robust PCA via Gradient Descent NIPS 2016
Dimensionality Reduction of Massive Sparse Datasets Using Coresets NIPS 2016
Doubly Convolutional Neural Networks NIPS 2016
Local Minimax Complexity of Stochastic Convex Optimization NIPS 2016
Regularized Nonlinear Acceleration NIPS 2016
Stochastic Online AUC Maximization NIPS 2016
Optimizing affinity-based binary hashing using auxiliary coordinates NIPS 2016
Without-Replacement Sampling for Stochastic Gradient Methods NIPS 2016
Barzilai-Borwein Step Size for Stochastic Gradient Descent NIPS 2016
A scaled Bregman theorem with applications NIPS 2016
Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation NIPS 2016
Quantum Perceptron Models NIPS 2016
Efficient High-Order Interaction-Aware Feature Selection Based on Conditional Mutual Information NIPS 2016
Linear-Memory and Decomposition-Invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes NIPS 2016
A Comprehensive Linear Speedup Analysis for Asynchronous Stochastic Parallel Optimization from Zeroth-Order to First-Order NIPS 2016
Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling NIPS 2016
Satisfying Real-world Goals with Dataset Constraints NIPS 2016
Launch and Iterate: Reducing Prediction Churn NIPS 2016