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

57113170226 · Jun 202019922001200920172026
48 results for Forward Sublinear Expectation

The paper addresses pricing interest rate derivatives in markets with volatility uncertainty.

problem Pricing interest rate derivatives under uncertainty about volatility.
method Modeling volatility uncertainty with G-Brownian motion and defining forward sublinear expectation.
result Developed robust pricing formulas for interest rate derivatives.

We provide a general construction of time-consistent sublinear expectations on the space of continuous paths. It yields the existence of the conditional G-expectation of a Borel-measurable (rather than quasi-continuous) random variable, a generalization of the random G-expectation, and an optional sampling theorem that…

2012-05-11abs ↗pdf ↗

Sublinear functionals of random variables are known as sublinear expectations; they are convex homogeneous functionals on infinite-dimensional linear spaces. We extend this concept for set-valued functionals defined on measurable set-valued functions (which form a nonlinear space), equivalently, on random closed sets. …

2019-03-12abs ↗pdf ↗

For α(1,2)α\in (1,2), we present a generalized central limit theorem for αα-stable random variables under sublinear expectation. The foundation of our proof is an interior regularity estimate for partial integro-differential equations (PIDEs). A classical generalized central limit theorem is recovered as a special case, p…

2014-09-28abs ↗pdf ↗

Paper generalizes extragradient methods for solving equations and inclusions with improved convergence rates.

problem Solving equations and inclusions using extragradient methods.
method Unified and generalized extragradient methods for a broader class of algorithms, analyzing sublinear convergence rates.
result Unified and improved convergence results for various extragradient variants.

We study the existence of optimal actions in a zero-sum game infτsupPEP[Xτ]\inf_τ\sup_PE^P[X_τ] between a stopper and a controller choosing a probability measure. This includes the optimal stopping problem infτE(Xτ)\inf_τ\mathcal{E}(X_τ) for a class of sublinear expectations E()\mathcal{E}(\cdot) such as the GG-expectation. We show that …

2012-12-10abs ↗pdf ↗

We construct a time-consistent sublinear expectation in the setting of volatility uncertainty. This mapping extends Peng's G-expectation by allowing the range of the volatility uncertainty to be stochastic. Our construction is purely probabilistic and based on an optimal control formulation with path-dependent control …

2010-09-11abs ↗pdf ↗

We consider dynamic sublinear expectations (i.e., time-consistent coherent risk measures) whose scenario sets consist of singular measures corresponding to a general form of volatility uncertainty. We derive a càdlàg nonlinear martingale which is also the value process of a superhedging problem. The superhedging strate…

2010-11-12abs ↗pdf ↗

Paper studies portfolio investment under volatility uncertainty and short-sale constraints, improving risk-adjusted returns.

problem Investment portfolio optimization under volatility uncertainty and short-sale constraints.
method Sublinear expectation model to handle volatility uncertainty, constructing SLE-MUV model.
result Pareto frontier of SLE-MUV model is a continuous convex curve with polynomial analytical expression.

This paper introduces an intermediary between conditional expectation and conditional sublinear expectation, called R-conditioning. The R-conditioning of a random-vector in L2L^2 is defined as the best L2L^2-estimate, given a σσ-subalgebra and a degree of model uncertainty. When the random vector represents the payoff…

2019-09-30abs ↗pdf ↗

For a finite function class we describe the large sample limit of the sequential Rademacher complexity in terms of the viscosity solution of a GG-heat equation. In the language of Peng's sublinear expectation theory, the same quantity equals to the expected value of the largest order statistics of a multidimensional $…

2016-05-11abs ↗pdf ↗

We study the problem of estimating the expected reward of the optimal policy in the stochastic disjoint linear bandit setting. We prove that for certain settings it is possible to obtain an accurate estimate of the optimal policy value even with a number of samples that is sublinear in the number that would be required…

2019-12-12abs ↗pdf ↗

Greedy algorithm achieves sublinear regret for various distributions.

problem Efficient performance of greedy algorithms in linear contextual bandit problems.
method Introduced Local Anti-Concentration (LAC) condition to ensure sublinear regret.
result Greedy algorithm achieves O(polylogT)O(\operatorname{poly} \log T) cumulative expected regret.

New framework guides resource usage to achieve sublinear regret in adversarial settings.

problem Achieving sublinear regret in online decision making with changing reward and cost distributions.
method General primal-dual methods guided by spending plans that ensure balanced resource usage.
result Achieves sublinear regret with respect to spending plans that balance resource usage.

New RL algorithm achieves sublinear regret and constraint violation without simulators.

problem Maximizing reward under utility constraints in large-scale systems.
method Model-free, simulator-free algorithm using LSVI-UCB with primal-dual optimization and soft-max policy.
result Achieves ildeO(d3H3T) ilde{\mathcal{O}}(\sqrt{d^3H^3T}) regret and ildeO(d3H3T) ilde{\mathcal{O}}(\sqrt{d^3H^3T}) constraint violation bounds.

A corrected EI acquisition function handles noisy observations in Bayesian optimization.

problem Noisy observations in Bayesian optimization.
method Proposes a modified expected improvement (EI) acquisition function that incorporates covariance information from the Gaussian Process model.
result Achieves a sublinear convergence rate on cumulative regret bound under heteroscedastic observation noise.

The paper shows how sublinear biLipschitz equivalences affect Morse boundaries of metric spaces.

problem Understanding how sublinear biLipschitz equivalences affect Morse boundaries of metric spaces.
method Defining sublinear biLipschitz equivalence and Morse boundaries, proving invariance under SBEs, using sublinear rays.
result κ-Morse boundaries of proper geodesic metric spaces are invariant under suitable sublinear biLipschitz equivalences.

Paper predicts high-frequency futures return directions using mean-uncertainty methods.

problem Data imbalance in short-term price movements of futures markets.
method Employed mean-uncertainty logistic regression and support vector machines under sublinear expectation framework.
result Mean-uncertainty approaches outperform conventional methods in classification metrics and average returns.

Algorithm maximizes revenue-risk by estimating price impact kernel and optimizing control problems.

problem Maximizing revenue-risk in a risky asset liquidation with unknown price impact.
method Alternates exploration and exploitation phases, uses novel kernel estimation and stability results.
result Sublinear regret achieved with high probability.

We present an adaptive approach to the construction of Gaussian process surrogates for Bayesian inference with expensive-to-evaluate forward models. Our method relies on the fully Bayesian approach to training Gaussian process models and utilizes the expected improvement idea from Bayesian global optimization. We adapt…

2018-09-27abs ↗pdf ↗

GP-PSRL achieves sublinear regret for continuous control with unbounded state space.

problem Analyzing regret bounds for GP-PSRL in continuous control with unbounded state space.
method Recursive application of Borell-Tsirelson-Ibragimov-Sudakov inequality and chaining method.
result Sublinear regret bound of O~(HγTT)\widetilde{\mathcal{O}}(H\sqrt{γ_TT}) for GP-PSRL.

Sublinear LSVI via LSH reduces runtime to sublinear in actions.

problem Efficiently estimating value functions in reinforcement learning with sublinear runtime.
method Formulated as approximate maximum inner product search, used LSH to solve with sublinear time complexity.
result Sublinear runtime while maintaining LSVI's regret.

The aim of this paper is to introduce the sublinear Higson corona and show that the sublinear Higson corona of Euclidean cone of P and X is decomposed into the product of P and that of X. Here P is a compact metric space and X is unbounded proper metric space. For example, the sublinear Higson corona of n-dimensional E…

2010-02-25abs ↗pdf ↗

We consider a multiobjective multiarmed bandit problem with lexicographically ordered objectives. In this problem, the goal of the learner is to select arms that are lexicographic optimal as much as possible without knowing the arm reward distributions beforehand. We capture this goal by defining a multidimensional for…

2019-07-26abs ↗pdf ↗

New variance-reduction methods solve stochastic composite inclusions.

problem Solving nonmonotone stochastic composite inclusions.
method Developed unbiased and biased variance-reduced estimators for FRBS method.
result Achieved best oracle complexities for finite-sum and expectation settings.

We give a proof of the sublinear tracking property for sample paths of random walks on various groups acting on spaces with hyperbolic-like properties. As an application, we prove sublinear tracking in Teichmueller distance for random walks on mapping class groups, and on Cayley graphs of a large class of finitely gene…

2012-10-27abs ↗pdf ↗

We derive an arbitrage free relationship between recovery swap rates, digital default swap spreads and conventional CDS spreads, and argue that the fair forward recovery rate used in recovery swaps must contain a convexity premium over the expected recovery value.

2010-01-05abs ↗pdf ↗

We study the non-stationary stochastic multiarmed bandit (MAB) problem and propose two generic algorithms, namely, the limited memory deterministic sequencing of exploration and exploitation (LM-DSEE) and the Sliding-Window Upper Confidence Bound# (SW-UCB#). We rigorously analyze these algorithms in abruptly-changing a…

2018-02-23abs ↗pdf ↗

This work creates a CS for non-negative heavy-tailed data with bounded mean.

problem Constructing a confidence sequence for non-negative heavy-tailed data with bounded mean.
method Non-parametric, non-asymptotic lower confidence sequence construction.
result The constructed CS is efficient and can be converted into a closed-interval CS.