Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent

DOI10.1016/J.EJCO.2023.100079MaRDI QIDQ6491346zbMATH OpenFDO

Authors Sara Venturini, Andrea Cristofari, F. Rinaldi, Francesco Tudisco

Publication date 24 April 2024

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJCO.2023.100079

zbMATH Keywords

coordinate methodsmultilayer hypergraphssemi-supervised learning

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A multilevel approach for learning from labeled and unlabeled data on graphs
• Efficient semi-supervised learning on locally informative multiple graphs
• Semi-supervised learning using greedy Max-Cut
• Generalization performance of graph-based semi-supervised classification

Cites work

• A convergent decomposition algorithm for support vector machines
• A coordinate gradient descent method for nonsmooth separable minimization
• A decomposition method for Lasso problems with zero-sum constraint
• A fast active set block coordinate descent algorithm for _1-regularized least squares
• A nodal domain theorem and a higher-order Cheeger inequality for the graph \(p\)-Laplacian
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
• A unified convergence analysis of block successive minimization methods for nonsmooth optimization
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems
• Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
• Analysis of p-Laplacian regularization in semisupervised learning
• Benchmarking optimization software with performance profiles.
• Block coordinate descent for smooth nonconvex constrained minimization
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
• Community detection in networks via nonlinear modularity eigenvectors
• Coordinate descent algorithms
• Coordinate descent with arbitrary sampling. II: Expected separable overapproximation.
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• Globally convergent block-coordinate techniques for unconstrained optimization
• Graph-based semi-supervised learning
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 6508162 (Why is no real title available?)
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Networks beyond pairwise interactions: structure and dynamics
• Nodal domain count for the generalized graph \(p\)-Laplacian
• On the convergence of inexact block coordinate descent methods for constrained optimization
• On the convergence of sequential minimization algorithms
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• On the convergence of the coordinate descent method for convex differentiable minimization
• Optimization approaches to semi-supervised learning
• Parallel coordinate descent methods for big data optimization
• Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
• Random block coordinate descent methods for linearly constrained optimization over networks
• Randomness and permutations in coordinate descent methods
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• Total variation based community detection using a nonlinear optimization approach

Cited in

(3)

• Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products
• Hypergraph regularized semi-supervised support vector machine
• Modern optimization approaches to classification -- special issue editorial

This page was built for publication: Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491346)