Mathematics

Faithfulness in Chain Graphs: The Gaussian Case AISTATS 2011 Faster Algorithms for Max-Product Message-Passing JMLR 2011 Fast Trajectory Correction for Nonholonomic Mobile Robots using Affine Transformations RSS 2011 Finite Time Analysis of Stratified Sampling for Monte Carlo NeurIPS 2011 Forest Density Estimation JMLR 2011 From Stochastic Nonlinear Integrate-and-Fire to Generalized Linear Models NeurIPS 2011 Generalization Bound for Infinitely Divisible Empirical Process AISTATS 2011 Group Lasso Estimation of High-dimensional Covariance Matrices JMLR 2011 High-dimensional Covariance Estimation Based On Gaussian Graphical Models JMLR 2011 High-Dimensional Graphical Model Selection: Tractable Graph Families and Necessary Conditions NeurIPS 2011 How biased are maximum entropy models? NeurIPS 2011 Inference in continuous-time change-point models NeurIPS 2011 Information, Divergence and Risk for Binary Experiments JMLR 2011 Learning Anchor Planes for Classification NeurIPS 2011 Learning a Robust Relevance Model for Search Using Kernel Methods JMLR 2011 Learning Auto-regressive Models from Sequence and Non-sequence Data NeurIPS 2011 Learning Eigenvectors for Free NeurIPS 2011 Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates JMLR 2011 Learning Higher-Order Graph Structure with Features by Structure Penalty NeurIPS 2011 Learning in Hilbert vs. Banach Spaces: A Measure Embedding Viewpoint NeurIPS 2011 Learning Latent Tree Graphical Models JMLR 2011 Learning low-rank output kernels ACML 2011 Learning Scale Free Networks by Reweighted ℓ_1 regularization AISTATS 2011 Learning with the weighted trace-norm under arbitrary sampling distributions NeurIPS 2011 Lower Bounds for Passive and Active Learning NeurIPS 2011