The Redundancy of a Computable Code on a Noncomputable Distribution

The Sample Complexity of Dictionary Learning

The theory and application of penalized methods or Reproducing Kernel Hilbert Spaces made easy

Theoretical Properties of the Overlapping Groups Lasso

Tight Measurement Bounds for Exact Recovery of Structured Sparse Signals

Time Varying Undirected Graphs

Towards Optimal Learning of Chain Graphs

Training linear ranking SVMs in linearithmic time using red-black trees

Transforming Graph Representations for Statistical Relational Learning

Translating biomarkers between multi-way time-series experiments

Tree Exploration for Bayesian RL Exploration

Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity

Trek separation for Gaussian graphical models

Truncated Power Method for Sparse Eigenvalue Problems