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

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for Non-stationary Functions

SmoothFBO tackles non-stationary functional bilevel optimization.

problem Current FBO methods are limited to static offline settings and perform poorly in online, non-stationary scenarios.
method SmoothFBO introduces a time-smoothed stochastic hypergradient estimator with a window parameter to handle non-stationarity.
result SmoothFBO achieves sublinear regret and outperforms existing methods in non-stationary hyperparameter optimization and model-based reinforcement learning.

New algorithm tackles non-stationary reinforcement learning with general function approximation.

problem Understanding non-stationary MDPs with function approximation.
method Dynamic Bellman Eluder (DBE) dimension for complexity, sliding window mechanism, confidence set design.
result Upper bound on dynamic regret for proposed SW-OPEA algorithm.

Designing a covariance function that represents the underlying correlation is a crucial step in modeling complex natural systems, such as climate models. Geospatial datasets at a global scale usually suffer from non-stationarity and non-uniformly smooth spatial boundaries. A Gaussian process regression using a non-stat…

2015-07-09abs ↗pdf ↗

We propose non-stationary spectral kernels for Gaussian process regression. We propose to model the spectral density of a non-stationary kernel function as a mixture of input-dependent Gaussian process frequency density surfaces. We solve the generalised Fourier transform with such a model, and present a family of non-…

2017-05-24abs ↗pdf ↗

PROPO tackles non-stationary MDPs with efficient policy optimization.

problem Non-stationary MDPs with varying reward and transition kernels.
method PROPO, a periodic restarted optimistic policy optimization algorithm with sliding-window-based policy evaluation and improvement.
result PROPO achieves near-optimal performance in non-stationary MDPs.

Novel CSK kernel improves GP model generalization for non-stationary patterns.

problem Improving generalization of Gaussian process models for non-stationary data.
method Introduced convolutional spectral kernel (CSK) derived from convolution of imaginary radial basis functions, using Fourier transform for interpretation.
result CSK improves GP model generalization on spatiotemporal datasets.

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.

New RL algorithm tackles non-stationary environments with flexible policy updates.

problem Non-stationary reinforcement learning with time-varying rewards and transition probabilities.
method Model-free policy-based algorithm NS-NAC with restart-based exploration and dynamic learning rates.
result Dynamic regret of ildeO(S1/2A1/2ΔT1/6T5/6) ilde{\mathscr O}(|S|^{1/2}|A|^{1/2}Δ_T^{1/6}T^{5/6}) for both algorithms.

Non-stationary reinforcement learning is challenging due to the complexity of updating value functions.

problem Challenges in non-stationary reinforcement learning, especially in updating value functions.
method Proved a worst-case complexity result for modifying reinforcement learning problems.
result Modifying reinforcement learning problems requires an amount of time almost as large as the number of states.

Bayesian Optimization uses Deep Gaussian Processes for non-stationary functions.

problem Optimizing expensive non-stationary functions with classic Gaussian Processes.
method Deep Gaussian Processes as surrogate models for capturing non-stationarity.
result The proposed algorithm outperforms state-of-the-art methods on analytical and aerospace design problems.

Develops a deep non-stationary kernel for non-stationary spatio-temporal point processes.

problem Capturing non-stationary dependencies in point process data.
method Approximates the influence kernel with a novel low-rank decomposition and introduces a log-barrier penalty to maintain non-negativity.
result Demonstrates superior performance and computational efficiency compared to state-of-the-art methods.

Paper tackles non-stationary kernelized bandits with near-optimal algorithm.

problem Minimizing regret in a time-varying reward function.
method Near-optimal algorithm with a novel restarting phased elimination with random permutation (R-PERP).
result Regret upper bound matches the lower bound, making the algorithm near-optimal.

Develops large-sample theory for non-stationary source separation.

problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.

A new learning strategy using two GP layers for inhomogeneous data.

problem Addressing inhomogeneous empirical correlation structures in data.
method Modeling the function as a sample function of a non-stationary Gaussian Process (GP) nested within multiple stationary GPs, with hyperparameters dependent on the outer GP.
result The approach is sufficient with two GP layers, and the model can be implemented using MCMC.

Standard kernels such as Matérn or RBF kernels only encode simple monotonic dependencies within the input space. Spectral mixture kernels have been proposed as general-purpose, flexible kernels for learning and discovering more complicated patterns in the data. Spectral mixture kernels have recently been generalized in…

2018-11-27abs ↗pdf ↗

This work explores variably scaled kernels to improve non-stationary Gaussian processes.

problem Limited ability of stationary kernels to represent heterogeneous correlation structures.
method Introduces variably scaled kernels to modify correlation structures explicitly.
result Improved reconstruction accuracy and better uncertainty estimates for non-stationary data.

We present a novel approach for fully non-stationary Gaussian process regression (GPR), where all three key parameters -- noise variance, signal variance and lengthscale -- can be simultaneously input-dependent. We develop gradient-based inference methods to learn the unknown function and the non-stationary model param…

2015-08-18abs ↗pdf ↗

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.

Framework infers Langevin dynamics from stochastic observations of latent systems.

problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.

The paper extends NSGPs with L1L^1-regularization for sparsity and solves the resulting R-NSGP regression problem.

problem Sparsity in non-stationary temporal data.
method Developed an ADMM-based method for solving the regularized NSGP regression problem.
result The proposed methods induce sparsity in the parameters of NSGPs.

Non-linear shrinkage isn't optimal for portfolio optimization, especially when asset dependence is non-stationary.

problem Optimizing portfolios with non-stationary asset dependence structures.
method Derived and compared non-linear shrinkage with an optimal target for covariance matrix estimation.
result Non-linear shrinkage can be significantly improved for portfolio optimization.

New algorithm tackles non-stationary RL with near-optimal regret bounds.

problem Model-free reinforcement learning in non-stationary Markov decision processes.
method Proposed RestartQ-UCB algorithm with Freedman-type bonus terms.
result Achieves near-optimal dynamic regret bound in non-stationary RL.

New definition resolves ambiguity in non-stationary bandit classification.

problem Ambiguity in classifying non-stationary bandits using existing definitions.
method Introducing a formal definition that resolves ambiguity and provides a unified approach.
result Unified approach applicable to both Bayesian and frequentist formulations, resolves classification issues.

Study causal financial signals for non-stationary markets, improving short-term forecasts.

problem Short-term forecasting in non-stationary financial markets under causal constraints.
method Construct causal signals from heterogeneous micro-features using causal centering, linear aggregation, Kalman filter, and forward-like operator.
result Causally constructed observables can exhibit substantial economic relevance in specific regimes but degrade under regime shifts.

The goal of a learner, in standard online learning, is to have the cumulative loss not much larger compared with the best-performing function from some fixed class. Numerous algorithms were shown to have this gap arbitrarily close to zero, compared with the best function that is chosen off-line. Nevertheless, many real…

2013-03-01abs ↗pdf ↗

New algorithm tackles non-stationary combinatorial semi-bandit problems with optimal regret bounds.

problem Non-stationary combinatorial semi-bandit problems in switching and dynamic environments.
method Developed algorithms for both switching and dynamic cases, achieving nearly optimal regret bounds.
result Achieved nearly optimal regret bounds in both switching and dynamic cases.

Paper establishes lower bounds for non-stationary kernelized bandits.

problem Optimizing functions with noisy observations in non-stationary scenarios.
method Develops algorithm-independent lower bounds for time-varying functions under total variation constraints.
result First algorithm-independent lower bounds for time-varying kernelized bandits.

Study non-stationary MDPs using worst-case RL, proposing RATS algorithm.

problem Robust zero-shot planning in non-stationary stochastic environments.
method Model-Based Reinforcement Learning, worst-case approach.
result RATS algorithm demonstrates benefits over reference methods.

A new kernel improves Gaussian process performance for non-stationary data.

problem Poor prediction and uncertainty quantification with standard GPs.
method Study and comparison of non-stationary kernels, propose a new combined kernel.
result A new kernel outperforms existing stationary and non-stationary kernels.

New algorithm combines Geostatistics and Quantile Random Forests for non-stationary spatial modelling.

problem Non-stationary spatial modelling with multiple secondary variables.
method Combines Geostatistics and Quantile Random Forests to estimate conditional distributions and simulate spatial data.
result Consistent results similar to geostatistical and Quantile Random Forests, allowing for embedding simpler interpolation techniques.

Study online ranking in non-stationary environments with abrupt preference changes.

problem Online learning to rank in a non-stationary cascade model where user preferences change abruptly.
method Cascading non-stationary bandits, proposing CascadeDUCB and CascadeSWUCB algorithms.
result Upper and lower bounds on regret for cascading non-stationary bandits algorithms.

A novel GPDA method for high-dimensional functional data.

problem Classification and feature selection challenges in high-dimensional, non-stationary functional data.
method Unified two-layer non-stationary Gaussian process with Ising prior for variable selection and classification.
result Demonstrated superior performance on simulated and proteomics datasets.

NVMDP framework tackles non-stationary MDPs with varying discount rates.

problem Challenges in non-stationary environments and infinite-horizon formulations for reinforcement learning.
method Introduces NVMDP framework that accommodates non-stationarity and varying discount rates.
result NVMDPs provide a flexible mechanism to shape optimal policies without altering state or action spaces.

Efficient methods reduce projections in non-stationary online learning.

problem Optimizing dynamic and adaptive regret in non-stationary online learning environments.
method Presented efficient methods reducing the number of projections per round from O(logT)O(\log T) to 11.
result Reduced number of projections per round from O(logT)O(\log T) to 11 for optimizing dynamic and adaptive regret.

Transformers achieve near-optimal dynamic regret in non-stationary reinforcement learning.

problem Understanding and handling non-stationary environments in reinforcement learning.
method Demonstrated that transformers can achieve nearly optimal dynamic regret bounds in non-stationary settings.
result Transformers can approximate and learn strategies for non-stationary environments, matching or outperforming existing expert algorithms.

New algorithms reduce dynamic regret for convex and smooth functions in non-stationary environments.

problem Online convex optimization in non-stationary environments.
method Proposed novel online algorithms exploiting smoothness to reduce dynamic regret.
result Dynamic regret improved to O(T)\mathcal{O}(T) for convex and smooth functions.