Skip to content
conftrace_

Papers (including subtopics)

Near-optimal Differentially Private Principal Components NeurIPS 2012 Near-Optimal MAP Inference for Determinantal Point Processes NeurIPS 2012 Newton-Like Methods for Sparse Inverse Covariance Estimation NeurIPS 2012 No Internal Regret via Neighborhood Watch AISTATS 2012 Nonconvex Penalization Using Laplace Exponents and Concave Conjugates NeurIPS 2012 Non-parametric Approximate Dynamic Programming via the Kernel Method NeurIPS 2012 No-Regret Algorithms for Unconstrained Online Convex Optimization NeurIPS 2012 On a Connection between Maximum Variance Unfolding, Shortest Path Problems and IsoMap AISTATS 2012 On Bayesian Upper Confidence Bounds for Bandit Problems AISTATS 2012 On Bisubmodular Maximization AISTATS 2012 Online allocation and homogeneous partitioning for piecewise constant mean-approximation NeurIPS 2012 Online Clustering of Processes AISTATS 2012 Online L1-Dictionary Learning with Application to Novel Document Detection NeurIPS 2012 Online Optimization with Gradual Variations COLT 2012 Online Rank Aggregation ACML 2012 Online Submodular Minimization JMLR 2012 Online Sum-Product Computation Over Trees NeurIPS 2012 Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012 On Multilabel Classification and Ranking with Partial Feedback NeurIPS 2012 On the Sample Complexity of Robust PCA NeurIPS 2012 On the Structure of Nonlinearities in Pose Graph SLAM RSS 2012 Optimal Control with Weighted Average Costs and Temporal Logic Specifications RSS 2012 Optimal Neural Tuning Curves for Arbitrary Stimulus Distributions: Discrimax, Infomax and Minimum L_p Loss NeurIPS 2012 Optimal Regularized Dual Averaging Methods for Stochastic Optimization NeurIPS 2012 Optimistic Bayesian Sampling in Contextual-Bandit Problems JMLR 2012