Searcharxiv⌕ Search

arXiv subjects

Qingsong Wang

Publications and source records attributed to Qingsong Wang.

At least 37 records · Page 2Linked to original sources

Contrasting Momentum-Selective Spin-Density-Wave Gaps in Bilayer and Trilayer Nickelates

Resolving where the density-wave gap opens in momentum space is essential for identifying the microscopic origin of the instability in layered nickelates. Using polarization-resolved electronic Raman scattering, we map the momentum selectivity of the spin-density-wave (SDW) gap in trilayer La4Ni3O10. We observe a SDW-induced redistribution of spectral weight on both the $α$ pocket at the Brillouin-zone centre and a portion of the $β$ pocket near the zone boundary, characterized by gap energies of approximately 55~meV. In contrast, no comparable spectral weight suppression is observed along the diagonal region of $β$ pockets, implying little or no gap opening. This gap topology contrasts sharply with that in La3Ni2O7, where anisotropic SDW gaps open solely on the $β$ pocket. Our results establish a distinct momentum-space gap topology between bilayer and trilayer nickelates, placing new constraints on the ordering wave vector and the mechanism of the density-wave instability relevant to superconductivity.

cond-mat.supr-con↗

Convergent Privacy Framework for Multi-layer GNNs through Contractive Message Passing

Differential privacy (DP) has been integrated into graph neural networks (GNNs) to protect sensitive structural information, e.g., edges, nodes, and associated features across various applications. A prominent approach is to perturb the message-passing process, which forms the core of most GNN architectures. However, existing methods typically incur a privacy cost that grows linearly with the number of layers (e.g., GAP published in Usenix Security'23), ultimately requiring excessive noise to maintain a reasonable privacy level. This limitation becomes particularly problematic when multi-layer GNNs, which have shown better performance than one-layer GNN, are used to process graph data with sensitive information. In this paper, we theoretically establish that the privacy budget converges with respect to the number of layers by applying privacy amplification techniques to the message-passing process, exploiting the contractive properties inherent to standard GNN operations. Motivated by this analysis, we propose a simple yet effective Contractive Graph Layer (CGL) that ensures the contractiveness required for theoretical guarantees while preserving model utility. Our framework, CARIBOU, supports both training and inference, equipped with a contractive aggregation module, a privacy allocation module, and a privacy auditing module. Experimental evaluations demonstrate that CARIBOU significantly improves the privacy-utility trade-off and achieves superior performance in privacy auditing tasks.

cs.CR↗

A Novel Virus Diffusion Optimization (VDO) Algorithm for Global Optimization

Meta-heuristic algorithms are widely used to tackle complex optimization problems, including nonlinear, multimodal, and high-dimensional tasks. However, many existing methods suffer from premature convergence, limited exploration, and performance degradation in large-scale search spaces. To overcome these limitations, this paper introduces a novel Virus Diffusion Optimizer (VDO), inspired by the life-cycle and propagation dynamics of herpes-type viruses. VDO integrates four biologically motivated strategies, including viral tropism exploration, viral replication step regulation, virion diffusion propagation, and latency reactivation mechanism, to achieve a balanced trade-off between global exploration and local exploitation. Experiments on standard benchmark problems, including CEC 2017 and CEC 2022, demonstrate that VDO consistently surpasses state-of-the-art metaheuristics in terms of convergence speed, solution quality, and scalability. These results highlight the effectiveness of viral-inspired strategies in optimization and position VDO as a promising tool for addressing large-scale, complex problems in engineering and computational intelligence.To ensure reproducibility and foster further research, the source code of VDO is made publicly available.

math.OC↗

Efficient QR-Based CP Decomposition Acceleration via Restructured Dimension Tree and Customized Extrapolation

The canonical polyadic (CP) decomposition is one of the most widely used tensor decomposition techniques. The conventional CP decomposition algorithm combines alternating least squares (ALS) with the normal equation. However, the normal equation is susceptible to numerical ill-conditioning, which can adversely affect the decomposition results. To mitigate this issue, ALS combined with QR decomposition has been proposed as a more numerically stable alternative. Although this method enhances stability, its iterative process involves tensor-times-matrix (TTM) operations, which typically result in higher computational costs. To reduce this cost, we propose restructured dimension tree, which increases the reuse of intermediate tensors and reduces the number of TTM operations. Compared with the standard dimension tree structure, this dimension tree structure can reduce the computational complexity of TTM operations for tensors of any order by 33\%. Additionally, we introduce a customized extrapolation strategy in the CP-ALS-QR algorithm, leveraging the unique structure of the matrix $\mathbf{Q}_0$ to further accelerate convergence. By integrating these two techniques, we propose a novel CP decomposition algorithm that significantly improves iteration efficiency, achieving up to twofold acceleration on datasets with certain specific structures. Numerical experiments on five real-world datasets show that, compared with the baseline algorithm, our proposed algorithm improves iteration efficiency while simultaneously enhancing fitting accuracy.

math.NA↗

Accelerated Tensor Completion via Trace-Regularized Fully-Connected Tensor Network

The fully-connected tensor network (FCTN) decomposition has gained prominence in the field of tensor completion owing to its powerful capacity to capture the low-rank characteristics of tensors. Nevertheless, the recovery of local details in the reconstructed tensor still leaves scope for enhancement. In this paper, we propose efficient tensor completion model that incorporates trace regularization within the FCTN decomposition framework. The trace regularization is constructed based on the mode-$k$ unfolding of the FCTN factors combined with periodically modified negative laplacian. The trace regularization promotes the smoothness of the FCTN factors through discrete second-order derivative penalties, thereby enhancing the continuity and local recovery performance of the reconstructed tensor. To solve the proposed model, we develop an efficient algorithm within the proximal alternating minimization (PAM) framework and theoretically prove its convergence. To reduce the runtime of the proposed algorithm, we design an intermediate tensor reuse mechanism that can decrease runtime by 10\%-30\% without affecting image recovery, with more significant improvements for larger-scale data. A comprehensive complexity analysis reveals that the mechanism attains a reduced computational complexity. Numerical experiments demonstrate that the proposed method outperforms existing approaches.

math.NA↗

Cognitive-Level Adaptive Generation via Capability-Aware Retrieval and Style Adaptation

Large Language Models (LLMs) have demonstrated strong performance in open-ended generation tasks. However, they often struggle to adapt content to users with differing cognitive capacities, leading to a phenomenon we term cognitive misalignment. This issue arises in two forms: knowledge-level misalignment, where content is too complex or too simplistic relative to user understanding, and presentation-style misalignment, where the structure or tone hinders effective comprehension. To address these challenges, we propose the Cognitive-Level Alignment Framework (CLAF), a general-purpose generation framework that aligns both knowledge complexity and presentation style with user cognition. CLAF integrates a capability-aware retrieval module based on a hierarchical knowledge graph and a style optimization module guided by Bloom's taxonomy and preference learning. Additionally, a knowledge-controllable generation component ensures consistency and relevance throughout the output. To support training and evaluation, we construct SCALE, a cognitively annotated dataset containing responses at multiple comprehension levels per query. Empirical results show that CLAF enhances the adaptability and informativeness of LLM outputs across a range of user profiles, offering a robust solution to cognitive-level alignment in real-world applications.

cs.CL↗

Accelerated Proximal Dogleg Majorization for Sparse Regularized Quadratic Optimization Problem

This paper addresses the problems of minimizing the sum of a quadratic function and a proximal-friendly nonconvex nonsmooth function. While the existing Proximal Dogleg Opportunistic Majorization (PDOM) algorithm for these problems offers computational efficiency by minimizing opportunistic majorization subproblems along mixed Newton directions and requiring only a single Hessian inversion, its convergence rate is limited due to the nonconvex nonsmooth regularization term, and its theoretical analysis is restricted to local convergence. To overcome these limitations, we firstly propose a novel algorithm named PDOM with extrapolation (PDOME). Its core innovations lie in two key aspects: (1) the integration of an extrapolation strategy into the construction of the hybrid Newton direction, and (2) the enhancement of the line search mechanism. Furthermore, we establish the global convergence of the entire sequence generated by PDOME to a critical point and derive its convergence rate under the Kurdyka-Lojasiewicz (KL) property. Numerical experiments demonstrate that PDOME achieves faster convergence and tends to converge to a better local optimum compared to the original PDOM.

math.OC↗

The Geometry of Gaussian Random Curves

In this paper, we investigate some geometric properties of non-smooth random curves within a stochastic flow. We consider a polygonal line $Γ(\vec{u}_{1},\cdots,\vec{u}_{n})$, which connects the points \(\vec{u}_{1},\cdots,\vec{u}_{n}\in{\mathbb{R}^{d}}\) and is inscribed in a Brownian trajectory. Subsequently, we estimate the probability that a polygonal line is almost inscribed in a Brownian trajectory. Next, we turn to the study of the self-intersection local time of Brownian motion and demonstrate the asymptotic result of its conditional expectation as the size of the polygonal line increases. Finally, taking such a Brownian trajectory as the initial curve, we let it evolve according to the solution of the equation with interaction. Then, we prove that its visitation density exhibits an intermittency phenomenon.

math.PR↗

Neural Network Training via Stochastic Alternating Minimization with Trainable Step Sizes

The training of deep neural networks is inherently a nonconvex optimization problem, yet standard approaches such as stochastic gradient descent (SGD) require simultaneous updates to all parameters, often leading to unstable convergence and high computational cost. To address these issues, we propose a novel method, Stochastic Alternating Minimization with Trainable Step Sizes (SAMT), which updates network parameters in an alternating manner by treating the weights of each layer as a block. By decomposing the overall optimization into sub-problems corresponding to different blocks, this block-wise alternating strategy reduces per-step computational overhead and enhances training stability in nonconvex settings. To fully leverage these benefits, inspired by meta-learning, we proposed a novel adaptive step size strategy to incorporate into the sub-problem solving steps of alternating updates. It supports different types of trainable step sizes, including but not limited to scalar, element-wise, row-wise, and column-wise, enabling adaptive step size selection tailored to each block via meta-learning. We further provide a theoretical convergence guarantee for the proposed algorithm, establishing its optimization soundness. Extensive experiments for multiple benchmarks demonstrate that SAMT achieves better generalization performance with fewer parameter updates compared to state-of-the-art methods, highlighting its effectiveness and potential in neural network optimization.

cs.LG↗

Gromov-Hausdorff distances, Borsuk-Ulam theorems, and Vietoris-Rips complexes

We explore emerging relationships between the Gromov--Hausdorff distance, Borsuk--Ulam theorems, and Vietoris--Rips simplicial complexes. The Gromov--Hausdorff distance between two metric spaces $X$ and~$Y$ can be lower bounded by the distortion of (possibly discontinuous) functions between them. The more these functions must distort the metrics, the larger the Gromov--Hausdorff distance must be. Topology has few tools to obstruct the existence of discontinuous functions. However, an arbitrary function $f\colon X\to Y$ induces a continuous map between their Vietoris--Rips simplicial complexes, where the allowable choices of scale parameters depend on how much the function $f$ distorts distances. We can then use equivariant topology to obstruct the existence of certain continuous maps between Vietoris--Rips complexes. With these ideas we bound how discontinuous an odd map between spheres $S^k\to S^n$ with $k>n$ must be, generalizing a result by Dubins and Schwarz (1981), which is the case $k=n+1$. As an application, we recover or improve upon all of the lower bounds from Lim, M{é}moli, and Smith (2022) on the Gromov--Hausdorff distances between spheres of different dimensions. We also provide new upper bounds on the Gromov--Hausdorff distance between spheres of adjacent dimensions.

math.MG↗

Elucidating Flow Matching ODE Dynamics with Respect to Data Geometries and Denoisers

Flow matching (FM) models extend ODE sampler based diffusion models into a general framework, significantly reducing sampling steps through learned vector fields. However, the theoretical understanding of FM models, particularly how their sample trajectories interact with underlying data geometry, remains underexplored. A rigorous theoretical analysis of FM ODE is essential for sample quality, stability, and broader applicability. In this paper, we advance the theory of FM models through a comprehensive analysis of sample trajectories. Central to our theory is the discovery that the denoiser, a key component of FM models, guides ODE dynamics through attracting and absorbing behaviors that adapt to the data geometry. We identify and analyze the three stages of ODE evolution: in the initial and intermediate stages, trajectories move toward the mean and local clusters of the data. At the terminal stage, we rigorously establish the convergence of FM ODE under weak assumptions, addressing scenarios where the data lie on a low-dimensional submanifold-cases that previous results could not handle. Our terminal stage analysis offers insights into the memorization phenomenon and establishes equivariance properties of FM ODEs. These findings bridge critical gaps in understanding flow matching models, with practical implications for optimizing sampling strategies and architectures guided by the intrinsic geometry of data.

cs.LG↗

An Efficient Alternating Algorithm for ReLU-based Symmetric Matrix Decomposition

Symmetric matrix decomposition is an active research area in machine learning. This paper focuses on exploiting the low-rank structure of non-negative and sparse symmetric matrices via the rectified linear unit (ReLU) activation function. We propose the ReLU-based nonlinear symmetric matrix decomposition (ReLU-NSMD) model, introduce an accelerated alternating partial Bregman (AAPB) method for its solution, and present the algorithm's convergence results. Our algorithm leverages the Bregman proximal gradient framework to overcome the challenge of estimating the global $L$-smooth constant in the classic proximal gradient algorithm. Numerical experiments on synthetic and real datasets validate the effectiveness of our model and algorithm.

cs.LG↗

A Triple-Inertial Accelerated Alternating Optimization Method for Deep Learning Training

The stochastic gradient descent (SGD) algorithm has achieved remarkable success in training deep learning models. However, it has several limitations, including susceptibility to vanishing gradients, sensitivity to input data, and a lack of robust theoretical guarantees. In recent years, alternating minimization (AM) methods have emerged as a promising alternative for model training by employing gradient-free approaches to iteratively update model parameters. Despite their potential, these methods often exhibit slow convergence rates. To address this challenge, we propose a novel Triple-Inertial Accelerated Alternating Minimization (TIAM) framework for neural network training. The TIAM approach incorporates a triple-inertial acceleration strategy with a specialized approximation method, facilitating targeted acceleration of different terms in each sub-problem optimization. This integration improves the efficiency of convergence, achieving superior performance with fewer iterations. Additionally, we provide a convergence analysis of the TIAM algorithm, including its global convergence properties and convergence rate. Extensive experiments validate the effectiveness of the TIAM method, showing significant improvements in generalization capability and computational efficiency compared to existing approaches, particularly when applied to the rectified linear unit (ReLU) and its variants.

cs.LG↗

An Accelerated Alternating Partial Bregman Algorithm for ReLU-based Matrix Decomposition

Despite the remarkable success of low-rank estimation in data mining, its effectiveness diminishes when applied to data that inherently lacks low-rank structure. To address this limitation, in this paper, we focus on non-negative sparse matrices and aim to investigate the intrinsic low-rank characteristics of the rectified linear unit (ReLU) activation function. We first propose a novel nonlinear matrix decomposition framework incorporating a comprehensive regularization term designed to simultaneously promote useful structures in clustering and compression tasks, such as low-rankness, sparsity, and non-negativity in the resulting factors. This formulation presents significant computational challenges due to its multi-block structure, non-convexity, non-smoothness, and the absence of global gradient Lipschitz continuity. To address these challenges, we develop an accelerated alternating partial Bregman proximal gradient method (AAPB), whose distinctive feature lies in its capability to enable simultaneous updates of multiple variables. Under mild and theoretically justified assumptions, we establish both sublinear and global convergence properties of the proposed algorithm. Through careful selection of kernel generating distances tailored to various regularization terms, we derive corresponding closed-form solutions while maintaining the $L$-smooth adaptable property always holds for any $L\ge 1$. Numerical experiments, on graph regularized clustering and sparse NMF basis compression confirm the effectiveness of our model and algorithm.

cs.LG↗

An Improved Optimal Proximal Gradient Algorithm for Non-Blind Image Deblurring

Image deblurring remains a central research area within image processing, critical for its role in enhancing image quality and facilitating clearer visual representations across diverse applications. This paper tackles the optimization problem of image deblurring, assuming a known blurring kernel. We introduce an improved optimal proximal gradient algorithm (IOptISTA), which builds upon the optimal gradient method and a weighting matrix, to efficiently address the non-blind image deblurring problem. Based on two regularization cases, namely the $l_1$ norm and total variation norm, we perform numerical experiments to assess the performance of our proposed algorithm. The results indicate that our algorithm yields enhanced PSNR and SSIM values, as well as a reduced tolerance, compared to existing methods.

cs.CV↗

Multi-step Inertial Accelerated Doubly Stochastic Gradient Methods for Block Term Tensor Decomposition

In this paper, we explore a specific optimization problem that combines a differentiable nonconvex function with a nondifferentiable function for multi-block variables, which is particularly relevant to tackle the multilinear rank-($L_r$,$L_r$,1) block-term tensor decomposition model with a regularization term. While existing algorithms often suffer from high per-iteration complexity and slow convergence, this paper employs a unified multi-step inertial accelerated doubly stochastic gradient descent method tailored for structured rank-$\left(L_r, L_r, 1\right)$ tensor decomposition, referred to as Midas-LL1. We also introduce an extended multi-step variance-reduced stochastic estimator framework. Our analysis under this new framework demonstrates the subsequential and sequential convergence of the proposed algorithm under certain conditions and illustrates the sublinear convergence rate of the subsequence, showing that the Midas-LL1 algorithm requires at most $\mathcal{O}(\varepsilon^{-2})$ iterations in expectation to reach an $\varepsilon$-stationary point. The proposed algorithm is evaluated on several datasets, and the results indicate that Midas-LL1 outperforms existing state-of-the-art algorithms in terms of both computational speed and solution quality.

math.OC↗

Extremal spherical polytopes and Borsuk's conjecture

We generate anti-self-polar polytopes via a numerical implementation of the gradient flow induced by the diameter functional on the space of all finite subsets of the sphere, and prove related results on the critical points of the diameter functional as well as results about the combinatorics of such polytopes. We also discuss potential connections to Borsuk's conjecture.

math.CO↗

Measure Theoretic Reeb Graphs and Reeb Spaces

A Reeb graph is a graphical representation of a scalar function on a topological space that encodes the topology of the level sets. A Reeb space is a generalization of the Reeb graph to a multiparameter function. In this paper, we propose novel constructions of Reeb graphs and Reeb spaces that incorporate the use of a measure. Specifically, we introduce measure-theoretic Reeb graphs and Reeb spaces when the domain or the range is modeled as a metric measure space (i.e.,~a metric space equipped with a measure). Our main goal is to enhance the robustness of the Reeb graph and Reeb space in representing the topological features of a scalar field while accounting for the distribution of the measure. We first introduce a Reeb graph with local smoothing and prove its stability with respect to the interleaving distance. We then prove the stability of a Reeb graph of a metric measure space with respect to the measure, defined using the distance to a measure or the kernel distance to a measure, respectively.

cs.CG↗