Skip to content
conftrace_

Theory

5,579 papers

1
4
39
80
486
612
2000
'5
'10
'15
'20
'25

Papers

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