← Core Methods
Machine Learning › Core Methods ›

Optimization

1184 directly classified papers

Papers per year

Papers

Scalable Influence Estimation in Continuous-Time Diffusion Networks NIPS 2013
Polar Operators for Structured Sparse Estimation NIPS 2013
From Bandits to Experts: A Tale of Domination and Independence NIPS 2013
Accelerating Stochastic Gradient Descent using Predictive Variance Reduction NIPS 2013
Distributed Submodular Maximization: Identifying Representative Elements in Massive Data NIPS 2013
Learning Efficient Random Maximum A-Posteriori Predictors with Non-Decomposable Loss Functions NIPS 2013
Symbolic Opportunistic Policy Iteration for Factored-Action MDPs NIPS 2013
Better Approximation and Faster Algorithm Using the Proximal Average NIPS 2013
Efficient Optimization for Sparse Gaussian Process Regression NIPS 2013
Geometric optimisation on positive definite matrices for elliptically contoured distributions NIPS 2013
An Approximate, Efficient LP Solver for LP Rounding NIPS 2013
Convex Tensor Decomposition via Structured Schatten Norm Regularization NIPS 2013
Accelerated Mini-Batch Stochastic Dual Coordinate Ascent NIPS 2013
Robust Spatial Filtering with Beta Divergence NIPS 2013
Dirty Statistical Models NIPS 2013
Exact and Stable Recovery of Pairwise Interaction Tensors NIPS 2013
Variance Reduction for Stochastic Gradient Optimization NIPS 2013
Recovering the Optimal Solution by Dual Random Projection COLT 2013
Passive Learning with Target Risk COLT 2013
Optimizing the F-Measure in Multi-Label Classification: Plug-in Rule Approach versus Structured Loss Minimization ICML 2013
Learning Policies for Contextual Submodular Prediction ICML 2013
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints NIPS 2013
Convex Two-Layer Modeling NIPS 2013
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
Learning Hidden Markov Models from Non-sequence Data via Tensor Decomposition NIPS 2013