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

Trend · papers per month

82163245326 · May 202619922001200920172026
48 results for linearly dependent

Study on singular points of translation surfaces under linearly dependent conditions.

problem Investigate singular points of translation surfaces under linearly dependent conditions.
method Use theories of generalised framed surfaces and framed surfaces.
result Introduce translation generalised framed surfaces and investigate their singular points.

Randomly initialized neural networks can linearly separate arbitrary sets.

problem Mapping two arbitrary sets to linearly separable sets.
method Randomly initialized one-layer neural networks with sufficient width.
result With high probability, these networks can transform two sets into linearly separable sets.

New theorem shows curvature concentration depends linearly on volume ratio.

problem Gap theorem for nonnegative Ricci curvature manifolds with small curvature concentration.
method Exhibited Ricci flow solution with faster than 1/t curvature decay.
result Curvature concentration depends linearly on asymptotic volume ratio.

In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given by parametric representation) in Euclidean space R^5. In transversal intersection…

2016-01-17abs ↗pdf ↗

Study Wintgen ideal submanifolds in curved spaces with specific curvature conditions.

problem Characterize Wintgen ideal submanifolds in curved spaces under certain curvature constraints.
method Analyze submanifolds in real space forms R^{n+m}(k) with specific curvature conditions.
result Identify conditions under which submanifolds satisfy given pseudo-symmetry type curvature conditions.

Improved Frank-Wolfe algorithm for polytopes converges linearly with dimension dependence on optimal face.

problem Efficiently solving convex minimization problems over polytopes with linear rate.
method Revisiting Frank-Wolfe algorithm with strict complementarity assumption and away-steps.
result Linear convergence rate independent of polytope dimension for optimal face.

In this paper we study null Bertrand curves in R14R_{1}^{4} under the assumption the curve has a Cartan frame. We show that if the derivative vectors of the null Cartan curve in R14R_{1}^{4} is linearly independent, then this curve is not a Bertrand curve. Since then the already known notion of null Bertrand curves in $R…

2011-01-31abs ↗pdf ↗

Fast robust subspace tracking in sparse data-dependent noise with near-optimal delay.

problem Robustly tracking time-varying subspaces in the presence of sparse outliers.
method Introduces a fast mini-batch robust ST solution under mild assumptions.
result Provably correct subspace tracking with near-optimal delay and same time complexity as simple PCA.

Given two conjugate mapping classes f and g, we produce a conjugating element w such that |w| < K(|f|+|g|), where |.| denotes the word metric with respect to a fixed generating set, and K is a constant depending only on the generating set. As a consequence, the conjugacy problem for mapping class groups is exponentiall…

2011-06-12abs ↗pdf ↗

Study heat kernel on quaternionic contact manifolds, finding linear dependence of coefficients on curvature.

problem Analyzing heat kernel on quaternionic contact manifolds.
method Explicit computation of heat kernel coefficients and dependence on curvature.
result Second coefficient of heat kernel's small time asymptotics depends linearly on the qc scalar curvature.

Study p-Willmore disks with boundary energies, finding equilibrium configurations.

problem Finding equilibrium configurations for p-Willmore disks with boundary energies.
method Model boundary as Kirchhoff elastic rod, interior term dependent on mean and Gaussian curvatures. Study among topological disks and p-Willmore examples.
result Equilibrium configurations for p-Willmore disks with boundary energies.

Study reveals how Fisher information changes with network depth, finding it grows linearly.

problem Understanding the trainability of deep neural networks (DNNs).
method Investigates the spectral distribution of the conditional Fisher information matrix (FIM) for fully-connected networks achieving dynamical isometry.
result The conditional FIM's spectrum concentrates around the maximum and grows linearly with depth.

We study kk-GenEV, the problem of finding the top kk generalized eigenvectors, and kk-CCA, the problem of finding the top kk vectors in canonical-correlation analysis. We propose algorithms LazyEV\mathtt{LazyEV} and LazyCCA\mathtt{LazyCCA} to solve the two problems with running times linearly dependent on the input size and…

2016-07-20abs ↗pdf ↗

We consider Feller mean-reverting square-root diffusion, which has been applied to model a wide variety of processes with linearly state-dependent diffusion, such as stochastic volatility and interest rates in finance, and neuronal and populations dynamics in natural sciences. We focus on the statistical mixing (or sup…

2009-10-08abs ↗pdf ↗

Polynomial bound on surfaces in hyperbolic 3-manifolds.

problem Bounding the number of surfaces in hyperbolic 3-manifolds.
method Using polynomial functions of the volume of the manifold and the Euler characteristic.
result An upper bound for the number of compact essential surfaces is a polynomial function of the volume of the manifold.

Electrostatic systems with specific tensors are locally conformally flat.

problem Understanding the geometry of electrostatic systems with special tensors.
method Proving local conformal flatness for electrostatic manifolds with divergence-free Bach tensor.
result Three-dimensional electrostatic manifolds with divergence-free Bach tensor are locally conformally flat.

The study examines arithmetic orbifolds and their length spectra, proving uniform discreteness and linear dependence of geodesic lengths.

problem Uniform discreteness and linear dependence of geodesic lengths in arithmetic orbifolds.
method Analyzes Salem numbers and Lie groups to prove uniform discreteness, and uses geometric properties to show linear dependence of geodesic lengths.
result Existence of a positive constant δ(X) such that squares of lengths of closed geodesics shorter than δ must be pairwise linearly dependent over Q.

We give simple homological conditions for a rational homology 3-sphere Y to have infinite order in the rational homology cobordism group, and for a collection of rational homology spheres to be linearly independent. These translate immediately to statements about knot concordance when Y is the branched double cover of …

2018-03-21abs ↗pdf ↗

EVILL uses randomised perturbations to improve exploration in bandit problems.

problem Improving exploration in structured stochastic bandit problems.
method Solves for the minimiser of a linearly perturbed regularised negative log-likelihood function.
result EVILL matches the performance of Thompson-sampling-style methods in theory and practice.

The paper analyzes why Gaussianization slows down with higher dimensions and proposes a solution.

problem The convergence rate of Gaussianization slows down as the dimension increases.
method Analytical and empirical analysis of Gaussianization with random rotations.
result The number of required layers scales linearly with the dimension for Gaussian input.

Motivated by the works of Krasner [arXiv:0801.4018] and Lobb [arXiv:1103.1412], we simplify the Khovanov-Rozansky chain complexes of open 2-braids. As an application, we show that, for a knot containing a "long" 2-braid, the sl(N) Rasmussen invariant of this knot depends linearly on the length of this 2-braid. We refin…

2011-11-15abs ↗pdf ↗

If a closed 3-manifold M supports a closed, nonsingular, irrational 1-form which linearly deforms into contact forms, then M supports a K-contact form. On the 3-torus, a closed nonsingular 1-form deforms linearly into contact forms if and only if it is a fibration 1-form. on any other 2-torus bundle over the circle, ev…

2008-12-17abs ↗pdf ↗

Study on linear regression with dependent covariates, proving universality and error characterization.

problem Linear regression with dependent covariates in high-dimensional settings.
method Analysis of ridge regression performance, Gaussian universality theorem, spectral properties of covariance matrices.
result Asymptotic performance of ridge regression is invariant under non-Gaussian covariates with preserved mean and covariance.

Labeling training data is a key bottleneck in the modern machine learning pipeline. Recent weak supervision approaches combine labels from multiple noisy sources by estimating their accuracies without access to ground truth labels; however, estimating the dependencies among these sources is a critical challenge. We foc…

2019-03-14abs ↗pdf ↗

LCW reduces activation shift in neural networks, improving training efficiency and generalization.

problem Activation shift in neural networks leading to non-zero mean preactivation values.
method Linearly constrained weights (LCW) to reduce activation shift in fully connected and convolutional layers.
result LCW resolves the vanishing gradient problem and improves generalization of neural networks.

The paper explores linearly free graphs and their embeddings into 3D space.

problem Understanding the conditions under which a graph's embedding into 3D space is free.
method Developed a sufficient condition for a linear embedding to be free and applied it to specific graph cases.
result Established sufficient conditions for a graph to be linearly free and provided examples and counterexamples.

The paper identifies redundant columns in matrices for feature selection and clustering.

problem Identifying redundant columns in matrices for feature selection and clustering.
method Proves that after re-ordering columns, a matrix can be block-diagonalized revealing linearly dependent columns.
result Identifies redundant columns in matrices, aiding in feature selection and clustering.

We deal with Matveev complexity of compact orientable 3-manifolds represented via Heegaard diagrams. This lead us to the definition of modified Heegaard complexity of Heegaard diagrams and of manifolds. We define a class of manifolds which are generalizations of Dunwoody manifolds, including cyclic branched coverings o…

2009-01-15abs ↗pdf ↗

Neural networks favor simple features over complex ones, even when complex features are available.

problem Neural networks exhibit a bias towards simple features over complex ones, even when complex features are present.
method Rigorously defined simplicity bias, theoretical and empirical demonstrations, ensemble approach to improve robustness.
result One hidden layer neural networks favor simple features over complex ones, even in the presence of more robust features.

The statistical properties of the increments x(t+T) - x(t) of a financial time series depend on the time resolution T on which the increments are considered. A non-parametric approach is used to study the scale dependence of the empirical distribution of the price increments x(t+T) - x(t) of S&P Index futures, for time…

1997-05-08abs ↗pdf ↗

This paper deals with the question of J.Morava on existence of canonical complex cobordism class of singular submanifold. We present several solutions of this question for Xr(ξ)X_r(ξ) -- the set of points where dimξr+1\dimξ-r+1 generic sections of a complex vector bundle ξξ are linearly dependent. The corresponding complex co…

2008-07-30abs ↗pdf ↗

New Performer model tackles long-sequence protein modeling.

problem Challenges of training complex Transformer models for long sequences.
method Linearly scalable long-context Transformer architecture, Performer.
result Performer provides strong theoretical guarantees and is effective for protein sequence modeling.