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

3777531,1301,506 · Jun 202019922001200920172026
48 results for statistical model checking

Statistical model checking for PCTL on MDPs using reinforcement learning.

problem Model checking PCTL specifications on MDPs with statistical methods.
method Reinforcement learning for policy search, statistical model checking with UCB-based Q-learning.
result Provably guaranteed statistical model checking method for PCTL specifications on MDPs.

This paper enhances privacy in statistical model checking of cyber-physical systems.

problem Privacy concerns in consumer-level applications due to statistical model checking.
method Proposes expected differential privacy and a new exponential mechanism for sequential algorithms.
result Demonstrates a novel mechanism to preserve privacy in statistical model checking.

SMC analysis reveals key transient effects in macroeconomic ABM.

problem Analysis of complex ABMs is challenging and often relies on ad hoc methods.
method Statistical model checking (SMC) implemented through MultiVeStA.
result Clear contrast across parameter families in macro-financial and structural sweeps.

Reliability is a critical consideration to DL-based systems. But the statistical nature of DL makes it quite vulnerable to invalid inputs, i.e., those cases that are not considered in the training phase of a DL model. This paper proposes to perform data sanity check to identify invalid inputs, so as to enhance the reli…

2019-09-06abs ↗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 ↗

New research shows calibration error is flawed when dealing with model uncertainty.

problem Current model evaluation techniques conflate model uncertainty with aleatoric uncertainty.
method Posterior predictive checks to evaluate deep learning models.
result Calibration error and variants are incorrect when model uncertainty is present.

Proposes a new method to improve Bayesian computation accuracy using flexible classification.

problem Bayesian computations accuracy check using rank-based simulation-based calibration has limitations.
method Replaces marginal rank test with a flexible classification approach that learns from data.
result Improves statistical power and provides an interpretable divergence measure of miscalibration.

Scalable model checking for stochastic systems using Gaussian Processes and Bayesian Neural Networks.

problem Efficiently verifying properties of stochastic systems with high-dimensional parameter spaces.
method Stochastic Variational Smoothed Model Checking (SV-smMC) using Gaussian Processes and Bayesian Neural Networks.
result SV-smMC scales to larger datasets and enables application to high-dimensional parameter spaces.

This study compares deep learning and statistical models for stock price forecasting.

problem Accurate stock price prediction is challenging due to market volatility.
method Used deep learning (LSTM, RNN, CNN, FULL CNN) and statistical models (ARIMA, Moving Averages) on S&P 500 data.
result LSTM model showed the lowest Mean Absolute Error (MAE), indicating highest accuracy.

New model corrects bias in crowdsourced ratings for diverse items.

problem Bias and noise in crowdsourced ratings for training data.
method Bayesian rating model with item-level effects for difficulty, discriminativeness, and guessability.
result New model avoids bias in training data, improving model goodness of fit.

Two statistical tasks are shown to have equivalent sample complexity.

problem Determining if a function depends on only a few variables and identifying those variables.
method Proved statistical equivalence of feature selection and junta testing through sample complexity analysis.
result Brute-force algorithm is sample-optimal for both tasks with optimal sample size.

We give a definition of an integer-valued function iαixi\sum_i α_i x ^*_i derived from arrow diagrams for the ambient isotopy classes of oriented spherical curves. Then, we introduce certain elements of the free Z\mathbb{Z}-module generated by the arrow diagrams with at most ll arrows, called relators of Type~($\check{…

2019-08-16abs ↗pdf ↗

New method improves spatial prediction validation accuracy.

problem Validation methods fail for spatial prediction tasks due to mismatch between validation and test locations.
method Proposes a new validation method that adapts existing covariate-shift ideas to spatial settings.
result Proves and demonstrates the new method's superiority in spatial prediction validation.

Time-aware fact-checking improves veracity predictions for time-sensitive claims.

problem Fact-checking decisions should consider temporal information of claims and evidence.
method Investigated four temporal ranking methods to optimize evidence ranking for fact-checking models.
result Time-aware evidence ranking surpasses relevance assumptions and improves veracity predictions for time-sensitive claims.

This paper deforms complex tori and their mirrors using gerbes.

problem Deforming complex tori and their mirror partners.
method Using flat gerbes to deform complex tori and their mirrors, constructing holomorphic line bundles over deformed objects.
result Deformed complex tori and their mirrors can be studied using flat gerbes.

We propose a 4-factor model for overnight returns and give explicit definitions of our 4 factors. Long horizon fundamental factors such as value and growth lack predictive power for overnight (or similar short horizon) returns and are not included. All 4 factors are constructed based on intraday price and volume data a…

2014-10-21abs ↗pdf ↗

Validates economic scenarios using statistical tests on stochastic processes.

problem Ensuring the accuracy of real-world economic scenario models.
method Applies Chevyrev and Oberhauser's (2022) signature and maximum mean distance test to various stochastic processes.
result Demonstrates the test's effectiveness across different path properties relevant to financial modeling.

New method evaluates language model forecasters by checking consistency of predictions.

problem Evaluating the performance of language model forecasters is difficult due to lack of ground truth.
method Developed a consistency check framework based on arbitrage to evaluate forecasters.
result Consistency metrics correlate with ground truth performance of LLM forecasters.

The paper proposes a method to evaluate superhuman models by checking for logical inconsistencies.

problem Evaluating superhuman models when ground truth is hard to obtain.
method A framework using consistency checks to identify logical inconsistencies in model decisions.
result Logical inconsistencies can be discovered in superhuman model decisions across various tasks.

Geometric regularisation improves statistical models by avoiding degeneracy loci.

problem Non-identifiability, singular information, and moment indeterminacy in statistical models.
method Develops the geometric regularisation of distribution-kernel pairs (T,φ)(T, \varphi) using Whitney, Thom, and Mather theorems.
result Finite-dimensional weak transversality theorem for generic kernels, avoiding degeneracy strata of high codimension.

The chapter improves deep learning models by interpreting and improving their performance.

problem Deep learning models often lack interpretability, leading to poor understanding of their predictions.
method The approach involves attributing importance to features and feature groups, including interactions, to improve model performance.
result The proposed attributions provide insights across various domains and can be used to improve model generalization.

Improves neural network estimates using IFs without needing more data.

problem Bias and lack of flexibility in neural network models.
method MultiNet and MultiStep methods using Influence Functions.
result Improves model robustness and facilitates statistical inference without additional data.

Develops a measure for checking cluster quality using multinomial distribution.

problem Determining the true number of clusters in a sample.
method Applying multinomial distribution to distances of data members from their cluster representatives.
result Demonstrates the capability to identify if a sample has inherent clusters.

New method simplifies checking consistency of differentiable loss functions.

problem Verifying consistency of differentiable loss functions is difficult.
method Developed a new approach called strong indirect elicitation (strong IE) to simplify checking consistency.
result Strong IE is equivalent to calibration for strongly convex, differentiable surrogates.

The paper defines and analyzes α\alpha-connections in generalized geometry.

problem Characterizing and analyzing α\alpha-connections in generalized geometry.
method Defining α\alpha-connections by pairs of generalized dual quasi-statistical connections and studying their curvature, Ricci curvature, and scalar curvature.
result Conditions for ^\hat \nabla^* to be an equiaffine connection and properties of conjugate Ricci-symmetric manifolds.

Proves SYZ mirror symmetry for del Pezzo and rational elliptic surfaces.

problem Proving mirror symmetry for specific Calabi-Yau surfaces.
method Adapting Hein's work, constructing asymptotically semi-flat Calabi-Yau metrics, and defining a mirror map.
result Existence and uniqueness of Calabi-Yau metrics on YDY\setminus D.

LLMs fail to match statistical ground truth despite stable run-to-run performance.

problem LLMs lack validation against statistical ground truth in automated scientific workflows.
method Introduced a behavioral evaluation framework for LLMs, separating four decision-making dimensions.
result LLMs can exhibit near-perfect stability but diverge from statistical ground truth.

Proposes a copula-based filter for diabetes risk prediction.

problem Feature selection for robust and interpretable predictive modeling in medicine, especially for extreme patient strata.
method Copula-based supervised filter using Gumbel-copula implied upper-tail concordance score (lambda U).
result The proposed filter outperforms standard filters and provides clinically coherent predictors.

We describe the infinitesimal moduli space of pairs (Y,V)(Y, V) where YY is a manifold with G2G_2 holonomy, and VV is a vector bundle on YY with an instanton connection. These structures arise in connection to the moduli space of heterotic string compactifications on compact and non-compact seven dimensional spaces, e.…

2016-07-12abs ↗pdf ↗

By the SYZ construction, a mirror pair (X,Xˇ)(X,\check{X}) of a complex torus XX and a mirror partner Xˇ\check{X} of the complex torus XX is described as the special Lagrangian torus fibrations XBX \rightarrow B and XˇB\check{X} \rightarrow B on the same base space BB. Then, by the SYZ transform, we can construct a simpl…

2019-05-02abs ↗pdf ↗

We prove the following result announced in Todorov and Valov: Any homogeneous, metric ANRANR-continuum is a VGnV^n_G-continuum provided dimGX=n1\dim_GX=n\geq 1 and Hˇn(X;G)0\check{H}^n(X;G)\neq 0, where GG is a principal ideal domain. This implies that any homogeneous nn-dimensional metric ANRANR-continuum with $\check{H}^n(X;G)\neq…

2012-08-31abs ↗pdf ↗

We consider rules for discarding predictors in lasso regression and related problems, for computational efficiency. El Ghaoui et al (2010) propose "SAFE" rules that guarantee that a coefficient will be zero in the solution, based on the inner products of each predictor with the outcome. In this paper we propose strong …

2010-11-09abs ↗pdf ↗

We specify a result of Yokoi \cite{yo} by proving that if GG is an abelian group and XX is a homogeneous metric ANRANR compactum with dimGX=n\dim_GX=n and Hˇn(X;G)0\check{H}^n(X;G)\neq 0, then XX is an (n,G)(n,G)-bubble. This implies that any such space XX has the following properties: Hˇn1(A;G)0\check{H}^{n-1}(A;G)\neq 0 for every closed…

2014-03-18abs ↗pdf ↗

Bayesian methods detect significant IIA violations in similarity choice data.

problem Detecting IIA violations in similarity choice data complicates classical models.
method Proposed two statistical methods: classical goodness-of-fit test and Bayesian PPC.
result Significant IIA violations confirmed in both datasets, driven by context effects.