Optimization

Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs NeurIPS 2011 Competitive Closeness Testing COLT 2011 Composite Multiclass Losses NeurIPS 2011 Concentration-Based Guarantees for Low-Rank Matrix Reconstruction COLT 2011 Contextual Gaussian Process Bandit Optimization NeurIPS 2011 Convergence of Distributed Asynchronous Learning Vector Quantization Algorithms JMLR 2011 Convergence Rates of Efficient Global Optimization Algorithms JMLR 2011 Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NeurIPS 2011 Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011 Convergent Fitted Value Iteration with Linear Function Approximation NeurIPS 2011 Convex and Network Flow Optimization for Structured Sparsity JMLR 2011 Convex envelopes of complexity controlling penalties: the case against premature envelopment AISTATS 2011 Differentially Private Empirical Risk Minimization JMLR 2011 Discussion of “Spectral Dimensionality Reduction via Maximum Entropy” AISTATS 2011 Distributed Delayed Stochastic Optimization NeurIPS 2011 Divide-and-Conquer Matrix Factorization NeurIPS 2011 Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011 Dynamic Policy Programming with Function Approximation AISTATS 2011 Efficient coding of natural images with a population of noisy Linear-Nonlinear neurons NeurIPS 2011 Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials NeurIPS 2011 Efficient inference in matrix-variate Gaussian models with \iid observation noise NeurIPS 2011 Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression NeurIPS 2011 Efficient Methods for Overlapping Group Lasso NeurIPS 2011 Efficient Offline Communication Policies for Factored Multiagent POMDPs NeurIPS 2011 Efficient Online Learning via Randomized Rounding NeurIPS 2011