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

12253749 · Jun 202019922001200920172026
48 results for Second-order stationarity

This article develops a statistical test for the null hypothesis of strict stationarity of a discrete time stochastic process in the frequency domain. When the null hypothesis is true, the second order cumulant spectrum is zero at all the discrete Fourier frequency pairs in the principal domain. The test uses a window …

2018-01-20abs ↗pdf ↗

New algorithm provably converges to second-order stationary points in NMF.

problem Understanding convergence to local minima in NMF.
method Multiplicative weight update dynamics, concurrent updates, and simplex reduction.
result Provable convergence to second-order stationary points.

Second-order guarantees for federated learning algorithms.

problem Non-convex optimization in federated learning with saddle-points as bottlenecks.
method Drawing on recent results on second-order optimality in centralized and decentralized settings, establish second-order guarantees for federated learning algorithms.
result Established second-order guarantees for federated learning algorithms.

Paper develops a TR-SSQP method for noisy optimization with heavy-tailed noise.

problem Optimization problems with stochastic objectives and heavy-tailed noise.
method Trust-Region Stochastic Sequential Quadratic Programming (TR-SSQP) method.
result Achieves high-probability first-order and second-order stationarity bounds for heavy-tailed noise.

New algorithms minimize dynamic regret in non-stationary online learning.

problem Universal dynamic regret minimization under exp-concave and smooth losses.
method Strongly Adaptive algorithms with a path variational based on second order differences of the comparator sequence.
result Achieve a dynamic regret of ildeO(d2n1/5Cn2/5d2) ilde O(d^2 n^{1/5} C_n^{2/5} \vee d^2), optimal modulo dependencies.

Adaptive algorithm AMSGrad converges for weakly convex constrained optimization problems.

problem Solving constrained stochastic optimization problems with weakly convex objectives.
method Analysis of AMSGrad algorithm for a specific class of problems.
result AMSGrad achieves a convergence rate of ildeO(t1/4)\mathcal{ ilde O}(t^{-1/4}) for the norm of the gradient of the Moreau envelope.

Deep RL agents suffer from transient non-stationarity, which ITER mitigates.

problem Transient non-stationarity in deep RL agents affects generalization.
method Iterated Relearning (ITER) transfers knowledge between networks to reduce non-stationarity.
result ITER improves deep RL agents' performance on generalization benchmarks.

TimeBridge addresses non-stationarity in long-term time series forecasting.

problem Non-stationarity in multivariate time series leads to spurious regressions and obscures long-term relationships.
method TimeBridge segments series into patches, applying Integrated Attention for short-term non-stationarity and Cointegrated Attention for long-term cointegration.
result TimeBridge achieves state-of-the-art performance in both short-term and long-term forecasting.

New method tackles bilevel optimization with polyhedral constraints.

problem Challenges in bilevel optimization with active-set changes and expensive Hessian inversions.
method Logarithmic barrier smoothing and proxy-gradient algorithm for differentiable approximation.
result Stationarity rates of O(K2/3)O(K^{-2/3}) in deterministic setting and O(K2/5)O(K^{-2/5}) under stochastic noise.

This paper compares stationarity in Bitcoin and S&P500 price indices.

problem Comparing stationarity in cryptocurrency and traditional stock market indices.
method Wide sense stationarity defined; Wiener-Khinchin Theorem applied; stationarity achieved through detrending and normalization of price returns.
result S&P500 price return achieves stationarity for 28 years with specific normalization windows, while Bitcoin's stationarity varies by segment and volatility.

Improved Adam for time series forecasting with distributional drift.

problem Non-stationary data challenges Adam's effectiveness.
method Proposed TS_Adam, removing Adam's second-order bias correction.
result TS_Adam achieves 12.8% reduction in MSE and 5.7% in MAE on ETT datasets.

The paper explores various stationarity concepts in non-smooth optimization.

problem Understanding stationarity in non-smooth optimization problems.
method Introduction and discussion of different stationarity concepts for non-convex non-smooth functions.
result Clarification of the relationship among different stationarity concepts and their relevance in iterative methods.

This paper considers regression tasks involving high-dimensional multivariate processes whose structure is dependent on some {known} graph topology. We put forth a new definition of time-vertex wide-sense stationarity, or joint stationarity for short, that goes beyond product graphs. Joint stationarity helps by reducin…

2016-11-01abs ↗pdf ↗

Master algorithm fails to detect non-stationarity in practical settings.

problem Non-Stationary Reinforcement Learning without prior knowledge.
method Master algorithm tested under various conditions, including piecewise stationary multi-armed bandits.
result Master's non-stationarity detection is ineffective for practical horizons, leading to performance similar to random restarting.

Study classifies stock price data into stationary and non-stationary periods for mechanical trading.

problem Classifying stock price fluctuations into stationary and non-stationary periods for trading.
method Stationarity analysis using KM2_2O-Langevin theory and trend-based indicators for stationary periods, oscillator-based indicators for non-stationary periods.
result Back testing confirms the strategy is a safe trading strategy with small maximum drawdown.

Study large deviation in stationarized fully lifted blirp interpolation.

problem Understanding atypical solutions in random optimization problems.
method Large deviation theory applied to fully lifted blirp interpolation.
result Elegant relations uncovered for fundamental interpolating parameters.

Paper tackles uncertainty prediction for deep sequential regression.

problem Challenges in generating accurate uncertainty estimates for deep recurrent networks.
method Flexible method that generates symmetric and asymmetric uncertainty estimates without stationarity assumptions.
result Outperforms competitive baselines on both drift and non-drift scenarios.

Framework isolates causal effects from time series data, improving accuracy under non-stationarity and autocorrelation.

problem Causal inference in non-stationary, autocorrelated time series data.
method Decomposes time series into trend, seasonal, and residual components; performs component-specific causal analysis.
result Framework more accurately recovers ground-truth causal structure than state-of-the-art baselines, especially under strong non-stationarity and temporal autocorrelation.

Study uses RL to optimize dynamic portfolios, addressing non-stationarity and constraints.

problem Non-stationarity and investment constraints in dynamic portfolio optimization.
method Reinforcement learning with regime change variables and practical constraints integration.
result Enhanced prediction accuracy through incorporation of regime change variables.

Develops RL algorithm for lifelong non-stationary environments.

problem Challenges of reinforcement learning in environments with persistent change.
method Formalizes lifelong non-stationarity, uses latent variable models, and leverages online learning and probabilistic inference.
result Substantial improvement in performance over non-reasoning approaches in lifelong non-stationary environments.

New method for estimating and optimizing MDPs without stationarity.

problem Challenges in offline contextual MDP estimation without stationarity.
method Introduces a new adaptive estimation and cost optimization approach for contextual MDPs.
result First robust, theoretically backed method for offline contextual MDP estimation.

This paper explores twisted Lagrangian tori in C^2 and their Hamiltonian stationarity.

problem Understanding the Hamiltonian stationarity of twisted Lagrangian tori in C^2.
method Investigation of differential geometry of twisted tori, including product and Chekanov's exotic tori.
result Only product tori are minimal under Hamiltonian deformations, indicating Chekanov's exotic tori are not area minimal.

Study on fake stationary Volterra Heston model for non-stationary processes.

problem Non-stationary nature of true Volterra equations.
method Weak notion of stationarity (fake stationary regime) for inhomogeneous affine Stochastic Volterra equations.
result Existence of limiting distributions in the long run, which may depend on initial state.

Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods for signal processing on graphs ignore the dimension of time, tr…

2016-06-22abs ↗pdf ↗

Proposes a probabilistic framework for stationary topological signals on simplicial complexes.

problem Complex data structures require new models and tools.
method Generalizes stationarity to topological signals on simplicial complexes.
result Defines topological power spectral density (PSD) for stationary signals.

NAST generalizes scattering transform for non-stationary time series analysis.

problem Analyzing non-stationary time series data.
method Neural activation of scattering transform with various activation functions and high pass filters.
result Central and non-central limit theorems for NAST of Gaussian processes.

A simple baseline outperforms deep learning methods in transportation forecasting.

problem The importance of stationarity and recurrent patterns in transportation data.
method A naive baseline based on average weekly patterns and linear regression.
result The baseline method achieves comparable or better results than state-of-the-art deep learning approaches.

Improved analysis for fair federated learning reduces dependence on noise floor.

problem Asymptotic stationarity in group fair federated learning with reduced noise floor dependence.
method DS FedProxGrad framework with inexact local proximal solutions and fairness regularization.
result Algorithm converges asymptotically to stationarity without dependence on a noise floor.

Second-order economic theory considers new variables to improve price volatility predictions.

problem Current economic models focus on first-order variables, missing second-order variables that affect price volatility.
method Introduces second-order economic theory with new variables composed of sums of squares of agents' transactions.
result Second-order economic theory complements first-order variables and introduces new macroeconomic variables.

This paper addresses Gaussian Process regression over probability measures, revealing a non-stationarity issue between Euclidean and Wasserstein kernels.

problem Non-stationarity issue between Euclidean and Wasserstein kernels in Gaussian Process regression over probability measures.
method Assuming Euclidean input space, applying algebraic transformation based on uncovered non-stationarity relationship to create a non-stationary and Wasserstein-based Gaussian Process model.
result An algebraic transformation simplifies learning a non-stationary Gaussian Process model over probability measures.

Algorithm adapts to non-stationary rewards without prior knowledge.

problem Optimizing decisions in non-stationary environments without prior knowledge of changes.
method Optimization-based algorithm that restarts when non-stationarity is detected.
result Achieves tighter dynamic regret bound and is nearly minimax optimal.

Second-order optimizers retain residual information after data deletion, affecting machine unlearning.

problem Residual information in second-order optimizers after data deletion.
method Comparison of first-order and second-order learners, eigendecomposition analysis.
result Second-order optimizers retain residual information, not detectable by first-order analysis.