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

Trend · papers per month

137275412549 · Jun 202019922001200920172026
48 results for literature analysis

LR-Robot automates SLRs with AI, expert oversight, and multidimensional analysis.

problem Efficient but contextually limited outputs from existing SLR frameworks.
method Human-in-the-loop process, structured knowledge sources, retrieval-augmented generation.
result Empirical demonstration of AI-driven literature synthesis in option pricing.

Lévy driven term structure models have become an important subject in the mathematical finance literature. This paper provides a comprehensive analysis of the Lévy driven Heath-Jarrow-Morton type term structure equation. This includes a full proof of existence and uniqueness in particular, which seems to have been lack…

2019-07-08abs ↗pdf ↗

We propose algorithms for online principal component analysis (PCA) and variance minimization for adaptive settings. Previous literature has focused on upper bounding the static adversarial regret, whose comparator is the optimal fixed action in hindsight. However, static regret is not an appropriate metric when the un…

2019-01-23abs ↗pdf ↗

This review assesses deep-learning methods for complex sequential data.

problem Lack of robustness and transparency in deep-learning frameworks for irregular sequential data.
method Systematic literature review of existing algorithms.
result Recurrent neural networks dominate in performance evaluation of deep-learning frameworks.

New method improves conditional covariance estimation using targeted groups of assets.

problem Improving conditional covariance estimation in financial time series.
method Introduces targeting in BEKK and DCC models for financial time series analysis.
result Encouraging results from empirical case study, especially with fewer assets.

Analyzes deep neural networks training errors with SGD and random init.

problem Lack of rigorous understanding of deep learning algorithms.
method Mathematical analysis of deep learning with SGD and random init.
result First full error analysis for deep learning with SGD and random init.

This paper reviews digital transformation research from 2011-2024, focusing on corporate finance.

problem Lack of systematic review in digital transformation from corporate finance perspective.
method Combines bibliometric and content analysis methods.
result Emerging and rapidly growing focus on digital transformation, particularly in developed countries.

We analyze conditional optimization problems arising in discrete time Principal-Agent problems of delegated portfolio optimization with linear contracts. Applying tools from Conditional Analysis we show that some results known in the literature for very specific instances of the problem carry over to translation invari…

2014-12-15abs ↗pdf ↗

Principal component regression (PCR) is a simple, but powerful and ubiquitously utilized method. Its effectiveness is well established when the covariates exhibit low-rank structure. However, its ability to handle settings with noisy, missing, and mixed-valued, i.e., discrete and continuous, covariates is not understoo…

2019-02-28abs ↗pdf ↗

This study investigates the content of the published scientific literature in the fields of operations research and management science (OR/MS) since the early 1950s. Our study is based on 80,757 published journal abstracts from 37 of the leading OR/MS journals. We have developed a topic model, using Latent Dirichlet Al…

2015-10-17abs ↗pdf ↗

Paper proposes a new method for exact recovery in robust tensor principal component analysis.

problem Exact recovery of low-rank and sparse components in tensors.
method Proposes a new method based on tensor-tensor product and t-SVD to solve a convex optimization problem.
result Exact recovery achieved in a deterministic fashion without randomness assumptions.

The paper addresses evaluating survival predictions using discrimination measures, finding a robust method to convert distributions to risks.

problem Evaluating survival distribution predictions with discrimination measures is challenging and often leads to unfair comparisons.
method The paper surveys existing methods and recommends summing over the predicted cumulative hazard as the most robust method to convert distributions to risks.
result Summing over the predicted cumulative hazard is the most robust method to convert distribution predictions to risk predictions.

Motivated by the supersymmetric extension of Liouville theory in the recent physics literature, we couple the standard Liouville functional with a spinor field term. The resulting functional is conformally invariant. We study geometric and analytic aspects of the resulting Euler-Lagrange equations, culminating in a blo…

2005-11-09abs ↗pdf ↗

New algorithm achieves near optimal sample complexity for 1-identification problem.

problem Determining if an arm's mean reward is at least a known threshold with high probability.
method Design of Sequential-Exploration-Exploitation (SEE) algorithm with non-asymptotic analysis.
result Achieves near optimality in sample complexity, matching upper and lower bounds up to a polynomial logarithmic factor.

New framework tackles high-dimensional reliability analysis using surrogate models and active subspaces.

problem High computational cost and curse of dimensionality in reliability analysis of high-dimensional systems.
method Sparse Active Subspace (SAS) algorithm for identifying low-dimensional manifolds and constructing efficient surrogate models.
result Proposed framework significantly improves accuracy and efficiency of reliability analysis compared to existing methods.

We study learning latent models with multi-instance weak supervision.

problem Learning latent models with multi-instance weak supervision.
method Formulated as multi-instance Partial Label Learning (multi-instance PLL), proposed a necessary and sufficient condition for learnability, derived Rademacher-style error bounds.
result First theoretical study of multi-instance PLL with unknown transition function, aligns with empirical results but highlights scalability issues.

The econophysics approach to socio-economic systems is based on the assumption of their complexity. Such assumption inevitably lead to another assumption, namely that underlying interconnections within socio-economic systems, particularly financial markets, are nonlinear, which is shown to be true even in mainstream ec…

2014-03-09abs ↗pdf ↗

Although stochastic approximation learning methods have been widely used in the machine learning literature for over 50 years, formal theoretical analyses of specific machine learning algorithms are less common because stochastic approximation theorems typically possess assumptions which are difficult to communicate an…

2014-12-18abs ↗pdf ↗

Sequential coordinate ascent is more robust in high-dimensional linear regression.

problem Behavior difference between sequential and parallel coordinate ascent in variational inference.
method Comparison of sequential and parallel coordinate ascent algorithms in high-dimensional linear regression.
result Sequential algorithm converges under more relaxed conditions than parallel algorithm.

The question of the optimality of Thompson Sampling for solving the stochastic multi-armed bandit problem had been open since 1933. In this paper we answer it positively for the case of Bernoulli rewards by providing the first finite-time analysis that matches the asymptotic rate given in the Lai and Robbins lower boun…

2012-05-18abs ↗pdf ↗

This study analyzes data science vocabulary changes over 13 years.

problem Understanding evolution of data science terms over time.
method Exploratory Data Analysis, Latent Semantic Analysis, Latent Dirichlet Analysis, N-grams Analysis.
result Identified new vocabulary and its incorporation into scientific literature.

Controlled interacting particle systems such as the ensemble Kalman filter (EnKF) and the feedback particle filter (FPF) are numerical algorithms to approximate the solution of the nonlinear filtering problem in continuous time. The distinguishing feature of these algorithms is that the Bayesian update step is implemen…

2019-10-05abs ↗pdf ↗

Networks are ubiquitous in science and have become a focal point for discussion in everyday life. Formal statistical models for the analysis of network data have emerged as a major topic of interest in diverse areas of study, and most of these involve a form of graphical representation. Probability models on graphs dat…

2009-12-29abs ↗pdf ↗

Study cosmic structures using Topological Data Analysis and Persistence Energy.

problem Investigate cosmic web evolution in ΛΛCDM cosmologies.
method Apply LITE method to embed persistence diagrams into vector spaces and analyze cosmic structures.
result Discover a correlation between Persistence Energy and redshift values.

In this paper we present a loss-based approach to change point analysis. In particular, we look at the problem from two perspectives. The first focuses on the definition of a prior when the number of change points is known a priori. The second contribution aims to estimate the number of change points by using a loss-ba…

2017-02-17abs ↗pdf ↗