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)

CherryPick: Adaptively Unearthing the Best Cloud Configurations for Big Data Analytics NSDI 2017 Clone MCMC: Parallel High-Dimensional Gaussian Gibbs Sampling NeurIPS 2017 Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery ICML 2017 Clustering Stable Instances of Euclidean k-means. NeurIPS 2017 Coarse-To-Fine Segmentation With Shape-Tailored Continuum Scale Spaces CVPR 2017 Coded Distributed Computing for Inverse Problems NeurIPS 2017 COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Evolution JMLR 2017 Collaborative Deep Learning in Fixed Topology Networks NeurIPS 2017 Collecting Telemetry Data Privately NeurIPS 2017 Combinatorial Topic Models using Small-Variance Asymptotics AISTATS 2017 Committee Scoring Rules: A Call to Arms IJCAI 2017 Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis ICML 2017 Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems IJCAI 2017 Comparing Strategic Secrecy and Stackelberg Commitment in Security Games IJCAI 2017 Compromise-free Pathfinding on a Navigation Mesh IJCAI 2017 Computationally Efficient Robust Sparse Estimation in High Dimensions COLT 2017 Computing an Approximately Optimal Agreeable Set of Items IJCAI 2017 Computing Bayes-Nash Equilibria in Combinatorial Auctions with Continuous Value and Action Spaces IJCAI 2017 Concentration of Multilinear Functions of the Ising Model with Applications to Network Data NeurIPS 2017 Conditional Accelerated Lazy Stochastic Gradient Descent ICML 2017 Conditions beyond treewidth for tightness of higher-order LP relaxations AISTATS 2017 Conic Scan-and-Cover algorithms for nonparametric topic modeling NeurIPS 2017 Connected Subgraph Detection with Mirror Descent on SDPs ICML 2017 Consensus Maximization With Linear Matrix Inequality Constraints CVPR 2017 Conservative Contextual Linear Bandits NeurIPS 2017