Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

53105158210 · Jun 202019922001200920172026
48 results for principal variations

A new dynamical formulation of log-PCA captures local principal modes of geodesic variations.

problem Learning principal variations of random probability measures under Wasserstein geometry.
method Introducing a new dynamical formulation of log-PCA as a variational approach.
result Deriving a general statistical convergence rate for empirical WT-PCA.

Study nonholonomic systems with collisions using variational principles.

problem Variational problems on nonholonomic systems with collisions.
method Extended variational principle, introduced connection on principal bundles, applied Lagrange–Poincaré–Pontryagin reduction.
result Implicit Lagrange–d'Alembert–Pontryagin equations for nonholonomic systems with collisions.

We consider a contracting problem in which a principal hires an agent to manage a risky project. When the agent chooses volatility components of the output process and the principal observes the output continuously, the principal can compute the quadratic variation of the output, but not the individual components. This…

2014-06-23abs ↗pdf ↗

We introduce a new convex formulation for stable principal component pursuit (SPCP) to decompose noisy signals into low-rank and sparse representations. For numerical solutions of our SPCP formulation, we first develop a convex variational framework and then accelerate it with quasi-Newton methods. We show, via synthet…

2014-06-04abs ↗pdf ↗

The paper presents new formulations of gauge and gravity theories using dynamical principal bundles.

problem Formulating gauge and gravity theories with a flexible principal bundle structure.
method Original variational formulations of Yang-Mills, Einstein's gravitation, and Kaluza-Klein theories with a dynamical principal bundle.
result The principal bundle structure and connection emerge from the dynamics, leading to solutions of Yang-Mills, Einstein-Cartan, or Yang-Mills-Einstein equations.

When a gauge-natural invariant variational principle is assigned, to determine {\em canonical} covariant conservation laws, the vertical part of gauge-natural lifts of infinitesimal principal automorphisms -- defining infinitesimal variations of sections of gauge-natural bundles -- must satisfy generalized Jacobi equat…

2004-06-04abs ↗pdf ↗

A reductive structure is associated here with Lagrangian canonically defined conserved quantities on gauge-natural bundles. Parametrized transformations defined by the gauge-natural lift of infinitesimal principal automorphisms induce a variational sequence such that the generalized Jacobi morphism is naturally self-ad…

2007-12-06abs ↗pdf ↗

Survey of factor analysis, PCA, variational inference, and VAE.

problem Dimensionality reduction and generative modeling of data.
method Variational inference, factor analysis, probabilistic PCA, and VAE.
result Derivation and explanation of ELBO, EM, and closed-form solutions.

In this document we are going to derive the equations needed to implement a Variational Bayes i-vector extractor. This can be used to extract longer i-vectors reducing the risk of overfittig or to adapt an i-vector extractor from a database to another with scarce development data. This work is based on Patrick Kenny's …

2015-11-20abs ↗pdf ↗

Develops statistical framework for analyzing functional data extremes.

problem Analyzing extremes of functional data in Hilbert spaces.
method Regular variation in Hilbert spaces, Peaks-Over-Threshold framework, functional PCA.
result Proposes a dimension reduction method for functional extreme observations.

A new method improves target selection for manipulating complex systems like the brain.

problem Improper incorporation of low-variance outcomes into latent space of predictive models.
method Developed a novel objective based on supervised variational autoencoders (SVAEs) for PPCA (Probabilistic Principal Component Analysis).
result gPCR (Generative Principal Component Regression) dramatically improves target selection in manipulation compared to standard PCR and SVAEs.

In this work, we develop a novel principal component analysis (PCA) for semimartingales by introducing a suitable spectral analysis for the quadratic variation operator. Motivated by high-dimensional complex systems typically found in interest rate markets, we investigate correlation in high-dimensional high-frequency …

2015-03-19abs ↗pdf ↗

Bayesian SPCA method tackles orthogonality constraint with spike and slab prior.

problem Bayesian SPCA method for high-dimensional data with orthogonality constraint.
method Parameter-expanded coordinate ascent variational inference (PX-CAVI) with spike and slab prior.
result PX-CAVI algorithm outperforms existing SPCA approaches in performance.

Study explores K-means clustering of variables and its relation to PCA.

problem Exploring the relationship between K-means clustering of variables and PCA.
method Apply PCA to original data and K-means to transposed data, quantify variable contributions to principal components.
result Identifies how variable clusters contribute to principal components identified by PCA.

We study the existence and properties of metrics maximising the first Laplace eigenvalue among conformal metrics of unit volume on Riemannian surfaces. We describe a general approach to this problem and its higher eigenvalue versions via the direct method of calculus of variations. The principal results include the gen…

2011-03-12abs ↗pdf ↗

We classify all rotational surfaces in Euclidean space whose principal curvatures κ1κ_1 and κ2κ_2 satisfy the linear relation κ1=aκ2+bκ_1=aκ_2+b, where aa and bb are two constants. We give a variational characterization of these surfaces in terms of its generating curve. As a consequence of our classification, we find clos…

2018-08-22abs ↗pdf ↗

Regularized MFPCA smooths multivariate functional data for clearer patterns.

problem Challenges in controlling roughness of multivariate functional PCs.
method ReMFPCA incorporates a roughness penalty in a penalized framework to smooth PCs.
result Smoothed multivariate functional PCs reveal clearer patterns.

This paper develops GPCA for probability distributions using Otto-Wasserstein geometry.

problem Analyzing modes of variation in datasets of probability measures.
method Geodesic Principal Component Analysis (GPCA) on Wasserstein space with neural networks.
result Identification of geodesic curves that capture modes of variation in probability distributions.

Unified method to compute Laplace spectra on homogeneous principal bundles.

problem Computing the Laplace-Beltrami spectrum on homogeneous principal bundles.
method Unified representation-theoretic approach using generalized canonical variations and spectral branching criterion.
result Explicit formulas for the full spectra of several geometric families.

Polynomial chaos expansions on Grassmannian submanifolds for high-dimensional stochastic systems.

problem Uncertainty quantification in high-dimensional stochastic systems.
method Principal Geodesic Analysis on the Grassmann manifold, adaptive algorithm for local submanifolds, polynomial chaos expansion.
result Efficient surrogate modeling of system behavior across different parameter spaces.

Improves variational inference for sparse models using mixtures of exponential families.

problem Intractability of posterior distributions in Bayesian sparse models.
method Flexible mean field variational inference using mixtures of non-overlapping exponential families.
result Mixtures of exponential families with non-overlapping support form an exponential family, enabling analytical updates.

Paper develops efficient AltMin algorithm for SRPCP robust matrix recovery.

problem SRPCP model robust matrix recovery with universal penalty parameter.
method Tuning-free alternating minimization (AltMin) algorithm with closed-form subproblems.
result Efficient AltMin algorithm confirms robustness and efficiency.

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.

The paper studies constant mean curvature hypersurfaces in Finsler manifolds.

problem Understanding geometric properties of hypersurfaces in Finsler manifolds.
method Using volume preserving variation and homothetic navigation.
result Deduced a Heintze-Karcher type inequality and proved an Alexandrov type theorem.

We study sparse principal components analysis in high dimensions, where pp (the number of variables) can be much larger than nn (the number of observations), and analyze the problem of estimating the subspace spanned by the principal eigenvectors of the population covariance matrix. We introduce two complementary not…

2012-11-02abs ↗pdf ↗

In the recent years, Riemannian shape analysis of curves and surfaces has found several applications in medical image analysis. In this paper we present a numerical discretization of second order Sobolev metrics on the space of regular curves in Euclidean space. This class of metrics has several desirable mathematical …

2015-06-29abs ↗pdf ↗

The literature provides strong evidence that stock prices can be predicted from past price data. Principal component analysis (PCA) is a widely used mathematical technique for dimensionality reduction and analysis of data by identifying a small number of principal components to explain the variation found in a data set…

2018-03-13abs ↗pdf ↗

New method for hyperparameter tuning in sparse matrix factorization.

problem Hyperparameter tuning in sparse matrix factorization.
method Numerical method based on evaluating the zero point of normalization factor in sparse matrix prior.
result Our method outperforms existing algorithms in ground-truth sparse matrix reconstruction.

Generalizes Carathéodory form for higher-order field theories.

problem Extending the Carathéodory form to second and higher-order Lagrangians.
method Geometric operations applied to the Poincaré--Cartan form and Lepage forms.
result Generalized Carathéodory form for second and higher-order Lagrangians.

The paper classifies and constructs rotational surfaces with constant astigmatism in space forms.

problem Classifying surfaces with constant astigmatism in space forms.
method Classification and construction of surfaces using variational problems and binormal evolution.
result Locally constructed all rotational surfaces of constant astigmatism.

Various problems in data analysis and statistical genetics call for recovery of a column-sparse, low-rank matrix from noisy observations. We propose ReFACTor, a simple variation of the classical Truncated Singular Value Decomposition (TSVD) algorithm. In contrast to previous sparse principal component analysis (PCA) al…

2017-05-22abs ↗pdf ↗

Let CMC\to M be the bundle of connections of a principal bundle on MM. The solutions to Hamilton-Cartan equations for a gauge-invariant Lagrangian density ΛΛ on CC satisfying a weak condition of regularity, are shown to admit an affine fibre-bundle structure over the set of solutions to Euler-Lagrange equations for …

2010-04-27abs ↗pdf ↗

Study of harmonic maps into principal bundles with applications to magnetic interactions.

problem Understanding harmonic mappings from Riemannian manifolds into principal bundles.
method Characterization and analysis of Kaluza-Klein harmonic maps and generalized magnetic maps.
result Existence and properties of generalized magnetic maps, including non-trivial examples.