Co-occurring keywords · papers mentioning both
Papers
Accelerating Greedy Coordinate Descent Methods
ICML 2018
Accelerating Stochastic Gradient Descent for Least Squares Regression
COLT 2018
Acceleration through Optimistic No-Regret Dynamics
NeurIPS 2018
A Certifiably Globally Optimal Solution to the Non-Minimal Relative Pose Problem
CVPR 2018
A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming
ICML 2018
A convex program for bilinear inversion of sparse vectors
NeurIPS 2018
Adaptive Three Operator Splitting
ICML 2018
A Generic Approach for Accelerating Stochastic Zeroth-Order Convex Optimization
IJCAI 2018
An Algorithmic Framework of Variable Metric Over-Relaxed Hybrid Proximal Extra-Gradient Method
ICML 2018
A Robust Learning Approach for Regression Models Based on Distributionally Robust Optimization
JMLR 2018
ASVRG: Accelerated Proximal SVRG
ACML 2018
Blind Deconvolutional Phase Retrieval via Convex Programming
NeurIPS 2018
Byzantine Stochastic Gradient Descent
NeurIPS 2018
Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
JMLR 2018
Causal Structure Learning via Temporal Markov Networks
PGM 2018
Celer: a Fast Solver for the Lasso with Dual Extrapolation
ICML 2018
Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
JMLR 2018
Compact Convex Projections
JMLR 2018
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm
ICML 2018
Convex Elicitation of Continuous Properties
NeurIPS 2018
Convex Optimization over Intersection of Simple Sets: improved Convergence Rate Guarantees via an Exact Penalty Approach
AISTATS 2018
Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing
COLT 2018
Convolutional Imputation of Matrix Networks
ICML 2018
Data-Dependent Stability of Stochastic Gradient Descent
ICML 2018
Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters
NeurIPS 2018