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)

Multi-Fidelity Multi-Objective Bayesian Optimization: An Output Space Entropy Search Approach AAAI 2020 Multi-label Feature Selection via Global Relevance and Redundancy Optimization IJCAI 2020 Multinomial Logit Bandit with Low Switching Cost ICML 2020 Multi-objective Bayesian Optimization using Pareto-frontier Entropy ICML 2020 Multi-Objective Multi-Agent Planning for Jointly Discovering and Tracking Mobile Objects AAAI 2020 Multi-Player Bandits: The Adversarial Case JMLR 2020 Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination AAAI 2020 Multi-Robot Adversarial Patrolling Strategies via Lattice Paths IJCAI 2020 Multi-Task Learning with User Preferences: Gradient Descent with Controlled Ascent in Pareto Optimization ICML 2020 Multi-Type Resource Allocation with Partial Preferences AAAI 2020 Mutual Information Estimation using LSH Sampling IJCAI 2020 Myersonian Regression NeurIPS 2020 My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits ICML 2020 Naive Exploration is Optimal for Online LQR ICML 2020 NAYEL at SemEval-2020 Task 12: TF/IDF-Based Approach for Automatic Offensive Language Detection in Arabic Tweets SemEval 2020 Near Input Sparsity Time Kernel Embeddings via Adaptive Sampling ICML 2020 Near-linear time Gaussian process optimization with adaptive batching and resparsification ICML 2020 Nearly Non-Expansive Bounds for Mahalanobis Hard Thresholding COLT 2020 Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs IJCAI 2020 Near-Optimal Algorithms for Minimax Optimization COLT 2020 Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond COLT 2020 Near-optimal Regret Bounds for Stochastic Shortest Path ICML 2020 Nesterov's Acceleration for Approximate Newton JMLR 2020 Neural Approximate Dynamic Programming for On-Demand Ride-Pooling AAAI 2020 NeuralExplorer: State Space Exploration of Closed Loop Control Systems Using Neural Networks L4DC 2020