conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,334 papers

Papers per year

17
66
123
466
307
'05
'10
'15
'20
'25

Papers

Sparse Kernel Regression with Coefficient-based $\ell_q-$regularization JMLR 2019
Stochastic Canonical Correlation Analysis JMLR 2019
Does My Rebuttal Matter? Insights from a Major NLP Conference NAACL 2019
Inoculation by Fine-Tuning: A Method for Analyzing Challenge Datasets NAACL 2019
Studying the Inductive Biases of RNNs with Synthetic Variations of Natural Languages NAACL 2019
Benchmarking Hierarchical Script Knowledge NAACL 2019
Testing a Minimalist Grammar Parser on Italian Relative Clause Asymmetries NAACL 2019
Variational Regret Bounds for Reinforcement Learning UAI 2019
Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019
On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits UAI 2019
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NIPS 2018
Identification and Estimation of Causal Effects from Dependent Data NIPS 2018
How Many Samples are Needed to Estimate a Convolutional Neural Network? NIPS 2018
Critical initialisation for deep signal propagation in noisy rectifier neural networks NIPS 2018
Generalization Bounds for Uniformly Stable Algorithms NIPS 2018
Escaping Saddle Points in Constrained Optimization NIPS 2018
Generalisation in humans and deep neural networks NIPS 2018
Efficient online algorithms for fast-rate regret bounds under sparsity NIPS 2018
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NIPS 2018
Implicit Bias of Gradient Descent on Linear Convolutional Networks NIPS 2018
Data-Driven Clustering via Parameterized Lloyd's Families NIPS 2018
When do random forests fail? NIPS 2018
Learning convex polytopes with margin NIPS 2018
Adaptation to Easy Data in Prediction with Limited Advice NIPS 2018