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)

Nearly Isometric Embedding by Relaxation NIPS 2016
Leveraging Sparsity for Efficient Submodular Data Summarization NIPS 2016
Quantum Perceptron Models NIPS 2016
Average-case hardness of RIP certification NIPS 2016
Fast and Provably Good Seedings for k-Means NIPS 2016
A Bandit Framework for Strategic Regression NIPS 2016
Linear Relaxations for Finding Diverse Elements in Metric Spaces NIPS 2016
Linear-Memory and Decomposition-Invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes NIPS 2016
A Comprehensive Linear Speedup Analysis for Asynchronous Stochastic Parallel Optimization from Zeroth-Order to First-Order NIPS 2016
Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling NIPS 2016
Faster Projection-free Convex Optimization over the Spectrahedron NIPS 2016
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits NIPS 2016
Contextual semibandits via supervised learning oracles NIPS 2016
Learning Kernels with Random Features NIPS 2016
Combinatorial semi-bandit with known covariance NIPS 2016
Exact Recovery of Hard Thresholding Pursuit NIPS 2016
A Multi-step Inertial Forward-Backward Splitting Method for Non-convex Optimization NIPS 2016
Learning Additive Exponential Family Graphical Models via $\ell_{2,1}$-norm Regularized M-Estimation NIPS 2016
On Explore-Then-Commit strategies NIPS 2016
Linear Contextual Bandits with Knapsacks NIPS 2016
Agnostic Estimation for Misspecified Phase Retrieval Models NIPS 2016
SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling NIPS 2016
Semiparametric Differential Graph Models NIPS 2016
Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NIPS 2016
Optimal Learning for Multi-pass Stochastic Gradient Methods NIPS 2016