← Core Methods
Machine Learning › Core Methods ›

Optimization

1184 directly classified papers

Papers per year

Papers

Video Desnowing and Deraining Based on Matrix Decomposition CVPR 2017
Residual Expansion Algorithm: Fast and Effective Optimization for Nonconvex Least Squares Problems CVPR 2017
Riemannian Optimization for Skip-Gram Negative Sampling ACL 2017
Tensor Decomposition via Simultaneous Power Iteration ICML 2017
Approximate Supermodularity Bounds for Experimental Design NIPS 2017
How regularization affects the critical points in linear networks NIPS 2017
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration NIPS 2017
SVD-Softmax: Fast Softmax Approximation on Large Vocabulary Neural Networks NIPS 2017
Optimized Pre-Processing for Discrimination Prevention NIPS 2017
On Blackbox Backpropagation and Jacobian Sensing NIPS 2017
Translation Synchronization via Truncated Least Squares NIPS 2017
Geometric Descent Method for Convex Composite Minimization NIPS 2017
Metaheuristic Approaches to Lexical Substitution and Simplification EACL 2017
High-Dimensional Variance-Reduced Stochastic Gradient Expectation-Maximization Algorithm ICML 2017
A Simulated Annealing Based Inexact Oracle for Wasserstein Loss Minimization ICML 2017
Parametric Simplex Method for Sparse Learning NIPS 2017
Collaborative Summarization of Topic-Related Videos CVPR 2017
An inner-loop free solution to inverse problems using deep neural networks NIPS 2017
Trimmed Density Ratio Estimation NIPS 2017
Efficient Use of Limited-Memory Accelerators for Linear Learning on Heterogeneous Systems NIPS 2017
Generalized Conditional Gradient for Sparse Estimation JMLR 2017
On Approximation Guarantees for Greedy Low Rank Optimization ICML 2017
Input Convex Neural Networks ICML 2017
Doubly Greedy Primal-Dual Coordinate Descent for Sparse Empirical Risk Minimization ICML 2017
Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization ICML 2017