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)

Representing 3D Shapes With Probabilistic Directed Distance Fields CVPR 2022 Reproducibility in Optimization: Theoretical Framework and Limits NeurIPS 2022 Residual-Based Sampling for Online Outlier-Robust PCA ICML 2022 Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(ε^-7/4)$ Complexity ICML 2022 Reverse Engineering ℓ_p attacks: A block-sparse optimization approach with recovery guarantees ICML 2022 Revision by Comparison for Ranking Functions IJCAI 2022 Revisiting Document Image Dewarping by Grid Regularization CVPR 2022 Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness ICML 2022 Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimization NeurIPS 2022 Revisit last-iterate convergence of mSGD under milder requirement on step size NeurIPS 2022 Reward-Free Policy Space Compression for Reinforcement Learning AISTATS 2022 RID-Noise: Towards Robust Inverse Design under Noisy Environments AAAI 2022 Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold JMLR 2022 Risk-Averse No-Regret Learning in Online Convex Games ICML 2022 Robust and Accurate Superquadric Recovery: A Probabilistic Approach CVPR 2022 Robust computation of optimal transport by $β$-potential regularization ACML 2022 Robust Distributed Accelerated Stochastic Gradient Methods for Multi-Agent Networks JMLR 2022 Robust Generalized Method of Moments: A Finite Sample Viewpoint NeurIPS 2022 Robust Graph-Based Multi-View Clustering AAAI 2022 Robust Group Synchronization via Quadratic Programming ICML 2022 Robust Imitation via Mirror Descent Inverse Reinforcement Learning NeurIPS 2022 Robust Multi-Objective Bayesian Optimization Under Input Noise ICML 2022 Robustness Guarantees for Credal Bayesian Networks via Constraint Relaxation over Probabilistic Circuits IJCAI 2022 Robustness in Multi-Objective Submodular Optimization: a Quantile Approach ICML 2022 Robustness to Unbounded Smoothness of Generalized SignSGD NeurIPS 2022