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

3979118157 · May 202619922001200920172026
48 results for Orthogonal projection

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.

We establish Marstrand-type projection theorems for orthogonal projections along geodesics onto m-dimensional subspaces of hyperbolic nn-space by a geometric argument. Moreover, we obtain a Besicovitch-Federer type characterization of purely unrectifiable sets in terms of these hyperbolic orthogonal projections.

2018-07-30abs ↗pdf ↗

We construct a decomposition of the identity operator on a Riemannian manifold MM as a sum of smooth orthogonal projections subordinate to an open cover of MM. This extends a decomposition of the real line by smooth orthogonal projection due to Coifman, Meyer and Auscher, Weiss, Wickerhauser, and a similar decomposit…

2018-03-09abs ↗pdf ↗

Principal component analysis (PCA) is an unsupervised method for learning low-dimensional features with orthogonal projections. Multilinear PCA methods extend PCA to deal with multidimensional data (tensors) directly via tensor-to-tensor projection or tensor-to-vector projection (TVP). However, under the TVP setting, i…

2015-04-30abs ↗pdf ↗

In this paper known results of symmetric orthogonality, as introduced by G. Birkhoff, and non-expansive nearest point projections are extended from the linear to the metric setting. If the space has non-positive curvature in the sense Busemann then it is shown that those concepts are actually equivalent. In the end it …

2016-04-07abs ↗pdf ↗

GOPO optimizes large models in Hilbert space, avoiding Kullback-Leibler's curvature.

problem Optimizing large language models with Kullback-Leibler divergence's curvature issues.
method GOPO uses Hilbert space L2(pi_k) with orthogonality constraints and a work-dissipation functional.
result GOPO achieves competitive generalization with stable gradient dynamics and entropy preservation.

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.

We study the relations between the quaternion HH-type group and the boundary of the unit ball on two dimensional quaternionic space. The orthogonal projection of the space of square integrable functions defined on quaternion HH-type group into its subspace of boundary values of qq-holomorphic functions is consider. …

2006-10-02abs ↗pdf ↗

The paper studies geometric properties of Grassman manifolds within Euclidean spaces.

problem Understanding the geometric structure of Grassman manifolds.
method Analyzing Grassman manifold G(E)G(E) as a subset of Euclidean space EE and orthogonal projections.
result Explicit formulas for differential geometry of G(E)G(E) as a submanifold.

Soft-Radial Projection solves gradient saturation in constrained deep learning.

problem Gradient saturation in deep learning models when integrating hard constraints.
method Introduces Soft-Radial Projection, a differentiable layer that maps predictions onto constraint boundaries without rank-deficient Jacobians.
result Improves convergence and solution quality over state-of-the-art methods.

Let HH be a hypersurface in Rn\mathbb R^n and let ππ be an orthogonal projection in Rn\mathbb R^n restricted to HH. We say that HH satisfies the ArchimedeanArchimedean projectionprojection propertyproperty corresponding to ππ if there exists a constant CC such that Vol(π1(U))=CVol(U)Vol(π^{-1}(U)) = C \cdot Vol(U) for every measurable UU in the range…

2015-04-12abs ↗pdf ↗

We prove that the set of orthogonal separable coordinates on an arbitrary (pseudo-)Riemannian manifold carries a natural structure of a projective variety, equipped with an action of the isometry group. This leads us to propose a new, algebraic geometric approach to the classification of orthogonal separable coordinate…

2015-10-30abs ↗pdf ↗

We prove that a foliation (M,F)(M, F) of codimension qq on a nn-dimen\-sio\-nal pseudo-Riemannian manifold is pseudo-Riemannian if and only if any geodesic that is orthogonal at one point to a leaf is orthogonal to every leaf it intersects. We show that on the graph G=G(F)G = G(F) of a pseudo-Riemannian foliation there exis…

2016-11-27abs ↗pdf ↗

A parametric manifold can be viewed as the manifold of orbits of a (regular) foliation of a manifold by means of a family of curves. If the foliation is hypersurface orthogonal, the parametric manifold is equivalent to the 1-parameter family of hypersurfaces orthogonal to the curves, each of which inherits a metric and…

1994-07-12abs ↗pdf ↗

The paper creates a deformation retraction for homeomorphisms of the projective plane.

problem Deformation retraction of homeomorphisms of the projective plane.
method Equivariant strong deformation retraction from homeomorphism group to special orthogonal group.
result Induces a SO(3)-equivariant strong deformation retraction from projective plane homeomorphisms to SO(3).

New method constructs non-arithmetic hyperbolic orbifolds from complex arithmetic ball quotients.

problem Creating non-arithmetic lattices in projective orthogonal groups.
method Using anti-holomorphic involutions on complex arithmetic ball quotients, gluing fixed loci along geodesic subspaces.
result Explicit calculation of the volume of constructed non-arithmetic orbifolds.

A new pruning method reduces neural network computation without retraining.

problem Efficiently reduce neural network computation while maintaining accuracy.
method Structured directional pruning via perturbation orthogonal projection.
result Achieves state-of-the-art pruned accuracy without retraining.

A novel online GP model captures long-term memory in sequential data.

problem Capturing long-term memory in sequential data online.
method Integrates HiPPO framework into interdomain GP, leveraging time-varying orthogonal projections as inducing variables.
result OHSVGP outperforms existing online GP methods in predictive performance, long-term memory preservation, and computational efficiency.

Develops a new framework for temporal anchoring in deep embedding spaces.

problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.

We solve the equivalence problem for the orthogonally separable webs on the three-sphere under the action of the isometry group. This continues a classical project initiated by Olevsky in which he solved the corresponding canonical forms problem. The solution to the equivalence problem together with the results by Olev…

2010-09-22abs ↗pdf ↗

A complex orthogonal (geometric) structure on a complex manifold is a geometric structure locally modelled on a non-degenerate quadric. One of the first examples of such a structure on a compact manifold of dimension three was constructed by Guillot. In this paper, we show that the same manifold carries a family of uni…

2018-09-18abs ↗pdf ↗

New Zoll families of minimal spheres found in spheres and projective spaces.

problem Finding new Zoll families of minimal spheres in various spaces.
method Equivariant constructions using Nash-Moser-Hamilton implicit function theorem.
result First examples of metrics on real projective spaces with Zoll families of minimal projective hyperplanes.

P-OCS detects OOD samples in a low-dimensional subspace, outperforming existing methods.

problem Efficient OOD detection for deep learning models in open-world environments.
method P-OCS operates in the orthogonal complement of the principal subspace, applying a single projected perturbation.
result P-OCS achieves state-of-the-art OOD detection with negligible computational cost and without requiring model retraining.

This paper analyzes quantiles of heavy-tailed distributions, separating projection direction and quantile threshold effects.

problem Analyzing quantiles of heavy-tailed distributions with estimated parameters.
method Introduces a Q-Q orthogonality formulation to separate projection-direction and quantile-threshold effects.
result Decomposes the difference between empirical and population quantiles into three terms.

Bayesian method maps high-dimensional inputs to lower dimensions for efficient multi-fidelity Gaussian Process modeling.

problem Efficiently modeling high-dimensional inputs with low-dimensional latent variables for multi-fidelity Gaussian Processes.
method Bayesian approach with orthonormal projection matrix inference using Markov Chain Monte Carlo (MCMC) and Geodesic Monte Carlo sampling.
result Optimal transformations identified that improve computational efficiency in multi-fidelity Gaussian Process modeling.

A new optimizer preserves orthogonality constraints on matrices efficiently.

problem Optimization on Stiefel manifold with orthogonality constraints.
method Interplay between continuous and discrete dynamics leading to a gradient-based optimizer with momentum.
result The method optimizes matrices on Stiefel manifold efficiently and accurately.

We study a notion of convex cocompactness for discrete subgroups of the projective general linear group acting (not necessarily irreducibly) on real projective space, and give various characterizations. A convex cocompact group in this sense need not be word hyperbolic, but we show that it still has some of the good pr…

2017-04-27abs ↗pdf ↗

Non-Gaussian component analysis (NGCA) is a problem in multidimensional data analysis which, since its formulation in 2006, has attracted considerable attention in statistics and machine learning. In this problem, we have a random variable XX in nn-dimensional Euclidean space. There is an unknown subspace ΓΓ of the …

2018-07-13abs ↗pdf ↗

Study on parabolic points and cylindrical surfaces in Euclidean 3-space.

problem Characterizing parabolic points and their geometric properties.
method Introducing contact cylindrical surfaces and analyzing their properties.
result Characterization of A\mathcal{A}-singularity through projections.