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 32 for “"Tensor Completion"”.

  1. Luck, Fairness and Bayesian Tensor Completion

    … Seasons. The second topic centers on matrix and tensor completion, which are frameworks for a wide range of problems, including collaborative filtering, missing data, and image reconstruction. Missing entries are estimated by leveraging an assumption that the matrix or tensor is low-rank. Most …

    cornell Repository record for Luck, Fairness and Bayesian Tensor Completion (opens in a new tab)

  2. Near-optimal sample complexity for noisy or 1-bit tensor completion

    Tensor completion is the problem of recovering a low-rank tensor from a partial subset of its entries. Assuming a rank-r, order-d tensor in ℝ^{NxNx...N}, the best sampling complexity achieved is O(rN^{d/2}) which can be obtained by a tensor nuclear-norm minimization problem. This bound is …

    ubc Repository record for Near-optimal sample complexity for noisy or 1-bit tensor completion (opens in a new tab) Download PDF for Near-optimal sample complexity for noisy or 1-bit tensor completion (opens in a new tab)

  3. Tensor Completion and Total Variation Denoising and Deblurring in Tensor Spaces

    Tensor completion is a higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from a partially observed tensor. Here we work on a numerical method to reconstructs a tensor (matrix) with missing entries by finding the optimal factors through linear least …

    uab Repository record for Tensor Completion and Total Variation Denoising and Deblurring in Tensor Spaces (opens in a new tab)

  4. A multiresolution approach for tensor completion from coarse and partial observations

    Existing tensor completion formulation mostly relies on partial observations from a single tensor. However, tensors extracted from real-world data often are more complex due to: (i) Partial observation: Only a small subset of tensor elements are available. (ii) Coarse observation: Some tensor modes …

    uiuc Repository record for A multiresolution approach for tensor completion from coarse and partial observations (opens in a new tab)

  5. Tensor completion methods with provable consistency and fairness guarantees for recommender systems

    … for solving nonnegative/ positive matrix and tensor completion problems in the context of recommender systems. The proposed framework focuses on preserving unit-scale consistency as a single property, ensuring both the existence and uniqueness of solutions. Key theoretical contributions …

    missouri Repository record for Tensor completion methods with provable consistency and fairness guarantees for recommender systems (opens in a new tab)

  6. Tensor Completion for Multidimensional Inverse Problems with Applications to Magnetic Resonance Relaxometry

    This thesis deals with tensor completion for the solution of multidimensional inverse problems. We study the problem of reconstructing an approximately low rank tensor from a small number of noisy linear measurements. New recovery guarantees, numerical algorithms, non-uniform sampling strategies, …

    maryland Repository record for Tensor Completion for Multidimensional Inverse Problems with Applications to Magnetic Resonance Relaxometry (opens in a new tab)

  7. End-to-end trainable deep tensor completion algorithms with multimodal data fusion for anticancer drug synergy prediction

    … multiomic features of cancer cell lines. Deep tensor completion (DTC)-based ACDSP algorithms achieve similar performance to DL-based ACDSP algorithms without using chemical or multiomic features. However, current DTC-based ACDSP algorithms are trained in two separate steps, potentially limiting …

    manitoba Repository record for End-to-end trainable deep tensor completion algorithms with multimodal data fusion for anticancer drug synergy prediction (opens in a new tab)

  8. Estimating mineral distribution using machine learning models

    … In this research, we studied how to apply tensor completion methods to estimate mineral distribution from partial observations. This includes how to map a partial observations as boreholes data format into tensor format, which problems should be considered to estimate mineral distributions, …

    colo-mines Repository record for Estimating mineral distribution using machine learning models (opens in a new tab)

  9. Scalable Algorithms for Hypergraph Analytics using Symmetric Tensor Decompositions

    Tensors are higher-dimension generalizations of matrices and are used to represent multi-dimensional data. Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. Symmetric tensors are an important class of tensors, arising in …

    gatech Repository record for Scalable Algorithms for Hypergraph Analytics using Symmetric Tensor Decompositions (opens in a new tab)

  10. Tensorial Data Low-Rank Decomposition on Multi-dimensional Image Data Processing

    … in big-data processing. The characteristics of tensor low-rank decomposition in recent years demonstrate the importance of capturing the tensor structure adequately which usually yields efficacious approaches. In this dissertation, we first aim to explore the tensor singular value decomposition …

    siu-theses Repository record for Tensorial Data Low-Rank Decomposition on Multi-dimensional Image Data Processing (opens in a new tab)

  11. The Evolving Retail Ecosystem: Spatiotemporal Data, Partnerships, and Crowd Wisdom for Strategic Advantage

    … in the crowdfunding context. Chapter 3 employs tensor completion methods to estimate the treatment effect of deploying smart vending machines across various urban settings, demonstrating the superiority of this approach over traditional causal inference techniques. Chapter 4 investigates the …

    washington Repository record for The Evolving Retail Ecosystem: Spatiotemporal Data, Partnerships, and Crowd Wisdom for Strategic Advantage (opens in a new tab)

  12. A Research on Automatic Hyperparameter Recommendation via Meta-Learning

    … recommendation as a problem of low-rank tensor completion. The hyperparameter search space was often stretched to a one-dimensional vector, which removes the spatial structure of the search space and ignores the correlations that existed between the adjacent hyperparameters and these …

    siu-theses Repository record for A Research on Automatic Hyperparameter Recommendation via Meta-Learning (opens in a new tab)

  13. Low rank models for multi-dimensional data recovery and image super-resolution

    … first develop new algorithms for low rank matrix completion that are more robust to noise and converge faster than the previous algorithms. Furthermore, we generalize our recovery function to the multi-dimensional tensor domain to target the applications that deal with multi-dimensional data. …

    msu

  14. Learning multi-way associations across biological networks

    … across multiple biological networks as a tensor (multi-way array), which is structured by the manifolds in the product of multiple networks; and improve the learning scalability through optimally estimating the tensor and the product graph. These methods rely on tensor decomposition and …

    umn Repository record for Learning multi-way associations across biological networks (opens in a new tab)

  15. Financial time series fusion, completion, and prediction with deep neural networks

    … networks, deep neural networks, and matrix/tensor methods. The primary objectives are twofold: first, to reveal complex correlations within financial time series to improve prediction accuracy, and second, to enhance the process of integrating and imputing missing financial data.</p><p>One …

    njit Repository record for Financial time series fusion, completion, and prediction with deep neural networks (opens in a new tab)

  16. Large-scale optimization algorithms for missing data completion and inverse problems

    … on the smooth manifold of Hierarchical Tucker tensors. Tensors that exhibit this low-rank structure can be recovered from solving this non-convex program in an efficient manner. We successfully interpolate realistically sized seismic data volumes using this approach. If our low-rank tensor is …

    ubc Repository record for Large-scale optimization algorithms for missing data completion and inverse problems (opens in a new tab) Download PDF for Large-scale optimization algorithms for missing data completion and inverse problems (opens in a new tab)

  17. Optimization and Machine Learning Techniques for Analyzing Spatiotemporal Dynamics

    In a numerical context, the tensor CP decomposition challenge can be reformulated into a series of least squares subproblems, which can be addressed using the renowned Alternating Least Square algorithm (ALS). The ALS algorithm is often characterized by a 'swamp phenomenon' that slows down its …

    uab Repository record for Optimization and Machine Learning Techniques for Analyzing Spatiotemporal Dynamics (opens in a new tab)

  18. Advanced Multilinear Data Analysis and Sparse Representation Approaches and Their Applications

    … process. This thesis sheds new light on the tensor decomposition problem via the ideas of fast low-rank approximation in random projection and tensor completion in compressed sensing. We propose a novel approach called Compressed Submanifold Multifactor Analysis (CSMA) to solve the three …

    concordia Download PDF for Advanced Multilinear Data Analysis and Sparse Representation Approaches and Their Applications (opens in a new tab)

  19. Algorithms and software for efficient tensor decompositions

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2026-02-19 without embargo terms

    uiuc Repository record for Algorithms and software for efficient tensor decompositions (opens in a new tab)

  20. Modelling Group Recommender Systems

    … becomes prohibitively large. We proposed a novel Tensor Completion Cohesion model that can determine the effectiveness of any subgroup formation based on observing only a very limited number of them.

    uts Repository record for Modelling Group Recommender Systems (opens in a new tab)

Page 1 of 2