Skip to content
conftrace_

Papers (including subtopics)

Online Prediction on Large Diameter Graphs NeurIPS 2008 On Relevant Dimensions in Kernel Feature Spaces JMLR 2008 On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor NeurIPS 2008 On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization NeurIPS 2008 On the Design of Loss Functions for Classification: theory, robustness to outliers, and SavageBoost NeurIPS 2008 On the Efficient Minimization of Classification Calibrated Surrogates NeurIPS 2008 On the Equivalence of Linear Dimensionality-Reducing Transformations JMLR 2008 On the Generalization Ability of Online Strongly Convex Programming Algorithms NeurIPS 2008 On the Reliability of Clustering Stability in the Large Sample Regime NeurIPS 2008 Optimal Response Initiation: Why Recent Experience Matters NeurIPS 2008 Optimal Solutions for Sparse Principal Component Analysis JMLR 2008 Optimization on a Budget: A Reinforcement Learning Approach NeurIPS 2008 Overlaying classifiers: a practical approach for optimal ranking NeurIPS 2008 Particle Filter-based Policy Gradient in POMDPs NeurIPS 2008 Performance analysis for L\_2 kernel classification NeurIPS 2008 Phase transitions for high-dimensional joint support recovery NeurIPS 2008 Posterior Consistency of the Silverman g-prior in Bayesian Model Choice NeurIPS 2008 Prior Data and Kernel Conditional Random Fields for Obstacle Detection RSS 2008 Proofs and Experiments in Scalable, Near-Optimal Search by Multiple Robots RSS 2008 PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NeurIPS 2008 Psychiatry: Insights into depression through normative decision-making models NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008 Rademacher Complexity Bounds for Non-I.I.D. Processes NeurIPS 2008 Ranking Categorical Features Using Generalization Properties JMLR 2008 Regularized Policy Iteration NeurIPS 2008