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

227454681908 · Jun 202019922001200920172026
48 results for large time

A faster method for visualization recommendations on large datasets.

problem Infeasibility of state-of-the-art vis-rec models on large datasets due to high computational time.
method Reinforcement-learning (RL) framework that identifies optimal statistics within a time budget.
result Significantly reduces time-to-visualize with minimal error compared to baseline approaches.

We investigate the large-volatility dynamics in financial markets, based on the minute-to-minute and daily data of the Chinese Indices and German DAX. The dynamic relaxation both before and after large volatilities is characterized by a power law, and the exponents p±p_\pm usually vary with the strength of the large vo…

2010-02-19abs ↗pdf ↗

We investigate the large-fluctuation dynamics in financial markets, based on the minute-to-minute and daily data of the Chinese Indices and German DAX. The dynamic relaxation both before and after the large fluctuations is characterized by a power law, and the exponents p±p_\pm usually vary with the strength of the lar…

2013-08-03abs ↗pdf ↗

Deep learning accelerates Monte Carlo SDE simulations with large time steps.

problem Accurate simulation of SDEs with large time steps.
method Polynomial chaos expansion with neural network learned stochastic collocation points.
result Data-driven scheme achieves strong convergence in Monte Carlo simulations.

This work aims to create a large-scale model for critical care time series data.

problem Lack of large-scale datasets and distribution shifts in critical care time series data.
method Harmonized dataset creation and transfer learning research.
result Established a foundation for large-scale multi-variate time series models in critical care.

Paper introduces a new method to compute pseudoinverse for ELM with large datasets.

problem Efficient computation of pseudoinverse for ELM with large datasets.
method Rank-based matrix decomposition of the hidden layer matrix.
result Optimal training time and reduced computational complexity for large hidden nodes.

Fine-tuning a time series model improves financial price prediction accuracy.

problem Improving accuracy in predicting financial market prices using large models.
method Continual pre-training of a time series foundation model on financial data to fine-tune its performance for price prediction.
result The fine-tuned model outperforms the baseline in various financial metrics.

We study here the large-time behaviour of all continuous affine stochastic volatility models (in the sense of Keller-Ressel) and deduce a closed-form formula for the large-maturity implied volatility smile. Based on refinements of the Gartner-Ellis theorem on the real line, our proof reveals pathological behaviours of …

2012-03-22abs ↗pdf ↗

BayTiDe discovers time-delayed differential equations from noisy data.

problem Discovering time-delayed differential equations from data with large delays and noise.
method Bayesian inference with a sparsity-promoting prior.
result BayTiDe accurately identifies time-delayed differential equations with accuracy proportional to data resolution.

New method recovers causal networks from short time-series data.

problem Inferring causal relationships from short time-series data in complex systems.
method Large-scale Nonlinear Granger Causality (lsNGC) approach.
result Captures meaningful interactions from limited observational data.

Large deviation principles for multivariate stochastic volatility models.

problem Understanding the behavior of log-processes in multivariate stochastic volatility models.
method Establishing a comprehensive sample path large deviation principle for log-processes.
result Asymptotic formulas for first exit times and barrier option prices derived from the LDP.

New method speeds up Gaussian process training and inference for large datasets.

problem Training and inference in Gaussian processes are computationally expensive for large datasets.
method Iterative alternating projection method that accesses subblocks of the kernel matrix, reducing time and space complexity.
result Empirically, the method accelerates GP training and inference by up to 72x compared to conjugate gradients.

We study the small-time behaviour of the rough Bergomi model, introduced by Bayer, Friz and Gatheral (2016), and prove a large deviations principle for a rescaled version of the normalised log stock price process, which then allows us to characterise the small-time behaviour of the implied volatility.

2017-06-16abs ↗pdf ↗

Deep learning speeds spectral density estimation for large 2D/3D grids.

problem Computational challenges in estimating spectral densities for large grids.
method Deep learning neural network for spectral density estimation.
result Deep learning estimator is a universal approximator and faster than existing methods.

GPU speeds up Monte Carlo simulations for large time steps.

problem Slow convergence and inaccurate solutions with large time steps in Monte Carlo simulations.
method Generalizes the Seven League scheme for GPU acceleration.
result Significantly improved computational speed.

New framework uses time series features for predicting streamflow in ungauged areas.

problem Predicting streamflow in areas without gauging stations.
method Developed regression-based streamflow regionalization using a wide range of time series features from large datasets.
result Certain time series features, like entropy and autocorrelation, are better predictors of streamflow than traditional catchment attributes.

We provide a unifying treatment of pathwise moderate deviations for models commonly used in financial applications, and for related integrated functionals. Suitable scaling allows us to transfer these results into small-time, large-time and tail asymptotics for diffusions, as well as for option prices and realised vari…

2018-03-12abs ↗pdf ↗

Study shows how large neural networks avoid overfitting through decoupling of feature learning and complexity growth.

problem Understanding inductive bias and generalization in large neural networks.
method Dynamical mean field theory applied to large two-layer networks.
result Training dynamics of large networks exhibit a separation of timescales, decoupling feature learning and overfitting.

TSFMs improve financial forecasting from diverse datasets.

problem Challenges in forecasting financial time series due to noisy, non-stationary, and heterogeneous data.
method Empirical study of TSFMs in global financial markets, evaluating zero-shot inference, fine-tuning, and pre-training from scratch.
result Pre-trained TSFMs on financial data achieve substantial forecasting and economic improvements, highlighting the value of domain-specific adaptation.

The paper proves the regularity of cohomogeneity two problems and constructs minimal hypersurfaces on spheres.

problem Cohomogeneity two equivariant isotopy minimization problems and minimal hypersurfaces with large Betti numbers.
method Developed cohomogeneity two equivariant min-max theory for minimal hypersurfaces.
result Constructs minimal hypersurfaces on spheres with large Betti numbers and specific symmetries.

Sparse Markovian Gaussian processes improve probabilistic model inference for large datasets.

problem Efficient inference for large-scale time series data.
method Combining inducing variables with Kalman filter-like recursions for linear scaling.
result General site-based approach for approximating non-Gaussian likelihoods.

To date, most state-of-the-art sequence modeling architectures use attention to build generative models for language based tasks. Some of these models use all the available sequence tokens to generate an attention distribution which results in time complexity of O(n2)O(n^2). Alternatively, they utilize depthwise convoluti…

2020-02-08abs ↗pdf ↗

Optimal model selection for forecasting large collections of short time series using latent space.

problem Challenges in choosing among multiple forecasting methods for large, high-dimensional time series with limited data.
method Combining low-rank temporal matrix factorization with optimal model selection using cross-validation.
result Forecasting latent factors leads to significant performance gains compared to direct uni-variate model application.

The study examines how extra compute during testing affects the performance of large language models.

problem Understanding the conditions under which test-time scaling improves model performance.
method An in-context weight prediction task for linear regression was used to train transformers. The performance was analyzed under varying levels of test-time compute.
result Training transformers on diverse, relevant, and hard tasks leads to the best performance for test-time scaling.

Efficient algorithms improve learning of large-margin halfspaces.

problem Learning large-margin halfspaces efficiently and reproducibly.
method Design of efficient, dimension-independent, polynomial-time algorithms; SGD-based approach; DP-to-Replicability reduction.
result Improved sample complexity compared to previous algorithms, with optimal sample complexity for one algorithm.

For a broad range of research, governmental and commercial applications it is important to understand the allegiances, communities and structure of key players in society. One promising direction towards extracting this information is to exploit the rich relational data in digital social networks (the social graph). As…

2016-01-15abs ↗pdf ↗

We build a simple diagnostic criterion for approximate factor structure in large cross-sectional equity datasets. Given a model for asset returns with observable factors, the criterion checks whether the error terms are weakly cross-sectionally correlated or share at least one unobservable common factor. It only requir…

2016-12-15abs ↗pdf ↗

The majority of real-world networks are dynamic and extremely large (e.g., Internet Traffic, Twitter, Facebook, ...). To understand the structural behavior of nodes in these large dynamic networks, it may be necessary to model the dynamics of behavioral roles representing the main connectivity patterns over time. In th…

2012-05-09abs ↗pdf ↗