Statistical Learning
4,564 papers
Papers per year
2
8
9
7
9
35
42
41
45
70
79
85
113
128
110
150
162
210
299
399
445
487
621
569
324
115
'5
'10
'15
'20
'25
Papers
Rethinking Soft Labels for Knowledge Distillation: A Bias–Variance Tradeoff Perspective
ICLR 2021
Revenue maximization via machine learning with noisy data
NeurIPS 2021
Revisiting Parity of Human vs. Machine Conversational Speech Transcription
Interspeech 2021
Rich Prosody Diversity Modelling with Phone-Level Mixture Density Network
Interspeech 2021
Risk Bounds and Calibration for a Smart Predict-then-Optimize Method
NeurIPS 2021
Risk Bounds and Rademacher Complexity in Batch Reinforcement Learning
ICML 2021
Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning
NeurIPS 2021
Risk Monotonicity in Statistical Learning
NeurIPS 2021
Rissanen Data Analysis: Examining Dataset Characteristics via Description Length
ICML 2021
Robust and differentially private mean estimation
NeurIPS 2021
Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free
ICML 2021
Robust hypothesis testing and distribution estimation in Hellinger distance
AISTATS 2021
Robustifying Algorithms of Learning Latent Trees with Vector Variables
NeurIPS 2021
Robust Inference for High-Dimensional Linear Models via Residual Randomization
ICML 2021
Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers
AISTATS 2021
Robustness Guarantees for Mode Estimation with an Application to Bandits
AAAI 2021
Robust Testing and Estimation under Manipulation Attacks
ICML 2021
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
ALT 2021
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
NeurIPS 2021
Sample-Efficient L0-L2 Constrained Structure Learning of Sparse Ising Models
AAAI 2021
Scalability vs. Utility: Do We Have To Sacrifice One for the Other in Data Importance Quantification?
CVPR 2021
Separation Results between Fixed-Kernel and Feature-Learning Probability Metrics
NeurIPS 2021
SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples
ICML 2021
Sharper Generalization Bounds for Clustering
ICML 2021
Sharp Impossibility Results for Hyper-graph Testing
NeurIPS 2021