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

1234 · Nov 202519922001200920172026
48 results for collinearity

The study characterizes quadrics among affine hyperspheres based on centroid collinearity of sections.

problem Characterizing quadrics among affine hyperspheres based on section centroid collinearity.
method Extending Meyer and Reisner's theorem to unbounded convex sets and identifying additional assumptions.
result Ellipsoids, paraboloids, and one sheet of a two-sheeted hyperboloid are the only quadrics satisfying the centroid collinearity condition.

No feature ranking can be faithful, stable, and complete when features are collinear.

problem The impossibility of creating a feature ranking that is simultaneously faithful, stable, and complete when features are collinear.
method Proving the impossibility, quantifying it for four model classes, resolving it via ensemble averaging (DASH), and machine-verifying it with Lean 4 theorems.
result No method lies outside the dichotomy of faithful-complete methods (unstable, with rankings that flip up to 50% of the time) and ensemble methods (stable, reporting ties for symmetric features).

Bayesian regularization tackles collinearity in large-scale systems with correlated inputs.

problem Collinearity in large-scale linear systems identification due to correlated inputs.
method Bayesian regularization with stable spline covariance and Markov chain Monte Carlo scheme.
result Efficient reconstruction of impulse responses with high correlation among inputs.

Bayesian approach tackles collinearity in large-scale linear system identification.

problem Collinearity in large-scale linear system identification.
method Bayesian regularization framework with Gaussian process and stable spline kernel. Novel Markov chain Monte Carlo scheme.
result Efficiently reconstructs impulse responses posterior by dealing with collinearity.

We study the connectedness of the planar self-affine sets T(A,D)T(A,{\mathcal{D}}) generated by an integer expanding matrix AA with det(A)=3|\det(A)|=3 and a non-collinear digit set D={0,v,kAv}{\mathcal D}=\{0, v, kAv\} where kZ{0}k\in {\mathbb Z}\setminus\{0\} and vZ2v\in {\mathbb Z}^2 such that {v,Av}\{v, Av\} is linearly independent. By chec…

2012-08-18abs ↗pdf ↗

Two-dimensional almost-Riemannian structures are generalized Riemannian structures on surfaces for which a local orthonormal frame is given by a Lie bracket generating pair of vector fields that can become collinear. Generically, the singular set is an embedded one dimensional manifold and there are three type of point…

2011-05-24abs ↗pdf ↗

Symmetry-electronic fingerprints reveal competing magnetic phases in two-dimensional materials.

problem Predicting magnetic ground states, moments, and anisotropy in two-dimensional magnets.
method Introduce the symmetry-electronic fingerprint (SEF), a physically interpretable representation that encodes crystallographic symmetry operations, Wyckoff-site geometry, and site-resolved electronic structure.
result SEF-trained models accurately classify magnetic ordering and regress moments alongside anisotropy energies.

The paper derives theoretical foundations for two common machine learning variable importance measures.

problem Understanding variable importance in machine learning problems.
method The paper derives closed-form expressions for Permute-and-Predict (PaP) and Leave-One-Covariate-Out (LOCO) methods.
result Theoretical derivations explain the behavior of PaP and LOCO under collinearity, linking them to coefficients and predictor variability.

In the paper, we focus on the connectedness of planar self-affine sets T(A,D)T(A,{\mathcal{D}}) generated by an integer expanding matrix AA with det(A)=3|\det (A)|=3 and a collinear digit set D={0,1,b}v{\mathcal{D}}=\{0,1,b\}v, where b>1b>1 and vR2v\in {\mathbb{R}}^2 such that {v,Av}\{v, Av\} is linearly independent. We discuss the domain of…

2012-05-16abs ↗pdf ↗

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…

2008-11-25abs ↗pdf ↗

This work discovers algebraic structures from data using a differentiable measure.

problem Discovering discrete algebraic rules from data.
method Formalizes the problem through Cayley-table completion and uses HyperCube operator-valued tensor factorization.
result Derives an absolute lower bound for the differentiable measure of algebraic complexity, proving it is attained only for group structures.

We consider the problem of learning linear prediction models with model misspecification bias. In such case, the collinearity among input variables may inflate the error of parameter estimation, resulting in instability of prediction results when training and test distributions do not match. In this paper we theoretica…

2019-11-28abs ↗pdf ↗

In N(k)N(k)-contact metric manifolds and/or (k,μ)(k,μ)-manifolds, gradient Ricci solitons, compact Ricci solitons and Ricci solitons with VV pointwise collinear with the structure vector field ξξ are studied.

2008-01-28abs ↗pdf ↗

Self-affine tiles homeomorphic to a ball proven for a specific digit set.

problem Topology of self-affine tiles with collinear digit sets.
method Proving homeomorphism to a ball using integral self-affine tiles with collinear digit sets.
result A large class of integral self-affine tiles with collinear digit sets is homeomorphic to a closed 3-dimensional ball.

New bounds on NTK's smallest eigenvalue for arbitrary data without distributional assumptions.

problem Existing bounds on NTK's smallest eigenvalue require distributional assumptions and high-dimensional data.
method Novel application of the hemisphere transform.
result Bounds on NTK's smallest eigenvalue hold with high probability even for constant input dimension.

Consider an immersed Legendrian surface in the five dimensional complex projective space equipped with the standard homogeneous contact structure. We introduce a class of fourth order projective Legendrian deformation called \emph{Ψ\,Ψ-deformation}, and give a differential geometric characterization of surfaces admitt…

2011-07-21abs ↗pdf ↗

We show that every non-trivial tame knot or link in R^3 has a quadrisecant, i.e. four collinear points. The quadrisecant must be topologically non-trivial in a precise sense. As an application, we show that a nonsingular, algebraic surface in R^3 which is a knotted torus must have degree at least eight.

1997-12-01abs ↗pdf ↗

New theory explains how noisy, high-dimensional data can still lead to robust predictions.

problem Modern machine learning models achieve high performance with noisy, high-dimensional data.
method Synthesizes principles from Information Theory, Latent Factor Models, and Psychometrics to clarify predictive robustness.
result Predictive robustness arises from data architecture and model capacity, not just data cleanliness.

Consider the equal mass planar 44-body problem with a potential corresponding to an inverse \textit{cube} force. The Jacobi-Maupertuis principle reparametrizes the dynamics as geodesics of a certain metric. We examine the curvature of this geodesic flow in the reduced space on the collinear and parallelogram invariant…

2016-10-26abs ↗pdf ↗

We show that any bounded zero-angular momentum solution for the Newtonian three-body problem must suffer infinitely many eclipses, or collinearities, provided that it does not suffer a triple collision. Motivation for the result comes from the dream of building a symbolic dynamics for the three-body problem, one whose …

2001-10-26abs ↗pdf ↗

The study explores rigid constraints on almost Ricci-Bourguignon solitons on contact metric three-manifolds.

problem Investigating constraints on almost Ricci-Bourguignon solitons on contact metric three-manifolds.
method Using a local orthonormal \(\varphi\)-basis, derived the full component form of the almost Ricci-Bourguignon soliton equation.
result For contact metric three-manifolds satisfying \(Qξ=σξ\), a collinear potential field must vanish on the non-Sasakian region whenever \(ξ(σ)=0\).

KG-WDRO optimizes transfer learning with external knowledge.

problem Over-pessimism in WDRO for small target samples.
method KG-WDRO incorporates multiple sources of external knowledge to construct smaller Wasserstein ambiguity sets.
result KG-WDRO improves transfer learning performance and adaptivity.

A kk-Artal arrangement is a reducible algebraic curve composed of a smooth cubic and kk inflectional tangents. By studying the topological properties of their subarrangements, we prove that for k=3,4,5,6k=3,4,5,6, there exist Zariski pairs of kk-Artal arrangements. These Zariki pairs can be distinguished in a geometric way…

2016-07-26abs ↗pdf ↗

The derivation of statistical properties for Partial Least Squares regression can be a challenging task. The reason is that the construction of latent components from the predictor variables also depends on the response variable. While this typically leads to good performance and interpretable models in practice, it ma…

2010-02-22abs ↗pdf ↗

We consider discrete nets in Grassmannians Grd\mathbb{G}^d_r which generalize Q-nets (maps ZNPd\mathbb{Z}^N\to\mathbb{P}^d with planar elementary quadrilaterals) and Darboux nets (Pd\mathbb{P}^d-valued maps defined on the edges of ZN\mathbb{Z}^N such that quadruples of points corresponding to elementary squares are all co…

2008-12-30abs ↗pdf ↗

In this paper, we consider the connectedness of planar self-affine set T(A,D)T(A,\mathcal{D}) arising from an integral expanding matrix AA with characteristic polynomial f(x)=x2+bx+cf(x)=x^2+bx+c and a digit set D={0,1,,m}v\mathcal{D}=\{0,1,\dots, m\}v. The necessary and sufficient conditions only depending on b,c,mb,c,m are given for the $T(A…

2014-04-25abs ↗pdf ↗

Let MM be a 3×33\times 3 integer matrix each of whose eigenvalues is greater than 11 in modulus and let DZ3\mathcal{D}\subset\mathbb{Z}^3 be a set with D=detM|\mathcal{D}|=|\det M|, called digit set. The set equation MT=T+DMT = T+\mathcal{D} uniquely defines a nonempty compact set TR3T\subset \mathbb{R}^3. If TT has positive L…

2018-11-16abs ↗pdf ↗

We present a family of expectation-maximization (EM) algorithms for binary and negative-binomial logistic regression, drawing a sharp connection with the variational-Bayes algorithm of Jaakkola and Jordan (2000). Indeed, our results allow a version of this variational-Bayes approach to be re-interpreted as a true EM al…

2013-05-31abs ↗pdf ↗

The aim of this article is to study the k-almost Ricci soliton and k-almost gradient Ricci soliton on contact metric manifold. First, we prove that if a compact K-contact metric is a k-almost gradient Ricci soliton then it is isometric to a unit sphere S2n+1. Next, we extend this result on a compact k-almost Ricci soli…

2018-01-15abs ↗pdf ↗

The paper characterizes a class of almost Kenmotsu manifolds with quasi Yamabe solitons.

problem Characterizing almost Kenmotsu manifolds with quasi Yamabe solitons.
method Analyzing the properties of quasi Yamabe solitons on (k,μ)(k,μ)'-almost Kenmotsu manifolds.
result If a (k,μ)(k,μ)'-almost Kenmotsu manifold admits a quasi Yamabe soliton, then VV is a constant multiple of ξξ, VV is a strict infinitesimal contact transformation, and (£Vh)X=0(£_V h')X = 0 for any vector field XX.

An almost-Riemannian structure on a surface is a generalized Riemannian structure whose local orthonormal frames are given by Lie bracket generating pairs of vector fields that can become collinear. The distribution generated locally by orthonormal frames has maximal rank at almost every point of the surface, but in ge…

2012-03-05abs ↗pdf ↗

Predictive models can be used for causal inference with feature selection.

problem Limitations of predictive models in interpreting causal relationships.
method Constrained learning process by selecting features according to Pearl's backdoor adjustment criterion.
result Causal models provide near unbiased effect estimates and better generalization.

The paper characterizes Kenmotsu metrics as almost *-Ricci solitons.

problem Characterizing Kenmotsu metrics as almost *-Ricci solitons.
method Analyzing the geometry of almost contact metrics through *-Ricci solitons.
result Kenmotsu metrics are characterized as almost *-Ricci solitons under specific conditions.

Study para-Ricci-like solitons on special Riemannian manifolds, proving geometric properties and providing an example.

problem Characterize para-Ricci-like solitons on para-Sasaki-like Riemannian ΠΠ-manifolds.
method Analyzed different cases of potential vectors and proved geometric properties of constructed objects.
result Obtained results for a parallel symmetric second-order covariant tensor and provided an explicit example.

Monte Carlo methods are widely used in particle physics to integrate and sample probability distributions (differential cross sections or decay rates) on multi-dimensional phase spaces. We present a Neural Network (NN) algorithm optimized to perform this task. The algorithm has been applied to several examples of direc…

2018-10-26abs ↗pdf ↗

Collimated streams of particles produced in high energy physics experiments are organized using clustering algorithms to form jets. To construct jets, the experimental collaborations based at the Large Hadron Collider (LHC) primarily use agglomerative hierarchical clustering schemes known as sequential recombination. W…

2015-09-07abs ↗pdf ↗