Skip to content
conftrace_

Papers (including subtopics)

Algebraic Geometric Comparison of Probability Distributions JMLR 2012 A Linear Time Active Learning Algorithm for Link Classification NeurIPS 2012 A Marginalized Particle Gaussian Process Regression NeurIPS 2012 A mechanistic model of early sensory processing based on subtracting sparse representations NeurIPS 2012 A Multi-Stage Framework for Dantzig Selector and LASSO JMLR 2012 Analog readout for optical reservoir computers NeurIPS 2012 Analysis of a Random Forests Model JMLR 2012 Analysis of Thompson Sampling for the Multi-armed Bandit Problem COLT 2012 An Autoregressive Approach to Nonparametric Hierarchical Dependent Modeling AISTATS 2012 Ancestor Sampling for Particle Gibbs NeurIPS 2012 A new metric on the manifold of kernel matrices with application to matrix geometric means NeurIPS 2012 An Improved GLMNET for L1-regularized Logistic Regression JMLR 2012 A Nonparametric Bayesian Model for Multiple Clustering with Overlapping Feature Views AISTATS 2012 A Nonparametric Conjugate Prior Distribution for the Maximizing Argument of a Noisy Function NeurIPS 2012 A nonparametric variable clustering model NeurIPS 2012 A Polylog Pivot Steps Simplex Algorithm for Classification NeurIPS 2012 A Polynomial-time Form of Robust Regression NeurIPS 2012 Approximate Inference by Intersecting Semidefinite Bound and Local Polytope AISTATS 2012 Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation AISTATS 2012 Approximate Message Passing with Consistent Parameter Estimation and Applications to Sparse Learning NeurIPS 2012 Approximating Concavely Parameterized Optimization Problems NeurIPS 2012 Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand NeurIPS 2012 A Primal-Dual Convergence Analysis of Boosting JMLR 2012 A quasi-Newton proximal splitting method NeurIPS 2012 A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound NeurIPS 2012