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

69137206274 · May 202619922001200920172026
48 results for consistency checks

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.

Let (Xn,Xˇn)(X^n, \check{X}^n) be a mirror pair of an nn-dimensional complex torus XnX^n and its mirror partner Xˇn\check{X}^n. Then, a simple projectively flat bundle E(L,L)XnE(L,\mathcal{L})\rightarrow X^n is constructed from each affine Lagrangian submanifold LL in Xˇn\check{X}^n with a unitary local system $\mathcal{L} \righta…

2017-05-11abs ↗pdf ↗

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.

SANST uses self-attentive networks with spatial and temporal embeddings for better POI recommendations.

problem Next point-of-interest (POI) recommendation for users based on their history.
method SANST incorporates spatio-temporal patterns into self-attentive networks.
result SANST outperforms state-of-the-art models by up to 13.65% in nDCG@10.

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.

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 ↗

Paper proves conditions for estimating precision matrices with Laplacian constraints.

problem Estimating high-dimensional precision matrices with Laplacian constraints.
method Minimizing Stein's loss with conditions on graph connectivity and Laplacian constraints.
result High-dimensional consistency achieved with Laplacian constraints, independent of graph structure.

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.

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.

We study a Markov-Functional (MF) interest-rate model with Uncertain Volatility Displaced Diffusion (UVDD) digital mapping, which is consistent with the volatility-smile phenomenon observed in the option market. We first check the impact of pricing Bermudan swaptions by the model. Next, we also investigate the future s…

2014-04-24abs ↗pdf ↗

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 work analyzes the Gompertz-Pareto distribution (GPD) of personal income, formed by the combination of the Gompertz curve, representing the overwhelming majority of the economically less favorable part of the population of a country, and the Pareto power law, which describes its tiny richest part. Equations for the…

2010-10-11abs ↗pdf ↗

Efficiently checks local robustness in neural networks using geometric projections.

problem Ensuring robustness of neural networks against adversarial inputs.
method Systematic search for decision boundaries in convex polyhedral regions using geometric projections.
result Shows geometric projections can efficiently check robustness in neural networks.

Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product alg…

2014-05-25abs ↗pdf ↗

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.

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 ↗

Formalizes weak and strong verification for LLMs, controlling errors without assumptions.

problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.

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 ↗

PCS-UQ framework improves uncertainty quantification for machine learning models.

problem Ensuring trustworthy uncertainty quantification for machine learning models in high-stakes domains.
method PCS-UQ framework based on Predictability, Computability, and Stability principles, integrating prediction-checking, bootstrap samples, and multiplicative calibration.
result PCS-UQ maintains target coverage while outperforming or matching conformal methods in interval width and subgroup coverage.

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 ↗

This study analyzes how one-layer transformers learn regular language recognition tasks.

problem Understanding how one-layer transformers solve regular language recognition tasks like even pairs and parity check.
method Theoretical analysis of training dynamics and gradient descent for a one-layer transformer.
result A one-layer transformer can solve even pairs directly but needs CoT for parity check. Training phases show rapid growth in attention layer followed by logarithmic growth in linear layer.

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 ↗

Study how past radiation determines present matter in Penrose's cyclic cosmology.

problem Determining matter content in the present eon from past radiation in Penrose's cyclic cosmology.
method Solve Einstein's equations for a spherical wave in the past eon, then apply reciprocity to find the present eon's matter content.
result The present eon is filled with three types of radiation: a damped wave, an in-going wave, and randomly scattered waves.

Paper develops Euler scheme for fractional delay diff. eqs with additive noise.

problem Developing a consistent Euler-Maruyama scheme for fractional stochastic delay diff. eqs.
method Euler-Maruyama scheme for fractional Brownian motion with additive noise.
result Achieved convergence rate of H+1/2 for smooth delays when H>1/2.

We study the Yamabe invariants of cylindrical manifolds and compact orbifolds with a finite number of singularities, by means of conformal geometry and the Atiyah-Patodi-Singer L2L^2-index theory. For an nn-orbifold MM with singularities ΣΓ={(pˇ1,Γ1),...,(pˇs,Γs)}Σ_Γ = \{(\check{p}_1, Γ_1), ..., (\check{p}_s, Γ_s)\} (where each group $Γ_j<O…

2002-04-05abs ↗pdf ↗

For an immersed Lagrangian submanifold, let Aˇ\check{A} be the Lagrangian trace-free second fundamental form. In this note we consider the equation T=0\nabla^*T=0 on Lagrangian surfaces immersed in C2\mathbb{C}^2, where T=2(Aˇω)T=-2\nabla^*(\check{A}\lrcornerω), and we prove a gap theorem for the Whitney sphere as a solution …

2019-10-04abs ↗pdf ↗

The paper characterizes boundaries in Turaev-Viro TQFTs and Dijkgraaf-Witten theories.

problem Characterizing boundaries in Turaev-Viro TQFTs and Dijkgraaf-Witten theories.
method Identifying explicit boundary locality conditions and proving consistency with state sum models.
result Turaev-Viro and Dijkgraaf-Witten theories with boundary defects admit a state sum description.

In the framework of supervised classification (discrimination) for functional data, it is shown that the optimal classification rule can be explicitly obtained for a class of Gaussian processes with "triangular" covariance functions. This explicit knowledge has two practical consequences. First, the consistency of the …

2010-04-28abs ↗pdf ↗

AutoPC optimizes hyperparameters for the PC algorithm to improve its performance.

problem The unsupervised nature of the PC algorithm makes it difficult to tune the Type I αα level.
method AutoPC optimizes αα directly for a chosen metric and ensures stability through a second run.
result AutoPC consistently outperforms state-of-the-art methods across multiple metrics.

Constructing brane quantization for AnA_n-resolutions using SYZ mirror symmetry.

problem Quantizing branes on singular fibers using SYZ mirror symmetry.
method Constructing coisotropic A-branes and their mirrors via fiberwise geometric quantization.
result Establishing a mirror isomorphism between endomorphism algebras.

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.

We present FAKTA which is a unified framework that integrates various components of a fact checking process: document retrieval from media sources with various types of reliability, stance detection of documents with respect to given claims, evidence extraction, and linguistic analysis. FAKTA predicts the factuality of…

2019-06-07abs ↗pdf ↗

New dataset for industrial machine malfunction detection with domain shifts.

problem Challenges in detecting anomalies due to domain shifts in industrial sounds.
method Created a dataset with domain shifts for five types of industrial machines.
result Significant performance differences between source and target domains.

Model combination, often regarded as a key sub-field of ensemble learning, has been widely used in both academic research and industry applications. To facilitate this process, we propose and implement an easy-to-use Python toolkit, combo, to aggregate models and scores under various scenarios, including classification…

2019-09-21abs ↗pdf ↗