Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 23 for “"Tucker decomposition"”.
-
Heterogeneous Decomposition of Convolutional Neural Networks Using Tucker Decomposition
… rank approximation of convolution layers using Tucker Decomposition (TD). We introduce a new heuristics-based Neural Architectural Search procedure to select low rank configurations for the convolution tensors, which we call Heterogeneous Tucker Decomposition (HTD). Standard low rank …
-
ESTIMATING THE RESPIRATORY LUNG MOTION MODEL USING TENSOR DECOMPOSITION ON DISPLACEMENT VECTOR FIELD
… to develop algorithms such as low-rank tensor decomposition for data compression, dimensionality reduction, and approximation. With the advancement in technology, high-dimensional images are becoming ubiquitous in the medical field. In lung radiation therapy, the respiratory motion of the lung …
-
Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems
… the alternating least squares algorithm for the Tucker decomposition of tensors. In addition, we introduce the Tucker packing problem for computing an approximately optimal core shape for the Tucker decomposition problem. We prove this problem is NP-hard and provide polynomial-time approximation …
-
Time Series, Clustering, Network Models and Tensor Analysis
… look at analyzing higher-order tensor data via a decomposition which interpolates between the CP-decomposition and the Tucker decomposition. This decomposition, which we call the grouped-tucker decomposition, groups together the different dimensions of the tensor and allows for different behavior …
-
High Dimensional Data Analysis With Dependency and Under Limited Memory
… fixate on developing a streaming algorithm for Tucker Decomposition, generalization of singular value decomposition. The method applies a randomized linear map to the tensor to obtain a sketch that captures the important directions within each mode as well as the interactions among the modes. …
-
Learning Representations With Linear-Algebraic Structure
… word embedding model is closely connected to the Tucker decomposition, an important basic operation in tensor analysis that also arises in the context of other latent variable models. We formulate the Tucker decomposition as a nonconvex optimization problem and prove that its landscape is benign. …
-
Novel Tensor Factorization Algorithms and Applications
… resources to compute large-scale tensor decompositions, efficiently enforcing nonnegativity constraints to improve interpretability, and incorporating additional information into the factorization to improve solution quality. We start by proposing the Fused In-place Sequentially Truncated …
-
Sparse Low-rank Tensor Logistic Regression with Applications in Neuroimaging
… tensor data. Recent advances in tensor decomposition, as reviewed by Burch et al. (2025), highlight methods such as CP, Tucker, HOSVD, and t-SVD, which offer robust frameworks for handling multi-dimensional biomedical data, including neuroimaging. In this paper, we propose a novel …
-
Robust Low-Rank Tensor Discriminant Analysis With Optimal Scoring
… by Huang \& Zhang (2020), incorporating low-rank Tucker decomposition and regularization techniques to address higher-dimensional cases. The enhanced method is designed to effectively handle tensor-structured data, which is prevalent in imaging applications. The model creates a sparse discriminant …
-
A case-study of using tensors in multi-way electroencephalograme (EEG) data analysis
… in a variety of fields rely on tensor decomposition. Tensor decomposition's goal is to compress the data without losing any signficant information. Tensor decompositon is also known for its ability to extract underlying features that could not have been seen at face value. One such …
-
Theory and Algorithms for Reliable Multimodal Data Analysis, Machine Learning, and Signal Processing
… which are commonly referred to as tensors. Tucker decomposition (TD) is a standard method for tensor analysis with applications in diverse fields of science and engineering. Despite its success, TD exhibits severe sensitivity against outliers —i.e., heavily corrupted entries that appear …
-
A Local Macroscopic Conservative (LoMaC) low rank tensor method with the discontinuous Galerkin method for the Vlasov dynamics
… to high-dimensional problems using hierarchical Tucker decomposition of solution tensors and a conservative projection algorithm. Additionally, the algorithm’s applicability is shown in DG methods on nodal points of unstructured meshes or other types of discretization, such as the spectral method …
-
Arbitrary mode-n convolution of physical tensors with applications in optics
… problems using 1) full-sized tensors; 2) Tensor Tucker Decomposition; and 3) Tensor Train Decomposition. Our numerical results demonstrated that the Tensor Train approach is most efficient in terms of accuracy, storage requirement, and computation time.
-
Satellite-Terrestrial Integration under Uncertainty Using Machine Learning and Distributionally Robust Optimization
… in terrestrial networks. By incorporating the Tucker decomposition technique, the proposed algorithm exhibits superior learning quality compared to conventional routing methods. In the second work, we extend our exploration to LEO satellite constellations, employing deep reinforcement learning …
-
Tensor decomposition for time-resolved immune cell sequencing in cancer
… analysis. This thesis applies different tensor decomposition methods to time-resolved γδ TCR sequencing data from sarcoma patients to uncover interpretable immune dynamics. After preprocessing, data from 13 of 16 patients were retained, and multiple tensors of varying temporal lengths (70, 100, …
-
High dimensional data analysis for anomaly detection and quality improvement
… A novel methodology, named smooth-sparse decomposition (SSD), is proposed to exploit regularized high-dimensional regression to decompose an image and separate anomalous regions simultaneously by solving a large-scale optimization problem. Chapter 4 extends this to spatial-temporal …
-
Environmental Influence on Cold-Climate Grapevine (Vitis Spp.) Fall Acclimation Response and Fruit Ripening
… three similar axes relating the genotypes. Tucker decomposition was better able to separate wild genotypes from hybrids, was more consistent in the subspace defined, and was more readily interpretable, thus was preferred over SVD. Adapted types, V. riparia and ‘Frontenac’, showed increased …
-
Scalable inference and private co-training for Gaussian processes
… <p>The second chapter explores the use of Tucker decomposition and Kronecker structure of variational distributions in order to use very large numbers of inducing points for scalable variational Gaussian processes. The methods use a massive number of gridded inducing points, enabling more …
-
Parametric Low-Rank Model Reduction for Nonlinear Fluid Systems
… methods built on Proper Orthogonal Decomposition (POD) are effective when the solution manifold is well captured by a global low-dimensional linear subspace, but they struggle as the complexity of the parameter-dependent dynamics increases --- with shock formation, moving free …
-
Block Coordinate Update Method in Tensor Optimization
… certain problems such as the nonnegative tensor decomposition, the block subproblems can be difficult to solve, or even if they are solved exactly or to high accuracies, BAM can perform badly on solving the original problem, in particular on non-convex problems. On the other hand, in the …
Page 1 of 2