SOTAVerified

Learning Theory

Learning theory

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 451–500 of 852 papers

TitleStatusHype
Online Learning: Stochastic, Constrained, and Smoothed Adversaries—0
Online Learning via Sequential Complexities—0
On Reject and Refine Options in Multicategory Classification—0
On statistical learning via the lens of compression—0
How Powerful are Shallow Neural Networks with Bandlimited Random Weights?—0
On the Asymptotic Learning Curves of Kernel Ridge Regression under Power-law Decay—0
On the Comparison between Multi-modal and Single-modal Contrastive Learning—0
On the Complexity of Computing Gödel Numbers—0
On the Complexity of Learning Description Logic Ontologies—0
On the Generalization Gap in Reparameterizable Reinforcement Learning—0
On the generalization of learning algorithms that do not converge—0
On the Hardness of Bandit Learning—0
On the Hardness of PAC-learning Stabilizer States with Noise—0
On the Hardness of Robust Classification—0
On the Impact of Applying Machine Learning in the Decision-Making of Self-Adaptive Systems—0
On the Learnability of Out-of-distribution Detection—0
On the Maximum Mutual Information Capacity of Neural Architectures—0
On the non-efficient PAC learnability of conjunctive queries—0
On the Pseudo-Dimension of Nearly Optimal Auctions—0
On the robustness of randomized classifiers to adversarial examples—0
On the Robustness of Regularized Pairwise Learning Methods Based on Kernels—0
On the Sample Complexity of One Hidden Layer Networks with Equivariance, Locality and Weight Sharing—0
On the Sampling Strategy for Evaluation of Spectral-spatial Methods in Hyperspectral Image Classification—0
On the Complexity of Labeled Datasets—0
Optimality Implies Kernel Sum Classifiers are Statistically Efficient—0
On the use of Statistical Learning Theory for model selection in Structural Health Monitoring—0
On the Variance of the Fisher Information for Deep Learning—0
Optimal choice: new machine learning problem and its solution—0
Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization—0
Optimal lower bounds for Quantum Learning via Information Theory—0
Optimal PAC Bounds Without Uniform Convergence—0
Optimal Quantum Sample Complexity of Learning Algorithms—0
Optimal Rejection Function Meets Character Recognition Tasks—0
Optimal Sample Complexity of Contrastive Learning—0
Optimization for deep learning: theory and algorithms—0
Optimization Theory for ReLU Neural Networks Trained with Normalization Layers—0
Outlier-Robust Linear System Identification Under Heavy-tailed Noise—0
PAC Learning is just Bipartite Matching (Sort of)—0
PAC Synthesis of Machine Learning Programs—0
Parameter Symmetry Potentially Unifies Deep Learning Theory—0
Parametric Prediction from Parametric Agents—0
Partial differential equation regularization for supervised machine learning—0
Passive Learning with Target Risk—0
Path classification by stochastic linear recurrent neural networks—0
Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning—0
Phase Retrieval Meets Statistical Learning Theory: A Flexible Convex Relaxation—0
Piecewise Strong Convexity of Neural Networks—0
Post-mortem on a deep learning contest: a Simpson's paradox and the complementary roles of scale metrics versus shape metrics—0
Potential-Based Agnostic Boosting—0
Practical machine learning is learning on small samples—0
Show:102550
← PrevPage 10 of 18Next →

No leaderboard results yet.