Skip to content
conftrace_

Papers (including subtopics)

Neyman-Pearson classification under a strict constraint COLT 2011 Noise Thresholds for Spectral Clustering NeurIPS 2011 Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning NeurIPS 2011 Non-conjugate Variational Message Passing for Multinomial and Binary Regression NeurIPS 2011 Non-Parametric Estimation of Topic Hierarchies from Texts with Hierarchical Dirichlet Processes JMLR 2011 Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels NeurIPS 2011 Nonstandard Interpretations of Probabilistic Programs for Efficient Inference NeurIPS 2011 -Norm Multiple Kernel Learning JMLR 2011 On Causal Discovery with Cyclic Additive Noise Models NeurIPS 2011 On fast approximate submodular minimization NeurIPS 2011 On Learning Discrete Graphical Models using Greedy Methods NeurIPS 2011 On Learning Discrete Graphical Models using Group-Sparse Regularization AISTATS 2011 Online Learning: Beyond Regret COLT 2011 Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm JMLR 2011 Online Learning: Stochastic, Constrained, and Smoothed Adversaries NeurIPS 2011 Online Variational Inference for the Hierarchical Dirichlet Process AISTATS 2011 On NDCG Consistency of Listwise Ranking Methods AISTATS 2011 On the accuracy of l1-filtering of signals with block-sparse structure NeurIPS 2011 On the Analysis of Multi-Channel Neural Spike Data NeurIPS 2011 On the Consistency of Multi-Label Learning COLT 2011 On the Estimation of α-Divergences AISTATS 2011 On the Relation between Realizable and Nonrealizable Cases of the Sequence Prediction Problem JMLR 2011 On the Universality of Online Mirror Descent NeurIPS 2011 On Time Varying Undirected Graphs AISTATS 2011 On Tracking The Partition Function NeurIPS 2011