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,657 papers · 148 categories

Trend · papers per month

11223344 · May 202619922001200920172026
48 results for Orthogonal intransitivity

Local classification of 4D Ricci solitons with specific algebra properties.

problem Classifying 4D Ricci solitons with a 2D Abelian Killing algebra.
method Local classification under specific curvature and symmetry conditions.
result Classification of Ricci solitons with orthogonally intransitive 2D Abelian Killing algebra.

A lemma of Tits establishes a connection between the simple connectivity of an incidence geometry and the universal completion of an amalgam induced by a sufficiently transitive group of automorphisms of that geometry. In the present paper, we generalize this lemma to intransitive geometries, thus opening the door for …

2007-08-11abs ↗pdf ↗

We show that formal isomorphism of intransitive linear Lie equations along transversal to the orbits can be extended to neighborhoods of these transversal. In analytic cases, the word formal is dropped from theorems. Also, we associate an intransitive Lie algebra with each intransitive linear Lie equation, and from the…

2009-11-17abs ↗pdf ↗

Elie Cartan's general equivalence problem is recast in the language of Lie algebroids. The resulting formalism, being coordinate and model-free, allows for a full geometric interpretation of Cartan's method of equivalence via reduction and prolongation. We show how to construct certain normal forms (Cartan algebroids) …

2005-09-03abs ↗pdf ↗

We consider the problem of estimating a ranking on a set of items from noisy pairwise comparisons given item features. We address the fact that pairwise comparison data often reflects irrational choice, e.g. intransitivity. Our key observation is that two items compared in isolation from other items may be compared bas…

2020-02-22abs ↗pdf ↗

For surfaces, we brush a reasonably sharp picture of the influence of the fundamental group upon the complexity of foliated-dynamics. A metaphor emerges with phase-changes through the solid-liquid-gaseous states. Groups of ranks 0r10\le r\le 1 are frozen with intransitivity reigning ubiquitously. When 2r32\le r \le 3, th…

2011-11-24abs ↗pdf ↗

This paper is a continuation of Part I where the general setup was developed. Here we discuss the general equivalence problem for geometric structures and provide criteria for the equivalence, local and global, of transitive structures. Cartan's Flag Systems illustrate the theory as a major example and, finally, some a…

2014-12-29abs ↗pdf ↗

Lie algebroids are by no means natural as an infinitesimal counterpart of groupoids. In this paper we propose a functorial construction called Nishimura algebroids for an infinitesimal counterpart of groupoids. Nishimura algebroids, intended for differential geometry, are of the same vein as Lawvere's functorial notion…

2007-09-23abs ↗pdf ↗

A general model for geometric structures on differentiable manifolds is obtained by deforming infinitesimal symmetries. Specifically, this model consists of a Lie algebroid, equipped with an affine connection compatible with the Lie algebroid structure. The curvature of this connection vanishes precisely when the struc…

2004-04-17abs ↗pdf ↗

In this paper we describe market in projective geometry language and give definition of a matrix of market rate, which is related to the matrix rate of return and the matrix of judgements in the Analytic Hierarchy Process (AHP). We use these observations to extend the AHP model to projective geometry formalism and gene…

2007-09-27abs ↗pdf ↗

A multiplicatively closed, horizontal nn-plane field DD on a Lie groupoid GG over MM generalizes to intransitive geometry the classical notion of a Cartan connection. The infinitesimalization of the connection DD is a Cartan connection \nabla on the Lie algebroid of GG, a notion already studied elsewhere by th…

2016-05-14abs ↗pdf ↗

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.

Study isotropy groups for complex orthogonal and skew-symmetric matrices.

problem Understanding isotropy subgroups of orthogonal similarity transformations.
method Analysis of group structure of nonsingular block matrices.
result Group structure of isotropy subgroups related to block Toeplitz matrices.

OPT framework improves neural network generalization by learning an orthogonal transformation.

problem Improving neural network generalization.
method Orthogonal over-parameterized training (OPT) framework that minimizes hyperspherical energy.
result OPT framework provably minimizes hyperspherical energy and improves empirical generalization.

The paper studies surfaces in a bounded domain with orthogonal boundaries and proves curvature estimates.

problem Estimating the area of surfaces with orthogonal boundaries in a bounded domain.
method Weak formulation of orthogonality for curvature varifolds, classification of vanishing curvature varifolds.
result Existence of an orthogonal 2-varifold that minimizes L2L^2 curvature in the integer rectifiable class.

Orthogonal random features approximate a Bessel kernel, offering sharper bounds than random Fourier features.

problem Approximating Gaussian kernel efficiently for large datasets.
method Use of Haar orthogonal matrices to construct orthogonal random features and analyze their bias and variance.
result Orthogonal random features approximate a Bessel kernel, not the Gaussian kernel, with sharper bounds.

Proposes FOAGP for efficient orthogonal effect decomposition of black-box computer experiments.

problem Challenges in sensitivity analysis of black-box computer experiments with complex, nonlinear functional outputs.
method Functional-output orthogonal additive Gaussian process (FOAGP) with conditional orthogonality constraint.
result Demonstrates effectiveness in orthogonal effect decomposition and variance decomposition through simulations and real-world application.

Novel prior for orthogonal functions improves functional component estimation.

problem Improving orthogonality in functional principal component analysis.
method Sequential adaptive priors for orthogonal functions using hierarchical conditionally normal distributions.
result Proposed prior leads to nearly orthogonal posterior 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.

We study the Chern-Simons partition function of orthogonal quantum group invariants, and propose a new orthogonal Labastida-Mariño-Ooguri-Vafa conjecture as well as degree conjecture for free energy associated to the orthogonal Chern-Simons partition function. We prove the degree conjecture and some interesting cases o…

2010-07-09abs ↗pdf ↗

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…

1998-02-27abs ↗pdf ↗

DONUT improves treatment effect estimation by enforcing orthogonality constraints.

problem Estimating treatment effects from observational data is challenging due to unobserved outcomes.
method DONUT uses a regularization framework that formalizes unconfoundedness as orthogonality, leading to deep orthogonal networks.
result DONUT outperforms state-of-the-art methods in estimating average treatment effects.

New convergence guarantees for learning with unknown nuisance parameters.

problem Learning problems with unknown nuisance parameters.
method Stochastic gradient optimization with Neyman orthogonality and approximately orthogonalized updates.
result Stochastic gradient algorithms can converge under conditions of nuisance parameters.

MuonEq improves training of matrix-valued parameters by rebalancing momentum before orthogonalization.

problem Training matrix-valued parameters with orthogonalized-update optimizers like Muon.
method MuonEq introduces three lightweight pre-orthogonalization equilibration schemes: two-sided row/column normalization (RC), row normalization (R), and column normalization (C).
result Row/column normalization acts as a zeroth-order surrogate for whitening and improves the geometry seen by orthogonalization.

Orthogonal initialization does not speed up training in ultra-wide neural networks.

problem Exploring the effect of orthogonal initialization on training speed in deep neural networks.
method Study of neural tangent kernel dynamics in FCNs and CNNs with orthogonal initialization.
result The NTK of orthogonally-initialized networks remains constant during training, suggesting no speedup in the NTK regime.

A new algorithm POGO optimizes thousands of orthogonal matrices efficiently.

problem Optimizing thousands of orthogonal constraints at scale is computationally expensive.
method Revisits Landing algorithm, uses modern adaptive optimizers, reduces hyperparameters.
result POGO optimizes thousands of orthogonal matrices in minutes, outperforming alternatives.

The paper finds at least N orthogonal Finsler geodesic chords in a disk-like manifold.

problem Existence and multiplicity of orthogonal Finsler geodesic chords in a disk-like manifold.
method Study of Finsler geodesic chords under reversibility assumption.
result At least N orthogonal Finsler geodesic chords found in a disk-like manifold.

LOFT separates subspace rotation and transformation for orthogonal fine-tuning.

problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.

New method enforces orthogonality in convolutional layers for improved robustness.

problem Improving adversarial robustness in deep learning models.
method Applying the Cayley transform to skew-symmetric convolutions in the Fourier domain.
result The proposed method preserves orthogonality and enhances adversarial robustness compared to existing techniques.

We propose orthogonality as a necessary condition for disentangling aleatoric and epistemic uncertainty.

problem Jointly estimating aleatoric and epistemic uncertainty is problematic and non-trivial.
method We propose orthogonality as a necessary condition for disentanglement and construct UDE to measure orthogonality and consistency.
result Orthogonality and consistency are necessary and sufficient criteria for disentanglement.

VRSGT algorithm reduces orthogonality constraints in decentralized optimization.

problem Decentralized optimization with orthogonality constraints.
method VRSGT algorithm with variance reduction and orthogonal techniques.
result VRSGT achieves convergence rate of O(1 / k) for orthogonality constraints.

We orthogonalize the NSS model to condition and diagnose its ill-conditioned parameters.

problem The ill-conditioning of the NSS model's design matrix.
method Exact orthogonal reparametrization via QR decomposition.
result Orthogonalization isolates the conditioning structure and maintains fit uncertainty.

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…

2013-12-01abs ↗pdf ↗

New algorithms reduce orthogonality constraint enforcement time in machine learning.

problem Efficiently solving orthogonality constraints in machine learning.
method Extending the landing algorithm to Stiefel manifold, incorporating stochastic and variance reduction techniques.
result All proposed methods achieve the same convergence rate as Riemannian counterparts enforcing constraints.

Ranking data arises in a wide variety of application areas but remains difficult to model, learn from, and predict. Datasets often exhibit multimodality, intransitivity, or incomplete rankings---particularly when generated by humans---yet popular probabilistic models are often too rigid to capture such complexities. In…

2018-09-13abs ↗pdf ↗

We present an intriguing discovery related to Random Fourier Features: in Gaussian kernel approximation, replacing the random Gaussian matrix by a properly scaled random orthogonal matrix significantly decreases kernel approximation error. We call this technique Orthogonal Random Features (ORF), and provide theoretical…

2016-10-28abs ↗pdf ↗

AuON is a linear-time optimizer that improves upon Muon's performance without approximate orthogonal matrices.

problem High memory and computational costs of orthogonal momentum updates.
method AuON uses normalized nonlinear scaling and a 'emergency brake' to handle exploding attention logits.
result AuON achieves strong performance without approximate orthogonal matrices, preserving structural alignment and reconditioning.

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.