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

4896143191 · May 202619922001200920172026
48 results for analytic rank

Analytic torsion defined for rank 2 distributions on 5-manifolds.

problem Defining and analyzing analytic torsion for rank 2 distributions.
method Proposed an analytic torsion for Rumin complex associated with rank 2 distributions on 5-manifolds, established anomaly formulas, and showed coincidence with Ray-Singer torsion.
result The proposed torsion coincides with Ray-Singer torsion for certain nilmanifolds.

Convolutional neural networks predict the analytic rank of elliptic curves accurately.

problem Predicting the analytic rank of elliptic curves over Q.
method Applied one-dimensional convolutional neural networks to Frobenius traces.
result High accuracy predictions for analytic rank across various conductors.

A method for ranking items using distance-based learning from positive and unlabeled data.

problem Learning to rank items without an analytic description of what constitutes a good ranking.
method Combining representations using an integer linear program for ranking items based on nominations.
result The method is effective in simulation and real data examples, especially when supervision is light.

Characterizes metabelian distributions and geodesics in sub-Riemannian manifolds.

problem Characterizing metabelian distributions and geodesics in sub-Riemannian manifolds.
method Characterization of metabelian distributions in terms of principal bundle structures. Proof of geodesic properties for rank-2 distributions.
result For rank-2 metabelian distributions, geodesics are of class C1C^1.

This paper examines how skip connections prevent rank collapse in sequence models.

problem Rank collapse in sequence models, leading to reduced expressivity and training instabilities.
method Analytical and ablation studies of lambda-skip connections in SSMs.
result A sufficient condition to prevent rank collapse across various architectures.

Efficiently reduces rank of non-negative matrices with quadratic time complexity.

problem Efficiently reducing the rank of non-negative matrices.
method Formulated rank reduction as a mean-field approximation using a log-linear model.
result Optimal solution for minimizing KL divergence can be computed in closed form.

We propose the Legendrian web in a contact three manifold as a second order generalization of the planar web. An Abelian relation for a Legendrian web is analogously defined as an additive equation among the first integrals of its foliations. For a class of Legendrian d\, d-webs defined by simple second order ODE's, w…

2011-10-09abs ↗pdf ↗

In this paper, we introduce a new geometric description of the manifolds of matrices of fixed rank. The starting point is a geometric description of the Grassmann manifold Gr(Rk)\mathbb{G}_r(\mathbb{R}^k) of linear subspaces of dimension r<kr<k in Rk\mathbb{R}^k which avoids the use of equivalence classes. The set $\mathbb{…

2017-05-11abs ↗pdf ↗

We consider actions of non-compact simple Lie groups preserving an analytic rigid geometric structure of algebraic type on a compact manifold. The structure is not assumed to be unimodular, so an invariant measure may not exist. Ergodic stationary measures always exist, and when such a measure has full support, we show…

2007-08-06abs ↗pdf ↗

This paper enhances uplift modeling for multi-treatment marketing campaigns.

problem Optimizing marketing strategies by selecting individuals likely to respond to different treatments.
method Leveraging score ranking and calibration techniques.
result Improves overall performance of marketing campaigns.

Matrices of (approximate) low rank are pervasive in data science, appearing in recommender systems, movie preferences, topic models, medical records, and genomics. While there is a vast literature on how to exploit low rank structure in these datasets, there is less attention on explaining why the low rank structure ap…

2017-05-21abs ↗pdf ↗

Analytic torsion and Reidemeister torsion help show exponential growth of torsion in cohomology.

problem Exponential growth of torsion in the cohomology of arithmetic groups.
method Analytic torsion and Reidemeister torsion, applied to fibered cusp ends of manifolds.
result Exponential growth of torsion in the cohomology of arithmetic groups.

Study the distribution for low-rank matrix learning, improving inference methods.

problem Lack of understanding of underlying probability distributions in low-rank matrix learning.
method Analyze the distribution f(X)eλXf(X)\propto e^{-λ\Vert X\Vert_*}, using differential geometry to design an improved MCMC algorithm and learn penalty parameter λ.
result Improved MCMC algorithm and penalty parameter learning for low-rank Bayesian inference.

Paper tackles ranking items with a semi-random comparison graph and a monotone adversary.

problem Ranking items based on pairwise comparisons from a semi-random comparison graph with a monotone adversary.
method Developed a weighted maximum likelihood estimator (MLE) and an SDP-based approach to reweight the semi-random graph.
result Achieves near-optimal sample complexity, up to a log^2(n) factor, for identifying the top-K preferred items.

In this paper we continue our program of extending the methods of geometric scattering theory to encompass the analysis of the Laplacian on symmetric spaces of rank greater than one and their geometric perturbations. In our previous work we described the resolvent, and specifically the asymptotic behavior of the Green'…

2002-08-14abs ↗pdf ↗

An almost complex structure J on a 4-manifold X may be described in terms of a rank 2 vector bundle E. A splitting of J consists of a pair of line bundles spanning E. A hypersurface M in X satisfying a nondegeneracy condition inherits a CR-structure from J and a path geometry from the splitting. Using the Cartan-Kähler…

2012-02-06abs ↗pdf ↗

Using the thermodynamics formalism, we introduce a notion of intersection for projective Anosov representations, show analyticity results for the intersection and the entropy, and rigidity results for the intersection. We use the renormalized intersection to produce a Out(Γ)Out(Γ)-invariant Riemannian metric on the smooth …

2013-01-30abs ↗pdf ↗

Gradient descent solves rank-one matrix estimation problem with detailed time evolution analysis.

problem Estimating a rank-one symmetric matrix corrupted by noise.
method Gradient descent on a sphere, using local versions of the semi-circle law.
result Explicit formulas for the time evolution of the estimator and cost function, revealing phase transitions.

Study evaluates sustainability of European banks using a new model.

problem Lack of a framework to evaluate sustainability of banking business models.
method Delphi-Analytic Hierarchy Process method to develop and assess the model.
result Norwegian and German banks have higher sustainability of their business models.

The paper solves an insurance problem using mean-variance and rank-dependent utility theory.

problem Formulating and solving an insurance problem with rank-dependent utility and mean-variance premium principle.
method Formulated as a non-concave maximization problem, then turned into a concave quantile optimization problem, solved using calculus of variations.
result An optimal insurance contract is derived and numerically computed.

The total duration of drawdowns is shown to provide a moment-free, unbiased, efficient and robust estimator of Sharpe ratios both for Gaussian and heavy-tailed price returns. We then use this quantity to infer an analytic expression of the bias of moment-based Sharpe ratio estimators as a function of the return distrib…

2015-05-06abs ↗pdf ↗

Unified approach tackles high-dimensional tensor bandits with convex optimization and weakly decomposable regularizers.

problem Challenges in high-dimensional generalized tensor bandits where existing algorithms fail.
method Proposes a generalized linear tensor bandits algorithm with a unified analytical framework using convex optimization and weakly decomposable regularizers.
result Unified analytical framework provides better bounds and broader applicability compared to existing methods.

The theory of geometric zeta functions for locally symmetric spaces as initialized by Selberg and continued by numerous mathematicians is generalized to the case of higher rank spaces. We show analytic continuation, describe the divisor in terms of tangential cohomology and in terms of group cohomology which generalize…

1995-11-10abs ↗pdf ↗

New method ranks sectors and countries using local and aggregate I-O data.

problem Ranking sectors and countries in global value chains using incomplete I-O tables.
method Rank-11 approximation to I-O tables using local and aggregate information.
result Consistently good performance in reconstructing rankings of upstreamness and downstreamness.

Researchers compute determinants and torsions of Rumin complex in specific Lie group representations.

problem Computing determinants and torsions of Rumin complex in specific Lie group representations.
method Analyzing Schrodinger and generic representations of the (2,3,5) nilpotent Lie group.
result Computed the spectrum and zeta regularized determinant of Rumin differentials in Schrodinger representations and evaluated their alternating product in generic representations.

Estimating the dependences between random variables, and ranking them accordingly, is a prevalent problem in machine learning. Pursuing frequentist and information-theoretic approaches, we first show that the p-value and the mutual information can fail even in simplistic situations. We then propose two conditions for r…

2012-06-27abs ↗pdf ↗

The paper decomposes unsupervised learning's generalization error into model, data, and variance components.

problem Understanding the components of unsupervised learning's generalization error.
method Information-geometric decomposition of the Kullback-Leibler generalization error.
result The optimal rank in εε-PCA is the noise floor, balancing model-error gain and data-bias cost.

The germ of the universal isomonodromic deformation of a logarithmic connection on a stable n-pointed genus g curve always exists in the analytic category. The first part of this paper investigates under which conditions it is the analytic germification of an algebraic isomonodromic deformation. Up to some minor techni…

2016-12-17abs ↗pdf ↗