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

Trend · papers per month

141281422562 · Jun 202019922001200920172026
48 results for time-varying distributions

The paper analyzes equity market dynamics and optimal portfolios using time-varying optimization.

problem Analyzing the time-varying structure of equity markets, particularly market capitalization inequality and concentration.
method The study employs mathematical functionals of time-varying portfolios and a Sharpe optimization procedure.
result Optimal portfolios exhibit varying market capitalization exposure over time.

Estimates financial market impacts of COVID-19 using time-varying kernel density.

problem Estimating the impact of COVID-19 on financial markets over time.
method Time-varying kernel density estimation with Kolmogorov-Smirnov statistic.
result Determines the chronology and regional disparities of financial market impacts.

A new method generates counterfactual treatment outcomes for time-varying treatments.

problem Estimating counterfactual outcomes for time-varying treatments with high-dimensional outcomes.
method Conditional generative framework with inverse probability re-weighting.
result Our method outperforms state-of-the-art baselines in generating high-quality counterfactual samples.

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.

Optimizes decisions in time-varying distributions using online stochastic methods and Wasserstein distance.

problem Optimizing decisions in time-varying distributions using Wasserstein distance.
method Online proximal-gradient method, exact penalty method, constraint-tightening approach.
result Dynamic regret bounds for tracking and estimation error.

We propose a computationally efficient random walk on a convex body which rapidly mixes and closely tracks a time-varying log-concave distribution. We develop general theoretical guarantees on the required number of steps; this number can be calculated on the fly according to the distance from and the shape of the next…

2013-09-23abs ↗pdf ↗

We present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence rate of O(1/k)O(1/k) with the constant term depending on the numb…

2016-12-06abs ↗pdf ↗

DIGing-SGLD improves SGLD for scalable Bayesian learning in dynamic networks.

problem Scalable Bayesian learning in multi-agent systems with time-varying networks.
method Integrates Langevin sampling with gradient-tracking for decentralized learning over time-varying networks.
result Achieves geometric convergence to the target distribution with finite-time guarantees.

Predicts long-term return distributions with time-varying volatility.

problem Risk management in long-horizon returns.
method Predicts future return distributions without specifying volatility dynamics or shock distribution.
result Derives risk measures like VaR and CTE from the predicted return distribution.

Proposes estimators for complex dose-response curves using kernel methods.

problem Estimating complex dose-response curves with continuous treatments, mediators, and covariates.
method Kernel ridge regression with sequential kernel embedding technique.
result Simple estimators for mediated and time-varying dose response curves with nonasymptotic uniform rates.

A new DVAE architecture improves channel estimation by incorporating temporal correlations.

problem Improving the estimation of time-varying channels.
method Introducing k-MemoryMarkovVAE (k-MMVAE) architecture to learn temporal correlations.
result The k-MMVAE aided channel estimator outperforms other ML aided estimators.

Adaptive ML learns complex time-varying systems without new data.

problem Applying ML to time-varying systems with shifting distributions.
method Mapping high-dimensional inputs to low-dimensional latent space, actively tuning latent space based on feedback.
result Learning correlations and tracking system evolution in real-time without new data.

Typically, operational risk losses are reported above a threshold. Fitting data reported above a constant threshold is a well known and studied problem. However, in practice, the losses are scaled for business and other factors before the fitting and thus the threshold is varying across the scaled data sample. A report…

2009-04-27abs ↗pdf ↗

The paper introduces Robust Correlated Equilibrium for games with time-varying costs and proposes an algorithm to achieve it.

problem Games with time-varying costs and disturbances.
method Proposes Robust Correlated Equilibrium and a decentralized algorithm to learn optimal strategies.
result The algorithm converges to the Robust Correlated Equilibrium, showing no regret for each controller.

DeepHazard uses neural networks to predict time-varying survival risks.

problem Traditional survival models assume proportional hazards and do not account for time-varying covariate information.
method DeepHazard is a neural network approach that models time-varying hazards without proportional hazards assumption.
result DeepHazard outperforms existing methods in predicting survival time, as shown by C-index metrics on real datasets.

Develops diffusion samplers for target distributions with efficient score and density estimates.

problem Estimating scores and densities for time-varying distributions.
method Sequential Monte Carlo with diffusion paths and control variates.
result Effective samplers for time-varying distributions with theoretical guarantees and practical applications.

Paper tests for time-varying entropy in stock prices, finding periods of inefficiency.

problem Testing for time-varying entropy in stock price dynamics.
method Unbiased approximation of Shannon entropy variance, optimal rolling window selection, hypothesis testing.
result Existence of periods of market inefficiency for meme stocks.

New method learns dynamic brain communication patterns across regions.

problem Current methods struggle with time-varying brain communications and scalability.
method Adaptive Delay Model (ADM) using Markovian Gaussian Processes.
result Captures dynamic neural communication patterns over time.

Signals coming from multivariate higher order conditional moments as well as the information contained in exogenous covariates, can be effectively exploited by rational investors to allocate their wealth among different risky investment opportunities. This paper proposes a new flexible dynamic copula model being able t…

2016-01-20abs ↗pdf ↗

In this note, we present a version of the Thompson sampling algorithm for the problem of online linear generalization with full information (i.e., the experts setting), studied by Kalai and Vempala, 2005. The algorithm uses a Gaussian prior and time-varying Gaussian likelihoods, and we show that it essentially reduces …

2013-11-03abs ↗pdf ↗

In this work the system of agents is applied to establish a model of the nonlinear distributed signal processing. The evolution of the system of the agents - by the prediction time scale diversified trend followers, has been studied for the stochastic time-varying environments represented by the real currency-exchange …

2011-10-12abs ↗pdf ↗

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions,…

2016-02-14abs ↗pdf ↗

Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1\ell_1 penalization methods. However, current methods assume that the data are independent and identically distributed. If the distribution, and hence the graph, evolves over time t…

2008-02-20abs ↗pdf ↗

Extends tracking guarantees for time-varying variational inequalities.

problem Tracking solutions of time-varying variational inequalities.
method Extends existing results to sublinear solution paths and periodic problems.
result Discrete dynamical systems of periodic time-varying VI can exhibit chaotic behavior or converge to the solution.

SpecGrad improves neural vocoder sound quality by adapting diffusion noise to log-mel spectrogram.

problem Improving neural vocoder sound quality, especially in high-frequency bands.
method Adapting the diffusion noise distribution to the conditioning log-mel spectrogram through time-varying filtering.
result SpecGrad generates higher-fidelity speech waveform than conventional DDPM-based neural vocoders.

Develops framework for estimating and improving DTRs with time-varying IV in the presence of unmeasured confounding.

problem Estimating DTRs from observational data with unmeasured confounding.
method Time-varying instrumental variable (IV) framework for estimating and improving DTRs.
result IV-optimal and IV-improved DTRs perform better than DTRs assuming no unmeasured confounding.

The paper tackles revenue management with time-varying demand using posterior sampling.

problem Maximizing revenue in real-time applications with unknown and time-varying demand.
method Episodic generalization of RM problem, posterior sampling algorithm for linear programming optimization.
result The proposed algorithm outperforms other methods and is comparable to the optimal policy in hindsight.

Develops diffusion models for time-varying correlation on the circle.

problem Time-varying correlation modeling on the circle.
method Stochastic processes on the unit circle, specifically Brownian motion and von Mises diffusion.
result Derives an accurate analytical approximation to the transition density of the von Mises diffusion.

This study improves estimation of locally stationary functional time series using NW method.

problem Accurately capturing time-dependence in locally stationary functional time series with time-varying covariates.
method Nadaraya-Watson (NW) estimation procedure for the conditional distribution of LSFTS.
result Established convergence rates of NW estimator for LSFTS with respect to Wasserstein distance.

MSCT predicts post-crash traffic speed using causal inference.

problem Time-varying confounding bias in post-crash traffic prediction.
method Marginal Structural Causal Transformer (MSCT) incorporating Marginal Structural Models and balanced loss function.
result MSCT outperforms state-of-the-art models in multi-step-ahead prediction.

A new method estimates time-varying parameters in earth system models using offline and online data assimilation.

problem Estimating time-varying parameters in complex earth system models.
method Hybrid Offline Online Parameter Estimation with Particle Filtering (HOOPE-PF)
result HOOPE-PF outperforms existing methods, especially with small ensemble sizes.

Develops a method to predict stock returns with time-varying risk premia.

problem Predicting stock returns with time-varying risk premia while maintaining no-arbitrage restrictions.
method Penalized two-pass regression with time-varying factor loadings, incorporating penalization in the first pass and grouping in the second pass.
result The proposed method reduces prediction errors compared to other approaches.

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.

KAPLAN-HR models survival data without manual interactions, outperforming existing methods.

problem Survival analysis challenges with complex covariates and time-varying effects.
method Kolmogorov-Arnold Networks (KAN) for nonparametric hazard estimation.
result KAPLAN-HR matches or exceeds existing methods in clinical survival data.

This paper introduces a novel technique to track structures in time varying graphs. The method uses a maximum a posteriori approach for adjusting a three-dimensional co-clustering of the source vertices, the destination vertices and the time, to the data under study, in a way that does not require any hyper-parameter t…

2016-08-29abs ↗pdf ↗

A new method for steering large agent populations efficiently.

problem Controlling the configuration of a swarm of identical, interacting cooperative agents.
method Mean-Field Schrodinger Bridges with Gaussian Mixture Models.
result A highly efficient parameterization to approximate optimal solutions of the MFSB problem in closed form.