Trace norm regularization: reformulations, algorithms, and multi-task learning
DOI10.1137/090763184zbMATH Open1211.90129OpenAlexW2045704273WikidataQ57511264 ScholiaQ57511264MaRDI QIDQ3083339FDOQ3083339
Paul Tseng, Ting Kei Pong, Shuiwang Ji, Jieping Ye
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090763184
Recommendations
convex optimizationmulti-task learningproximal gradient methodsemidefinite programmingdualitygene expression pattern analysistrace norm regularization
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Protein sequences, DNA sequences (92D20) Semidefinite programming (90C22)
Cited In (22)
- Low-Rank and Sparse Multi-task Learning
- Regularization-based model tree for multi-output regression
- Smooth over-parameterized solvers for non-smooth structured optimization
- Supervised Learning by Support Vector Machines
- Title not available (Why is that?)
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- A sparsity preserving stochastic gradient methods for sparse regression
- Robust reduced rank regression in a distributed setting
- Matrix completion from a computational statistics perspective
- Distributed multi-task classification: a decentralized online learning approach
- Kernel collaborative online algorithms for multi-task learning
- Adaptive and robust multi-task learning
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Stochastic Saddle Point Problems with Decision-Dependent Distributions
- Generalized Conditional Gradient for Sparse Estimation
- A constrained matrix-variate Gaussian process for transposable data
- Title not available (Why is that?)
- A smoothing stochastic gradient method for composite optimization
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint
- Calibrated multi-task subspace learning via binary group structure constraint
Uses Software
This page was built for publication: Trace norm regularization: reformulations, algorithms, and multi-task learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083339)