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,695 papers · 148 categories

Trend · papers per month

591418 · May 202619922001200920172026
48 results for self-normalized martingales

New bounds on self-normalized martingales improve online linear regression performance.

problem Improving regret bounds in online linear regression.
method Characterizing scale-invariant bounds on self-normalized martingales.
result For d=1d=1, O(logT)O(\log T) doubly-uniform regret is possible; for d>1d>1, sublinear doubly-uniform regret is impossible.

The paper develops a method for self-normalized inference in adaptive experiments.

problem Adaptive experiments require a fixed horizon for ATE estimation, but propensities can change.
method The method uses self-normalized martingale limit theory to estimate ATE.
result The Studentized statistic is asymptotically N(0,1) at the prespecified horizon.

We provide a brief tutorial on the use of concentration inequalities as they apply to system identification of state-space parameters of linear time invariant systems, with a focus on the fully observed setting. We draw upon tools from the theories of large-deviations and self-normalized martingales, and provide both d…

2019-06-27abs ↗pdf ↗

Study improves self-normalized bounds for vector-valued processes beyond sub-Gaussianity.

problem Limited understanding of self-normalized concentration for vector-valued processes outside sub-Gaussian frameworks.
method Developed concentration inequalities for self-normalized processes with light tails (e.g., Bennett, Bernstein bounds) for vector-valued data.
result Provided new insights and bounds for self-normalized processes with non-sub-Gaussian distributions.

New algorithm reduces best-in-class regret in contextual bandits.

problem Compete with the best policy in a class without model restrictions.
method Proposes an algorithm that updates policies by minimizing a pessimistic objective, including a clipped inverse-propensity estimate and variance penalty.
result Achieves fast best-in-class regret rates, including polylogarithmic rates in the parametric case.

Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has therefore attracted significant attention in the theoretical and applied machine learning literature. In this paper, we analyze a recently pro…

2015-06-12abs ↗pdf ↗

This paper studies semiparametric contextual bandits, a generalization of the linear stochastic bandit problem where the reward for an action is modeled as a linear function of known action features confounded by an non-linear action-independent term. We design new algorithms that achieve O~(dT)\tilde{O}(d\sqrt{T}) regret …

2018-03-12abs ↗pdf ↗

New inequalities for matrix supermartingales converge under various conditions.

problem Convergence and maximal inequalities of supermartingales in positive semidefinite matrices.
method Developed new concentration inequalities for matrix supermartingales.
result New inequalities for matrix supermartingales under different tail conditions.

In this paper, we analyze the finite sample complexity of stochastic system identification using modern tools from machine learning and statistics. An unknown discrete-time linear system evolves over time under Gaussian noise without external inputs. The objective is to recover the system parameters as well as the Kalm…

2019-03-21abs ↗pdf ↗

The generalized linear bandit framework has attracted a lot of attention in recent years by extending the well-understood linear setting and allowing to model richer reward structures. It notably covers the logistic model, widely used when rewards are binary. For logistic bandits, the frequentist regret guarantees of e…

2020-02-18abs ↗pdf ↗

A new linear contextual bandit algorithm with improved regret bound.

problem Efficiently solving linear contextual bandit problems with reduced regret.
method Proposes a novel estimator embedded with exploration and a self-normalized bound.
result Regret bound matches lower bound of Ω(dT)Ω(\sqrt{dT}) up to logarithmic factors.

We improve bounds for stochastic processes, especially those with heavy tails.

problem Bounding the concentration of sub-ψψ processes with heavy tails.
method Variational approach to concentration, focusing on sub-Gaussian and other tail conditions.
result First dimension-free self-normalized empirical Bernstein inequality.

Self Normalizing Flows improve normalizing flows by reducing computational complexity.

problem Efficient gradient computation in normalizing flows, especially in Jacobian determinant terms.
method Introducing Self Normalizing Flows that replace expensive terms with learned approximate inverses.
result Models can be trained more quickly and perform better than functionally constrained counterparts.

A new method for evaluating and selecting policies in contextual bandits improves confidence intervals and policy quality.

problem Evaluating and selecting policies in contextual bandits with logged data.
method Self-normalized Importance Weighting (SN) estimator with Efron-Stein tail inequality and multiplicative bias control.
result The method provides tighter confidence intervals and better policy selection compared to competitors.

Deep Learning has revolutionized vision via convolutional neural networks (CNNs) and natural language processing via recurrent neural networks (RNNs). However, success stories of Deep Learning with standard feed-forward neural networks (FNNs) are rare. FNNs that perform well are typically shallow and, therefore cannot …

2017-06-08abs ↗pdf ↗

Extends martingale Schrödinger bridge to arbitrary dimensions and characterizes it.

problem Tackles the martingale Schrödinger bridge in arbitrary dimensions.
method Identifies continuous-time counterpart and relates to variational problems.
result Continuous martingale Schrödinger bridge coincides with Föllmer martingale in irreducible case.

Geometric Bass martingales linked to Brownian motion and geometric Brownian motion.

problem Modeling continuous martingales with prescribed initial and terminal distributions.
method Developed geometric Bass martingales and established their properties.
result Explicit bijection and representation of geometric Bass martingales.

Study finds optimal martingale coupling between two distributions with minimal entropy.

problem Finding the optimal martingale coupling between two distributions with minimal relative entropy.
method Solving a dual problem to find the log-density of the optimal coupling, which represents the marginal and martingale constraints.
result The log-density of the optimal coupling is given by a triplet of real functions representing the marginal and martingale constraints.

The paper studies projections of asset prices under equivalent martingale measures.

problem Understanding the impact of information on asset price bubbles and arbitrage opportunities.
method Analyzes optional projections of local martingales into a smaller filtration under equivalent martingale measures.
result Provides general results and specific examples like inverse Bessel process and stochastic volatility models.

Extends optimal transport to dynamic and martingale settings.

problem Dynamic and martingale relaxation of optimal transport problems.
method Extends Benamou-Brenier formula to weak optimal transport and introduces barycentric optimal transport.
result Relates barycentric optimal transport to martingale Benamou-Brenier formula.

We exhibit sufficient conditions such that components of a multidimensional SDE giving rise to a local martingale MM are strict local martingales or martingales. We assume that the equations have diffusion coefficients of the form σ(Mt,vt),σ(M_t,v_t), with vtv_t being a stochastic volatility term.

2019-03-06abs ↗pdf ↗

A strict local martingale is a local martingale which is not a martingale. There are few explicit examples of "naturally occurring" strict local martingales with jumps available in the literature. The purpose of this paper is to provide such examples, and to illustrate how they might arise via filtration shrinkage, a p…

2013-07-09abs ↗pdf ↗

In this paper, we obtain stability results for martingale representations in a very general framework. More specifically, we consider a sequence of martingales each adapted to its own filtration, and a sequence of random variables measurable with respect to those filtrations. We assume that the terminal values of the m…

2018-06-04abs ↗pdf ↗

In this paper we introduce the concept of conic martingales}. This class refers to stochastic processes having the martingale property, but that evolve within given (possibly time-dependent) boundaries. We first review some results about the martingale property of solution to driftless stochastic differential equations…

2016-03-24abs ↗pdf ↗

A concept of martingale-fair index of return, consistent with Arbitrage Free Pricing Theory, is introduced. An explicit formula for the average rate of return of a group of investment/pension funds in a discrete time stochastic model is derived and several properties of this index are shown. In particular, it is proven…

2015-01-15abs ↗pdf ↗

New method improves feature importance assessment in random forests.

problem Improving feature importance measures for random forests.
method Hypothesis testing via self-normalized feature-residual correlation test (FACT).
result The method provides theoretically justified feature importance tests with controlled type I error and appealing power.

We study strict local martingales via h-transforms, a method which first appeared in Delbaen-Schachermayer. We show that strict local martingales arise whenever there is a consistent family of change of measures where the two measures are not equivalent to one another. Several old and new strict local martingales are i…

2007-11-07abs ↗pdf ↗

The stochastic exponential Zt=exp{MtM0(1/2)<M,M>t}Z_t=\exp\{M_t-M_0-(1/2) <M,M>_t\} of a continuous local martingale MM is itself a continuous local martingale. We give a necessary and sufficient condition for the process ZZ to be a true martingale in the case where Mt=0tb(Yu)dWuM_t=\int_0^t b(Y_u)\,dW_u and YY is a one-dimensional diffusion drive…

2009-05-22abs ↗pdf ↗

Efficiently computes robust option prices using multi-marginal martingale transport.

problem Computing robust option prices under martingale constraints.
method Extending state space, sequential martingale structure, entropic regularisation.
result Fast computation of optimal solutions for large problems.