Decomposing tensors into orthogonal factors is a well-known task in statistics, machine learning, and signal processing. We study orthogonal outer product decompositions where the factors in the summands in the decomposition are required to be orthogonal across summands, by relating this orthogonal decomposition to the…
Proposes FOAGP for efficient orthogonal effect decomposition of black-box computer experiments.
problem Challenges in sensitivity analysis of black-box computer experiments with complex, nonlinear functional outputs.
method Functional-output orthogonal additive Gaussian process (FOAGP) with conditional orthogonality constraint.
result Demonstrates effectiveness in orthogonal effect decomposition and variance decomposition through simulations and real-world application.
New method evaluates feature interactions using orthogonal variance decomposition.
problem Feature selection fails to account for interactions between features.
method Orthogonal variance decomposition to evaluate feature subsets considering interactions.
result Our method accurately identifies relevant features and improves model accuracy.
The paper explores geometric decompositions for Ricci tensors and their applications.
problem Understanding Ricci tensors on compact Riemannian manifolds.
method Utilizes Berger-Ebin and York L2-orthogonal decompositions. result New insights into Ricci almost solitons and harmonic maps.
We construct a decomposition of the identity operator on a Riemannian manifold M as a sum of smooth orthogonal projections subordinate to an open cover of M. This extends a decomposition of the real line by smooth orthogonal projection due to Coifman, Meyer and Auscher, Weiss, Wickerhauser, and a similar decomposit…
PROD method improves high-dimensional regression by handling strong correlations.
problem Violation of Irrepresentable Condition in LASSO for high-dimensional data.
method PROD procedure based on orthogonal decomposition of design matrix.
result PROD enhances performance of high-dimensional penalized regression.
The paper extends orthogonal decomposition results to hermitian Higgs bundles.
problem Classical propositions on holomorphic vector bundles do not always extend to Higgs bundles.
method The approach involves extending propositions on orthogonal decompositions and the second fundamental form to hermitian Higgs bundles.
result Extended propositions concerning orthogonal decompositions and the second fundamental form have applications in Higgs bundles.
TreeHFD algorithm explains tree ensemble models through hierarchical orthogonality.
problem Difficulty in explaining black-box tree ensemble models.
method TreeHFD algorithm using hierarchical orthogonality constraints.
result TreeHFD estimates Hoeffding decomposition from data samples.
The paper shows how gradient flow on over-parametrized tensor decomposition behaves like deflation.
problem Understanding the training dynamics of gradient flow on tensor decomposition.
method Empirical observation and mathematical proof of gradient flow dynamics for orthogonally decomposable tensors.
result Gradient flow dynamics for orthogonally decomposable tensors follows a tensor deflation process, recovering all tensor components.
Optimizing over the set of orthogonal matrices is a central component in problems like sparse-PCA or tensor decomposition. Unfortunately, such optimization is hard since simple operations on orthogonal matrices easily break orthogonality, and correcting orthogonality usually costs a large amount of computation. Here we…
We present an algorithm for the decomposition of periodic financial return data into orthogonal factors of expected return and "systemic", "productive", and "nonproductive" risk. Generally, when the number of funds does not exceed the number of periods, the expected return of a portfolio is an affine function of its pr…
New algorithms improve tensor CP decomposition under mild conditions.
problem Improving tensor CP decomposition with theoretical guarantees under mild incoherence conditions.
method Composite PCA and Concurrent Orthogonalization algorithms.
result Theoretical guarantees and practical superiority over existing methods.
New scalable GP approximation using Fourier series decomposition.
problem Scalability and accuracy in Gaussian process approximations.
method Harmonic kernel decomposition (HKD) to decompose kernels orthogonally.
result Significantly outperforms standard variational methods in scalability and accuracy.
Paper proposes ONTD for nonnegative tensor data.
problem Handling nonnegative tensor data efficiently.
method Orthogonal Nonnegative Tucker Decomposition (ONTD) with convex relaxation algorithm.
result Demonstrates effectiveness on real-world image data applications.
Study optimizes estimation of orthogonal and rotation matrices from noisy data.
problem Estimating orthogonal and rotation matrices from noisy data.
method Iterative polar decomposition algorithm initialized by spectral methods.
result Algorithm achieves optimal error rate of $(1+o(1)) rac{σ^2 d(d-1)}{2np}$.
TGCCA analyzes higher-order tensors using orthogonal rank-R CP decomposition.
problem Handling higher-order structures in multi-block data analysis.
method Tensor Generalized Canonical Correlation Analysis (TGCCA) with orthogonal rank-R CP decomposition.
result TGCCA outperforms state-of-the-art methods on simulated and real data.
A new method improves maximum inner product search by locally decomposing residual vectors.
problem Maximum inner product search efficiency and accuracy.
method Local Orthogonal Decomposition (LOD) combined with multiscale quantization.
result LOD consistently achieves higher recall than previous methods under the same bitrates.
Paper uses sparse learning to estimate quasi-potential and drift components in stochastic systems.
problem Estimating quasi-potential and drift components in stochastic systems.
method Sparse identification of non-linear dynamics (SINDy) combined with action minimization methods.
result Evaluation of quasi-potential landscape from a single trajectory.
We present an algebraic investigation of generalized and equiaffine curvature tensors in a given pseudo-Euclidean vector space and study different orthogonal, irreducible decompositions in analogy to the known decomposition of algebraic curvature tensors. We apply the decomposition results to characterize geometric pro…
Proposes a new RNN structure to improve expressivity without sacrificing stability.
problem Exploding and vanishing gradient problems in RNNs and reduced expressivity.
method Introduces a non-normal RNN structure using Schur decomposition and splitting.
result Enhances expressivity while maintaining stability and training speed.
We orthogonalize the NSS model to condition and diagnose its ill-conditioned parameters.
problem The ill-conditioning of the NSS model's design matrix.
method Exact orthogonal reparametrization via QR decomposition.
result Orthogonalization isolates the conditioning structure and maintains fit uncertainty.
We provide a unified view of additive explanations for dependent inputs.
problem Challenges in obtaining a tractable representation and estimating the decomposition for dependent inputs.
method Combining Hilbert space methods with generalized functional ANOVA, we build an explicit decomposition Riesz Basis.
result Proposed a simple yet powerful algorithm to estimate the decomposition from data.
Enhances Gaussian processes with spherical features for better scalability and flexibility.
problem Lack of representation learning in Gaussian processes compared to deep neural networks.
method Introduces spherical inter-domain features to improve GP approximation and scalability.
result The method alleviates limitations and improves scalability compared to alternative strategies.
Paper proves rigidity of spherical ring patterns on surfaces.
problem Proving rigidity of spherical orthogonal ring patterns on closed surfaces.
method Modification of combinatorial total geodesic curvature and variational principles.
result Rigidity of spherical orthogonal ring patterns on closed surfaces proved.
It is well known that the curvature tensor of a pseudo-Riemannian manifold can be decomposed with respect to the pseudo-orthogonal group into the sum of the Weyl conformal curvature tensor, the traceless part of the Ricci tensor and of the scalar curvature. A similar decomposition with respect to the pseudo-unitary gro…
Algorithm D4 decomposes data into useful and orthogonal components.
problem Data representation and task-specific information.
method Decision-Directed Data Decomposition (D4) algorithm.
result Improves predictive generalization and debiasing in word embeddings.
Revisits CP tensor decomposition for noisy, non-orthogonal data.
problem Statistical optimality and convergence of ALS in noisy, non-orthogonal, higher-rank settings.
method Statistical analysis and TASD method for initialization.
result ALS with TASD achieves optimal error in rank-one setting within one or two iterations.
We analyze stochastic gradient descent for optimizing non-convex functions. In many cases for non-convex functions the goal is to find a reasonable local minimum, and the main concern is that gradient updates are trapped in saddle points. In this paper we identify strict saddle property for non-convex problem that allo…
Tensor CANDECOMP/PARAFAC (CP) decomposition is an important tool that solves a wide class of machine learning problems. Existing popular approaches recover components one by one, not necessarily in the order of larger components first. Recently developed simultaneous power method obtains only a high probability recover…
The Temperley-Lieb algebra is a fundamental component of SU(2) topological quantum field theories. We construct chain complexes corresponding to minimal idempotents in the Temperley-Lieb algebra. Our results apply to the framework which determines Khovanov homology. Consequences of our work include semi-orthogonal deco…
Many modern big data applications feature large scale in both numbers of responses and predictors. Better statistical efficiency and scientific insights can be enabled by understanding the large-scale response-predictor association network structures via layers of sparse latent factors ranked by importance. Yet sparsit…
The paper proposes and discusses semiorthogonal decompositions for moduli spaces of vector bundles.
problem Decompositions of moduli spaces of vector bundles with fixed determinant of odd degree.
method Semiorthogonal decompositions, Grothendieck ring of varieties, mirror symmetry, graph potentials, Fukaya category.
result Evidence for a conjectural semiorthogonal decomposition of moduli spaces of rank 2 bundles with odd determinant.
The paper decomposes spacelike hypersurface properties for general relativistic vacuum equations.
problem Analyzing properties of spacelike hypersurfaces in general relativity.
method Used L2-orthogonal decomposition and Ahlfors Laplacian. result Decomposed the second fundamental form of spacelike hypersurfaces.
New algorithms solve tensor problems with random components using SDP.
problem Exact tensor nuclear norm, decomposition, and completion for random tensors.
method Degree-4 Sum of Squares (SOS) semidefinite programs.
result Exact solutions for tensor nuclear norm, decomposition, and completion with random asymmetric components.
Corrected whitening restores orthogonality in high-dimensional spherical Gaussian mixtures.
problem In high-dimensional data, standard whitening fails to preserve orthogonality of mixture means.
method Derived exact limits for whitened means dot products using random matrix theory, constructed a corrected whitening matrix.
result Corrected whitening allows for improved estimation of spherical Gaussian mixtures in the large-dimensional regime.
The paper characterizes harmonic maps and studies their properties on Riemannian manifolds.
problem Characterizing and analyzing harmonic maps between Riemannian manifolds.
method Analytic and geometric methods, including L2-orthogonal decomposition and energy density analysis.
result A criterion for harmonic submersions and diffeomorphisms, and new results linking harmonic symmetric bilinear forms and metrics.
We study algebraic structures (L∞ and A∞-algebras) introduced by Gaiotto, Moore and Witten in their recent work devoted to certain supersymmetric 2-dimensional massive field theories. We show that such structures can be systematically produced in any number of dimensions by using the geometry of seconda…
The main result is the identification of the orthogonal complement of the subalgebra of conformal vector field inside the algebra of all vector fields of a compact flat 2-manifold. As a fundamental tool, the complete Hodge decomposition for manifold with boundary is used. The identification allows the derivation of gov…
Non-orthogonal joint diagonalization (NJD) free of prewhitening has been widely studied in the context of blind source separation (BSS) and array signal processing, etc. However, NJD is used to retrieve the jointly diagonalizable structure for a single set of target matrices which are mostly formulized with a single da…
Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.
problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.
This work is devoted to elaboration on the idea to use block term decomposition for group data analysis and to raise the possibility of modelling group activity with (Lr, 1) and Tucker blocks. A new generalization of block tensor decomposition was considered in application to group data analysis. Suggested approach was…
Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal's uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlik…
AuON is a linear-time optimizer that improves upon Muon's performance without approximate orthogonal matrices.
problem High memory and computational costs of orthogonal momentum updates.
method AuON uses normalized nonlinear scaling and a 'emergency brake' to handle exploding attention logits.
result AuON achieves strong performance without approximate orthogonal matrices, preserving structural alignment and reconditioning.
Proposes MVGPR for spatiotemporal data modal analysis.
problem Sparse and irregularly sampled data in complex flows.
method Multivariate Gaussian process regression (MVGPR) with kernel design.
result MVGPR outperforms DMD and SPOD in modal analysis of sparse and irregular data.
The paper introduces polarizations in symplectic and orthogonal settings.
problem Understanding polarizations in symplectic and orthogonal contexts.
method Exposition of symplectic and orthogonal polarizations, emphasizing symmetry.
result Grassmannians of polarizations in symplectic and orthogonal settings.
New method preserves topology in Hodge decomposition for scalar and vector fields.
problem Topology-preserving Hodge decomposition on manifolds with boundaries.
method Comprehensive 5-component decomposition in Eulerian representation.
result Effective numerical experiments validate the method's accuracy and orthogonality.
D-GCCA improves multi-view data analysis by separating common and distinctive components.
problem Analyzing multi-view high-dimensional data with latent factors.
method Decomposes each view's data matrix into common and distinctive sources with orthogonality constraints.
result Consistent estimators with good performance and efficient computation.
Spectral method for joint community detection and group synchronization.
problem Jointly detecting communities and synchronizing orthogonal groups in graphs.
method Spectral decomposition followed by CPQR factorization.
result Near-optimal guarantees for exact and stable recovery of cluster memberships and orthogonal transforms.