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
21
30
55
40
51
225
219
249
257
357
364
480
942
818
966
1,394
2,092
3,114
4,415
4,853
5,064
5,371
5,992
6,412
5,823
1,475
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Divide-and-Conquer Matrix Factorization
NeurIPS 2011
Domain Decomposition Approach for Fast Gaussian Process Regression of Large Spatial Data Sets
JMLR 2011
Double Updating Online Learning
JMLR 2011
Dynamical segmentation of single trials from population neural data
NeurIPS 2011
Efficient and Effective Visual Codebook Generation Using Additive Kernels
JMLR 2011
Efficient anomaly detection using bipartite k-NN graphs
NeurIPS 2011
Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials
NeurIPS 2011
Efficient inference in matrix-variate Gaussian models with \iid observation noise
NeurIPS 2011
Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression
NeurIPS 2011
Efficient Learning with Partially Observed Attributes
JMLR 2011
Efficient Methods for Overlapping Group Lasso
NeurIPS 2011
Efficient Structure Learning of Bayesian Networks using Constraints
JMLR 2011
Efficient variable selection in support vector machines via the alternating direction method of multipliers
AISTATS 2011
EigenNet: A Bayesian hybrid of generative and conditional models for sparse learning
NeurIPS 2011
Emergence of Multiplication in a Biophysical Model of a Wide-Field Visual Neuron for Computing Object Approaches: Dynamics, Peaks, & Fits
NeurIPS 2011
Empirical models of spiking in neural populations
NeurIPS 2011
Error Analysis of Laplacian Eigenmaps for Semi-supervised Learning
AISTATS 2011
Estimating Diffusion Probability Changes for AsIC-SIS Model from Information Diffusion Results
ACML 2011
Estimating Probabilities in Recommendation Systems
AISTATS 2011
Evaluating the inverse decision-making approach to preference learning
NeurIPS 2011
Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks
AISTATS 2011
Exploiting spatial overlap to efficiently compute appearance distances between image windows
NeurIPS 2011
Extracting Speaker-Specific Information with a Regularized Siamese Deep Network
NeurIPS 2011
Fast b-matching via Sufficient Selection Belief Propagation
AISTATS 2011
Fast and Accurate k-means For Large Datasets
NeurIPS 2011