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

92183275366 · Jun 202019922001200920172026
48 results for numerical understanding

Paper introduces NumLLM for better financial text understanding with numeric variables.

problem Poor performance of existing financial large language models in numeric financial text.
method Constructed financial corpus, fine-tuned with LoRA modules, merged into foundation model.
result NumLLM achieves best performance on financial question-answering benchmark, especially with numeric questions.

A Neural Network (NN) based numerical method is formulated and implemented for solving Boundary Value Problems (BVPs) and numerical results are presented to validate this method by solving Laplace equation with Dirichlet boundary condition and Poisson's equation with mixed boundary conditions. The principal advantage o…

2019-09-24abs ↗pdf ↗

Improved financial sentiment analysis using simple instruction tuning of LLMs.

problem Lack of accurate financial sentiment analysis by large language models.
method Instruction tuning of general-purpose LLMs with a small portion of financial sentiment data.
result Significant improvement in financial sentiment analysis, especially in complex scenarios.

This paper compares analytical and numerical solutions of the Black-Scholes model.

problem Comparing analytical and numerical methods for solving the Black-Scholes model.
method Analytical solution (variable separation) and numerical solution (finite differences) of the Black-Scholes equation.
result Numerical solutions provide more accurate results for complex scenarios.

Method extracts governing laws from non-Gaussian stochastic systems data.

problem Modeling complex dynamics with non-Gaussian Lévy noise.
method Data-driven method to extract stochastic dynamical systems from noisy data.
result Established a theoretical framework and numerical algorithm to compute Lévy jump measure, drift, and diffusion.

We give an overview of the constrained Willmore problem and address some conjectures arising from partial results and numerical experiments. Ramifications of these conjectures would lead to a deeper understanding of the Willmore functional over conformal immersions from compact surfaces.

2017-05-09abs ↗pdf ↗

The power of neural networks lies in their ability to generalize to unseen data, yet the underlying reasons for this phenomenon remain elusive. Numerous rigorous attempts have been made to explain generalization, but available bounds are still quite loose, and analysis does not always lead to true understanding. The go…

2019-06-07abs ↗pdf ↗

This paper simplifies ANS for statisticians, making it easier to use.

problem Statisticians struggle to understand ANS and its versatility.
method Present ANS from a latent variable model perspective and guide step-by-step implementation.
result Made ANS more accessible for statisticians through a Python implementation and library.

Financial markets provide a natural quantitative lab for understanding some of the most advanced human behaviours. Among them is the use of mathematical tools known as financial instruments. Besides money, the two most fundamental financial instruments are bonds and equities. More than 30 years ago Mehra and Prescott f…

2015-07-26abs ↗pdf ↗

Linear models can grok without understanding, improving generalization.

problem Understanding the phenomenon of grokking in linear models.
method Analytical and numerical derivation of training and generalization dynamics in linear networks.
result Grokking can occur in linear networks without reaching understanding, and its timing depends on various parameters.

Understanding optimal prompts for binary sequence predictors is challenging.

problem Finding good prompts for binary sequence predictors is difficult.
method Viewing prompting as finding the best conditioning sequence on a near-optimal sequence predictor, using empirical and statistical analysis.
result Optimal prompts can be better understood given the pretraining distribution, which is not usually available.

Researchers improve transformer networks' optimization and understanding.

problem Improving the understanding and optimization of transformer networks.
method Introducing a convex alternative to the self-attention mechanism and reformulating the training problem as a convex optimization problem.
result Revealed an implicit regularization mechanism that promotes sparsity across tokens.

This masters thesis reviews bundle gerbe theory and the well-known basic bundle gerbe over SU(n). We introduce the cup product bundle gerbe, and show it is stably isomorphic to the pullback of the basic bundle gerbe by the Weyl map. This result enriches our understanding of the basic bundle gerbe, which has numerous ap…

2019-10-03abs ↗pdf ↗

Meta learning works well with overparameterized models, a phenomenon called 'benign overfitting'.

problem Understanding why overparameterized models perform well in few-shot learning.
method Analyzed the generalization performance of gradient-based meta learning with an overparameterized meta linear regression model.
result Demonstrated that overparameterized meta learning can still generalize well, a phenomenon called 'benign overfitting'.

We consider the numerical stability of the parameter recovery problem in Linear Structural Equation Model ($\LSEM$) of causal inference. A long line of work starting from Wright (1920) has focused on understanding which sub-classes of $\LSEM$ allow for efficient parameter recovery. Despite decades of study, this questi…

2019-05-16abs ↗pdf ↗

This paper tackles Bayesian system identification with probabilistic numerical methods.

problem Accurately modeling nonlinear dynamic systems from noisy data.
method Probabilistic Sequential Monte Carlo (SMC) combined with probabilistic numerical integration.
result Efficient identification of latent states and system parameters from noisy measurements.

Introduces Gaussian Processes and Relevance Vector Machines, connecting them to Kalman filtering.

problem Regression, smoothing, interpolation, and filtering problems.
method Bayesian kernel-based methods, Gaussian Processes, Relevance Vector Machines, connections to Kalman filtering.
result Developed a common framework for understanding these methods.

Machine learning models predict the behavior of negatively buoyant jets from wastewater.

problem Minimizing harmful effects of negatively buoyant jets during wastewater discharge.
method Training machine learning models (ANN, XGBoost, CatBoost, LightGBM) on OpenFOAM simulations and experimental data.
result Artificial Neural Network provided the best prediction with R2 0.98 and RMSE 0.28.

Enhances SDR via Hellinger correlation for better data dependency understanding.

problem Improving sufficient dimension reduction in single-index models.
method Developed a new method using Hellinger correlation for detecting the dimension reduction subspace.
result Significantly enhances and outperforms existing SDR methods through deeper data dependency understanding.

SAGE quantifies feature importance in machine learning models.

problem Understanding the role of individual features in complex models.
method Formalizing predictive power through model-based and universal measures, and introducing SAGE for efficient calculation.
result SAGE assigns more accurate feature importance values than other methods.

We introduce the new "Goldilocks" class of activation functions, which non-linearly deform the input signal only locally when the input signal is in the appropriate range. The small local deformation of the signal enables better understanding of how and why the signal is transformed through the layers. Numerical result…

2020-02-11abs ↗pdf ↗

We present a new methodology of computing incremental contribution for performance ratios for portfolio like Sharpe, Treynor, Calmar or Sterling ratios. Using Euler's homogeneous function theorem, we are able to decompose these performance ratios as a linear combination of individual modified performance ratios. This a…

2018-07-13abs ↗pdf ↗

Quantum reservoir computing needs coherence influx for effective information processing.

problem Understanding and optimizing quantum reservoir computing.
method Theoretical and numerical analysis of quantum systems, focusing on coherence influx and spectral radius of Pauli transfer matrix.
result Coherence influx is essential for realizing nonstationary echo state property in quantum reservoir computing.

Humans gain an implicit understanding of physical laws through observing and interacting with the world. Endowing an autonomous agent with an understanding of physical laws through experience and observation is seldom practical: we should seek alternatives. Fortunately, many of the laws of behaviour of the physical wor…

2018-12-04abs ↗pdf ↗

Theoretical framework for neural network compression using sparsity norms.

problem Understanding and quantifying compressibility and accuracy trade-offs in neural networks.
method Using sparsity-sensitive ℓ_q-norm to characterize compressibility and developing adaptive pruning algorithms.
result Theoretical relationship between network sparsity and compressibility with controlled accuracy degradation.

Improves understanding of neural network predictions using influence functions.

problem Challenges in understanding neural network predictions.
method Utilized NTK theory to calculate influence functions for over-parameterized neural networks.
result Proved that the approximation error of IF can be arbitrarily small in the over-parameterized regime.

This article reviews mathematical insights into neural networks and machine learning.

problem Understanding the success and subtleties of neural network-based machine learning.
method Rigorous mathematical analysis, numerical experiments, and simplified models.
result Identification of open problems in the field.

Generative Adversarial Networks (GANs) have become a powerful framework to learn generative models that arise across a wide variety of domains. While there has been a recent surge in the development of numerous GAN architectures with distinct optimization metrics, we are still lacking in our understanding on how far aw…

2019-02-25abs ↗pdf ↗

New method reduces PDE surrogate model training costs by selectively acquiring time steps.

problem High computational cost of generating training data for PDE surrogate models.
method STAP (Selective Time-Step Acquisition for PDEs) framework that acquires only important time steps.
result Demonstrated effectiveness on several benchmark PDEs, reducing training costs.

This study uses continuous-time analysis to understand how momentum affects the optimisation of diagonal linear networks.

problem The effect of momentum on the optimisation trajectory of gradient descent.
method Leveraging a continuous-time approach to analyze momentum gradient descent with step size γ and momentum parameter β.
result Small values of λ help recover sparse solutions in overparametrised regression settings.

Graph connection Laplacian (GCL) is a modern data analysis technique that is starting to be applied for the analysis of high dimensional and massive datasets. Motivated by this technique, we study matrices that are akin to the ones appearing in the null case of GCL, i.e the case where there is no structure in the datas…

2013-10-01abs ↗pdf ↗

In this paper, we propose and study a Nyström based approach to efficient large scale kernel principal component analysis (PCA). The latter is a natural nonlinear extension of classical PCA based on considering a nonlinear feature map or the corresponding kernel. Like other kernel approaches, kernel PCA enjoys good mat…

2019-07-11abs ↗pdf ↗

This is a brief survey of the research performed by Grandata Labs in collaboration with numerous academic groups around the world on the topic of human mobility. A driving theme in these projects is to use and improve Data Science techniques to understand mobility, as it can be observed through the lens of mobile phone…

2018-12-03abs ↗pdf ↗