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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for Exponential Time

New model captures time-varying volatility with stochastic exponential tails.

problem Capturing time-varying volatility and stochastic skewness in financial markets.
method Normal Tempered Stable distribution with time-varying parameter.
result Model better explains market option prices with stochastic exponential tails.

Exponentially smoothed RNNs improve industrial forecasting.

problem Complexity and non-stationarity in industrial time series data.
method Exponential smoothed recurrent neural networks (RNNs) for modeling non-linear dynamics.
result Exponentially smoothed RNNs outperform traditional models in multi-step forecasting.

Develops a new exponential map for time-varying vector fields.

problem Lack of global flows for general time-varying vector fields.
method Categorical development of spaces of vector fields and flows, allowing for systematic localisation.
result Derives the homeomorphism of the exponential map for vector fields with measurable time-dependence.

New Thompson sampling algorithm reduces regret for exponential family bandits.

problem Minimizing regret in multi-armed bandit problems with exponential family rewards.
method Proposes ExpTS and ExpTS+^+ algorithms using novel sampling distributions.
result Minimizes both finite-time and asymptotic regret for exponential family rewards.

Time series analysis is used to understand and predict dynamic processes, including evolving demands in business, weather, markets, and biological rhythms. Exponential smoothing is used in all these domains to obtain simple interpretable models of time series and to forecast future values. Despite its popularity, expon…

2017-06-09abs ↗pdf ↗

This paper extends exponential smoothing to distributional time series using Wasserstein distance.

problem Forecasting distributional time series with exponential smoothing.
method Generalized exponential smoothing in Wasserstein space, with consistent parameter estimation.
result Wasserstein exponential smoothing outperforms traditional methods in high-frequency financial and electricity demand data.

Study optimal strategy for maximizing exponential utility in financial market with linear price impact.

problem Maximizing exponential utility in financial market with linear price impact.
method Purely probabilistic approach using duality.
result Computed optimal portfolio strategy and value for Ornstein-Uhlenbeck process.

New RL approach handles non-exponential discounting for sequential decisions.

problem Modeling human discounting in sequential decision-making tasks.
method Generalized model-based reinforcement learning with arbitrary discount functions, using Hamilton-Jacobi-Bellman equation and collocation method.
result Validated approach on simulated problems, showing applicability to human discounting.

In this paper, we obtain analytical expression for the distribution of the occupation time in the red (below level 00) up to an (independent) exponential horizon for spectrally negative Lévy risk processes and refracted spectrally negative Lévy risk processes. This result improves the existing literature in which only…

2019-03-09abs ↗pdf ↗

A new method for efficiently computing derivatives of skew-symmetric matrix exponentials.

problem Efficient computation of derivatives for skew-symmetric matrices.
method Characterization of invertibility, construction of nearby logarithm, and efficient implementation.
result Explicit formulae for differentiation and its inverse of skew-symmetric matrix exponentials.

Polynomial-time algorithm estimates mean with bounded covariance using differential privacy.

problem Estimating mean of a d-variate distribution with differential privacy constraints.
method Sum of Squares (SoS) exponential mechanism for polynomial-time differentially private estimation.
result First polynomial-time algorithm with O(d)O(d) samples for mean estimation under pure differential privacy.

The paper characterizes probability and entropy of exponentially growing sample spaces.

problem Characterizing probability and entropy of exponentially growing sample spaces.
method Analytical and applied to real-world data (US$ broad money supply).
result Information entropy is related to the rate of sample space expansion.

This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard t…

2016-04-05abs ↗pdf ↗

Paper efficiently infers differential parameters in time-varying models using time score matching.

problem Efficiently inferring differential parameters in time-varying probabilistic models.
method Directly estimates the differential parameter using time score matching and proves consistency of the method.
result Consistent estimation of parameter derivatives in high-dimensional settings.

It is well known that generic solutions of the heat equation are not analytic in time in general. Here it is proven that ancient solutions with exponential growth are analytic in time in ${\M} \times (-\infty, 0]$. Here $\M=\R^n$ or is a manifold with Ricci curvature bounded from below. Consequently a necessary and suf…

2019-05-14abs ↗pdf ↗

Efficient numerical method for time-fractional Black-Scholes model.

problem Solving time-fractional Black-Scholes equations for European options.
method Crank-Nicolson discretization for time, exponential B-spline for space.
result The proposed method is unconditionally stable and superior to existing approaches.

New CTBNs with clocks allow for non-exponential survival times.

problem Modeling phenomena with non-exponential survival times in continuous time.
method Introduced node-wise clocks to construct graph-coupled semi-Markov chains, enabling non-exponential survival times without auxiliary states.
result Parameter and structure inference algorithms provided, demonstrating advantages over current CTBN extensions.

Space exploration technology advances exponentially, consistent with Moore's and Wright's laws.

problem Predicting the advancement of space exploration technology.
method Analysis of Moore's and Wright's laws applied to space exploration technology.
result Spacecraft technology advances exponentially, consistent with Moore's and Wright's laws.

Thompson Sampling has been demonstrated in many complex bandit models, however the theoretical guarantees available for the parametric multi-armed bandit are still limited to the Bernoulli case. Here we extend them by proving asymptotic optimality of the algorithm using the Jeffreys prior for 1-dimensional exponential …

2013-07-12abs ↗pdf ↗

Adaptive estimation for nonstationary time series reduces computational cost.

problem Estimating parameters of nonstationary time series with varying parameters over time.
method Moving exponential moving ML estimator for scale parameter estimation.
result Significantly improved log-likelihoods compared to standard estimation.

The paper proposes a method to train time-varying generative models using natural gradients.

problem Training time-varying generative models efficiently and accurately.
method Projecting generative model parameters onto an exponential family manifold and optimizing using natural gradient descent.
result The proposed method efficiently approximates the natural gradient and can be applied to various exponential family models.

Analyzing historical data of price indices we find an extraordinary growth phenomenon in several examples of hyper-inflation in which price changes are approximated nicely by double-exponential functions of time. In order to explain such behavior we introduce the general coarse-graining technique in physics, the Monte …

2001-12-24abs ↗pdf ↗

Polynomial-time algorithm estimates edge density of random graphs with privacy and robustness.

problem Estimating edge density of random graphs while maintaining privacy and robustness.
method Sum-of-squares algorithm for robust edge density estimation and reduction from privacy to robustness.
result Optimal error rate up to logarithmic factors, matching theoretical lower bounds.

Ridge regression linked to Poisson resetting in statistical physics.

problem Understanding and extending ridge regularization in machine learning.
method Connecting stochastic resetting from statistical physics with ridge regularization in machine learning, using renewal processes.
result Exact filter identities for ridge regularization in various reset laws, including exponential and non-exponential.

On a complete non-compact gradient shrinking Ricci soliton, we prove the analyticity in time for smooth solutions of the heat equation with quadratic exponential growth in the space variable. This growth condition is sharp. As an application, we give a necessary and sufficient condition on the solvability of the backwa…

2019-11-07abs ↗pdf ↗