Skip to content
conftrace_

Papers (including subtopics)

On the Efficient Minimization of Classification Calibrated Surrogates NeurIPS 2008 On the Generalization Ability of Online Strongly Convex Programming Algorithms NeurIPS 2008 On the Size and Recovery of Submatrices of Ones in a Random Binary Matrix JMLR 2008 Optimal Solutions for Sparse Principal Component Analysis JMLR 2008 Optimization on a Budget: A Reinforcement Learning Approach NeurIPS 2008 Particle Filter-based Policy Gradient in POMDPs NeurIPS 2008 Phase transitions for high-dimensional joint support recovery NeurIPS 2008 PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008 Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension JMLR 2008 Ranking Individuals by Group Comparisons JMLR 2008 Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking NeurIPS 2008 Resolution Limits of Sparse Coding in High Dimensions NeurIPS 2008 Robust Regression and Lasso NeurIPS 2008 Robust Submodular Observation Selection JMLR 2008 Sparse Signal Recovery Using Markov Random Fields NeurIPS 2008 Spectral Clustering with Perturbed Data NeurIPS 2008 Stochastic Recruitment: A Limited-Feedback Control Policy for Large Ensemble Systems RSS 2008 Stochastic Relational Models for Large-scale Dyadic Data using MCMC NeurIPS 2008 Structural Improvement Filtering Strategy for PRM RSS 2008 Supervised Dictionary Learning NeurIPS 2008 Supervised Exponential Family Principal Component Analysis via Convex Optimization NeurIPS 2008 Support Vector Machinery for Infinite Ensemble Learning JMLR 2008 Trust Region Newton Method for Logistic Regression JMLR 2008 Value Function Approximation using Multiple Aggregation for Multiattribute Resource Management JMLR 2008