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)

Dual Inference for Machine Learning IJCAI 2017 Dualing GANs NeurIPS 2017 Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization ICML 2017 Dueling Bandits with Weak Regret ICML 2017 Dynamic Collaborative Filtering With Compound Poisson Factorization AISTATS 2017 Dynamic Facial Analysis: From Bayesian Filtering to Recurrent Neural Network CVPR 2017 Dynamic Logic for Data-aware Systems: Decidability Results IJCAI 2017 Dynamic Time-Of-Flight CVPR 2017 Dynamic Walking on Randomly-Varying Discrete Terrain with One-step Preview RSS 2017 Dynamic Weighted Majority for Incremental Learning of Imbalanced Data Streams with Concept Drift IJCAI 2017 Dynamic Word Embeddings ICML 2017 Early stopping for kernel boosting algorithms: A general analysis with localized complexities NeurIPS 2017 ECO: Efficient Convolution Operators for Tracking CVPR 2017 Effective Inference for Generative Neural Parsing EMNLP 2017 Effective Parallelisation for Machine Learning NeurIPS 2017 Effective Representing of Information Network by Variational Autoencoder IJCAI 2017 Effective Semisupervised Learning on Manifolds COLT 2017 Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees IJCAI 2017 Efficient Algorithm for Sparse Tensor-variate Gaussian Graphical Models via Gradient Descent AISTATS 2017 Efficient and Flexible Inference for Stochastic Systems NeurIPS 2017 Efficient Attention using a Fixed-Size Memory Representation EMNLP 2017 Efficient Automatic Perception System Parameter Tuning On Site without Expert Supervision CoRL 2017 Efficient Benchmarking of NLP APIs using Multi-armed Bandits EACL 2017 Efficient Computation of Extensions for Dynamic Abstract Argumentation Frameworks: An Incremental Approach IJCAI 2017 Efficient Distributed Learning with Sparsity ICML 2017