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

199398597796 · Jun 202019922001200920172026
48 results for neural suff stats

We present results about financial market observables, specifically returns and traded volumes. They are obtained within the current nonextensive statistical mechanical framework based on the entropy Sq=k1i=1Wpiq1q(q)S_{q}=k\frac{1-\sum\limits_{i=1}^{W} p_{i} ^{q}}{1-q} (q\in \Re) ($S_{1} \equiv S_{BG}=-k\sum\limits_{i=1}^{W}p_{i} \l…

2006-01-31abs ↗pdf ↗

This article studies local and global inference for smoothing spline estimation in a unified asymptotic framework. We first introduce a new technical tool called functional Bahadur representation, which significantly generalizes the traditional Bahadur representation in parametric models, that is, Bahadur [Ann. Inst. S…

2012-12-30abs ↗pdf ↗

Neural Bayes simplifies computing complex stats for unsupervised learning.

problem Computing mutual information and optimal labeling of disjoint manifolds in unsupervised learning.
method Parameterization using neural networks to express statistical quantities in closed form.
result Neural Bayes enables efficient computation of mutual information and optimal labeling of disjoint manifolds.

Nowadays with a growing number of online controlling systems in the organization and also a high demand of monitoring and stats facilities that uses data streams to log and control their subsystems, data stream mining becomes more and more vital. Hoeffding Trees (also called Very Fast Decision Trees a.k.a. VFDT) as a B…

2019-02-10abs ↗pdf ↗

We introduce and discuss a nonlinear kinetic equation of Boltzmann type which describes the influence of knowledge in the evolution of wealth in a system of agents which interact through the binary trades introduced in Cordier, Pareschi, Toscani, J. Stat. Phys. 2005. The trades, which include both saving propensity and…

2014-01-18abs ↗pdf ↗

This paper simplifies computing higher-order UU-statistics efficiently.

problem The inefficiency of computing higher-order UU-statistics in practice.
method Decomposition, connection to Einstein summation, and treewidth-based complexity estimate.
result A new, more efficient algorithm to compute UU-statistics.

We present analytical investigations of a multiplicative stochastic process that models a simple investor dynamics in a random environment. The dynamics of the investor's budget, x(t)x(t), depends on the stochasticity of the return on investment, r(t)r(t), for which different model assumptions are discussed. The fat-tail d…

2007-09-23abs ↗pdf ↗

Study investigates how machine learning models degrade over time, leading to patient safety issues.

problem Overtime degradation of machine learning models in clinical settings.
method Used MIMIC-IV dataset to train models replicating commercial approaches, observing and analyzing degradation over a decade.
result An RNN model built on Epic features degrades from 0.729 AUC to 0.525 AUC over a decade, highlighting technical and clinical drift as root causes.

Sharp thresholds and contiguity for community detection in contextual SBM.

problem Community detection in graphs with high-dimensional node-covariates.
method Contextual Stochastic Block Model, non-rigorous cavity method, information theory.
result Established the sharp threshold for detection and weak recovery in the contextual SBM.

Spectral clustering is a technique that clusters elements using the top few eigenvectors of their (possibly normalized) similarity matrix. The quality of spectral clustering is closely tied to the convergence properties of these principal eigenvectors. This rate of convergence has been shown to be identical for both th…

2013-10-05abs ↗pdf ↗

In a recent paper in this journal [J. Stat. Mech. (2009) P02037] we proposed a new, physically motivated, distribution function for modeling individual incomes having its roots in the framework of the k-generalized statistical mechanics. The performance of the k-generalized distribution was checked against real data on…

2012-09-21abs ↗pdf ↗

Paper generalizes tensor-train approximation for complex random variables.

problem Characterizing intractable high-dimensional random variables.
method Extends inverse Rosenblatt transform to general reference measures and integrates into deep variable transformation framework.
result Deep inverse Rosenblatt transport significantly expands tensor approximations for complex random variables.

Localized sketching improves matrix multiplication and ridge regression complexity.

problem Efficiently approximate matrix multiplication and ridge regression with limited data availability.
method Localized sketching matrices for block diagonal structure, reducing sample complexity.
result Localized sketching achieves sample complexity matching global sketching methods.

A framework assesses the quality of crowdsourced weather data.

problem Quality control and assessment of crowdsourced weather data from third-party stations.
method Proposes a simple, scalable, and interpretable AI/Stats/ML framework to assess TPAWS data.
result Demonstrates the performance of the framework using synthetic and real data.

We find that when measured in terms of dollar-turnover, and once ββ-neutralised and Low-Vol neutralised, the Size Effect is alive and well. With a long term t-stat of 5.15.1, the "Cold-Minus-Hot" (CMH) anomaly is certainly not less significant than other well-known factors such as Value or Quality. As compared to marke…

2017-08-02abs ↗pdf ↗

agtboost speeds up gradient tree boosting with automatic complexity adjustment.

problem Speeding up and simplifying gradient tree boosting computations.
method Adaptive gradient tree boosting with automatic complexity adjustment and feature importance.
result Significant decrease in computation time and simplification of model complexity.

We establish the existence of anomalous excess returns based on trend following strategies across four asset classes (commodities, currencies, stock indices, bonds) and over very long time scales. We use for our studies both futures time series, that exist since 1960, and spot time series that allow us to go back to 18…

2014-04-12abs ↗pdf ↗

New framework identifies strongly identifiable models from flexible generators.

problem Indeterminacies in generative models that prevent unique latent codes.
method Theoretical framework for analyzing latent variable models, excluding certain indeterminacies.
result Strong identifiability possible even with flexible nonlinear generators.

MegazordNet combines stats and ML for better financial time series forecasting.

problem Forecasting financial time series is challenging due to its chaotic nature.
method MegazordNet integrates statistical features with a deep learning model.
result MegazordNet outperforms single statistical and machine learning methods in S&P 500 stock price prediction.

We develop an iterative subsampling approach to improve the computational efficiency of our previous work on solution path clustering (SPC). The SPC method achieves clustering by concave regularization on the pairwise distances between cluster centers. This clustering method has the important capability to recognize no…

2014-12-04abs ↗pdf ↗

The paper proves an energy identity for harmonic maps near singularities.

problem Analyzing the behavior of harmonic maps near singular points.
method Analyzes sequences of stationary harmonic maps with bounded energy, proving an energy identity near singularities.
result The energy density of the defect measure is the sum of the energies of the bubbling maps.

In this article, we study the regularity of minimizing and stationary pp-harmonic maps between Riemannian manifolds. The aim is obtaining Minkowski-type volume estimates on the singular set S(f)={x  s.t.  f is not continuous at x}S(f)=\{x \ \ s.t. \ \ f \text{ is not continuous at } x\}, as opposed to the weaker and non quantitative Hausdorff dimension bo…

2014-09-30abs ↗pdf ↗

We show that the emerging field of discrete differential geometry can be usefully brought to bear on crystallization problems. In particular, we give a simplified proof of the Heitmann-Radin crystallization theorem (R. C. Heitmann, C. Radin, J. Stat. Phys. 22, 281-287, 1980), which concerns a system of NN identical at…

2016-04-29abs ↗pdf ↗

Enhanced ECCD speeds up elastic net model training.

problem Efficiently solving generalized linear models with elastic net constraints.
method Redesigned cyclic coordinate descent with Taylor expansion and batched computations.
result Empirically shows consistent 3imes3 imes performance improvement over state-of-the-art solvers.

The paper analyzes covariate shift in nonparametric regression with Markovian data.

problem Covariate shift in regression problems with Markovian data.
method Extension of nonparametric convergence rates to Markovian dependence structures, using Hölder smoothness assumptions and similarity measures.
result Precise convergence rates for Nadaraya-Watson kernel estimators under specific Markovian conditions.

A new method ranks uncertainty vectors from multiple measures for robust prediction.

problem Single scalar measures of model reliability are insufficient for comprehensive uncertainty quantification.
method Optimal transport ranks vectors of uncertainty measures, supporting flexible fusion of aleatoric and epistemic uncertainties.
result The method provides a robust ranking of uncertainty that supports various downstream tasks.