← Keywords

convex optimization

1320 papers

Explore in graph

Also known as

ACO ADMM CO OCO

Co-occurring keywords

stochastic optimization (1060) convergence rate (606) stochastic gradient descent (1088) gradient descent (1143) online learning (1770) support vector machine (976) matrix completion (356) regret bound (1918) kernel methods (1096) sparse optimization (246)

Papers

Dynamic Regret of Strongly Adaptive Methods ICML 2018
Causal Structure Learning via Temporal Markov Networks PGM 2018
Provable Estimation of the Number of Blocks in Block Models AISTATS 2018
Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity JMLR 2018
Accelerated Difference of Convex functions Algorithm and its Application to Sparse Binary Logistic Regression IJCAI 2018
Online Continuous-Time Tensor Factorization Based on Pairwise Interactive Point Processes IJCAI 2018
Adaptive Three Operator Splitting ICML 2018
Equivalence of Multicategory SVM and Simplex Cone SVM: Fast Computations and Statistical Theory ICML 2018
An Algorithmic Framework of Variable Metric Over-Relaxed Hybrid Proximal Extra-Gradient Method ICML 2018
Efficient Convex Completion of Coupled Tensors using Coupled Nuclear Norms NIPS 2018
Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity NIPS 2018
A convex program for bilinear inversion of sparse vectors NIPS 2018
Forward-Backward Splitting for Time-Varying Graphical Models PGM 2018
Unleashing Linear Optimizers for Group-Fair Learning and Optimization COLT 2018
Minimax Bounds on Stochastic Batched Convex Optimization COLT 2018
FLAG n’ FLARE: Fast Linearly-Coupled Adaptive Gradient Methods AISTATS 2018
Stochastic Three-Composite Convex Minimization with a Linear Operator AISTATS 2018
Smooth and Sparse Optimal Transport AISTATS 2018
Accelerated Stochastic Mirror Descent: From Continuous-time Dynamics to Discrete-time Algorithms AISTATS 2018
Nonparametric Sharpe Ratio Function Estimation in Heteroscedastic Regression Models via Convex Optimization AISTATS 2018
Convex Optimization over Intersection of Simple Sets: improved Convergence Rate Guarantees via an Exact Penalty Approach AISTATS 2018
Weighted SGD for $\ell_p$ Regression with Randomized Preconditioning JMLR 2018
Fast MCMC Sampling Algorithms on Polytopes JMLR 2018
Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling JMLR 2018
Lyapunov Functions for First-Order Methods: Tight Automated Convergence Guarantees ICML 2018