Proposes a novel method for detecting novelty in multi-modal data.
problem Challenges in detecting novelty in high-dimensional, multi-modal data.
method Orthogonalized latent space for disentangling features and defining novelty score.
result Proposed method outperforms state-of-the-art algorithms in novelty detection.
Conformal Autoencoders infer intrinsic dimensionality and impose invariance.
problem Detecting intrinsic dimensionality and imposing invariance in nonlinear manifold data.
method Imposing orthogonality conditions on latent variables to infer intrinsic dimensionality and build coordinate invariance.
result The method can infer intrinsic dimensionality and build coordinate invariance on submanifolds.
SOFARI improves inference on multi-task learning latent factors.
problem Challenges in precise inference on multi-task learning latent factor matrices.
method High-dimensional manifold-based Neyman near-orthogonality inference on Stiefel manifold structure.
result Easy-to-use bias-corrected estimators for latent factor vectors and singular values with asymptotic normal distributions.
Geometrically transforms word embeddings into a common space for better comparison.
problem Comparing embeddings from different sources is challenging.
method Applies orthogonal rotations and Mahalanobis scaling to transform embeddings into a shared latent space.
result The method improves word similarity and analogy tasks.
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…
IMA addresses non-identifiability in nonlinear ICA by assuming orthogonal Jacobian columns.
problem Non-identifiability in nonlinear ICA.
method IMA assumes orthogonal Jacobian columns and extends to manifold settings.
result IMA circumvents non-identifiability issues and can be beneficial for higher-dimensional observations.
New differential geometry perspective on orthogonal RNNs.
problem Mitigating exploding and vanishing gradients in RNNs.
method Using tools from differential geometry, parameterizing vector fields via directional derivatives of scalar functions.
result Our approach achieves comparable or better results on benchmark tasks.
We propose an unsupervised object matching method for relational data, which finds matchings between objects in different relational datasets without correspondence information. For example, the proposed method matches documents in different languages in multi-lingual document-word networks without dictionaries nor ali…
New method for clustering tasks with heterogeneous data.
problem Clustered multitask learning with semiparametric and heterogeneous nuisances.
method Adaptive fused orthogonal estimator with Neyman-orthogonal losses and data-driven fusion penalties.
result Achieves exact clustering recovery and pooled parametric convergence rates.
This work improves disentanglement in latent space models without sacrificing generation quality.
problem Trade-off between disentanglement and generation quality in latent space models.
method Manifold optimization with a sum of autoencoder and PCA reconstruction errors, on the Stiefel manifold.
result Improves disentanglement without sacrificing generation quality.
A new model detects anomalies in time series data efficiently.
problem Detect anomalies in high-dimensional time series data.
method r-ssGPFA, an unsupervised online anomaly detection model using state space Gaussian processes.
result The model detects anomalies efficiently and is computationally cheaper.
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.
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.
Unsupervised machine learning helps design complex experiments more efficiently.
problem Designing experiments with many factors and constraints is challenging and costly.
method Applied a beta variational autoencoder (beta-VAE) to represent trials in a low-dimensional latent space.
result Generated pragmatic designs with fewer trials while maintaining objectives.
We propose a penalized orthogonal-components regression (POCRE) for large p small n data. Orthogonal components are sequentially constructed to maximize, upon standardization, their correlation to the response residuals. A new penalization framework, implemented via empirical Bayes thresholding, is presented to effecti…
LeJEPA learns latent variables from nonlinear observations.
problem Learning latent variables from nonlinear observations.
method Proves linear identifiability of Gaussian latent distributions.
result Gaussian distribution uniquely guarantees linear identifiability.
New method reduces PDE model parameters by 30% with sparsity.
problem Redundant parameters in neural network projections.
method Bregman iterations for sparsity, POD compression, bias propagation.
result 30% fewer parameters with similar accuracy.
Optimizes embedding accuracy for data variance and error.
problem Efficiently embedding data while minimizing distortion.
method Uses Johnson-Lindenstrauss embeddings with orthogonal matrices and singular-value latent variables.
result Achieves best accuracy in variance, mean-squared error, and length distortion.
A new method for learning manifolds efficiently using canonical basis functions.
problem Learning manifolds in high-dimensional data with efficient and distinct latent dimensions.
method Proposes a novel optimization objective to enforce a transformation matrix with a few prominent and non-degenerate basis functions.
result Demonstrates that minimizing the off-diagonal manifold metric elements ℓ1-norm results in a more efficient latent space representation. New method estimates latent gene expression factors without overlap with known confounders.
problem Estimating latent variance components in gene expression data with known confounders.
method Restricted maximum-likelihood method maximizing likelihood on orthogonal subspace.
result Method reduces runtime and attains greater likelihood values than gradient-based optimizers.
TANGOS improves neural network performance on tabular data by encouraging neuron specialization.
problem Improving neural network performance on tabular data.
method Gradient orthogonality and specialization of latent units.
result TANGOS leads to improved out-of-sample generalization performance.
Constructs orthogonal coordinates in curved spaces.
problem Separating variables in curved spaces.
method Explicit construction of orthogonal coordinates and transformations.
result Explicit formulas for Killing tensors and Stäckel matrices.
New method for high-dimensional manifold-based inference tackles latent responses.
problem Inference on latent right factor vectors in multi-task learning with large numbers of responses and features.
method SOFARI-R method with two variants: one for strongly orthogonal factors and another for weakly orthogonal factors.
result Bias-corrected estimators for latent right factor vectors with asymptotically normal distributions and justified asymptotic variance estimates.
Method constructs orthogonal curvilinear coordinates in constant curvature spaces.
problem Creating orthogonal coordinates in spaces of constant curvature.
method Modification of Krichever's method for Euclidean space, applied to constant curvature spaces.
result Examples of orthogonal coordinate systems on the sphere and hyperbolic plane constructed.
Scalable approach for high-dimensional dynamical systems with noise filtering and parameter estimation.
problem Noise filtering and parameter estimation for high-dimensional dynamical systems.
method Flexible latent factor model with orthogonal factor loading matrix and closed-form parameter estimation.
result Substantial acceleration and higher accuracy compared to alternatives.
The study extends Jacobi-orthogonality to indefinite scalar product spaces.
problem Generalizing Jacobi-orthogonality to indefinite scalar product spaces.
method Comparing principles, investigating tensor relations, proving properties.
result Every quasi-Clifford tensor is Jacobi-orthogonal; certain tensors are Jacobi-dual or Osserman.
Improves Bayesian optimisation for engineering design problems with many variables.
problem Efficiently searching for global minima in high-dimensional design spaces.
method Integrates input and output data to identify a reduced latent subspace using probabilistic partial least squares.
result Significant improvements in convergence to the global minimum compared to existing methods.
The paper tackles causal disentanglement with linear models and interventions.
problem Identify latent variables in a causal model from observed data.
method Use linear transformations and interventions to uniquely identify latent variables.
result A single intervention on each latent variable is sufficient for identifying the latent causal model.
The paper tackles extrapolation of gene knockouts effects on RNA counts.
problem Modeling effects of gene knockouts on RNA counts for new perturbations.
method Formulated as a latent variable model with additive perturbation effects, proved identifiability, proposed PDAE for estimation.
result PDAE can accurately predict effects of unseen but identifiable perturbations.
EbC learns equivariant embeddings from unlabeled group actions.
problem Learning equivariant embeddings from unlabeled group actions.
method Equivariance by Contrast (EbC) method to learn equivariant embeddings from observation pairs (y,g⋅y). result High-fidelity equivariance in latent space for diverse groups.
Modified Wasserstein metric for Gaussian distributions, invariant to isometries.
problem Distance measurement for latent Gaussian distributions invariant to isometries.
method Modified Benamou-Brenier approach leading to a Procrustes Wasserstein metric.
result For Gaussian distributions, the metric reduces to Euclidean distance between eigenvalues.
Recently there has been an increased interest in unsupervised learning of disentangled representations using the Variational Autoencoder (VAE) framework. Most of the existing work has focused largely on modifying the variational cost function to achieve this goal. We first show that these modifications, e.g. beta-VAE, …
A notion of orthogonality in multisymplectic geometry has been developed by Cantrijn, Ibort and de León and used by many authors. In this paper, we review this concept and propose a new type of orthogonality in multisymplectic geometry; we prove a number of results regarding this orthogonality and its associated subspa…
New method better identifies irrelevant variables for more accurate treatment effect estimation.
problem Handling irrelevant variables in treatment effect estimation with deep disentanglement.
method Deep embedding method to disentangle pre-treatment variables, explicitly identify and represent irrelevant variables, and orthogonalize them.
result Better identification and representation of irrelevant variables lead to more precise treatment effect prediction.
New measures on orbit spaces for orthogonal groups identified.
problem Characterizing measures on orbit spaces of orthogonal groups.
method Constructing Hilbert measures on orbit spaces of coregular representations of orthogonal groups.
result Hilbert measures have singularities if and only if the number of copies equals the dimension.
The space Z of leftinvariant orthogonal almost complex structures, keeping the orientation, on 6-dimensional Lie groups is researched. To get explicit view of this space elements the isomorphism of Z and CP3 is used. The explicit formula for arbitrary leftinvariant orthogonal almost …
New model handles complex output dependence in large datasets.
problem Complex output dependence in large datasets.
method Orthogonal Stochastic Linear Mixing Model (OSLMM) with Markov chain Monte Carlo inference.
result OSLMM reduces prediction error compared to state-of-the-art methods.
Paper links set derivatives to its orthogonal projections.
problem Understanding the relationship between set derivatives and projections.
method Derives equations from topological link between Minkowski functional partial derivatives and set boundary.
result System of equations for orthogonal projections derived.
Proposes EOT eigenmaps for aligning and embedding multiple datasets.
problem Aligning and embedding multiple datasets with shared structures but individual distortions.
method Entropic Optimal Transport (EOT) eigenmaps, leveraging leading singular vectors of EOT plan matrix.
result Proves theoretical guarantees and favorable properties for aligning and embedding datasets.
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…
New findings on Kähler manifolds restrict orthogonal coordinates existence.
problem Existence of orthogonal coordinates on Kähler manifolds.
method Algebraic and geometric techniques applied to Kähler manifolds.
result No nontrivial self-dual Kähler 4-manifolds or Ricci-flat Kähler 4-manifolds support orthogonal coordinates.
The Variational Autoencoder (VAE) is a powerful architecture capable of representation learning and generative modeling. When it comes to learning interpretable (disentangled) representations, VAE and its variants show unparalleled performance. However, the reasons for this are unclear, since a very particular alignmen…
This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which exploits a certain tensor structure in their low-order observable moments (typically…
The purpose of this note is to study the complex structures orthogonal to a given Riemannian metric. For another paper on this topic, we highly recommend the work of Salamon. His work describes in great detail the role that curvature plays in this question. We instead focus on torsion, which lends itself to somewhat di…
A Clifford algebra model for M"obius geometry is presented. The notion of Ribaucour pairs of orthogonal systems in arbitrary dimensions is introduced, and the structure equations for adapted frames are derived. These equations are discretized and the geometry of the occuring discrete nets and sphere congruences is disc…
In this paper, we study helices and the Bertrand curves. We obtain some of the classification results of these curves with respect to the modified orthogonal frame in Euclidean 3-spaces.
Develops MENT for interpreting and detecting changes in network trajectories.
problem Distortion of network geometry and invalidation of temporal comparisons in dynamic network analysis.
method Develops Multiscale Euclidean Network Trajectories (MENT) framework based on second-moment geometry.
result Validates and interprets network trajectories through isotropic normalization and orthogonal transformations.
In this paper, we investigate Mannheim pairs, Frenet-Mannheim curves and Weakened Mannheim curves with respect to the modified orthogonal frame in Euclidean 3-space(E 3 ). We obtain some characterizations of these curves.