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)

Linearized Alternating Direction Method of Multipliers for Constrained Nonconvex Regularized Optimization ACML 2016
Proper Inner Product with Mean Displacement for Gaussian Noise Invariant ICA ACML 2016
Geometry-aware stationary subspace analysis ACML 2016
Revealing Graph Bandits for Maximizing Local Influence AISTATS 2016
Convex Block-sparse Linear Regression with Expanders – Provably AISTATS 2016
Tightness of LP Relaxations for Almost Balanced Models AISTATS 2016
Control Functionals for Quasi-Monte Carlo Integration AISTATS 2016
Random Forest for the Contextual Bandit Problem AISTATS 2016
Learning Sparse Additive Models with Interactions in High Dimensions AISTATS 2016
Bipartite Correlation Clustering: Maximizing Agreements AISTATS 2016
Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices AISTATS 2016
Precision Matrix Estimation in High Dimensional Gaussian Graphical Models with Faster Rates AISTATS 2016
On the Reducibility of Submodular Functions AISTATS 2016
Accelerated Stochastic Gradient Descent for Minimizing Finite Sums AISTATS 2016
Fast Convergence of Online Pairwise Learning Algorithms AISTATS 2016
Non-stochastic Best Arm Identification and Hyperparameter Optimization AISTATS 2016
A Linearly-Convergent Stochastic L-BFGS Algorithm AISTATS 2016
No Regret Bound for Extreme Bandits AISTATS 2016
Online Learning to Rank with Feedback at the Top AISTATS 2016
Time-Varying Gaussian Process Bandit Optimization AISTATS 2016
An Improved Convergence Analysis of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization AISTATS 2016
Large-Scale Optimization Algorithms for Sparse Conditional Gaussian Graphical Models AISTATS 2016
Low-Rank and Sparse Structure Pursuit via Alternating Minimization AISTATS 2016
Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization AISTATS 2016
Fast Dictionary Learning with a Smoothed Wasserstein Loss AISTATS 2016