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)

FALKON: An Optimal Large Scale Kernel Method NIPS 2017
Generalized Linear Model Regression under Distance-to-set Penalties NIPS 2017
Breaking the Nonsmooth Barrier: A Scalable Parallel Method for Composite Optimization NIPS 2017
Adaptive SVRG Methods under Error Bound Conditions with Unknown Growth Parameter NIPS 2017
Real-Time Bidding with Side Information NIPS 2017
Approximate Supermodularity Bounds for Experimental Design NIPS 2017
When Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent NIPS 2017
Robust Optimization for Non-Convex Objectives NIPS 2017
Safe Adaptive Importance Sampling NIPS 2017
A Universal Analysis of Large-Scale Regularized Least Squares Solutions NIPS 2017
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms NIPS 2017
Phase Transitions in the Pooled Data Problem NIPS 2017
Polynomial time algorithms for dual volume sampling NIPS 2017
Differentiable Learning of Submodular Models NIPS 2017
On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm NIPS 2017
Best Response Regression NIPS 2017
Elementary Symmetric Polynomials for Optimal Experimental Design NIPS 2017
Dynamic Importance Sampling for Anytime Bounds of the Partition Function NIPS 2017
Process-constrained batch Bayesian optimisation NIPS 2017
Multi-View Decision Processes: The Helper-AI Problem NIPS 2017
Online Learning with a Hint NIPS 2017
DPSCREEN: Dynamic Personalized Screening NIPS 2017
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions NIPS 2017
Gradient Methods for Submodular Maximization NIPS 2017
Collecting Telemetry Data Privately NIPS 2017