← Core Methods
Machine Learning › Core Methods ›

Optimization

1184 directly classified papers

Papers per year

Papers

Non-delusional Q-learning and value-iteration NIPS 2018
Stochastic Expectation Maximization with Variance Reduction NIPS 2018
Statistical mechanics of low-rank tensor decomposition NIPS 2018
Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport NIPS 2018
Stochastic Spectral and Conjugate Descent Methods NIPS 2018
A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization NIPS 2018
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy ICML 2018
Not All Samples Are Created Equal: Deep Learning with Importance Sampling ICML 2018
Frank-Wolfe with Subsampling Oracle ICML 2018
Convergence guarantees for a class of non-convex and non-smooth optimization problems ICML 2018
Fast Gradient-Based Methods with Exponential Rate: A Hybrid Control Framework ICML 2018
DICOD: Distributed Convolutional Coordinate Descent for Convolutional Sparse Coding ICML 2018
Stochastic Proximal Algorithms for AUC Maximization ICML 2018
Efficient First-Order Algorithms for Adaptive Signal Denoising ICML 2018
Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation ICML 2018
Asynchronous Stochastic Quasi-Newton MCMC for Non-Convex Optimization ICML 2018
Accelerating Natural Gradient with Higher-Order Invariance ICML 2018
Approximation Algorithms for Cascading Prediction Models ICML 2018
Policy Optimization as Wasserstein Gradient Flows ICML 2018
Lossy Compression of Pattern Databases Using Acyclic Random Hypergraphs IJCAI 2017
Top-k Supervise Feature Selection via ADMM for Integer Programming IJCAI 2017
Batched High-dimensional Bayesian Optimization via Structural Kernel Learning ICML 2017
Learning RBM with a DC programming Approach ACML 2017
Supervised Learning of Automatic Pyramid for Optimization-Based Multi-Document Summarization ACL 2017
FFTLasso: Large-Scale LASSO in the Fourier Domain CVPR 2017