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

Optimization

14,207 papers

Papers per year

Papers

Multi-class SVMs: From Tighter Data-Dependent Generalization Bounds to Novel Algorithms NIPS 2015
M-Best-Diverse Labelings for Submodular Energies and Beyond NIPS 2015
Convergence rates of sub-sampled Newton methods NIPS 2015
Equilibrated adaptive learning rates for non-convex optimization NIPS 2015
Analysis of Robust PCA via Local Incoherence NIPS 2015
Asynchronous Parallel Stochastic Gradient for Nonconvex Optimization NIPS 2015
Fast and Guaranteed Tensor Decomposition via Sketching NIPS 2015
Minimax Time Series Prediction NIPS 2015
Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff NIPS 2015
Nearly Optimal Private LASSO NIPS 2015
Fast Lifted MAP Inference via Partitioning NIPS 2015
Convergence Analysis of Prediction Markets via Randomized Subspace Descent NIPS 2015
Multi-Layer Feature Reduction for Tree Structured Group Lasso via Hierarchical Projection NIPS 2015
GAP Safe screening rules for sparse multi-task and multi-class models NIPS 2015
Unified View of Matrix Completion under General Structural Constraints NIPS 2015
Interpolating Convex and Non-Convex Tensor Decompositions via the Subspace Norm NIPS 2015
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems NIPS 2015
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NIPS 2015
Probabilistic Line Searches for Stochastic Optimization NIPS 2015
On the Optimality of Classifier Chain for Multi-label Classification NIPS 2015
A Normative Theory of Adaptive Dimensionality Reduction in Neural Networks NIPS 2015
A Pseudo-Euclidean Iteration for Optimal Recovery in Noisy ICA NIPS 2015
Approximating Sparse PCA from Incomplete Data NIPS 2015
Regularization-Free Estimation in Trace Regression with Symmetric Positive Semidefinite Matrices NIPS 2015
Beyond Convexity: Stochastic Quasi-Convex Optimization NIPS 2015