Skip to content
conftrace_

Optimization

14,850 papers (55 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Continuous Optimization (4,424) Stochastic Methods (2,991) Combinatorial Optimization (2,615) Online Algorithms (2,404) Optimization (1,521) Game Theory (1,046) Convex Optimization (864) Discrete Optimization (721) Optimal Transport (474) Sparse Optimization (416) Optimal Control (271) Global Optimization (200) Non-Convex Optimization (182) Distributed Learning (164) Approximation Algorithms (162) Multi-Objective Optimization (151) Distributed Optimization (136) Bayesian Optimization (132) Theory (109) Compressed Sensing (102) Algorithms (89) Robust Optimization (86) Submodular Optimization (77) Kernel Methods (75) Evolutionary Algorithm (72) Linear Programming (54) Tensor Decomposition (48) Bilevel Optimization (42) Integer Programming (38) Matrix Completion (33) Algorithm (21) Regularization (11)

Papers per year

1
16
133
440
1,353
1,441
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Plurality Veto: A Simple Voting Rule Achieving Optimal Metric Distortion IJCAI 2022 Policy Learning and Evaluation with Randomized Quasi-Monte Carlo AISTATS 2022 Policy Optimization with Linear Temporal Logic Constraints NeurIPS 2022 Polynomial time guarantees for the Burer-Monteiro method NeurIPS 2022 Polynomial Time Reinforcement Learning in Factored State MDPs with Linear Value Functions AISTATS 2022 PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits NeurIPS 2022 Posistive-Unlabeled Learning via Optimal Transport and Margin Distribution IJCAI 2022 Positively Weighted Kernel Quadrature via Subsampling NeurIPS 2022 Posted Pricing and Dynamic Prior-independent Mechanisms with Value Maximizers NeurIPS 2022 Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering ICML 2022 Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs AAAI 2022 Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums AISTATS 2022 Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm NeurIPS 2022 Preconditioning for Scalable Gaussian Process Hyperparameter Optimization ICML 2022 Pretrained Cost Model for Distributed Constraint Optimization Problems AAAI 2022 PRISM: A Rich Class of Parameterized Submodular Information Measures for Guided Data Subset Selection AAAI 2022 Private Convex Optimization via Exponential Mechanism COLT 2022 Private frequency estimation via projective geometry ICML 2022 Private Sequential Hypothesis Testing for Statisticians: Privacy, Error Rates, and Sample Size AISTATS 2022 Private Stochastic Convex Optimization and Sparse Learning with Heavy-tailed Data Revisited IJCAI 2022 Private Streaming SCO in ℓ_p geometry with Applications in High Dimensional Online Decision Making ICML 2022 Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback AAAI 2022 Product Ranking for Revenue Maximization with Multiple Purchases NeurIPS 2022 Project and Forget: Solving Large-Scale Metric Constrained Problems JMLR 2022 Projected Gradient Descent Algorithms for Solving Nonlinear Inverse Problems with Generative Priors IJCAI 2022