arXiv subjects

Yanbin Wu

Publications and source records attributed to Yanbin Wu.

4 recordsLinked to original sources

arXiv2026

IFNSO: Iteration-Free Newton-Schulz Orthogonalization

The Newton-Schulz (NS) iteration has become a key technique for orthogonalization in optimizers such as Muon and for optimization on the Stiefel manifold. Despite its effectiveness, the conventional NS iteration incurs significant computational overhead due to repeated high-dimensional matrix multiplications. To overcome these limitations, we propose Iteration-Free Newton-Schulz Orthogonalization (IFNSO), a novel framework that consolidates the traditional iterative structure into a unified and Iteration-Free formulation. By analyzing the contribution of individual matrix powers, we streamline the process by removing insignificant terms and introducing a polynomial with learnable coefficients. These coefficients are optimized to ensure both superior computational efficiency and stable convergence. Extensive experiments demonstrate that IFNSO achieves superior performance compared to existing methods. Our code is available at: https://github.com/greekinRoma/Unified_Newton_Schulz_Orthogonalization.

cs.LG↗

arXiv2025

Unified Flow Rule of Undeveloped and Fully Developed Dense Granular Flows Down Rough Inclines

We report on chute measurements of the free-surface velocity $v$ in dense flows of spheres and diverse sands and spheres-sand mixtures down rough inclines. These and previous measurements are inconsistent with standard flow rules, in which the Froude number $v/\sqrt{gh}$ scales linearly with $h/h_s$ or $(\tan\theta/\mu_r)^2h/h_s$, where $\mu_r$ is the dynamic friction coefficient, $h$ the flow thickness, and $h_s(\theta)$ its smallest value that permits a steady, uniform dense flow state at a given inclination angle $\theta$. This is because the characteristic length $L$ a flow needs to fully develop can exceed the chute or travel length $l$ and because neither rule is universal for fully developed flows across granular materials. We use a dimensional analysis motivated by a recent unification of sediment transport to derive a flow rule that solves both problems in accordance with our and previous measurements: $v=v_\infty[1-\exp(-l/L)]^{1/2}$, with $v_\infty\propto\mu_r^{3/2}\left[(\tan\theta-\mu_r)h\right]^{4/3}$ and $L\propto\mu_r^3\left[(\tan\theta-\mu_r)h\right]^{5/3}h$.

cond-mat.soft↗

arXiv2017

A novel image tag completion method based on convolutional neural network

In the problems of image retrieval and annotation, complete textual tag lists of images play critical roles. However, in real-world applications, the image tags are usually incomplete, thus it is important to learn the complete tags for images. In this paper, we study the problem of image tag complete and proposed a novel method for this problem based on a popular image representation method, convolutional neural network (CNN). The method estimates the complete tags from the convolutional filtering outputs of images based on a linear predictor. The CNN parameters, linear predictor, and the complete tags are learned jointly by our method. We build a minimization problem to encourage the consistency between the complete tags and the available incomplete tags, reduce the estimation error, and reduce the model complexity. An iterative algorithm is developed to solve the minimization problem. Experiments over benchmark image data sets show its effectiveness.

cs.CV↗

arXiv2016

Cross-model convolutional neural network for multiple modality data representation

A novel data representation method of convolutional neural net- work (CNN) is proposed in this paper to represent data of different modalities. We learn a CNN model for the data of each modality to map the data of differ- ent modalities to a common space, and regularize the new representations in the common space by a cross-model relevance matrix. We further impose that the class label of data points can also be predicted from the CNN representa- tions in the common space. The learning problem is modeled as a minimiza- tion problem, which is solved by an augmented Lagrange method (ALM) with updating rules of Alternating direction method of multipliers (ADMM). The experiments over benchmark of sequence data of multiple modalities show its advantage.

cs.LG↗