arXiv Machine Learning August 14, 2026 By Liping Tao, Chee Wei Tan

Difference-of-Convex Regularization for Graph Learning by Differentiable Programming

Read the original on arXiv Machine Learning →

arXiv:2608. 12757v1 Announce Type: cross Abstract: Laplacian-regularized minimization is fundamental in signal processing and machine learning, but is limited by the dense and ill-conditioned nature of the graph Laplacian pseudoinverse.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 20

Analysis of Semi-Supervised Learning on Hypergraphs

arXiv:2510. 25354v3 Announce Type: replace Abstract: Hypergraphs provide a natural framework for modeling multiway interactions.

By Adrien Weihs, Andrea L. Bertozzi, Matthew Thorpe

benchmarks

Hugging Face Trending Papers

Jun 29

A Dual-domain Refinement Network with FBP-based Jacobian Learning for Sparse-view Dual-Energy CT Material Decomposition

Dual-energy CT (DECT) exploits attenuation differences across different X-ray spectra to provide richer material information and has been widely used in medical imaging. While sparse-view acquisition can lower radiation exposure, it makes DECT material decomposition even more challenging, as the problem is nonlinear and ill-posed.

efficiency

arXiv Machine Learning

Jul 24

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

arXiv:2607. 21039v1 Announce Type: new Abstract: Spectral methods are among the most widely used techniques for community detection, clustering, and graph learning.

By Zhuan Liang, Zheng Zhai

arXiv Machine Learning

Jun 10

Range Penalization: Theoretical Insights with Applications in Federated Learning

arXiv:2606. 10916v1 Announce Type: cross Abstract: This paper introduces range regularization for federated learning with linear systematic components to enhance statistical accuracy and induce cross-client regularity conducive to quantization, coding, and resource efficiency.

By Yiyuan She, Zhaojun Hu, Yifan Sun

efficiency

arXiv Machine Learning

Jul 24

Filter Learning for Subgraphs: Algebras and Performance Risk Bounds

arXiv:2607. 21263v1 Announce Type: new Abstract: Graph signal processing tasks that leverage spectral information typically assume access to the complete graph topology, which is often unavailable in practice.

By Purui Zhang, Feng Ji, Yanan Zhao, Bihan Wen, Wee Peng Tay

arXiv Machine Learning

Jul 9

Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization

arXiv:2607. 07513v1 Announce Type: new Abstract: Self-supervised learning matches supervised accuracy from a fraction of the labels, but the labeled-sample efficiency behind this has lacked a theoretical explanation.

By Adam M. Oberman

safety

Related stories

Analysis of Semi-Supervised Learning on Hypergraphs

A Dual-domain Refinement Network with FBP-based Jacobian Learning for Sparse-view Dual-Energy CT Material Decomposition

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

Range Penalization: Theoretical Insights with Applications in Federated Learning

Filter Learning for Subgraphs: Algebras and Performance Risk Bounds

Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization