convex optimization

Variable Sparsity Kernel Learning JMLR 2011 Adaptive Multi-Task Lasso: with Application to eQTL Detection NeurIPS 2010 A Family of Penalty Functions for Structured Sparsity NeurIPS 2010 A POMDP Extension with Belief-dependent Rewards NeurIPS 2010 A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning JMLR 2010 Bundle Methods for Regularized Risk Minimization JMLR 2010 Consensus-Based Distributed Support Vector Machines JMLR 2010 Convex Multiple-Instance Learning by Estimating Likelihood Ratio NeurIPS 2010 Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials AISTATS 2010 Decomposing Isotonic Regression for Efficiently Solving Large Problems NeurIPS 2010 Distributed Dual Averaging In Networks NeurIPS 2010 Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization JMLR 2010 Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions NeurIPS 2010 Efficient Minimization of Decomposable Submodular Functions NeurIPS 2010 Factorized Latent Spaces with Structured Sparsity NeurIPS 2010 Fast global convergence rates of gradient methods for high-dimensional statistical recovery NeurIPS 2010 Generalized roof duality and bisubmodular functions NeurIPS 2010 Guaranteed Rank Minimization via Singular Value Projection NeurIPS 2010 Hierarchical Convex NMF for Clustering Massive Data ACML 2010 Iterative Scaling and Coordinate Descent Methods for Maximum Entropy Models JMLR 2010 Learning Bayesian Network Structure using LP Relaxations AISTATS 2010 Learning Multiple Tasks using Manifold Regularization NeurIPS 2010 Learning Nonlinear Dynamic Models from Non-sequenced Data AISTATS 2010 Learning To Count Objects in Images NeurIPS 2010 Lower Bounds on Rate of Convergence of Cutting Plane Methods NeurIPS 2010