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)

Beyond L1: Faster and Better Sparse Models with skglm NeurIPS 2022 Beyond spectral gap: the role of the topology in decentralized learning NeurIPS 2022 Beyond Sub-Gaussian Noises: Sharp Concentration Analysis for Stochastic Gradient Descent JMLR 2022 Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update NeurIPS 2022 Beyond Worst-Case Analysis in Stochastic Approximation: Moment Estimation Improves Instance Complexity ICML 2022 Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales COLT 2022 BILCO: An Efficient Algorithm for Joint Alignment of Time Series NeurIPS 2022 Bilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport EMNLP 2022 Blocking Influence at Collective Level with Hard Constraints (Student Abstract) AAAI 2022 Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck IJCAI 2022 BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach NeurIPS 2022 Born-Infeld (BI) for AI: Energy-Conserving Descent (ECD) for Optimization ICML 2022 Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity NeurIPS 2022 Bounding the Error of Discretized Langevin Algorithms for Non-Strongly Log-Concave Targets JMLR 2022 Bounds on Causal Effects and Application to High Dimensional Data AAAI 2022 Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+Optimize NeurIPS 2022 Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022 Breaking the Convergence Barrier: Optimization via Fixed-Time Convergent Flows AAAI 2022 Bregman Power k-Means for Clustering Exponential Family Data ICML 2022 Bregman Proximal Langevin Monte Carlo via Bregman-Moreau Envelopes ICML 2022 Bridging Central and Local Differential Privacy in Data Acquisition Mechanisms NeurIPS 2022 Bring Your Own Algorithm for Optimal Differentially Private Stochastic Minimax Optimization NeurIPS 2022 BR-SNIS: Bias Reduced Self-Normalized Importance Sampling NeurIPS 2022 Budgeted Sequence Submodular Maximization IJCAI 2022 Camera Pose Estimation Using Implicit Distortion Models CVPR 2022