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)

Phase Retrieval Under a Generative Prior NIPS 2018
Structured Local Minima in Sparse Blind Deconvolution NIPS 2018
Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach NIPS 2018
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NIPS 2018
Mixture Matrix Completion NIPS 2018
Factored Bandits NIPS 2018
Implicit Probabilistic Integrators for ODEs NIPS 2018
Adaptation to Easy Data in Prediction with Limited Advice NIPS 2018
Generalized Inverse Optimization through Online Learning NIPS 2018
Semidefinite relaxations for certifying robustness to adversarial examples NIPS 2018
Plug-in Estimation in High-Dimensional Linear Inverse Problems: A Rigorous Analysis NIPS 2018
Automating Bayesian optimization with Bayesian optimization NIPS 2018
Leveraged volume sampling for linear regression NIPS 2018
Scalable Robust Matrix Factorization with Nonconvex Loss NIPS 2018
Recurrent World Models Facilitate Policy Evolution NIPS 2018
On preserving non-discrimination when combining expert advice NIPS 2018
Inferring Networks From Random Walk-Based Node Similarities NIPS 2018
Distributed $k$-Clustering for Data with Heavy Noise NIPS 2018
Diverse Ensemble Evolution: Curriculum Data-Model Marriage NIPS 2018
The Convergence of Sparsified Gradient Methods NIPS 2018
ATOMO: Communication-efficient Learning via Atomic Sparsification NIPS 2018
Graphical model inference: Sequential Monte Carlo meets deterministic approximations NIPS 2018
Zeroth-order (Non)-Convex Stochastic Optimization via Conditional Gradient and Gradient Updates NIPS 2018
Coordinate Descent with Bandit Sampling NIPS 2018
Rest-Katyusha: Exploiting the Solution's Structure via Scheduled Restart Schemes NIPS 2018