Skip to content
conftrace_

convex optimization

1,445 papers

CO

Papers

Assisting Main Task Learning by Heterogeneous Auxiliary Tasks with Applications to Skin Cancer Screening AISTATS 2011 Better Mini-Batch Algorithms via Accelerated Gradient Methods NeurIPS 2011 CAKE: Convex Adaptive Kernel Density Estimation AISTATS 2011 Clustered Multi-Task Learning Via Alternating Structure Optimization NeurIPS 2011 Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NeurIPS 2011 Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011 Convex and Network Flow Optimization for Structured Sparsity JMLR 2011 Convex envelopes of complexity controlling penalties: the case against premature envelopment AISTATS 2011 Efficient Methods for Overlapping Group Lasso NeurIPS 2011 Efficient Offline Communication Policies for Factored Multiagent POMDPs NeurIPS 2011 Greedy Algorithms for Structurally Constrained High Dimensional Problems NeurIPS 2011 Improved Loss Bounds For Multiple Kernel Learning AISTATS 2011 Information Theoretical Clustering via Semidefinite Programming AISTATS 2011 Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NeurIPS 2011 Matrix Completion for Multi-label Image Classification NeurIPS 2011 Maximum Margin Multi-Label Structured Prediction NeurIPS 2011 Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning NeurIPS 2011 On the Universality of Online Mirror Descent NeurIPS 2011 Penalty Decomposition Methods for Rank Minimization NeurIPS 2011 PiCoDes: Learning a Compact Code for Novel-Category Recognition NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Shaping Level Sets with Submodular Functions NeurIPS 2011 Statistical Performance of Convex Tensor Decomposition NeurIPS 2011 Stochastic convex optimization with bandit feedback NeurIPS 2011 Trace Lasso: a trace norm regularization for correlated designs NeurIPS 2011