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

2575157721,029 · Jun 202019922001200920172026
48 results for Dependent Observation Times

Extends PD-NJ-ODE to noisy observations and dependent observation times.

problem Predicting continuous-time stochastic processes with irregular and noisy observations.
method Extends PD-NJ-ODE to handle conditional independence and noisy observations.
result Theoretical guarantees and empirical examples for handling noisy observations and dependent observation times.

Theoretical analysis of deep neural networks for time series data.

problem Theoretical development for deep neural networks on temporally dependent observations is lacking.
method Established non-asymptotic bounds for prediction error of deep neural networks under mixing-type assumptions.
result Deep neural networks can model non-linear time series data with additional logarithmic factors due to dependence.

Network models have been popular for modeling and representing complex relationships and dependencies between observed variables. When data comes from a dynamic stochastic process, a single static network model cannot adequately capture transient dependencies, such as, gene regulatory dependencies throughout a developm…

2009-07-14abs ↗pdf ↗

We review a resent {\em time-dependent} performance measure for economical time series -- the (optimal) investment horizon approach. For stock indices, the approach shows a pronounced gain-loss asymmetry that is {\em not} observed for the individual stocks that comprise the index. This difference may hint towards an sy…

2005-04-21abs ↗pdf ↗

Causal relationships in time series with latent variables are discovered using LPCMCI.

problem Discovering causal relationships in complex, time-series data with hidden variables.
method Evaluated LPCMCI algorithm for finding generators compatible with multi-dimensional, autocorrelated time series with latent variables.
result LPCMCI performs better than random guessing but is not optimal.

We review ideas on temporal dependences and recurrences in discrete time series from several areas of natural and social sciences. We revisit existing studies and redefine the relevant observables in the language of copulas (joint laws of the ranks). We propose that copulas provide an appropriate mathematical framework…

2013-11-20abs ↗pdf ↗

EDICT learns evidential distributions for irregular time series, improving predictions and uncertainty quantification.

problem Challenges in predicting and characterizing uncertainty for irregular time series data.
method EDICT (Evidential Distributions for Irregular Time Series) learns a continuous-time evidential distribution.
result EDICT achieves competitive performance on time series classification tasks and provides better uncertainty quantification.

Rhino learns causal relationships from time series data with history-dependent noise.

problem Discovering causal relationships from time series data with non-linear relations, instantaneous effects, and history-dependent noise.
method Combines vector auto-regression, deep learning, and variational inference.
result Demonstrates better causal relationship discovery performance compared to baselines.

Develops a new method to discover causal relationships from nonstationary time series data.

problem Challenges in inferring causal relationships from observational data, especially for nonstationary time series.
method State-Dependent Causal Inference (SDCI) for conditionally stationary time series.
result SDCI can recover underlying causal dependencies with provable identifiability for state-dependent causal structures.

We consider a sequential learning problem with Gaussian payoffs and side information: after selecting an action ii, the learner receives information about the payoff of every action jj in the form of Gaussian observations whose mean is the same as the mean payoff, but the variance depends on the pair (i,j)(i,j) (and may…

2015-10-27abs ↗pdf ↗

Adaptive sequential testing optimizes epidemic control by learning optimal test strategies.

problem Optimizing test allocation in epidemics with network and temporal dependence.
method Adaptive sequential design with Online Super Learner for optimal test strategies.
result Superior performance in simulated university COVID-19 pandemic.

The study provides statistical theory for WGANs in time series forecasting.

problem Statistical analysis of WGANs for time series forecasting.
method Statistical theory and upper bounds for excess Bayes risk, weak convergence, and confidence intervals.
result Developed confidence intervals for time series forecasting using WGANs.

We revisit the Kolmogorov-Smirnov and Cramér-von Mises goodness-of-fit (GoF) tests and propose a generalisation to identically distributed, but dependent univariate random variables. We show that the dependence leads to a reduction of the "effective" number of independent observations. The generalised GoF tests are not…

2011-06-15abs ↗pdf ↗

Develops a deep survival model for causal inference in longitudinal studies.

problem Estimating treatment effects on time-to-event outcomes in observational studies with time-dependent covariates.
method TCS model using potential outcomes framework and ensemble of recurrent subnetworks.
result Identifies conditional average treatment effects and individual treatment effect heterogeneity over time.

Study nearest-neighbor radii under dependent sampling, finding they remain informative.

problem Analyzing nearest-neighbor radii under dependent sampling.
method Consider strong mixing dependent observations, establish distribution-free almost sure convergence and sharp non-asymptotic moment bounds.
result Nearest-neighbor geometry remains informative under dependence sampling.

The paper bounds the excess risk of deep neural networks for weakly dependent processes.

problem Learning with weakly dependent data using deep neural networks.
method Approximation of smooth functions by deep neural networks and a bound on excess risk.
result The excess risk bound for deep learning under weak dependence is close to O(n1/2)\mathcal{O}(n^{-1/2}) for sufficiently smooth functions.

FIT evaluates time series model feature importance quantifying distributional shift.

problem Lack of explanations for time series models in high-stakes applications.
method FIT framework quantifies feature importance based on distributional shift using KL-divergence.
result FIT identifies important time points and observations superiorly compared to baselines.

The correlation matrix is the key element in optimal portfolio allocation and risk management. In particular, the eigenvectors of the correlation matrix corresponding to large eigenvalues can be used to identify the market mode, sectors and style factors. We investigate how these eigenvalues depend on the time scale of…

2018-07-13abs ↗pdf ↗

We propose a stochastic process for stock movements that, with just one source of Brownian noise, has an instantaneous volatility that rises from a type of statistical feedback across many time scales. This results in a stationary non-Gaussian process which captures many features observed in time series of real stock r…

2004-12-20abs ↗pdf ↗

We review the decomposition method of stock return cross-correlations, presented previously for studying the dependence of the correlation coefficient on the resolution of data (Epps effect). Through a toy model of random walk/Brownian motion and memoryless renewal process (i.e. Poisson point process) of observation ti…

2007-04-28abs ↗pdf ↗

We present the Wright-Fisher Indian buffet process (WF-IBP), a probabilistic model for time-dependent data assumed to have been generated by an unknown number of latent features. This model is suitable as a prior in Bayesian nonparametric feature allocation models in which the features underlying the observed data exhi…

2016-11-22abs ↗pdf ↗

Develops anytime-valid stopping rules for SGD based on observed trajectory.

problem Stopping stochastic gradient descent (SGD) based on observed trajectory.
method Develops anytime-valid confidence sequences for stochastic gradient methods.
result Statistically valid, time-uniform stopping rules for SGD across convex and nonconvex settings.

Two new methods improve forecasting of functional time series data.

problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.

Proposes a Koopman operator method for time-dependent reliability analysis of nonlinear systems.

problem Challenges in time-dependent reliability analysis of nonlinear dynamical systems.
method Koopman operator approach for transforming nonlinear systems into linear ones, combined with deep learning for intrinsic coordinates.
result Robust and generalizable approach for time-dependent reliability analysis, superior to purely data-driven methods.

Investigates portfolio selection for rank-dependent utilities in incomplete markets.

problem Portfolio selection for agents with rank-dependent utility in incomplete financial markets.
method Characterizes deterministic strict equilibrium strategies for constant-coefficient and time-invariant probability weighting functions. Addresses the issue of selecting an optimal strategy from multiple equilibrium strategies for time-variant probability weighting functions.
result Characterizes deterministic strict equilibrium strategies and identifies optimal strategies from multiple equilibrium strategies.