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)

Improved Penalty Method via Doubly Stochastic Gradients for Bilevel Hyperparameter Optimization AAAI 2021 Improved Regret Bound and Experience Replay in Regularized Policy Iteration ICML 2021 Improved Regret Bounds for Tracking Experts with Memory NeurIPS 2021 Improved Regret Bounds of Bilinear Bandits using Action Space Analysis ICML 2021 Improved Regret for Zeroth-Order Stochastic Convex Bandits COLT 2021 Improving approximate optimal transport distances using quantization UAI 2021 Improving Conditional Coverage via Orthogonal Quantile Regression NeurIPS 2021 Improving Gaussian mixture latent variable model convergence with Optimal Transport ACML 2021 Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding AAAI 2021 Improving the Morphology and Control Policy of Self-reconfiguring Modular Robots in Dynamic Environment (Student Abstract) AAAI 2021 Improving Welfare in One-Sided Matchings using Simple Threshold Queries IJCAI 2021 Incentive-Aware PAC Learning AAAI 2021 Incentivized Bandit Learning with Self-Reinforcing User Preferences ICML 2021 Incentivizing Compliance with Algorithmic Instruments ICML 2021 Incentivizing Truthfulness Through Audits in Strategic Classification AAAI 2021 Increasing Iterate Averaging for Solving Saddle-Point Problems AAAI 2021 Incremental Learning via Rate Reduction CVPR 2021 In-Database Regression in Input Sparsity Time ICML 2021 Individual Fairness in Kidney Exchange Programs AAAI 2021 Indoor Lighting Estimation Using an Event Camera CVPR 2021 Inductive Mutual Information Estimation: A Convex Maximum-Entropy Copula Approach AISTATS 2021 Inference in Stochastic Epidemic Models via Multinomial Approximations AISTATS 2021 Inference of Black Hole Fluid-Dynamics From Sparse Interferometric Measurements ICCV 2021 Inferring serial correlation with dynamic backgrounds ICML 2021 Infinite-Dimensional Fisher Markets: Equilibrium, Duality and Optimization AAAI 2021