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

95190285380 · Jun 202019922001200920172026
48 results for stochastic comparisons

New model for pairwise comparisons without stochastic transitivity.

problem Suboptimal performance of models assuming stochastic transitivity in real-world scenarios.
method Proposes a general family of statistical models using a skew-symmetric matrix.
result Achieves minimax-rate optimality and adapts to data sparsity.

The paper proves new comparison theorems for sub-Laplacian in foliations with minimal leaves.

problem Proving comparison theorems for sub-Laplacian in Riemannian foliations with minimal leaves.
method Using Riemannian foliations with minimal leaves, the paper proves comparison theorems for the sub-Laplacian.
result The comparison theorems yield a Bonnet-Myers type theorem, stochastic completeness, and Lipschitz regularization property for the sub-Riemannian semigroup.

We present a criterion for the stochastic completeness of a submanifold in terms of its distance to a hypersurface in the ambient space. This relies in a suitable version of the Hessian comparison theorem. In the sequel we apply a comparison principle with geometric barriers for establishing mean curvature estimates fo…

2013-07-10abs ↗pdf ↗

This paper optimizes the number of comparisons needed to find the best k items from pairwise comparisons.

problem Finding the best k items from pairwise comparisons with limited comparisons.
method Developed algorithms for finding probably approximately correct and exact best k items under stochastic conditions.
result Upper and lower bounds on the number of comparisons for finding the best k items, with matching upper bounds for PAC best k items.

We consider the problem of stochastic comparison of general Garch-like processes, for different parameters and different distributions of the innovations. We identify several stochastic orders that are propagated from the innovations to the Garch process itself, and discuss their interpretations. We focus on the convex…

2012-04-17abs ↗pdf ↗

Paper proposes a new method to compare classifiers across multiple datasets.

problem Comparing classifiers over multiple datasets with multiple criteria.
method Adopting decision theory, the paper introduces generalized stochastic dominance for ranking classifiers.
result Generalized stochastic dominance can be used to rank classifiers and statistically tested.

The paper develops a method to estimate consumer preferences from observed rankings.

problem Estimating consumer preferences from partial ranking information.
method Interpreting observed rankings as pairwise comparisons, modeling latent utility, and correcting for selection bias.
result The method improves recommendation performance, especially for previously unconsumed products.

This study compares SPX and VIX options and quantifies their relationship.

problem Understanding the relationship between SPX and VIX options markets.
method Uses moment formulas in a model-free approach to compare implied volatilities.
result SPX options reflect the extreme-strike asymptotics of VIX options and vice versa.

The paper compares three option pricing models with varying volatility dynamics.

problem Comparing the accuracy and efficiency of different option pricing models with changing volatility.
method Used stochastic volatility models including Heston and MSV, and compared them with existing models on 15 index option datasets.
result Stochastic volatility models achieve comparable accuracy to existing models and are faster to calibrate.

We prove spectral, stochastic and mean curvature estimates for complete mm-submanifolds φ ⁣:MN\varphi \colon M \to N of nn-manifolds with a pole NN in terms of the comparison isoperimetric ratio ImI_{m} and the extrinsic radius rφr_\varphi\leq \infty. Our proof holds for the bounded case rφ<r_\varphi< \infty, recovering …

2013-03-17abs ↗pdf ↗

New method compares classifiers using GSD-front, addressing statistical uncertainty and robustness.

problem Comparing classifiers with multiple quality metrics and statistical uncertainty.
method Proposes GSD-front and statistical tests for robust comparisons.
result Reliable method for comparing classifiers with statistical uncertainty and robustness.

We develop a new statistical test for comparing variables with varying scales.

problem Comparing variables with different scales in multidimensional spaces.
method Order based on expectations of random variables, generalized stochastic dominance (GSD) order, regularized statistical test, linear optimization, imprecise probability models.
result Validated through multidimensional data from various fields.

We extend the stochastic Perron method to analyze the framework of stochastic target games, in which one player tries to find a strategy such that the state process almost surely reaches a given target no matter which action is chosen by the other player. Within this framework, our method produces a viscosity sub-solut…

2014-08-28abs ↗pdf ↗

In this paper, we adapt stochastic Perron's method to analyze a stochastic target problem with unbounded controls in a jump diffusion set-up. With this method, we construct a viscosity sub-solution and super-solution to the associated Hamiltonian-Jacobi-Bellman (HJB) equations. Under comparison principles, uniqueness o…

2016-04-13abs ↗pdf ↗

Neural SVEs model complex systems with memory, outperforming traditional methods.

problem Modeling systems with memory effects and irregular behavior.
method Introducing neural stochastic Volterra equations as a physics-inspired architecture.
result Neural SVEs outperform neural SDEs and DeepONets in various applications.

Paper compares credit portfolio risks using robust Bernoulli mixture models.

problem Tackles risk bounds and comparison of credit portfolio losses.
method Uses Bernoulli mixture models with conditional independence and stochastic increasing defaults.
result Provides conditions for comparing conditional default probabilities and portfolio losses.

Logarithmic regret for continuous-time reinforcement learning.

problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.

SGLRW improves robustness of stochastic gradient MCMC methods.

problem Sensitivity to minibatch size and gradient noise in stochastic-gradient MCMC methods.
method Proposes Stochastic Gradient Lattice Random Walk (SGLRW) with lattice-based discretization.
result SGLRW remains stable in regimes where SGLD fails, including heavy-tailed gradient noise.

We develop a scalable method for Bayesian neural networks with stochastic differential equations.

problem Uncertainty quantification in deep neural networks.
method Gradient-based stochastic variational inference in continuous-depth Bayesian neural networks.
result Gradient estimator with zero variance as the approximation improves.

In this paper we are concerned with backward stochastic differential equations with random default time and their applications to default risk. The equations are driven by Brownian motion as well as a mutually independent martingale appearing in a defaultable setting. We show that these equations have unique solutions …

2009-10-12abs ↗pdf ↗

The paper analyzes SGD and its continuous counterpart, improving convergence rates and approximation results.

problem Theoretical analysis of convergence rates and approximation results for SGD and its continuous-time counterpart.
method Provable approximation of SGD recursion by solutions of a time inhomogeneous SDE, using Stein's method for batch noise, and new comparison techniques.
result Improved non-asymptotic bounds for SGD under weaker assumptions and finite-time convergence results.

Recent advances in stochastic gradient techniques have made it possible to estimate posterior distributions from large datasets via Markov Chain Monte Carlo (MCMC). However, when the target posterior is multimodal, mixing performance is often poor. This results in inadequate exploration of the posterior distribution. A…

2017-06-05abs ↗pdf ↗

We introduce and compare new variability measures based on risk quantiles.

problem Comparing variability measures in risk management.
method Developed a framework for one-parameter families of inter-Expected Shortfall differences and inter-expectile differences.
result Characterized symmetric and comonotonic variability measures as mixtures of inter-Expected Shortfall differences.

New method uses model comparison signals to improve LLM evaluation accuracy.

problem Limited benchmark sizes and model stochasticity in evaluating LLMs' mathematical reasoning.
method Combines standard labeled outcomes with model comparison signals to design a statistically efficient evaluation framework.
result Semiparametric estimator achieves the semiparametric efficiency bound and substantially improves ranking accuracy.

The thesis examines stochastic calculus in option pricing with logistic models and numerical methods.

problem Exploring the application of stochastic calculus in option pricing.
method Monte-Carlo Simulation and machine learning algorithms.
result Insights from Peter Carr and Lorenzo Torricelli's convex duality in continuous models.

In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator ff has quadratic growth in the zz-variable. In particular, we obtain existence, comparison, and stability results, and consider the opti…

2010-05-19abs ↗pdf ↗