scientific article; zbMATH DE number 7370577
From MaRDI portal
Publication:4998960
Recommendations
- Fitting Laplacian regularized stratified Gaussian models
- A distributed algorithm for fitting generalized additive models
- The distributed \({L_{1/2}}\) regularization
- Distributed regularized least squares with flexible Gaussian kernels
- Distributed multinomial regression
- Distributed penalized modal regression for massive data
- A distributed algorithm for Lasso variable selection
- Distributed learning with regularized least squares
Cites work
- A Pliable Lasso
- Algorithms, graph theory, and linear equations in Laplacian matrices
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Approximate Inference in Generalized Linear Mixed Models
- Convex optimization of graph Laplacian eigenvalues
- Covariance-regularized regression and classification for high dimensional problems
- CVXPY: a Python-embedded modeling language for convex optimization
- Data shared Lasso: a novel tool to discover uplift
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Deep learning
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 3144846 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 472973 (Why is no real title available?)
- scientific article; zbMATH DE number 1547349 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- Introduction to Information Retrieval
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Laplacian support vector machines trained in the primal
- Linear and generalized linear mixed models and their applications.
- Linear mixed models and penalized least squares
- Lx = b
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Methods of conjugate gradients for solving linear systems
- Model Selection and Estimation in Regression with Grouped Variables
- Newton-Raphson and EM Algorithms for Linear Mixed-Effects Models for Repeated-Measures Data
- Nonlinear total variation based noise removal algorithms
- On Distributions Admitting a Sufficient Statistic
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- On the limited memory BFGS method for large scale optimization
- Polytomous logistic regression
- Proximal algorithms in statistics and machine learning
- Random-Effects Models for Longitudinal Data
- Robust Estimation of a Location Parameter
- Selection and estimation for mixed graphical models
- Semidefinite Programming
- SnapVX: a network-based convex optimization solver
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Sparse inverse covariance estimation with the graphical lasso
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
- Statistical methods with varying coefficient models
- Support-vector networks
- That BLUP is a good thing: The estimation of random effects. With comments and a rejoinder by the author
- The Group Lasso for Logistic Regression
- The Laplacian paradigm: emerging algorithms for massive graphs
- Theory of the motion of the celestial bodies moving around the Sun in conic sections
- Time-dependent coefficients in a Cox-type regression model
Cited in
(5)- Eigen-stratified models
- Fitting Laplacian regularized stratified Gaussian models
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- Covariance prediction via convex optimization
- A Distributed Method for Fitting Laplacian Regularized Stratified Models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998960)
