Convex multi-task feature learning
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244304322765658
- Bounds for linear multi-task learning
- Canonical Correlation Analysis: An Overview with Application to Learning Methods
- scientific article; zbMATH DE number 5957307 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 624746 (Why is no real title available?)
- scientific article; zbMATH DE number 1086070 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 1448976 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Learning multiple tasks with kernel methods
- Learning Theory
- Learning Theory
- Learning Theory and Kernel Machines
- Multi-task learning for classification with Dirichlet process priors
- Nonparametric identification of population models via Gaussian processes
- On Learning Vector-Valued Functions
- Optimal rates for the regularized least-squares algorithm
- Reduced-rank regression for the multivariate linear model
- RELATIONS BETWEEN TWO SETS OF VARIATES
- The Collinearity Problem in Linear Regression. The Partial Least Squares (PLS) Approach to Generalized Inverses
- The elements of statistical learning. Data mining, inference, and prediction
- Theory of Reproducing Kernels
Cited in
(only showing first 100 items - show all)- Flexible latent variable models for multi-task learning
- A joint convex penalty for inverse covariance matrix estimation
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- Data shared Lasso: a novel tool to discover uplift
- A novel multivariate performance optimization method based on sparse coding and hyper-predictor learning
- A unified approach to error bounds for structured convex optimization problems
- Multi-target regression via input space expansion: treating targets as inputs
- Group online adaptive learning
- Least absolute deviations learning of multiple tasks
- Low-rank representation-based object tracking using multitask feature learning with joint sparsity
- Simultaneous nonparametric regression in RADWT dictionaries
- Linearized and kernelized sparse multitask learning for predicting cognitive outcomes in Alzheimer's disease
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Slice inverse regression with score functions
- Regularized nonnegative shared subspace learning
- Finite rank kernels for multi-task learning
- Regularizers for structured sparsity
- Composite kernel learning
- Multi-domain learning by confidence-weighted parameter combination
- Exact matrix completion based on low rank Hankel structure in the Fourier domain
- Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems
- An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems
- Low-rank matrix recovery via regularized nuclear norm minimization
- Tackling ordinal regression problem for heterogeneous data: sparse and deep multi-task learning approaches
- Inductive matrix completion with feature selection
- Low-rank approximation algorithms for matrix completion with random sampling
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models
- Discriminant analysis of regularized multidimensional scaling
- Sensitivity of low-rank matrix recovery
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- Pointwise mutual information sparsely embedded feature selection
- Proof methods for robust low-rank matrix recovery
- Regularized high dimension low tubal-rank tensor regression
- Which option is a better way to improve transfer learning performance?
- Robust reduced rank regression in a distributed setting
- Joint feature selection and classification for positive unlabelled multi-label data using weighted penalized empirical risk minimization
- JGPR: a computationally efficient multi-target Gaussian process regression algorithm
- Low rank matrix recovery with impulsive noise
- Manifold regularization based on Nyström type subsampling
- Group guided fused Laplacian sparse group Lasso for modeling Alzheimer's disease progression
- Guarantees of Riemannian optimization for low rank matrix completion
- Inter-class sparsity based discriminative least square regression
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Joint ranking SVM and binary relevance with robust low-rank learning for multi-label classification
- Max-margin heterogeneous information machine for RGB-D action recognition
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Mixed-norm regularization for brain decoding
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Robust finite mixture regression for heterogeneous targets
- Utilizing relevant RGB-D data to help recognize RGB images in the target domain
- Memory networks for fine-grained opinion mining
- Least square regularized regression for multitask learning
- A Riemannian gossip approach to subspace learning on Grassmann manifold
- Joint detection of malicious domains and infected clients
- Truncated sparse approximation property and truncated \(q\)-norm minimization
- Kernel collaborative online algorithms for multi-task learning
- An efficient primal dual prox method for non-smooth optimization
- Stable recovery of low rank matrices from nuclear norm minimization
- Multilabel classification through random graph ensembles
- A unified approach to computing the nearest complex polynomial with a given zero
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning
- Multi-task learning via linear functional strategy
- Learning with optimal interpolation norms
- Advanced conjoint analysis using feature selection via support vector machines
- On the robustness of the generalized fused Lasso to prior specifications
- Matrix completion with sparse measurement errors
- Analysis of mobility based COVID-19 epidemic model using federated multitask learning
- Low rank matrix minimization with a truncated difference of nuclear norm and Frobenius norm regularization
- Analysis on methods to effectively improve transfer learning performance
- Multiplicative multitask feature learning
- The benefit of multitask representation learning
- Guarantees of Riemannian optimization for low rank matrix recovery
- Multi-task and lifelong learning of kernels
- Multi-stage multi-task feature learning
- Minimum n-rank approximation via iterative hard thresholding
- Learning multiple tasks with kernel methods
- Learning multi-label predictors under sparsity budget
- Low-rank and sparse multi-task learning
- The bounds of restricted isometry constants for low rank matrices recovery
- Geometry preserving multi-task metric learning
- Learning with infinitely many features
- Estimating variable structure and dependence in multitask learning via gradients
- Multi-output learning via spectral filtering
- Local Rademacher complexity-based learning guarantees for multi-task learning
- A semantic tree method for image classification and video action recognition
- Gap safe screening rules for sparsity enforcing penalties
- Generalized conditional gradient for sparse estimation
- Orthogonal sparse linear discriminant analysis
- kLog: a language for logical and relational learning with kernels
- Feature selection and multi-kernel learning for sparse representation on a manifold
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Sparsity-promoting algorithms for the discovery of informative Koopman-invariant subspaces
- Deep large-scale multi-task learning network for gene expression inference
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- scientific article; zbMATH DE number 7626710 (Why is no real title available?)
- A novel boosting algorithm for multi-task learning based on the Itakuda-Saito divergence
- Sparse Single Index Models for Multivariate Responses
- Complete dictionary learning via ^4-norm maximization over the orthogonal group
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
This page was built for publication: Convex multi-task feature learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009294)
