Study invariant operations on Fedosov manifolds.
problem None explicitly stated in the abstract.
method Analysis of tensor-valued operations on Fedosov manifolds.
result Spaces of homogeneous natural tensors are finite dimensional linear representations of the symplectic group.
New method tackles tensor regression with robust Kaczmarz approach.
problem Reconstructing tensor signals from corrupted measurements.
method Quantile-based randomized Kaczmarz method for tensor linear systems.
result Improved convergence and robustness to adversarial corruptions.
Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we consider a novel class of matrix and tensor-valued features, which can be pre-trained using unlabeled samples. We present efficient algorithms f…
Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we consider a novel class of matrix and tensor-valued features, which can be pre-trained using unlabeled samples. We present efficient algorithms f…
tvGP-VAE models tensor-valued latent variables with Gaussian processes for better data structure representation.
problem Agnostic latent variables in VAEs ignore data structure correlations.
method Proposes tensor-variate Gaussian process prior for variational autoencoder.
result Explicitly modeling correlation structures improves model performance in reconstruction.
New algorithm detects tensor dependence structure alterations efficiently.
problem Detecting alterations in tensor dependence structures.
method Tensor-normal distributions, decorrelation, centralization, SERA (Sparsity-Exploited Reranking Algorithm).
result The proposed SERA algorithm controls false discovery rates effectively.
Efficiently analyzes multidimensional functional data using separable basis functions.
problem Curse of dimensionality in traditional functional data analysis.
method Marginal product basis systems for multidimensional data, tensor decomposition, differential operator-based penalties.
result Efficient estimation of multidimensional functional data representations.
In this paper, we consider the tensor completion problem representing the solution in the tensor train (TT) format. It is assumed that tensor is high-dimensional, and tensor values are generated by an unknown smooth function. The assumption allows us to develop an efficient initialization scheme based on Gaussian Proce…
Global fixed income returns span across multiple maturities and economies, that is, they naturally reside on multi-dimensional data structures referred to as tensors. In contrast to standard "flat-view" multivariate models that are agnostic to data structure and only describe linear pairwise relationships, we introduce…
This paper introduces the Sylvester graphical lasso (SyGlasso) that captures multiway dependencies present in tensor-valued data. The model is based on the Sylvester equation that defines a generative model. The proposed model complements the tensor graphical lasso (Greenewald et al., 2019) that imposes a Kronecker sum…
We present a novel neural network algorithm, the Tensor Switching (TS) network, which generalizes the Rectified Linear Unit (ReLU) nonlinearity to tensor-valued hidden units. The TS network copies its entire input vector to different locations in an expanded representation, with the location determined by its hidden un…
We define and study the harmonic heat flow for almost complex structures which are compatible with a Riemannian structure (M,g). This is a tensor-valued version of harmonic map heat flow. We prove that if the initial almost complex structure J has small energy (depending on the norm ∣∇J∣), then the flow ex…
Unified framework for non-negative matrices and tensors using Wasserstein loss.
problem Finding low-dimensional representations of high-dimensional datasets with non-negative constraints.
method Unified mathematical framework with a smoothed Wasserstein loss, convex dual formulation for efficient computation.
result Efficient solution for non-negative matrix and tensor factorisations with Wasserstein loss.
A novel method for common and individual feature analysis from exceedingly large-scale data is proposed, in order to ensure the tractability of both the computation and storage and thus mitigate the curse of dimensionality, a major bottleneck in modern data science. This is achieved by making use of the inherent redund…
New model improves portfolio selection by analyzing tensor data.
problem Improving portfolio selection through better analysis of style returns.
method Introducing a tensor dynamic conditional correlation (TDCC) model with trace-normalization and dimension-normalization.
result The TDCC model enhances portfolio selection across multiple markets.
Model projection transfers convolutional network properties to feedforward networks.
problem Transferring properties between feedforward and convolutional networks.
method Unified node-level framework with tensor-valued activations, model projection.
result Projected CNN nodes inherit GFFN-style trainable structure.
Two methods preserve tensor structure for reduced dimensionality in tensor regression.
problem Reducing dimensionality of tensor predictors for improved interpretation and accuracy.
method Developed two tensor dimension reduction methods using Tucker and CP decompositions.
result Substantial improvement in accuracy over existing methods in simulations and applications.
Improved image learning using elliptically contoured tensor-variate distributions.
problem Inadequate statistical analysis for tensor-valued data, especially with heavier or lighter tails.
method Developed a family of elliptically contoured tensor-variate distributions and derived their properties and procedures for estimation.
result Tensor-variate classification rules and tensor-on-tensor regression better predict and characterize data than TVN-based methods.
Improved tensor GLM estimation for complex data.
problem Complex tensor data in GLMs leads to high-dimensional, ill-posed estimation.
method Proposed LSRTR-M algorithm using Muon updates for faster convergence and lower errors.
result LSRTR-M converges faster and achieves lower errors than LSRTR.
A new diffusion model generates structured tensors for high-dimensional data.
problem Generating a structured tensor with a target distribution.
method Tucker diffusion model with Tucker-Unet architecture.
result Generated tensors converge to the true data distribution at a rate dependent on tensor mode dimensions.
We consider the estimation and inference of graphical models that characterize the dependency structure of high-dimensional tensor-valued data. To facilitate the estimation of the precision matrix corresponding to each way of the tensor, we assume the data follow a tensor normal distribution whose covariance has a Kron…
In many applications, such as classification of images or videos, it is of interest to develop a framework for tensor data instead of an ad-hoc way of transforming data to vectors due to the computational and under-sampling issues. In this paper, we study convergence and statistical properties of two-dimensional canoni…
Proposes a nonparametric tensor factorization for sparse data.
problem Handling sparse tensor data with structural and interpretability benefits.
method Hierarchical Gamma processes and Poisson random measures for tensor-valued process, Dirichlet processes for sampling entry indices, Gaussian processes for values.
result Demonstrates superior performance on benchmark datasets.
New algorithm learns interpretable CP-basis from streaming tensor data under Markovian constraints.
problem Learning interpretable CP-basis from streaming tensor data under Markovian constraints.
method Online Tensor Factorization (OTF) with CANDECOMP/PARAFAC (CP) decomposition, proving convergence to stationary points.
result Algorithm converges almost surely to stationary points of the objective function under Markovian data generation.
Dual-Channel Tensor Neural Network (DC-TNN) decomposes tensor data into low-rank and sparse components for better estimation and inference.
problem Tensor-valued data with multilinear dependencies are challenging to process due to loss of multiway geometry under vectorization.
method DC-TNN decomposes tensors into a low-rank core and a sparse refinement, processing them through coupled neural channels.
result Established non-asymptotic risk bounds and developed structure-aware conformal ROC and AUC confidence bands.
This paper completes the construction of arbitrary order conformally invariant differential operators in higher spin spaces. Jan Slovák has classified all conformally invariant differential operators on locally conformally flat manifolds. We complete his results in higher spin theory by giving explicit expressions for …
The paper connects eigenvalue problems for various operators and establishes inequalities and asymptotic formulas for heat traces.
problem Eigenvalue problems and heat trace asymptotics for different operators.
method Establishes connections and inequalities for eigenvalues and heat traces.
result Eigenvalue inequalities and three-term asymptotic formulas for heat traces of various operators.
Introduces a new elliptic operator with positive eigenvalue.
problem None explicitly stated in the abstract.
method Introduces a new elliptic operator called the two-radical Laplace operator.
result The eigenvalue of the new operator is the positive square root of the Laplace operator's eigenvalue.
Proves Kato inequalities for various conformal operators.
problem Proving inequalities for differential operators.
method Analyzes a class of first order differential operators, including Dirac and Penrose twistor operators.
result Derives Kato inequalities that interpolate between classical and refined versions.
We describe a set of conformally covariant boundary operators associated to the Paneitz operator, in the sense that they give rise to a conformally covariant energy functional for the Paneitz operator on a compact Riemannian manifold with boundary. These operators naturally give rise to a first- and third-order conform…
Study on biharmonic hypersurfaces with specific recurrent operators in Euclidean space.
problem Characterizing biharmonic hypersurfaces with recurrent operators.
method Analysis of various recurrent operators and their impact on biharmonic hypersurfaces.
result Some well-known recurrent operators play a significant role in making biharmonic hypersurfaces minimal.
Local index theorem for chiral geometric operators proved using heat kernel.
problem Proving a local index theorem for geometric first-order differential operators.
method Using Gilkey's invariance theory and heat kernel techniques.
result Supertrace of heat kernel converges to Chern-Weil form.
Study estimates eigenvalues for concave Hessian operators on convex domains.
problem Estimating eigenvalues for concave elliptic Hessian operators.
method Investigates Dirichlet eigenvalue problem for a broad class of concave elliptic Hessian operators.
result Existence and properties of the first nonzero eigenvalue and eigenfunction.
The paper proves homotopy equivalences for spaces of unbounded Fredholm operators.
problem Spaces of unbounded Fredholm operators and their properties.
method Analyzing the spaces and proving homotopy equivalences.
result Natural maps between four spaces of unbounded Fredholm operators are homotopy equivalences.
GJMS operators connect geometry, analysis, and physics.
problem None explicitly stated; focus on operators and their impact.
method Construction of conformally invariant differential operators.
result GJMS operators have significant impact in geometry, analysis, and physics.
Extends Calabi operator to Riemannian locally symmetric spaces.
problem Local integrability conditions on Riemannian locally symmetric spaces.
method Generalizes Calabi operator to Riemannian locally symmetric spaces.
result Generalised operator works in irreducible case and fails in products.
New spectral torsion defined for rescaled Dirac operators.
problem Defining spectral torsion for rescaled Dirac operators.
method Using three vector fields and noncommutative residue.
result Computed spectral torsion for one form rescaled Dirac operators.
Proves formal self-adjointness of certain differential operators.
problem Verifying conjectures about differential operators.
method Proving formal self-adjointness through mathematical proof.
result Proves two conjectures about differential operators.
Researchers create new operators from Riemannian invariants.
problem Developing new mathematical tools for Riemannian geometry.
method Introducing formally self-adjoint conformally covariant polydifferential operators.
result Found a fourth-order, conformally covariant tridifferential operator.
The paper proves new theorems about specific types of operator perturbations.
problem Analyzing conformal perturbations of Dirac and signature operators.
method Developed Kastler-Kalau-Walze type theorems for specific operator types.
result Established new theorems for six-dimensional manifolds with boundary.
Study of Dirac-like operators on spin manifolds with large mass parameters.
problem Understanding spectra of Dirac-like operators with piecewise constant mass terms.
method Analysis of asymptotic regimes to derive effective operators.
result Extension of MIT Bag operator concept to spin geometry.
Study essential spectrum of differential operators on geometrically finite orbifolds.
problem Analyzing the essential spectrum of differential operators over specific geometric structures.
method Investigates first order and Laplace type elliptic differential operators on Riemannian vector bundles over geometrically finite orbifolds.
result Discovers properties of essential spectra for these operators.
The study proves inequalities for complex operators on curved spaces.
problem Establishing inequalities for nonlocal operators on curved spaces.
method Defining and analyzing nonlocal Pucci operators on manifolds with nonnegative sectional curvatures, proving Harnack inequalities and Holder estimates.
result Harnack inequalities and Holder estimates for nonlocal operators on manifolds with nonnegative sectional curvatures.
Study on opers over complex manifolds of dimension one.
problem Investigating opers over complex manifolds of dimension one.
method Introducing relative opers and differential operators, analyzing their equivalence.
result Bijective correspondence between relative opers and differential operators.
Mixtures of neural operators reduce active complexity in operator learning.
problem Reduction of active complexity in operator learning models.
method Constructive comparison between routed mixtures of neural operators (MoNOs) and a fixed single-neural-operator construction.
result Every scalar uniformly continuous nonlinear operator can be approximated by a MoNO whose active expert has smaller depth, width, and rank scaling.
Formula for Hadamard coefficients from Green's operators on spacetimes.
problem Calculating Hadamard coefficients from Green's operators on spacetimes.
method Developed formulas for diagonal values and integrals over the diagonal of Hadamard coefficients.
result Formulated analogues of Hadamard expansions and resolvents for Green's operators.
Study perturbs Dirac operators in any dimension, focusing on Majorana fermions.
problem Understanding perturbations of Dirac operators in various dimensions.
method Analyzes canonical perturbations of Dirac operators on Hermitian Clifford modules.
result Characterizes the low-energy spectrum of these operators on complete surfaces.
Identifies Lorentzian locally symmetric spaces where Calabi operator suffices to determine Killing operator range.
problem Determining when the Calabi operator can identify the range of the Killing operator in Lorentzian locally symmetric spaces.
method Developed criteria for a connection to be in the range of a connection, applied to the Killing connection.
result For indecomposable spaces, the Calabi operator suffices to identify the range of the Killing operator; for products, it fails.