An official website of the United States government
Abstract Observations in various applications are frequently represented as a time series of multidimensional arrays, called tensor time series, preserving the inherent multidimensional structure. In this paper, we present a factor model approach, in a form similar to tensor CANDECOMP/PARAFAC (CP) decomposition, to the analysis of high-dimensional dynamic tensor time series. As the loading vectors are uniquely defined but not necessarily orthogonal, it is significantly different from the existing tensor factor models based on Tucker-type tensor decomposition. The model structure allows for a set of uncorrelated one-dimensional latent dynamic factor processes, making it much more convenient to study the underlying dynamics of the time series. A new high-order projection estimator is proposed for such a factor model, utilizing the special structure and the idea of the higher order orthogonal iteration procedures commonly used in Tucker-type tensor factor model and general tensor CP decomposition procedures. Theoretical investigation provides statistical error bounds for the proposed methods, which shows the significant advantage of utilizing the special model structure. Simulation study is conducted to further demonstrate the finite sample properties of the estimators. Real data application is used to illustrate the model and its interpretations.
more »
« less
Orthogonal Arrays: A Review
ABSTRACT Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and beautiful mathematical theory. Their connections with combinatorics, finite fields, geometry, and error‐correcting codes are profound. Orthogonal arrays have been widely used in agriculture, engineering, manufacturing, and high‐technology industries for quality and productivity improvement experiments. In recent years, they have drawn rapidly growing interest from various fields such as computer experiments, integration, visualization, optimization, big data, machine learning/artificial intelligence through successful applications in those fields. We review the fundamental concepts and statistical properties and report recent developments. Discussions of recent applications and connections with various fields are presented. Some interesting open research directions are also presented.
more »
« less
- Award ID(s):
- 2304767
- PAR ID:
- 10630840
- Publisher / Repository:
- Wiley
- Date Published:
- Journal Name:
- WIREs Computational Statistics
- Volume:
- 17
- Issue:
- 2
- ISSN:
- 1939-5108
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Plasmonic nanostructures with electrical connections have potential applications as new electro-optic devices due to their strong light–matter interactions. Plasmonic dimers with nanogaps between adjacent nanostructures are especially good at enhancing local electromagnetic (EM) fields at resonance for improved performance. In this study, we use optical extinction measurements and high-resolution electron microscopy imaging to investigate the thermal stability of electrically interconnected plasmonic dimers and their optical and morphological properties. Experimental measurements and finite difference time domain (FDTD) simulations are combined to characterize temperature effects on the plasmonic properties of large arrays of Au nanostructures on glass substrates. Experiments show continuous blue shifts of extinction peaks for heating up to 210°C. Microscopy measurements reveal these peak shifts are due to morphological changes that shrink nanorods and increase nanogap distances. Simulations of the nanostructures before and after heating find good agreement with experiments. Results show that plasmonic properties are maintained after thermal processing, but peak shifts need to be considered for device design.more » « less
-
Vortex singularities in speckle patterns formed from random superpositions of waves are an inevitable consequence of destructive interference and are consequently generic and ubiquitous. Singularities are topologically stable, meaning that they persist under small perturbations and can only be removed via pairwise annihilation. They have applications including sensing, imaging, and energy transfer in multiple fields such as optics, acoustics, and elastic or fluid waves. We generalize the concept of singularity speckle patterns to arbitrary two-dimensional parameter spaces and any complex scalar function that describes wave phenomena involving complicated scattering. In scattering systems specifically, we are often concerned with singularities associated with complex zeros of various functions of the scattering matrix . Some examples are coherent perfect absorption (CPA), reflectionless scattering modes, transmissionless scattering modes, and -matrix exceptional points. Experimentally, we find that all scattering singularities share a universal statistical property: Any quantity that diverges as a simple pole at a singularity, such as at CPA, has a probability distribution function with a power-law tail. The heavy tail of the distribution provides an estimate for the likelihood of finding a given singularity in a generic scattering system. We use these universal statistical results to determine that homogeneous system loss is the most important parameter determining singularity density in a given parameter space of an absorptive scattering system. Finally, we discuss events where distinct singularities coincide in parameter space, which result in higher-order singularities that have applications beyond the capabilities of isolated singularities. These higher-order singularities are not topologically protected, and we do not find universal statistical properties for them. We support our empirical results from microwave experiments with random matrix theory simulations and conclude that the statistical results presented hold for all generic non-Hermitian scattering systems in which singularities can occur.more » « less
-
null (Ed.)This article provides an overview of tensors, their properties, and their applications in statistics. Tensors, also known as multidimensional arrays, are generalizations of matrices to higher orders and are useful data representation architectures. We first review basic tensor concepts and decompositions, and then we elaborate traditional and recent applications of tensors in the fields of recommender systems and imaging analysis. We also illustrate tensors for network data and explore the relations among interacting units in a complex network system. Some canonical tensor computational algorithms and available software libraries are provided for various tensor decompositions. Future research directions, including tensors in deep learning, are also discussed.more » « less
-
Large amounts of multidimensional data represented by multiway arrays or tensors are prevalent in modern applications across various fields such as chemometrics, genomics, physics, psychology, and signal processing. The structural complexity of such data provides vast new opportunities for modeling and analysis, but efficiently extracting information content from them, both statistically and computationally, presents unique and fundamental challenges. Addressing these challenges requires an interdisciplinary approach that brings together tools and insights from statistics, optimization, and numerical linear algebra, among other fields. Despite these hurdles, significant progress has been made in the past decade. This review seeks to examine some of the key advancements and identify common threads among them, under a number of different statistical settings.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Journal Article:
- https://doi.org/10.1002/wics.70029
