HPC formulations of optimization algorithms for tensor completion

Smith, Shaden; Park, Jongsoo; Karypis, George

doi:10.1016/j.parco.2017.11.002

Title: HPC formulations of optimization algorithms for tensor completion

Full Record
Other Related Research

Authors:: Smith, Shaden; Park, Jongsoo; Karypis, George

Publication Date:: Tue May 01 00:00:00 EDT 2018

Sponsoring Org.:: USDOE

OSTI Identifier:: 1549506

Grant/Contract Number:: AC02-05CH11231

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Parallel Computing

Additional Journal Information:: Journal Name: Parallel Computing Journal Volume: 74 Journal Issue: C; Journal ID: ISSN 0167-8191

Publisher:: Elsevier

Country of Publication:: Netherlands

Language:: English

Citation Formats


                    Smith, Shaden, Park, Jongsoo, and Karypis, George. HPC formulations of optimization algorithms for tensor completion.  Netherlands: N. p., 2018. 
Web.  doi:10.1016/j.parco.2017.11.002.

Copy to clipboard


                    Smith, Shaden, Park, Jongsoo, & Karypis, George. HPC formulations of optimization algorithms for tensor completion.  Netherlands.  https://doi.org/10.1016/j.parco.2017.11.002

Copy to clipboard


                    Smith, Shaden, Park, Jongsoo, and Karypis, George. Tue .  
"HPC formulations of optimization algorithms for tensor completion".  Netherlands.  https://doi.org/10.1016/j.parco.2017.11.002.

Copy to clipboard


                    
@article{osti_1549506,

  title        = {HPC formulations of optimization algorithms for tensor completion},

  author       = {Smith, Shaden and Park, Jongsoo and Karypis, George},

  abstractNote = {},

  doi          = {10.1016/j.parco.2017.11.002},

  journal      = {Parallel Computing},

  number       = C,

  volume       = 74,

  place        = {Netherlands},

  year         = {Tue May 01 00:00:00 EDT 2018},

  month        = {Tue May 01 00:00:00 EDT 2018}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.parco.2017.11.002

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 3 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

HPC formulations of optimization algorithms for tensor completion

Journal Article - Parallel Computing

Tensor completion is a powerful tool used to estimate or recover missing values in multi-way data. It has seen great success in domains such as product recommendation and healthcare. Tensor completion is most often accomplished via low-rank sparse tensor factorization, a computationally expensive non-convex optimization problem which has only recently been studied in the context of parallel computing. In this work, we study three optimization algorithms that have been successfully applied to tensor completion: alternating least squares (ALS), stochastic gradient descent (SGD), and coordinate descent (CCD++). We explore opportunities for parallelism on shared- and distributed-memory systems and address challenges suchmore »« less
https://doi.org/10.1016/j.parco.2017.11.002
A Tensor Product Formulation of Strassen's Matrix Multiplication Algorithm with Memory Reduction

Journal Article Kumar, B. ; Huang, C. -H. ; Sadayappan, P. ; ... - Scientific Programming

In this article, we present a program generation strategy of Strassen's matrix multiplication algorithm using a programming methodology based on tensor product formulas. In this methodology, block recursive programs such as the fast Fourier Transforms and Strassen's matrix multiplication algorithm are expressed as algebraic formulas involving tensor products and other matrix operations. Such formulas can be systematically translated to high-performance parallel/vector codes for various architectures. In this article, we present a nonrecursive implementation of Strassen's algorithm for shared memory vector processors such as the Cray Y-MP. A previous implementation of Strassen's algorithm synthesized from tensor product formulas required working storagemore »« less
https://doi.org/10.1155/1995/636457
A HPC-Based Flowback and Cleanup Simulator Tool for Horizontal Well Completion and Optimization

Technical Report Pummill, Rand
A HPC-Based Flowback and Cleanup Simulator Tool for Horizontal Well Completion and Optimization

Technical Report McGurn, Matthew

The major goal of this project was to create a simulation tool that couples geomechanics, reservoir, and fracture flow physics to allow the design of a flowback schedule to optimize fluid recovery and reduce water usage in hydraulic fracturing operations. The simulation tool provides greater accuracy and faster turn-around time than currently available simulators. The tool will be designed for specialists and non-experts including non-operating or operating working interest partners, financial institutions, contractors, academics and service companies. In final form, the simulator will improve the efficiency of natural gas production from unconventional resources and reduce the amount of water used.
A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems

Journal Article Hao, Tianyi ; Huang, Xuxin ; Jia, Chunjing ; ... - Frontiers in Physics

Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we propose a quantum-inspired tensor-network-based algorithm for general locally constrained combinatorial optimization problems. Our algorithm constructs a Hamiltonian for the problem of interest, effectively mapping it to a quantum problem, then encodes the constraints directly into a tensor network state and solves the optimal solution by evolving the system to the ground state of the Hamiltonian. We demonstrate our algorithm with the open-pit mining problem, which results in a quadratic asymptotic timemore »« less
https://doi.org/10.3389/fphy.2022.906590

Full Text Available

Similar Records