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)
Open-World Multi-Task Control Through Goal-Aware Representation Learning and Adaptive Horizon Prediction
CVPR 2023
OPERA: Omni-Supervised Representation Learning with Hierarchical Supervisions
ICCV 2023
Operator Learning for Nonlinear Adaptive Control
L4DC 2023
Operator Learning with Neural Fields: Tackling PDEs on General Geometries
NeurIPS 2023
OPI at SemEval-2023 Task 1: Image-Text Embeddings and Multimodal Information Retrieval for Visual Word Sense Disambiguation
SemEval 2023
Opinion Tree Parsing for Aspect-based Sentiment Analysis
ACL 2023
OPT-GAN: A Broad-Spectrum Global Optimizer for Black-Box Problems by Learning Distribution
AAAI 2023
OptIForest: Optimal Isolation Forest for Anomaly Detection
IJCAI 2023
Optimal Activation Functions for the Random Features Regression Model
ICLR 2023
Optimal Algorithms for Latent Bandits with Cluster Structure
AISTATS 2023
Optimal Algorithms for the Inhomogeneous Spiked Wigner Model
NeurIPS 2023
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles
AISTATS 2023
Optimal Convergence Rates for Agnostic Nyström Kernel Learning
ICML 2023
Optimal Convergence Rates for Distributed Nystroem Approximation
JMLR 2023
Optimal Decision Diagrams for Classification
AAAI 2023
Optimal Decision Trees For Interpretable Clustering with Constraints
IJCAI 2023
Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear Regression
NeurIPS 2023
Optimality of Message-Passing Architectures for Sparse Graphs
NeurIPS 2023
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs
ICML 2023
Optimally-weighted Estimators of the Maximum Mean Discrepancy for Likelihood-Free Inference
ICML 2023
Optimal Nonlinearities Improve Generalization Performance of Random Features
ACML 2023
Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits
ICML 2023
Optimal Sketching Bounds for Sparse Linear Regression
AISTATS 2023
Optimal Sparse Recovery with Decision Stumps
AAAI 2023
Optimal Sparse Regression Trees
AAAI 2023