Skip to content
conftrace_

Optimization & Theory

43,292 papers (3 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Optimization (17,731) Learning Theory (6,809) Bayesian Inference (6,267) Theory (5,579) Statistical Learning (4,564) Neural Network Optimization (4,155) Stochastic Processes (2,948) Stochastic Methods (1,283) Loss Functions (1,220) Distributed Learning (1,202) Online Algorithms (1,013) Statistics (822) Generalization (376) Information Theory (370) Sample Complexity (282) Sparse Optimization (241) Game Theory (151) Convex Optimization (132) Optimal Transport (104) Robust Optimization (84) Distributed Optimization (73) Approximation Algorithms (33)

Papers per year

1
52
352
828
3,646
5,854
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Mean Field for the Stochastic Blockmodel: Optimization Landscape and Convergence Issues NeurIPS 2018 Mean-field theory of graph neural networks in graph partitioning NeurIPS 2018 Measuring sentence parallelism using Mahalanobis distances: The NRC unsupervised submissions to the WMT18 Parallel Corpus Filtering shared task EMNLP 2018 Measuring the Diversity of Automatic Image Descriptions COLING 2018 Measuring the Intrinsic Dimension of Objective Landscapes ICLR 2018 MegDet: A Large Mini-Batch Object Detector CVPR 2018 Memory Time Span in LSTMs for Multi-Speaker Source Separation Interspeech 2018 Mental Sampling in Multimodal Representations NeurIPS 2018 MeSH-based dataset for measuring the relevance of text retrieval ACL 2018 Mesh-TensorFlow: Deep Learning for Supercomputers NeurIPS 2018 Meta-Learning by Adjusting Priors Based on Extended PAC-Bayes Theory ICML 2018 Meta-Level Control of Anytime Algorithms with Online Performance Prediction IJCAI 2018 Minibatch Gibbs Sampling on Large Graphical Models ICML 2018 Minimax Bounds on Stochastic Batched Convex Optimization COLT 2018 Minimax Curriculum Learning: Machine Teaching with Desirable Difficulties and Scheduled Diversity ICLR 2018 Minimax Estimation of Neural Net Distance NeurIPS 2018 Minimax Optimal Bayes Mixtures for Memoryless Sources over Large Alphabets ALT 2018 Minimax-Optimal Privacy-Preserving Sparse PCA in Distributed Systems AISTATS 2018 Minimax Rates and Efficient Algorithms for Noisy Sorting ALT 2018 Minimax Reconstruction Risk of Convolutional Sparse Dictionary Learning AISTATS 2018 Minimax Statistical Learning with Wasserstein distances NeurIPS 2018 Minimizing Adaptive Regret with One Gradient per Iteration IJCAI 2018 Mirrored Langevin Dynamics NeurIPS 2018 Missing Slice Recovery for Tensors Using a Low-Rank Model in Embedded Space CVPR 2018 MISSION: Ultra Large-Scale Feature Selection using Count-Sketches ICML 2018