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

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Exponentially Weighted Signature

Introduces Exponentially Weighted Signature for better path representation.

problem Uniform treatment of historical information in signatures.
method Generalizes EFM signature to bounded linear operators, enabling contextualised temporal weighting.
result EWS is the unique solution to a linear controlled differential equation and generalizes state-space models.

Signature volatility models are analyzed for existence, arbitrage, completeness, and hedging-error decomposition.

problem Existence, arbitrage, completeness, and hedging-error decomposition of signature volatility models.
method Global existence and uniqueness of strong solutions, asset-pricing, market completeness, and hedging-error decomposition derived through structural results.
result Signature volatility models are structurally sound with existence, arbitrage, completeness, and hedging-error decomposition.

This paper develops a path-first theory using signatures and jump lifts for self-exiting processes.

problem Developing a universal coordinate system for various types of paths and processes.
method Using signatures, jump lifts, and expected signatures, the paper presents a geometricity framework with algebraic properties and obstructions.
result The framework links various mathematical concepts and offers four main contributions to understanding and modeling self-exiting processes.

Volterra signature provides a clear, interpretable feature for history-dependent systems.

problem Learning from non-Markovian time series with implicit memory mechanisms.
method Develops Volterra signature as a tensor algebra representation weighted by a temporal kernel, proving injectivity and universal approximation.
result Volterra signature leads to linear functionals and universal approximation, improving dynamic learning tasks.

Functional input neural networks approximate continuous functions on weighted spaces.

problem Approximating continuous functions on infinite-dimensional weighted spaces.
method Additive family mapping, non-linear activation, linear readouts, Stone-Weierstrass theorem.
result Global universal approximation of continuous functions on weighted spaces.

We compute the average Tristram---Levine signature of any graph link with positive weights in a three sphere, generalizing the results of Kirby and Melvin. The main tools are the Neumann's algorithm for computing the equivariant signatures of graph links and the Reciprocity Law for Dedekind sums.

2013-05-07abs ↗pdf ↗

A new neural network model reduces features in high-dimensional sequential data.

problem Exponential growth in features of truncated signature transform in high-dimensional data.
method Proposes a neural network model inspired by Convolutional Neural Networks to address feature growth.
result Reduces the number of features efficiently in a data-dependent way.

Reconstructing signature features from randomized vector fields in differential equations.

problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.

Researchers develop Malliavin calculus for signatures, simplifying option Greeks computation.

problem Lack of tractability and explicit representations in Malliavin calculus.
method Focus on finite linear combinations of time-extended Brownian motion signatures, derive explicit formulas for Malliavin derivative, and compute Greeks for path-dependent options.
result Closed-form expressions for classical operators of Malliavin calculus, providing algebraic formulations.

Universal approximation for stochastic processes using Brownian motion.

problem Approximating stochastic processes with linear functionals.
method Establishing LpL^p-type universal approximation theorems for rough path spaces.
result Linear functionals on the signature of time-extended Brownian motion can approximate any pp-integrable stochastic process.

Generative model prices basket options efficiently.

problem Real-time pricing of basket options with varying market inputs.
method Truncated path signatures and Mixture Density Networks (MDN) for learning the terminal density.
result The model produces small pricing errors and matches Monte Carlo simulations closely.

Researchers extend asymptotic analysis to Bergman projections with Gevrey weights.

problem Analyzing Bergman projections with Gevrey weights.
method Extending direct approach to semiclassical asymptotics to Gevrey weights using Fourier integral operators.
result Gevrey symbol amplitude of asymptotic Bergman projection with Gevrey weights and Gevrey-type growth rate.

A new VWAP execution method using transformer and signature features.

problem Asset-specific model training and complex temporal dependencies.
method Combining transformer-based design with path signatures for capturing geometric features.
result GFT-Sig model achieves superior performance in VWAP loss metrics.

The study analyzes how neural reward models learn features for policy optimization in a Gaussian single-index model.

problem Reward modeling in policy optimization and its impact on downstream value.
method Two-stage neural reward model: first learns hidden direction, then fits readout layer.
result For any feature-learning temperature above a dimension-free threshold, a constant fraction of neurons recover the hidden direction.

Paper explores exact recovery of communities in weighted graphs using Gaussian and exponential distributions.

problem Exact recovery of communities in weighted graphs with Gaussian and exponential distributions.
method Introduces a new semi-metric to describe conditions for exact recovery and analyzes conditions for both complete and incomplete graphs.
result Necessary and sufficient conditions for exact recovery are asymptotically tight and applicable to both complete and incomplete graphs.

Paper analyzes sparse aggregation in GLMs with Kullback-Leibler risk bounds.

problem Sparse aggregation in GLMs for parameter approximation.
method Exponential weighted aggregation scheme with Kullback-Leibler risk bounds.
result Sharp oracle inequality for Kullback-Leibler risk with leading constant 1 and minimax-optimal rate of aggregation.

Decentralized algorithm reduces regret and converges to Nash equilibrium in online congestion games.

problem Online congestion games with exponential action sets and strict Nash equilibria.
method CongestEXP algorithm using exponential weights method.
result CongestEXP achieves O(kFT)O(kF\sqrt{T}) regret bound and almost exponential convergence to strict Nash equilibrium.

We improve deep threshold networks' memorization capacity exponentially.

problem Memorizing datasets with randomized labels using deep neural networks.
method Using Gaussian random weights in the first layer and binary or integer weights in subsequent layers, we prove a new dependence on minimum distance.
result We show that O~(1δ+n)\widetilde{\mathcal{O}}(\frac{1}{\delta} + \sqrt{n}) neurons and O~(dδ+n)\widetilde{\mathcal{O}}(\frac{d}{\delta} + n) weights are sufficient.

Abstract result on correlations of pairs in exponentially growing discrete subsets.

problem Pair correlations in exponentially growing discrete subsets with weight functions.
method Proved abstract result on correlations of pairs of elements in an exponentially growing discrete subset with a weight function.
result Distribution function of unscaled differences is tδ2ett\mapsto\fracδ2\,e^{-|t|}, and pair correlation exhibits Poissonian behavior under certain conditions.

New algorithm optimizes online network resource allocation with long-term constraints.

problem Optimal resource reservation in communication networks with job transfers and budget limits.
method Randomized exponentially weighted method for long-term constraints.
result Upper bound for regret and cumulative constraint violations established.

Paper characterizes DLN distribution, its properties, and estimation methods.

problem No specific problem stated, focuses on DLN distribution properties.
method Characterization of PDF, CDF, moments; generalization to N-dimensions; methods to handle double-exponential nature.
result Characterization of DLN distribution and its properties, including estimation methods.

Nonuniform tubular neighborhoods of curves in Euclidean n-space are studied by using weighted distance functions and generalizing the normal exponential map. Different notions of injectivity radii are introduced to investigate singular but injective exponential maps. A generalization of the thickness formula is obtaine…

2007-05-16abs ↗pdf ↗

Improved averaging method for noisy observations converges strongly.

problem Noisy observations from random dynamical systems require stable estimates.
method Introduced pp-EMA, a modified exponential moving average with subharmonic weight decay.
result Stochastic convergence guarantees for pp-EMA under mild assumptions.

Annealed Entropic Allocation improves ranking and selection by mitigating hard switching and improving finite-budget discrimination.

problem Sequential budget allocation in ranking and selection
method Annealed weighted soft-min framework
result Surrogate converges uniformly to the hard minimum, soft-min weights concentrate on active challengers, and target allocation map is continuous.

Study addresses RTB model performance drops due to distribution shifts.

problem Distribution shifts between training and target environments in RTB markets.
method Applies Exponential Tilt Reweighting Alignment (ExTRA) algorithm to estimate and correct model weights.
result Demonstrates improved RTB model performance using ExTRA algorithm.

A checkerboard graph of a special diagram of an oriented link is made a directed, edge-weighted graph in a natural way so that a principal minor of its Laplacian matrix is a Seifert matrix of the link. Doubling and weighting the edges of the graph produces a second Laplacian matrix such that a principal minor is an Ale…

2018-09-18abs ↗pdf ↗

Let φC(Cn)φ\in C^\infty(\Complex^n) be a given real valued function. We assume that $\pr\ddbarφ$ is non-degenerate of constant signature (n,n+)(n_-,n_+) on Cn\Complex^n. When q=nq=n_-, it is well-known that the Bergman kernel for (0,q)(0,q) forms with respect to the kk-th weight e2kφe^{-2kφ}, k>0k>0, admits a full asymptotic expansi…

2012-08-19abs ↗pdf ↗

Develops a new fuzzy model using QPs and ewl2 regularization to improve local region behavior.

problem Inability of constant and linear functions to accurately describe local regions in fuzzy models.
method Applied Fuzzy C-Means for structure identification, used QPs as consequents, introduced ewl2 regularization.
result Improved model's ability to describe local regions without overfitting.

AEW estimator achieves optimal risk in expectation for large enough temperatures.

problem Understanding minimax-rate optimality of AEW estimator in model selection aggregation.
method Analyzing AEW estimator with exponential weights for squared loss under random design.
result AEW achieves excess risk Tlog(M)/(n+1)T \log (M) / (n+1) in expectation for large enough temperatures.

This work improves polynomial approximations for functions with asymmetric behavior.

problem Efficiently approximating functions with asymmetric behavior, especially those growing unbounded on one side.
method Introduces weighted deep polynomial approximants that combine learnable deep polynomials with one-sided weights.
result Weighted deep polynomial approximants outperform existing methods in approximating functions with asymmetric behavior.

Researchers prove constant solutions for a specific Finslerian equation.

problem Investigating exponentially harmonic functions on Finslerian spaces.
method Analyzing the exponential energy functional and using nonnegative Ricci curvature conditions.
result Any bounded solution to the Finslerian equation is constant.

Efficiently optimizes boolean functions using multilinear polynomials and exponential weight updates.

problem Optimizing boolean functions over the boolean hypercube with high computational cost.
method Proposes a computationally efficient algorithm using multilinear polynomials and exponential weight updates.
result Improves computational time up to several orders of magnitude compared to state-of-the-art algorithms.

Paper introduces kernel deformed exponential families for sparse continuous attention.

problem Creating efficient attention mechanisms for sparse data.
method Developed kernel deformed exponential families, theoretically and experimentally.
result Kernel deformed exponential families can attend to multiple compact regions of data.