Co-occurring keywords · papers mentioning both
Papers
A Constructive Approach to L_0 Penalized Regression
JMLR 2018
Adversarial Task Assignment
IJCAI 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
Comparing Constraints for Taxonomic Organization
NAACL 2018
Differential Equations for Modeling Asynchronous Algorithms
IJCAI 2018
Efficient Optimization for Rank-Based Loss Functions
CVPR 2018
Faster Training Algorithms for Structured Sparsity-Inducing Norm
IJCAI 2018
Local and Global Optimization Techniques in Graph-Based Clustering
CVPR 2018
New Balanced Active Learning Model and Optimization Algorithm
IJCAI 2018
SGDLibrary: A MATLAB library for stochastic optimization algorithms
JMLR 2018
The Physical Systems Behind Optimization Algorithms
NeurIPS 2018
Algorithms for ℓ_p Low-Rank Approximation
ICML 2017
Approximate Steepest Coordinate Descent
ICML 2017
A Unified Formulation and Fast Accelerated Proximal Gradient Method for Classification
JMLR 2017
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
NeurIPS 2017
Filter Flow Made Practical: Massively Parallel and Lock-Free
CVPR 2017
Safe Adaptive Importance Sampling
NeurIPS 2017
Sketching Meets Random Projection in the Dual: A Provable Recovery Algorithm for Big and High-dimensional Data
AISTATS 2017
StingyCD: Safely Avoiding Wasteful Updates in Coordinate Descent
ICML 2017
Temporal Planning for Compilation of Quantum Approximate Optimization Circuits
IJCAI 2017
When Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent
NeurIPS 2017
Coordinate-wise Power Method
NeurIPS 2016
Dual Decomposed Learning with Factorwise Oracle for Structural SVM of Large Output Domain
NeurIPS 2016
LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain
NeurIPS 2016