skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Exploration of tensor decomposition applied to commercial building baseline estimation
Baseline estimation is a critical task for commercial buildings that participate in demand response programs and need to assess the impact of their strategies. The problem is to predict what the power profile would have been had the demand response event not taken place. This paper explores the use of tensor decomposition in baseline estimation. We apply the method to submetered fan power data from demand response experiments that were run to assess a fast demand response strategy expected to primarily impact the fans. Baselining this fan power data is critical for evaluating the results, but doing so presents new challenges not readily addressed by existing techniques designed primarily for baselining whole building electric loads. We find that tensor decomposition of the fan power data identifies components that capture both dominant daily patterns and demand response events, and that are generally more interpretable than those found by principal component analysis. We conclude by discussing how these components and related techniques can aid in developing new baseline models.  more » « less
Award ID(s):
1838179
PAR ID:
10205312
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
IEEE Global Conference on Signal and Information Processing (GlobalSIP)
Page Range / eLocation ID:
1 to 5
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing)
    null (Ed.)
    We give new and efficient black-box reconstruction algorithms for some classes of depth-3 arithmetic circuits. As a consequence, we obtain the first efficient algorithm for computing the tensor rank and for finding the optimal tensor decomposition as a sum of rank-one tensors when then input is a constant-rank tensor. More specifically, we provide efficient learning algorithms that run in randomized polynomial time over general fields and in deterministic polynomial time over and for the following classes: 1) Set-multilinear depth-3 circuits of constant top fan-in ((k) circuits). As a consequence of our algorithm, we obtain the first polynomial time algorithm for tensor rank computation and optimal tensor decomposition of constant-rank tensors. This result holds for d dimensional tensors for any d, but is interesting even for d=3. 2) Sums of powers of constantly many linear forms ((k) circuits). As a consequence we obtain the first polynomial-time algorithm for tensor rank computation and optimal tensor decomposition of constant-rank symmetric tensors. 3) Multilinear depth-3 circuits of constant top fan-in (multilinear (k) circuits). Our algorithm works over all fields of characteristic 0 or large enough characteristic. Prior to our work the only efficient algorithms known were over polynomially-sized finite fields (see. Karnin-Shpilka 09’). Prior to our work, the only polynomial-time or even subexponential-time algorithms known (deterministic or randomized) for subclasses of (k) circuits that also work over large/infinite fields were for the setting when the top fan-in k is at most 2 (see Sinha 16’ and Sinha 20’). 
    more » « less
  2. ; ; ; (, Journal of the Royal Statistical Society Series B: Statistical Methodology)
    Abstract This paper introduces a general framework of Semi-parametric TEnsor Factor Analysis (STEFA) that focuses on the methodology and theory of low-rank tensor decomposition with auxiliary covariates. Semi-parametric TEnsor Factor Analysis models extend tensor factor models by incorporating auxiliary covariates in the loading matrices. We propose an algorithm of iteratively projected singular value decomposition (IP-SVD) for the semi-parametric estimation. It iteratively projects tensor data onto the linear space spanned by the basis functions of covariates and applies singular value decomposition on matricized tensors over each mode. We establish the convergence rates of the loading matrices and the core tensor factor. The theoretical results only require a sub-exponential noise distribution, which is weaker than the assumption of sub-Gaussian tail of noise in the literature. Compared with the Tucker decomposition, IP-SVD yields more accurate estimators with a faster convergence rate. Besides estimation, we propose several prediction methods with new covariates based on the STEFA model. On both synthetic and real tensor data, we demonstrate the efficacy of the STEFA model and the IP-SVD algorithm on both the estimation and prediction tasks. 
    more » « less
  3. ; ; ; ; ; ; ; ; (, Journal of Electronic Packaging)
    The ability of traditional room-conditioning systems to accommodate expanding information technology loads is limited in contemporary data centers (DCs), where the storage, storing, and processing of data have grown quickly as a result of evolving technological trends and rising demand for online services, which has led to an increase in the amount of waste heat generated by IT equipment. Through the implementation of hybrid air and liquid cooling technologies, targeted, on-demand cooling is made possible by employing a variety of techniques, which include but are not limited to in-row, overhead, and rear door heat exchanger (HX) cooling systems. One of the most common liquid cooling techniques will be examined in this study based on different conditions for high-power density racks (+50 kW). This paper investigates the cooling performance of a liquid-to-air in-row coolant distribution unit (CDU) in test racks containing seven thermal test vehicles (TTVs) under various conditions, focusing on cooling capacity and HX effectiveness under different supply air temperatures (SAT). This test rig has the necessary instruments to monitor and analyze the experiments on both the liquid coolant and the air sides. Moreover, another experiment is conducted to assess the performance of the CDU that runs under different control fan schemes, as well as how the change of the control type will affect the supply fluid temperature and the TTV case temperatures at 10%, 50%, and 100% of the total power. Finally, suggestions for the best control fan scheme to use for these systems and units are provided at the conclusion of the study. 
    more » « less
  4. ; ; ; (, Journal of Computing and Information Science in Engineering)
    Abstract Energy 3D printing processes have enabled energy storage devices with complex structures, high energy density, and high power density. Among these processes, Freeze Nano Printing (FNP) has risen as a promising process. However, quality problems are among the biggest barriers for FNP. Particularly, the droplet solidification time in FNP governs thermal distribution, and subsequently determines product solidification, formation, and quality. To describe the solidification time, physical-based heat transfer model is built. But it is computationally intensive. The objective of this work is to build an efficient emulator for the physical model. There are several challenges unaddressed: 1) the solidification time at various locations, which is a multi-dimensional array response, needs to be modeled; 2) the construction and evaluation of the emulator at new process settings need to be quick and accurate. We integrate joint tensor decomposition and Nearest Neighbor Gaussian Process (NNGP) to construct an efficient multi-dimensional array response emulator with process settings as inputs. Specifically, structured joint tensor decomposition decomposes the multi-dimensional array responses at various process settings into the setting-specific core tensors and shared low dimensional factorization matrices. Then, each independent entry of the core tensor is modeled with an NNGP, which addresses the computationally intensive model estimation problem by sampling the nearest neighborhood samples. Finally, tensor reconstruction is performed to make predictions of solidification time for new process settings. The proposed framework is demonstrated by emulating the physical model of FNP, and compared with alternative tensor (multi-dimensional array) regression models. 
    more » « less
  5. ; (, 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019))
    A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although they are not presented this way, can be viewed as spectral methods on matrices built from simple tensor networks. In this work we leverage the full power of this abstraction to design new algorithms for certain continuous tensor decomposition problems. An important and challenging family of tensor problems comes from orbit recovery, a class of inference problems involving group actions (inspired by applications such as cryo-electron microscopy). Orbit recovery problems over finite groups can often be solved via standard tensor methods. However, for infinite groups, no general algorithms are known. We give a new spectral algorithm based on tensor networks for one such problem: continuous multi-reference alignment over the infinite group SO(2). Our algorithm extends to the more general heterogeneous case. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email