AAAI 2017 accepted papers on Optimization
17 of the 639 papers accepted at AAAI 2017 (2.7%) are on Optimization, compared with 3.3% at AAAI 2016. They fall into 3 topics.
See AAAI 2017 in the interactive map
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Nonconvex and smooth optimization · 12 papers
- An Exact Penalty Method for Binary Optimization Based on MPEC Formulation (52 citations)
- Accelerated Variance Reduced Stochastic ADMM (44 citations)
- Asynchronous Mini-Batch Gradient Descent with Variance Reduction for Non-Convex Optimization (42 citations)
- Asynchronous Stochastic Proximal Optimization Algorithms with Variance Reduction (18 citations)
- Mixed Discrete-Continuous Planning with Convex Optimization (15 citations)
- SCOPE: Scalable Composite Optimization for Learning on Spark (13 citations)
- Parallel Asynchronous Stochastic Variance Reduction for Nonconvex Optimization (10 citations)
- Lock-Free Optimization for Non-Convex Problems (8 citations)
- Parametric Dual Maximization for Non-Convex Learning Problems (7 citations)
- Adaptive Proximal Average Approximation for Composite Convex Minimization (5 citations)
- Lifted Inference for Convex Quadratic Programs (5 citations)
- Approximate Conditional Gradient Descent on Multi-Class Classification (3 citations)
Implicit bias and generalization · 4 papers
- A Riemannian Network for SPD Matrix Learning (476 citations)
- Alternating Back-Propagation for Generator Network (100 citations)
- Tunable Sensitivity to Large Errors in Neural Network Training (9 citations)
- Generalization Error Bounds for Optimization Algorithms via Stability (7 citations)
