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

15304459 · Jun 202019922001200920172026
48 results for purpose

A multi-task model tackles citation purpose classification with limited data.

problem Classifying citations based on their purpose is challenging due to limited labeled data and subjectivity.
method Combines linguistic features, TF-IDF, and an LSTM-with-attention model for multi-task learning.
result Improves classification accuracy compared to single-task models.

We examine three methods of constructing correlated Student-tt random variables. Our motivation arises from simulations that utilise heavy-tailed distributions for the purposes of stress testing and economic capital calculations for financial institutions. We make several observations regarding the suitability of the …

2010-05-24abs ↗pdf ↗

One purpose of this article is to establish a general method to determine stability of totally geodesic submanifolds of symmetric spaces. The method is used to determine the stability of the basic totally geodesic submanifolds M+,MM_+,M_- introduced and studied by Chen and Nagano in [Totally geodesic submanifolds of symm…

2013-07-28abs ↗pdf ↗

We introduce the variational filtering EM algorithm, a simple, general-purpose method for performing variational inference in dynamical latent variable models using information from only past and present variables, i.e. filtering. The algorithm is derived from the variational objective in the filtering setting and cons…

2018-11-13abs ↗pdf ↗

CDFM aims to unify causal discovery across diverse datasets.

problem Fragmented, test-driven causal discovery approaches struggle with modern data heterogeneity.
method CDFM is a unified, general-purpose framework using a variational decomposition of causal mechanisms.
result CDFM outperforms traditional algorithms across diverse datasets.

Let P(M,G)P(M,G) be a principal fiber bundle and E(M,N,G,P)E(M,N,G,P) be an associate fiber bundle. Our interested is to study harmonic sections of the projection πEπ_{E} of EE into MM. Our first purpose is to give a stochastic characterization of harmonic section from MM into EE and a geometric characterization of harmonic se…

2009-12-15abs ↗pdf ↗

For an autonomous agent to fulfill a wide range of user-specified goals at test time, it must be able to learn broadly applicable and general-purpose skill repertoires. Furthermore, to provide the requisite level of generality, these skills must handle raw sensory input such as images. In this paper, we propose an algo…

2018-07-12abs ↗pdf ↗

The purpose of this article is to present the theory of higher order connections on vector bundles from a viewpoint inspired by projective differential geometry.

2009-08-11abs ↗pdf ↗

We propose a general-purpose approach to discovering active learning (AL) strategies from data. These strategies are transferable from one domain to another and can be used in conjunction with many machine learning models. To this end, we formalize the annotation process as a Markov decision process, design universal s…

2018-10-09abs ↗pdf ↗

For a knot KK, Kakimizu introduced a simplicial complex whose vertices are all the isotopy classes of minimal genus spanning surfaces for KK. The first purpose of this paper is to prove the 1-skeleton of this complex has diameter bounded by a function quadratic in knot genus, whenever KK is atoroidal. The second pur…

2007-01-17abs ↗pdf ↗

For an nn-dimensional polytope ΩΩ in Rn\mathbb{R}^{n}, we study lower bounds for eigenvalues of the Dirichlet eigenvalue problem of the Laplacian. In the asymptotic formula on the average of the first kk eigenvalues, Li and Yau (1983) obtained the first term with the order k2nk^{\frac2n}, which is optimal. The next l…

2012-08-26abs ↗pdf ↗

Neural networks predict shapes of first passage percolation sets.

problem Predicting the shape of first passage percolation sets.
method Used a neural network to predict the shape of the set of discovered sites from the distribution of passage times.
result Neural networks can quickly predict the shape of the set of discovered sites from the distribution of passage times.