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

275582109 · Jun 202019922001200920172026
48 results for Whittle indices

NeurWIN learns Whittle indices for restless bandits using deep reinforcement learning.

problem Finding optimal solutions for restless bandits with complex transition kernels.
method NeurWIN uses a neural network to learn Whittle indices, leveraging the Whittle indices' mathematical properties.
result NeurWIN outperforms other RL algorithms in solving three recently studied restless bandit problems.

New algorithm optimizes resource allocation in non-stationary networks.

problem Optimal resource allocation in non-stationary RMABs is computationally hard.
method Sliding-Window Online Whittle (SW-Whittle) policy for non-stationary transition kernels.
result Sub-linear dynamic regret achieved with unknown variation budget.

New algorithm uses Whittle index to improve Q-learning for restless bandits.

problem Optimizing decision-making in multiarmed restless bandits with average reward.
method Introduces a novel reinforcement learning algorithm combining Q-learning and Whittle index policy.
result Demonstrates significant computational gains and excellent empirical performance.

New ICA method for sources with mixed spectra.

problem Inaccurate separation of sources with temporal autocorrelations and mixed spectra.
method Estimates spectral density functions and line spectra using cubic splines and indicator functions, then maximizes the Whittle likelihood function.
result Outperforms existing ICA methods in simulations and EEG data applications.

We simplify Khovanov homology for torus braids using Gaussian elimination.

problem Computing Khovanov homology for torus braids is complex and computationally intensive.
method Applying Gaussian elimination to reduce the number of generators in the Khovanov chain complex.
result We provide a bound on the number of generators in the whittled complex at fixed homological degree.

Study Whittle index learning algorithms for restless bandits with constant stepsizes.

problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.

Python package for estimating Hurst exponent in fBm.

problem Estimating Hurst exponent in fractional Brownian motion.
method Whittle's likelihood method applied to fractional Gaussian noise.
result Implementation achieves state-of-the-art accuracy and speed.

Study on indexability of restless multi-armed bandits and rollout policy performance.

problem Maximizing discounted rewards in finite state restless multi-armed bandit problems.
method Decouple the problem into single-armed restless bandits, analyze using value iteration, and compare with Whittle index policy.
result Demonstrates conditions for indexability and compares performance of index policy and rollout policy.

The Whittle likelihood is a widely used and computationally efficient pseudo-likelihood. However, it is known to produce biased parameter estimates for large classes of models. We propose a method for de-biasing Whittle estimates for second-order stationary stochastic processes. The de-biased Whittle likelihood can be …

2016-05-22abs ↗pdf ↗

We provide a computationally and statistically efficient method for estimating the parameters of a stochastic covariance model observed on a regular spatial grid in any number of dimensions. Our proposed method, which we call the Debiased Spatial Whittle likelihood, makes important corrections to the well-known Whittle…

2019-07-04abs ↗pdf ↗

ContextWIN uses neural networks and reinforcement learning to optimize decisions in dynamic environments.

problem Optimizing decisions in dynamic, context-aware environments like recommendation systems.
method Integrates a mixture of experts within a reinforcement learning framework to compute context-specific weights for decision-making.
result Enhanced efficiency and accuracy in Whittle index computation for each arm in RMABs.

This paper introduces the Markov-Switching Multifractal Duration (MSMD) model by adapting the MSM stochastic volatility model of Calvet and Fisher (2004) to the duration setting. Although the MSMD process is exponential ββ-mixing as we show in the paper, it is capable of generating highly persistent autocorrelation. W…

2012-08-15abs ↗pdf ↗

We study the restless bandit associated with an extremely simple scalar Kalman filter model in discrete time. Under certain assumptions, we prove that the problem is indexable in the sense that the Whittle index is a non-decreasing function of the relevant belief state. In spite of the long history of this problem, thi…

2015-09-15abs ↗pdf ↗

Rough volatility models are continuous time stochastic volatility models where the volatility process is driven by a fractional Brownian motion with the Hurst parameter smaller than half, and have attracted much attention since a seminal paper titled "Volatility is rough" was posted on SSRN in 2014 showing that the log…

2019-05-13abs ↗pdf ↗

Estimates network structure from correlated node outputs of wide-sense stationary processes.

problem Learning edge connectivity from node outputs of latent inputs.
method Wide-sense stationary stochastic processes, Laplacian matrix estimation, ℓ1-regularized Whittle's MLE.
result The MLE recovers the sparsity pattern of the Laplacian matrix with high probability.

We introduce two new estimators of the bivariate Hurst exponent in the power-law cross-correlations setting -- the cross-periodogram and local XX-Whittle estimators -- as generalizations of their univariate counterparts. As the spectrum-based estimators are dependent on a part of the spectrum taken into consideration …

2014-08-28abs ↗pdf ↗

The paper examines how long-memory dynamics, rough-volatility, and persistence affect equity volatility forecasting.

problem The study investigates how long-memory dynamics, rough-volatility, and persistence impact equity volatility forecasting.
method The paper combines semiparametric long-memory estimation, rough-volatility diagnostics, and structured forecasting regressions.
result Persistence measures improve out-of-sample volatility forecasts, particularly during periods of elevated market volatility and in volatility-managed portfolio applications.

We examine the performance of six estimators of the power-law cross-correlations -- the detrended cross-correlation analysis, the detrending moving-average cross-correlation analysis, the height cross-correlation analysis, the averaged periodogram estimator, the cross-periodogram estimator and the local cross-Whittle e…

2016-02-17abs ↗pdf ↗

We study how the round-off (or discretization) error changes the statistical properties of a Gaussian long memory process. We show that the autocovariance and the spectral density of the discretized process are asymptotically rescaled by a factor smaller than one, and we compute exactly this scaling factor. Consequentl…

2011-07-22abs ↗pdf ↗

The paper tackles restless bandits with limited observation, proposing a method to analyze and approximate their optimal strategies.

problem Restless bandits with limited observation.
method General probabilistic model, PCL analysis, and approximation process.
result The proposed method can transform the problem into a finite-state problem, enabling the use of existing algorithms.

Abstract: Generalizes SGMs to infinite-dimensional Hilbertian setting.

problem Difficulties in extending SGMs to infinite-dimensional settings.
method Uses Gamma and Malliavin Calculus, Dirichlet forms, Wiener chaoses, and time-reversal formula.
result Generalized SGMs to Hilbertian setting with finite-dimensional entropic convergence bounds.

cvHM framework speeds up GP inference for neural spike train analysis.

problem Scalability issue in approximate inference for latent GP models.
method cvHM framework using Hida-Matérn kernels and conjugate computation variational inference (CVI).
result Linear time inference for latent neural trajectories.

Develops a measure-theoretic framework for complex co-occurrence data.

problem Modeling and interpreting complex co-occurrences in high-dimensional data.
method Introduces measure-theoretic probability and conditional probability, investigates E-integrals.
result Establishes a rigorous measure-theoretic foundation for co-occurrence modeling.

New composite indicators reveal hidden relationships between indicators.

problem Subjective aggregation of indicators leads to missed information.
method Used dimensionality reduction techniques (PCA, filtering, clustering) to reveal hidden relationships.
result Cluster-driven composite indicators outperform traditional ones in data reconstruction.

New approach tackles non-Markovian behavior in maternal health programs.

problem Improving adherence and engagement in maternal and child healthcare programs.
method Extending RMABs to non-Markovian settings, using time-series forecasting and TARI policy.
result Significant increase in engagement and content listened compared to existing methods.

This study examined how the correlation and network structure of 30 global indices and 145 local Korean indices belonging to the KOSPI 200 have changed during the 13-year period, 2000-2012. The correlations among the indices were calculated. The results showed that although the average correlations of the global indice…

2014-02-07abs ↗pdf ↗

Financial market created for wellbeing indices to mitigate socioeconomic risks.

problem Risk mitigation in financial indices of socioeconomic wellbeing.
method Developed new quantitative measure, created financial market, and implemented insurance instruments.
result Optimal portfolio weights and efficient frontiers for wellbeing indices.

Investigates local indicability of groups with circle homology presentations.

problem Conditions for local indicability in groups with circle homology presentations.
method Generalizes results for two-relator presentations to circle homology presentations.
result Extends results on local indicability to LOT groups and non-cycle-free Adian presentations.