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

54109163217 · May 202619922001200920172026
48 results for principal directions

The study examines principal directions and curvatures of Lagrangian submanifolds.

problem Understanding the geometry of Lagrangian submanifolds.
method Recalling and analyzing the extrinsic principal tangential and normal directions, and their corresponding curvatures for Lagrangian submanifolds in complex Euclidean spaces.
result Established natural relationships between distinguished tangential and normal directions and their curvatures for Lagrangian submanifolds.

Given a vector field XX in a Riemannian manifold, a hypersurface is said to have a canonical principal direction relative to XX if the projection of XX onto the tangent space of the hypersurface gives a principal direction. We give different ways for building these hypersurfaces, as well as a number of useful charac…

2011-10-10abs ↗pdf ↗

Study on discrete surfaces with constant principal curvature for nanocarbon applications.

problem Understanding discrete geometry properties of nanocarbon materials.
method Developed discrete surface theory on 3-ary oriented trees, defined discrete principal directions, constructed examples of discrete CPC surfaces.
result Construction of discrete constant principal curvature surfaces, including discrete CPC tori.

Survey of SDR methods for high-dimensional regression and embedding.

problem Reducing dimensionality in high-dimensional data.
method Involves both statistical and machine learning approaches, covering inverse and forward regression methods.
result Supervised Kernel Dimension Reduction is equivalent to supervised PCA.

Autoencoders are a deep learning model for representation learning. When trained to minimize the distance between the data and its reconstruction, linear autoencoders (LAEs) learn the subspace spanned by the top principal directions but cannot learn the principal directions themselves. In this paper, we prove that $L_2…

2019-01-23abs ↗pdf ↗

We consider surfaces in Euclidean space parametrized on an annular domain such that the first fundamental form and the principal curvatures are rotationally invariant, and the principal curvature directions only depend on the angle of rotation (but not the radius). Such surfaces generalize the Enneper surface. We show …

2016-07-28abs ↗pdf ↗

A new PCR method using SVD with sparse regularization.

problem Lack of response variable information in traditional PCR.
method One-stage SVD approach with two loss functions and sparse regularization.
result Obtains principal component loadings with response variable information.

Attention learns PCA on Gaussian data, proving its connection to principal component analysis.

problem Principal component analysis on Gaussian data.
method Analysis of attention mechanisms through PCA, covering finite and infinite prompt regimes.
result Attention aligns with principal eigenvectors of covariance matrices, converging to optimal solutions in the infinite-prompt limit.

We explore the geometrical interpretation of the PCA based clustering algorithm Principal Direction Divisive Partitioning (PDDP). We give several examples where this algorithm breaks down, and suggest a new method, gap partitioning, which takes into account natural gaps in the data between clusters. Geometric features …

2012-11-17abs ↗pdf ↗

We study submanifolds whose principal curvatures, counted with multiplicities, do not depend on the normal direction. Such submanifolds, which we briefly call CPC submanifolds, are always austere, hence minimal, and have constant principal curvatures. Well-known classes of examples include totally geodesic submanifolds…

2018-05-25abs ↗pdf ↗

In this paper we introduce a notion of parallel transport for principal bundles with connections over differentiable stacks. We show that principal bundles with connections over stacks can be recovered from their parallel transport thereby extending the results of Barrett, Caetano and Picken, and Schreiber and Waldof f…

2015-09-16abs ↗pdf ↗

Study on null hypersurfaces with constant angle in Lorentzian manifolds.

problem Understanding constant angle null hypersurfaces in Lorentzian manifolds.
method Introduced constant angle null hypersurfaces, analyzed with respect to a given ambient vector field, and provided classification results.
result Null hypersurfaces have a canonical principal direction when the vector field is closed and conformal.

This research classifies invariant complex structures and Kähler metrics on principal bundles.

problem Classifying invariant complex structures and Kähler metrics on principal bundles.
method Using Wang's theory of invariant connections and the Levi-Civita connection, the study provides direct geometric proofs and extends the classification from Hermitian to general symmetric spaces.
result The invariant integrable complex structures are unique in the reduced frame bundles of the upper half-plane and complex projective spaces.

Let M be a simply connected Riemannian symmetric space, with at most one flat direction. We show that every Riemannian (or unitary) vector bundle with parallel curvature over M is an associated vector bundle of a canonical principal bundle, with the connection inherited from the principal bundle. The problem of finding…

1997-12-22abs ↗pdf ↗

We study parallel surfaces and dual surfaces of cuspidal edges. We give concrete forms of principal curvature and principal direction for cuspidal edges. Moreover, we define ridge points for cuspidal edges by using those. We clarify relations between singularities of parallel and dual surfaces and differential geometri…

2015-10-22abs ↗pdf ↗

A new construction of a universal connection was given in \cite{BHS}. The main aim here is to explain this construction. A theorem of Atiyah and Weil says that a holomorphic vector bundle EE over a compact Riemann surface admits a holomorphic connection if and only if the degree of every direct summand of EE is degre…

2016-08-08abs ↗pdf ↗

POTD estimates SDR subspace using optimal transport for binary response.

problem Insufficient performance of existing SDR methods for categorical responses.
method Principal optimal transport direction (POTD) using optimal transport coupling.
result POTD exclusively estimates SDR subspace for error-free class labels.

We present a novel algorithm (Principal Sensitivity Analysis; PSA) to analyze the knowledge of the classifier obtained from supervised machine learning techniques. In particular, we define principal sensitivity map (PSM) as the direction on the input space to which the trained classifier is most sensitive, and use anal…

2014-12-21abs ↗pdf ↗

We consider the classification problem and focus on nonlinear methods for classification on manifolds. For multivariate datasets lying on an embedded nonlinear Riemannian manifold within the higher-dimensional ambient space, we aim to acquire a classification boundary for the classes with labels, using the intrinsic me…

2017-10-21abs ↗pdf ↗

This is a detailed tutorial paper which explains the Principal Component Analysis (PCA), Supervised PCA (SPCA), kernel PCA, and kernel SPCA. We start with projection, PCA with eigen-decomposition, PCA with one and multiple projection directions, properties of the projection matrix, reconstruction error minimization, an…

2019-06-01abs ↗pdf ↗

Improved convergence speed of principal component analysis through modified learning rules.

problem Slow convergence for covariance matrices with close eigenvalues.
method Introduced an additional term to the objective function to mitigate convergence issues.
result Significantly improved convergence speed confirmed through simulations.

CPCR mitigates bias in PCR for overparameterized models.

problem Bias in Principal Component Regression (PCR) for overparameterized models.
method Calibrated Principal Component Regression (CPCR) learns a low-variance prior in the PC subspace and calibrates the model in the original feature space.
result CPCR outperforms standard PCR in overparameterized settings, improving prediction across multiple problems.

New algorithms detect and estimate rank-one signals with prior directional information.

problem Detecting and estimating rank-one signals with directional prior information.
method Construct nonlinear Laplacians and examine top eigenvalues and eigenvectors.
result Nonlinear Laplacian algorithms outperform direct spectral methods for biased signals.

A Hopf hypersurface in complex hyperbolic space CH^n is one in which the complex structure applied to the normal vector is a principal direction at each point. In this paper, Hopf hypersurfaces for which the corresponding principal curvature is small (relative to the ambient sectional curvature) are studied by means of…

2009-12-03abs ↗pdf ↗

This paper improves Koopman operator approximations by pruning subspaces in RKHS.

problem Improving predictive accuracy of Koopman operator approximations.
method Computes principal angles and vectors in RKHS to prune subspaces.
result Validated approach enhances Koopman operator approximations for large datasets.

A checkerboard graph of a special diagram of an oriented link is made a directed, edge-weighted graph in a natural way so that a principal minor of its Laplacian matrix is a Seifert matrix of the link. Doubling and weighting the edges of the graph produces a second Laplacian matrix such that a principal minor is an Ale…

2018-09-18abs ↗pdf ↗

New method for robust PCA with exponential family distributions.

problem Recovering low-rank structure from data matrices with outliers.
method Alternating Direction Method of Multipliers for eextRPCAe^{ ext{RPCA}}.
result Demonstrated effectiveness in steel sheet defect detection and crime activity monitoring.

We introduce a new spatial data structure for high dimensional data called the \emph{approximate principal direction tree} (APD tree) that adapts to the intrinsic dimension of the data. Our algorithm ensures vector-quantization accuracy similar to that of computationally-expensive PCA trees with similar time-complexity…

2012-06-18abs ↗pdf ↗

Consider a complete Riemannian manifold MnM^n and let ΣnΣ^n be an orientable hypersurface of the product manifold M×RM\times\mathbb{R} endowed with its standard product metric ,.\langle \,,\, \rangle. Let ξ\nablaξ denote the gradient of the height function ξξ of Σ.Σ. In this note, we characterize the hypersurfaces ΣΣ

2019-05-28abs ↗pdf ↗

Classifies hypersurfaces with specific curvature properties in 4D space.

problem Classifying hypersurfaces with three distinct principal curvatures in 4D space.
method Used classification results for hypersurfaces in R4\mathbb{R}^4, S3imesR\mathbb{S}^3 imes \mathbb{R}, and H3imesR\mathbb{H}^3 imes \mathbb{R} to derive new classifications.
result Alternative classification of cyclic conformally flat hypersurfaces in R4\mathbb{R}^4.

Dimension reduction of multivariate data supervised by auxiliary information is considered. A series of basis for dimension reduction is obtained as minimizers of a novel criterion. The proposed method is akin to continuum regression, and the resulting basis is called continuum directions. With a presence of binary sup…

2016-06-20abs ↗pdf ↗

Motivated by the Bagging Partial Least Squares (PLS) and Principal Component Analysis (PCA) algorithms, we propose a Principal Model Analysis (PMA) method in this paper. In the proposed PMA algorithm, the PCA and the PLS are combined. In the method, multiple PLS models are trained on sub-training sets, derived from the…

2019-02-06abs ↗pdf ↗

We use foliations and connections on principal Lie groupoid bundles to prove various integrability results for Lie algebroids. In particular, we show, under quite general assumptions, that the semi-direct product associated to an infinitesimal action of one integrable Lie algebroid on another is integrable. This genera…

2000-06-06abs ↗pdf ↗