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)

Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework NeurIPS 2010 Sufficient covariates and linear propensity analysis AISTATS 2010 Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation AISTATS 2010 Supervised Clustering NeurIPS 2010 Switching state space model for simultaneously estimating state transitions and nonstationary firing rates NeurIPS 2010 Tempered Markov Chain Monte Carlo for training of Restricted Boltzmann Machines AISTATS 2010 The Coding Divergence for Measuring the Complexity of Separating Two Sets ACML 2010 The Feature Selection Path in Kernel Methods AISTATS 2010 The Group Dantzig Selector AISTATS 2010 The LASSO risk: asymptotic results and real world examples NeurIPS 2010 The Maximal Causes of Natural Scenes are Edge Filters NeurIPS 2010 The Neural Costs of Optimal Control NeurIPS 2010 The Smooth Curvature Flexure Model: An Accurate, Low-Dimensional Approach for Robot Analysis RSS 2010 Throttling Poisson Processes NeurIPS 2010 Tight Sample Complexity of Large-Margin Learning NeurIPS 2010 t-logistic regression NeurIPS 2010 Topology Selection in Graphical Models of Autoregressive Processes JMLR 2010 Towards Property-Based Classification of Clustering Paradigms NeurIPS 2010 Trading off Mistakes and Don't-Know Predictions NeurIPS 2010 Training and Testing Low-degree Polynomial Data Mappings via Linear SVM JMLR 2010 Transduction with Matrix Completion: Three Birds with One Stone NeurIPS 2010 Tree Decomposition for Large-Scale SVM Problems JMLR 2010 Tree-Structured Stick Breaking for Hierarchical Data NeurIPS 2010 Two-Layer Generalization Analysis for Ranking Using Rademacher Average NeurIPS 2010 Ultra-high Dimensional Multiple Output Learning With Simultaneous Orthogonal Matching Pursuit: Screening Approach AISTATS 2010