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)

Handling Hard Affine SDP Shape Constraints in RKHSs JMLR 2022 Handling Slice Permutations Variability in Tensor Recovery AAAI 2022 HARA: A Hierarchical Approach for Robust Rotation Averaging CVPR 2022 Hardness and Algorithms for Robust and Sparse Optimization ICML 2022 Hardness of Maximum Likelihood Learning of DPPs COLT 2022 HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem IJCAI 2022 Hedonic Diversity Games: A Complexity Picture with More than Two Colors AAAI 2022 Hessian-Free High-Resolution Nesterov Acceleration For Sampling ICML 2022 Heterogeneous Facility Location with Limited Resources AAAI 2022 Hierarchical Optimal Transport for Comparing Histopathology Datasets MIDL 2022 High-dimensional Additive Gaussian Processes under Monotonicity Constraints NeurIPS 2022 Highly-Efficient Incomplete Large-Scale Multi-View Clustering With Consensus Bipartite Graph CVPR 2022 High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize ICLR 2022 High-probability bounds for robust stochastic Frank-Wolfe algorithm UAI 2022 High Probability Guarantees for Nonconvex Stochastic Gradient Descent with Heavy Tails ICML 2022 HLRTF: Hierarchical Low-Rank Tensor Factorization for Inverse Problems in Multi-Dimensional Imaging CVPR 2022 HNO: High-Order Numerical Architecture for ODE-Inspired Deep Unfolding Networks AAAI 2022 Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent (Extended Abstract) IJCAI 2022 How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents NeurIPS 2022 How Many Representatives Do We Need? The Optimal Size of a Congress Voting on Binary Issues AAAI 2022 How to Fill the Optimum Set? Population Gradient Descent with Harmless Diversity ICML 2022 How to Learn when Data Gradually Reacts to Your Model AISTATS 2022 Human-AI Collaborative Bayesian Optimisation NeurIPS 2022 Hyperverlet: A Symplectic Hypersolver for Hamiltonian Systems AAAI 2022 I AM A.I. Gradient Descent – an Open-Source Digital Game for Inquiry-Based CLIL Learning AAAI 2022