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)

An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives COLT 2016 An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learning JMLR 2016 An End-To-End System for Accomplishing Tasks with Modular Robots RSS 2016 An equivalence between high dimensional Bayes optimal inference and M-estimation NeurIPS 2016 An Error Bound for L1-norm Support Vector Machine Coefficients in Ultra-high Dimension JMLR 2016 A Network That Learns Strassen Multiplication JMLR 2016 A New Algorithm and Theory for Penalized Regression-based Clustering JMLR 2016 A New PAC-Bayesian Perspective on Domain Adaptation ICML 2016 An Expectation Maximization Approach to Joint Modeling of Multidimensional Ratings Derived from Multiple Annotators Interspeech 2016 An Improved Convergence Analysis of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization AISTATS 2016 An Information-Theoretic Analysis of Thompson Sampling JMLR 2016 An Objective Evaluation Methodology for Blind Bandwidth Extension Interspeech 2016 A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing NeurIPS 2016 An Online Convex Optimization Approach to Blackwell's Approachability JMLR 2016 A Non-parametric Learning Method for Confidently Estimating Patient's Clinical State and Dynamics NeurIPS 2016 An optimal algorithm for the Thresholding Bandit Problem ICML 2016 A Note on the Sample Complexity of the Er-SpUD Algorithm by Spielman, Wang and Wright for Exact Recovery of Sparsely Used Dictionaries JMLR 2016 A Novel Fast Framework for Topic Labeling Based on Similarity-preserved Hashing COLING 2016 An urn model for majority voting in classification ensembles NeurIPS 2016 Anytime Exploration for Multi-armed Bandits using Confidence Information ICML 2016 Anytime optimal algorithms in stochastic multi-armed bandits ICML 2016 A Paradigm for Building Generalized Models of Human Image Perception Through Data Fusion CVPR 2016 A posteriori error bounds for joint matrix decomposition problems NeurIPS 2016 Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methods NeurIPS 2016 Approximate Newton Methods for Policy Search in Markov Decision Processes JMLR 2016