conftrace_
← Mathematics & Optimization
Mathematics & Optimization ›

Optimization

12,959 papers (55 classified directly here)

Subtopics

Continuous Optimization (3,907) Stochastic Methods (2,788) Combinatorial Optimization (2,409) Online Algorithms (2,192) Optimization (1,207) Game Theory (944) Discrete Optimization (705) Convex Optimization (591) Optimal Transport (369) Sparse Optimization (347) Optimal Control (225) Global Optimization (190) Distributed Learning (157) Multi-Objective Optimization (125) Approximation Algorithms (110) Bayesian Optimization (100) Distributed Optimization (99) Theory (98) Non-Convex Optimization (76) Kernel Methods (73) Compressed Sensing (72) Robust Optimization (70) Evolutionary Algorithm (58) Linear Programming (43) Algorithms (10) Algorithm (10) Integer Programming (9) Submodular Optimization (9) Matrix Completion (8) Bilevel Optimization (8) Tensor Decomposition (6) Regularization (5)

Papers per year

1
15
119
411
1322
644
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

Combinatorial Multi-Armed Bandit with General Reward Functions NIPS 2016
Short-Dot: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products NIPS 2016
Efficient Nonparametric Smoothness Estimation NIPS 2016
Multistage Campaigning in Social Networks NIPS 2016
Global Optimality of Local Search for Low Rank Matrix Recovery NIPS 2016
Optimistic Bandit Convex Optimization NIPS 2016
Learning in Games: Robustness of Fast Convergence NIPS 2016
Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games NIPS 2016
On Robustness of Kernel Clustering NIPS 2016
Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\epsilon)$ NIPS 2016
Fast Algorithms for Robust PCA via Gradient Descent NIPS 2016
Local Minimax Complexity of Stochastic Convex Optimization NIPS 2016
Normalized Spectral Map Synchronization NIPS 2016
Regularized Nonlinear Acceleration NIPS 2016
A Non-generative Framework and Convex Relaxations for Unsupervised Learning NIPS 2016
Simple and Efficient Weighted Minwise Hashing NIPS 2016
Sample Complexity of Automated Mechanism Design NIPS 2016
LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain NIPS 2016
The Power of Optimization from Samples NIPS 2016
Optimal Tagging with Markov Chain Optimization NIPS 2016
A scaled Bregman theorem with applications NIPS 2016
The Product Cut NIPS 2016
Unified Methods for Exploiting Piecewise Linear Structure in Convex Optimization NIPS 2016
Large-Scale Price Optimization via Network Flow NIPS 2016
Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation NIPS 2016