Skip to content
conftrace_

Core Methods

51,083 papers (8 classified directly here)

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

Representation Learning (22,308) Classification (15,497) Regression (5,281) Clustering (3,809) Embedding Learning (3,795) Metric Learning (2,938) Graph Neural Networks (1,211) Graphical Models (1,093) Feature Learning (891) Kernel Methods (795) Dimensionality Reduction (780) Interpretability (512) Feature Selection (511) Matrix Factorization (408) Ranking (315) Ensemble Methods (300) Support Vector Machine (295) Anomaly Detection (281) Sequence Modeling (244) Structured Prediction (237) Sequence Labeling (157) Topic Modeling (150) Sparse Coding (140) Matrix Completion (131) Neural Networks (114) Retrieval (105) Density Estimation (104) Estimation (83) Inference (56) Decision Tree (50) Feature Extraction (40) Model Selection (39) Prediction (35) Information Extraction (7)

Papers per year

4
51
357
966
4,853
5,823
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

On Multiplicative Multitask Feature Learning NeurIPS 2014 On p-norm Path Following in Multiple Kernel Learning for Non-linear Feature Selection ICML 2014 On Robustness and Regularization of Structural Support Vector Machines ICML 2014 On Sparse Gaussian Chain Graph Models NeurIPS 2014 On the Bayes-Optimality of F-Measure Maximizers JMLR 2014 On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems COLT 2014 On the Number of Linear Regions of Deep Neural Networks NeurIPS 2014 On the relations of LFPs & Neural Spike Trains NeurIPS 2014 On the Statistical Consistency of Plug-in Classifiers for Non-decomposable Performance Measures NeurIPS 2014 ooDACE Toolbox: A Flexible Object-Oriented Kriging Implementation JMLR 2014 Open Problem: A (Missing) Boosting-type Convergence Result for AdaBoost.MH with Factorized Multi-class Classifiers COLT 2014 Open Problem: Efficient Online Sparse Regression COLT 2014 Open Problem: Online Local Learning COLT 2014 Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces COLT 2014 Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs JMLR 2014 Optimality of Graphlet Screening in High Dimensional Variable Selection JMLR 2014 Optimal learners for multiclass problems COLT 2014 Optimal Mean Robust Principal Component Analysis ICML 2014 Optimal rates for k-NN density and mode estimation NeurIPS 2014 Optimal Teaching for Limited-Capacity Human Learners NeurIPS 2014 Optimization Equivalence of Divergences Improves Neighbor Embedding ICML 2014 Optimization Methods for Sparse Pseudo-Likelihood Graphical Model Selection NeurIPS 2014 Optimizing F-Measures by Cost-Sensitive Classification NeurIPS 2014 Optimizing Over Radial Kernels on Compact Manifolds CVPR 2014 Outlier Path: A Homotopy Algorithm for Robust SVM ICML 2014