Skip to content
conftrace_

Papers (including subtopics)

A Denoising View of Matrix Completion NeurIPS 2011 Advice Refinement in Knowledge-Based SVMs NeurIPS 2011 A Dynamic Relational Infinite Feature Model for Longitudinal Social Networks AISTATS 2011 A Family of Simple Non-Parametric Kernel Learning Algorithms JMLR 2011 A Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods AISTATS 2011 A Finite Newton Algorithm for Non-degenerate Piecewise Linear Systems AISTATS 2011 A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011 A General Linear Non-Gaussian State-Space Model: Identifiability, Identification, and Applications ACML 2011 A Global Structural EM Algorithm for a Model of Cancer Progression NeurIPS 2011 Agnostic KWIK learning and efficient approximate reinforcement learning COLT 2011 Agnostic Selective Classification NeurIPS 2011 Algorithms and hardness results for parallel large margin learning NeurIPS 2011 Algorithms for Hyper-Parameter Optimization NeurIPS 2011 A Model for Temporal Dependencies in Event Streams NeurIPS 2011 A More Powerful Two-Sample Test in High Dimensions using Random Projection NeurIPS 2011 Analysis and Improvement of Policy Gradient Estimation NeurIPS 2011 Analytical Results for the Error in Filtering of Gaussian Processes NeurIPS 2011 An Application of Tree-Structured Expectation Propagation for Channel Decoding NeurIPS 2011 An Asymptotic Behaviour of the Marginal Likelihood for General Markov Models JMLR 2011 Anatomically Constrained Decoding of Finger Flexion from Electrocorticographic Signals NeurIPS 2011 An Empirical Evaluation of Thompson Sampling NeurIPS 2011 A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data COLT 2011 An Exact Algorithm for F-Measure Maximization NeurIPS 2011 An ideal observer model for identifying the reference frame of objects NeurIPS 2011 Approximate inference for the loss-calibrated Bayesian AISTATS 2011