← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14207 directly classified papers

Papers per year

Papers

Online PCA for Contaminated Data NIPS 2013
High-Dimensional Gaussian Process Bandits NIPS 2013
Bellman Error Based Feature Generation using Random Projections on Sparse Spaces NIPS 2013
Variational Planning for Graph-based MDPs NIPS 2013
Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation NIPS 2013
Reflection methods for user-friendly submodular optimization NIPS 2013
Distributed Exploration in Multi-Armed Bandits NIPS 2013
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NIPS 2013
Solving inverse problem of Markov chain with partial observations NIPS 2013
Sign Cauchy Projections and Chi-Square Kernel NIPS 2013
Learning Multi-level Sparse Representations NIPS 2013
Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching NIPS 2013
Optimizing Instructional Policies NIPS 2013
BudgetedSVM: A Toolbox for Scalable SVM Approximations JMLR 2013
On Decomposing the Proximal Map NIPS 2013
Variance Reduction for Stochastic Gradient Optimization NIPS 2013
Sketching Structured Matrices for Faster Nonlinear Regression NIPS 2013
Polar Operators for Structured Sparse Estimation NIPS 2013
Scalable Influence Estimation in Continuous-Time Diffusion Networks NIPS 2013
Exact and Stable Recovery of Pairwise Interaction Tensors NIPS 2013
Lasso Screening Rules via Dual Polytope Projection NIPS 2013
The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited NIPS 2013
Distributed Submodular Maximization: Identifying Representative Elements in Massive Data NIPS 2013
Fantope Projection and Selection: A near-optimal convex relaxation of sparse PCA NIPS 2013
Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n) NIPS 2013