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)

Finite Time Analysis of Stratified Sampling for Monte Carlo NIPS 2011
Online Submodular Set Cover, Ranking, and Repeated Active Learning NIPS 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011
Clustered Multi-Task Learning Via Alternating Structure Optimization NIPS 2011
On Learning Discrete Graphical Models using Greedy Methods NIPS 2011
On the Universality of Online Mirror Descent NIPS 2011
Statistical Tests for Optimization Efficiency NIPS 2011
Statistical Performance of Convex Tensor Decomposition NIPS 2011
Reinforcement Learning using Kernel-Based Stochastic Factorization NIPS 2011
Better Mini-Batch Algorithms via Accelerated Gradient Methods NIPS 2011
Energetically Optimal Action Potentials NIPS 2011
Thinning Measurement Models and Questionnaire Design NIPS 2011
Shaping Level Sets with Submodular Functions NIPS 2011
Multi-Bandit Best Arm Identification NIPS 2011
Minimax Localization of Structural Information in Large Noisy Matrices NIPS 2011
Committing Bandits NIPS 2011
Sparse recovery by thresholded non-negative least squares NIPS 2011
Variance Reduction in Monte-Carlo Tree Search NIPS 2011
On fast approximate submodular minimization NIPS 2011
Improved Algorithms for Linear Stochastic Bandits NIPS 2011
From Bandits to Experts: On the Value of Side-Observations NIPS 2011
An Empirical Evaluation of Thompson Sampling NIPS 2011
Efficient Offline Communication Policies for Factored Multiagent POMDPs NIPS 2011
Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning NIPS 2011
Quasi-Newton Methods for Markov Chain Monte Carlo NIPS 2011