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

Theory

4,950 papers

Papers per year

1
4
37
72
447
426
'00
'05
'10
'15
'20
'25

Papers

On Evaluating Embedding Models for Knowledge Base Completion ACL 2019
Model-Based Reinforcement Learning Exploiting State-Action Equivalence ACML 2019
Linear Convergence of the Primal-Dual Gradient Method for Convex-Concave Saddle Point Problems without Strong Convexity AISTATS 2019
Blind Demixing via Wirtinger Flow with Random Initialization AISTATS 2019
Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit AISTATS 2019
Optimal Testing in the Experiment-rich Regime AISTATS 2019
On the Connection Between Learning Two-Layer Neural Networks and Tensor Decomposition AISTATS 2019
SPONGE: A generalized eigenproblem for clustering signed networks AISTATS 2019
A Swiss Army Infinitesimal Jackknife AISTATS 2019
Towards Efficient Data Valuation Based on the Shapley Value AISTATS 2019
No-regret algorithms for online $k$-submodular maximization AISTATS 2019
Subsampled Renyi Differential Privacy and Analytical Moments Accountant AISTATS 2019
A Geometric Perspective on the Transferability of Adversarial Directions AISTATS 2019
Implicit Kernel Learning AISTATS 2019
Dynamical Isometry is Achieved in Residual Networks in a Universal Way for any Activation Function AISTATS 2019
Revisiting Adversarial Risk AISTATS 2019
A Topological Regularizer for Classifiers via Persistent Homology AISTATS 2019
Variance reduction properties of the reparameterization trick AISTATS 2019
High Dimensional Inference in Partially Linear Models AISTATS 2019
An Exponential Efron-Stein Inequality for $L_q$ Stable Learning Rules ALT 2019
Can Adversarially Robust Learning LeverageComputational Hardness? ALT 2019
Conference on Learning Theory 2019: Preface COLT 2019
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models COLT 2019
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness COLT 2019
A near-optimal algorithm for approximating the John Ellipsoid COLT 2019