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

22446587 · May 202619922001200920172026
48 results for truncated moments

In the paper "On Truncated Variation of Brownian Motion with Drift" (Bull. Pol. Acad. Sci. Math. 56 (2008), no.4, 267 - 281) we defined truncated variation of Brownian motion with drift, Wt=Bt+μt,t0,W_t = B_t + μt, t\geq 0, where (Bt)(B_t) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…

2009-12-23abs ↗pdf ↗

The paper calculates moments and conditional risks for skewed elliptical distributions.

problem Estimating moments and tail conditional risks for skewed elliptical distributions.
method Derives explicit expressions for multivariate doubly truncated moments and conditional risks for generalized skew-elliptical distributions.
result Explicit formulas for multivariate doubly truncated moments and conditional risks are derived for various skewed elliptical distributions.

Completely random measures (CRM) represent the key building block of a wide variety of popular stochastic models and play a pivotal role in modern Bayesian Nonparametrics. A popular representation of CRMs as a random series with decreasing jumps is due to Ferguson and Klass (1972). This can immediately be turned into a…

2016-06-08abs ↗pdf ↗

We develop a scale-invariant truncated Lévy (STL) process to describe physical systems characterized by correlated stochastic variables. The STL process exhibits Lévy stability for the probability density, and hence shows scaling properties (as observed in empirical data); it has the advantage that all moments are fini…

1999-06-25abs ↗pdf ↗

We show how to compute lower bounds for the supremum Bayes error if the class-conditional distributions must satisfy moment constraints, where the supremum is with respect to the unknown class-conditional distributions. Our approach makes use of Curto and Fialkow's solutions for the truncated moment problem. The lower …

2011-05-15abs ↗pdf ↗

Optimal algorithm learns Gaussian under halfspace truncation with minimal samples.

problem Learning a Gaussian distribution truncated to an unknown halfspace.
method Efficient algorithm using n=ildeO(d2/ε2)n = ilde{O}(d^2/\varepsilon^2) samples and runtime dominated by empirical covariance matrix computation.
result Optimal sample and time complexity bounds for learning a Gaussian under halfspace truncation.

In recent studies the truncated Levy process (TLP) has been shown to be very promising for the modeling of financial dynamics. In contrast to the Levy process, the TLP has finite moments and can account for both the previously observed excess kurtosis at short timescales, along with the slow convergence to Gaussian at …

1997-10-20abs ↗pdf ↗

The COS method for European options pricing is improved with a new bound for the number of terms.

problem Determining the optimal number of terms in the COS method for accurate European option pricing.
method Using Fourier-cosine expansion, the study finds an explicit bound for the number of terms N in the cosine series approximation.
result The COS method achieves exponential convergence when the log-return density is smooth, but not when it has heavy tails.

We give a microscopic representation of the stock-market in which the microscopic agents are the individual traders and their capital. Their basic dynamics consists in the auto-catalysis of the individual capital and in the global competition/cooperation between the agents mediated by the total wealth invested in the s…

1998-03-30abs ↗pdf ↗

Paper tackles moment estimation under covariate shift with a two-stage algorithm.

problem Estimating moments under covariate shift when source and target distributions differ.
method Proposes a two-stage algorithm: first, an optimal estimator for the source distribution; second, likelihood ratio reweighting for calibration.
result Achieves minimax optimal bound for moment estimation.

The stochastic multi-armed bandit problem is well understood when the reward distributions are sub-Gaussian. In this paper we examine the bandit problem under the weaker assumption that the distributions have moments of order 1+ε, for some ε(0,1]ε\in (0,1]. Surprisingly, moments of order 2 (i.e., finite variance) are suffi…

2012-09-08abs ↗pdf ↗

We consider the problem of predicting as well as the best linear combination of d given functions in least squares regression, and variants of this problem including constraints on the parameters of the linear combination. When the input distribution is known, there already exists an algorithm having an expected excess…

2009-02-10abs ↗pdf ↗

Polynomial-time algorithm learns high-dimensional halfspaces without labels.

problem Learning high-dimensional halfspaces with margins in polynomial time.
method Contrastive moments and polynomial-time algorithm.
result Establishes the unique and efficient identifiability of the hidden halfspace.

The paper improves asset allocation using a skew-normal distribution in the Black-Litterman model.

problem Improving asset allocation under skewed return distributions.
method Using the Black-Litterman model with hidden truncation skew-normal distribution and Simaan's three-moment risk model.
result Optimal portfolios have less risk and higher skewness compared to classical BL model.

Unified method for calculating financial option prices from characteristic functions.

problem Calculating financial option prices from characteristic functions in high dimensions.
method Damped Fourier-cosine expansion (COS) method.
result The method converges exponentially if the characteristic function decays exponentially.

New method estimates tempered stable Lévy models with high accuracy.

problem Estimating volatility and jump intensity of tempered stable Lévy processes.
method Iterative method combining Truncated Realized Quadratic Variations and small-time approximations.
result Method outperforms existing alternatives in various scenarios.

We present an approximated maximum likelihood method for the multifractal random walk processes of [E. Bacry et al., Phys. Rev. E 64, 026103 (2001)]. The likelihood is computed using a Laplace approximation and a truncation in the dependency structure for the latent volatility. The procedure is implemented as a package…

2011-12-01abs ↗pdf ↗

New method estimates volatility for processes with jumps of unbounded variation.

problem Estimating volatility of processes with jumps of unbounded variation.
method Developed a new volatility estimator using debiasing of truncated realized quadratic variation.
result Method outperforms existing alternatives in simulations.

New method uses SDEs for accurate non-uniformly sampled time series analysis.

problem Characterizing non-uniformly sampled time series with high accuracy.
method Stochastic Differential Equations (SDEs) for modeling, incremental estimation, and model truncation.
result Increased accuracy in characterizing non-uniformly sampled time series.

Paper tackles heavy-tailed data without finite variance, proposing robust risk minimization.

problem Empirical risk minimization under heavy-tailed data with finite pp-th moment.
method Minimizes risk values robustly estimated via Catoni's method, using generalized generic chaining.
result Shows better performance of optimizer based on empirical risks via Catoni-style estimation.

Study robust linear regression without distributional assumptions for heavy-tailed responses.

problem Linear regression with heavy-tailed responses and no distributional assumptions.
method Combining truncated least squares, median-of-means, and aggregation theory to construct a non-linear estimator.
result Achieves excess risk of order d/nd/n with optimal sub-exponential tail.

New algorithms for stochastic linear bandits with heavy-tailed payoffs achieve nearly optimal regret.

problem Stochastic linear bandits with heavy-tailed payoffs.
method Median of means and dynamic truncation.
result Sublinear regret bound of O(d12T11+ε)O(d^{\frac{1}{2}}T^{\frac{1}{1+ε}}) for ε(0,1]ε\in(0,1].

The problem of an arbitrary truncated Levy flight description using the method of cumulant approach has been solved. The set of cumulants of the truncated Levy distribution given the assumption of arbitrary truncation has been found. The influence of truncation shape on the truncated Levy flight properties in the Gauss…

2010-06-12abs ↗pdf ↗

Exact simulation of correlated binary outcomes using PMF constraints and linear programming.

problem Simulating dependent Bernoulli outcomes with specific means and correlations.
method Formulate the problem over the joint Bernoulli PMF, impose constraints, and solve as a linear program. Use convex-hull characterization and truncated-moment completion scheme for feasibility and simulation.
result Exact simulation framework for correlated binary outcomes, providing a convex-hull characterization and truncated-moment completion scheme.

New method estimates volatility for Lévy processes with unbounded jumps efficiently.

problem Efficient estimation of volatility for Lévy processes with unbounded jumps.
method Developed a new estimator based on high-order expansions of truncated moments.
result Method outperforms existing alternatives in estimating volatility.

Study minimax regret in bilateral trade with heavy-tailed valuations.

problem Minimizing regret in bilateral trade with infinite variance valuations.
method Extended self-bounding property, truncated-mean estimation, epoch-based algorithm.
result Achieves regret bound of O(T12β(p1)/(βp+d(p1)))O(T^{1-2β(p-1)/(βp + d(p-1))}) under specific conditions.

Efficiently estimate Boolean product distribution parameters from truncated samples.

problem Estimating parameters of Boolean product distributions from truncated samples.
method Introducing fatness of truncation set, using membership queries, and adapting Stochastic Gradient Descent.
result Efficiently learn Boolean product distributions from truncated samples with small sample complexity.

We consider the structure functions S^(q)(T), i.e. the moments of order q of the increments X(t+T)-X(t) of the Foreign Exchange rate X(t) which give clear evidence of scaling (S^(q)(T)~T^z(q)). We demonstrate that the nonlinearity of the observed scaling exponent z(q) is incompatible with monofractal additive stochasti…

2001-02-21abs ↗pdf ↗

Improved regret bounds for adversarial linear contextual bandits.

problem Adversarial linear contextual bandits with changing loss functions.
method Truncated continuous exponential weights algorithm over the probability simplex, analyzing with linear bandit setting without contexts.
result Second-order bound of ildeO(KdVT) ilde O(K\sqrt{d V_T}) and first-order bound of ildeO(KdLT) ilde O(K\sqrt{d L_T^*}).

Non-negative matrix factorization (NMF) minimizes the Euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large e…

2019-06-02abs ↗pdf ↗

Paper proposes approximate Stein classes for efficient truncated density estimation.

problem Difficulties in estimating truncated density models due to intractable normalising constants and boundary conditions.
method Adapts score matching to solve the problem, introduces approximate Stein classes and a novel discrepancy measure, TKSD.
result TKSD does not require a fixed weighting function and can be evaluated using only boundary samples, leading to improved accuracy.