Skip to content
conftrace_

Papers (including subtopics)

Fast Computation of Posterior Mode in Multi-Level Hierarchical Models NeurIPS 2008 Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method NeurIPS 2008 Fast Rates for Regularized Objectives NeurIPS 2008 Improved Moves for Truncated Convex Models NeurIPS 2008 Improving Localization Robustness in Monocular SLAM Using a High-Speed Camera RSS 2008 Inferring rankings under constrained sensing NeurIPS 2008 Kernelized Sorting NeurIPS 2008 Learning Balls of Strings from Edit Corrections JMLR 2008 Linear-Time Computation of Similarity Measures for Sequential Data JMLR 2008 MAS: a multiplicative approximation scheme for probabilistic inference NeurIPS 2008 MDPs with Non-Deterministic Policies NeurIPS 2008 Mind the Duality Gap: Logarithmic regret algorithms for online optimization NeurIPS 2008 Model Selection for Regression with Continuous Kernel Functions Using the Modulus of Continuity JMLR 2008 Model Selection in Gaussian Graphical Models: High-Dimensional Consistency of \boldmath$\ell_1$-regularized MLE NeurIPS 2008 Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data JMLR 2008 Mortal Multi-Armed Bandits NeurIPS 2008 Multi-stage Convex Relaxation for Learning with Sparse Regularization NeurIPS 2008 Near-optimal Regret Bounds for Reinforcement Learning NeurIPS 2008 Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies JMLR 2008 Nonparametric regression and classification with joint sparsity constraints NeurIPS 2008 One sketch for all: Theory and Application of Conditional Random Sampling NeurIPS 2008 Online Learning of Complex Prediction Problems Using Simultaneous Projections JMLR 2008 Online Models for Content Optimization NeurIPS 2008 Online Optimization in X-Armed Bandits NeurIPS 2008 Online Prediction on Large Diameter Graphs NeurIPS 2008