Search arXivSearch

arXiv · 2609.03190

Coupled Tensor-Tensor Completion Method with Applications in Drug Repurposing

Abstract

Many biomedical challenges can be posed as tensor completion problems where the observed entries of a multidimensional array (a tensor) are used to impute the missing values. In such settings, incorporating side information about the modes of the tensor, such as gene-gene similarity, can significantly enhance the solutions of the completion problem. Most existing tensor completion methods can only incorporate side information in the form of matrices. In this study, we introduce a novel framework to incorporate side information in the form of tensors. Our new approach, called Coupled Tensor-Tensor Completion (CTTC), leverages the hidden connections among multimodal tensors to improve tensor completion performance. In addition to practical utility, CTTC has theoretical foundations in distance metric learning and group theory. We derive an alternating algorithm to solve the CTTC optimization problem and establish its convergence to a stationary point. Finally, we show that CTTC outperforms state-of-the-art tensor completion methods at predicting drug effects. Results: Compared with other tensor completion methods, including HaLRTC, CTRC, Cell, and NTDDR, CTTC demonstrates superior run-time and RSE tensor completion accuracy on two benchmark datasets, DTD and LINCS.

Explore related subjects

Keep this discovery

BibTeXRIS

Maryam Bagherian, Albert Hung, Ivo Dinov, Joshua Welch. 2026-09-02. Coupled Tensor-Tensor Completion Method with Applications in Drug Repurposing. https://arxiv.org/abs/2609.03190

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Regularity of Second-Order Elliptic PDEs in Spectral Barron Spaces

We establish a regularity theorem for second-order elliptic PDEs on $\mathbb{R}^{d}$ in spectral Barron spaces. Under mild ellipticity and smallness assumptions, the solution gains two additional orders of Barron regularity. As a corollary, we identify a class of PDEs whose solutions can be approximated by two-layer neural networks with cosine activation functions, where the width of the neural network is independent of the spatial dimension.

math.AP

Neural operators approximate strongly continuous convex monotone semigroups

We approximate strongly continuous convex monotone semigroups by learning their Chernoff-type one-step operators with neural operators. First, we introduce the general class of so-called Chernoff-neural operators and show in a universal approximation theorem that they can approximate the Chernoff one-step operators arbitrarily well. By using stability estimates between weighted Hölder spaces, the one-step approximation error can be propagated through the iterations which yields universal approximation of the corresponding semigroup. Second, we introduce the more specialized class of envelope-neural operators for envelope semigroups which allows us to derive quantitative approximation rates. Finally, we illustrate the effectiveness of these neural operators in several numerical examples arising from non-linear partial differential equations, stochastic optimal control and stochastic processes under model uncertainty.

math.NA

Approximation of solutions of parameter-dependent problems by residual neural networks

We develop a convergent scheme to train neural networks involving analytic activation functions based on gradient flows. Convergence properties are guaranteed by Lojasiewicz theory. The main advantage of this approach is its simplicity of implementation. The coefficients of the network are approximated by solving a system of ordinary differential equations. We test the method by constructing residual neural network approximations of solutions of parametric problems. The dependence of the solutions of simple ordinary differential equations on a few parameters is correctly reproduced. The solutions of inverse problems involving wave constraints which depend on a few parameters can be reasonably approximated, even in regions in which the problem is severely ill posed.

math.NA