← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

Consistent Feature Selection for Pattern Recognition in Polynomial Time JMLR 2007
Sequential Hypothesis Testing under Stochastic Deadlines NIPS 2007
Stability Bounds for Non-i.i.d. Processes NIPS 2007
Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent Plasticity NIPS 2007
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations NIPS 2007
A Kernel Statistical Test of Independence NIPS 2007
Testing for Homogeneity with Kernel Fisher Discriminant Analysis NIPS 2007
Theoretical Analysis of Heuristic Search Methods for Online POMDPs NIPS 2007
Efficient Inference for Distributions on Permutations NIPS 2007
The Tradeoffs of Large Scale Learning NIPS 2007
Convex Relaxations of Latent Variable Training NIPS 2007
Progressive mixture rules are deviation suboptimal NIPS 2007
Combining PAC-Bayesian and Generic Chaining Bounds JMLR 2007
Structured Learning with Approximate Inference NIPS 2007
On the Representer Theorem and Equivalent Degrees of Freedom of SVR JMLR 2007
Random Projections for Manifold Learning NIPS 2007
Discovering Weakly-Interacting Factors in a Complex Stochastic Process NIPS 2007
An in-silico Neural Model of Dynamic Routing through Neuronal Coherence NIPS 2007
Contraction Properties of VLSI Cooperative Competitive Neural Networks of Spiking Neurons NIPS 2007
Near-Maximum Entropy Models for Binary Neural Representations of Natural Images NIPS 2007
What makes some POMDP problems easy to approximate? NIPS 2007
Bounds for Linear Multi-Task Learning JMLR 2006
On the Complexity of Learning Lexicographic Strategies JMLR 2006
Optimal Single-Class Classification Strategies NIPS 2006
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms JMLR 2006