Unified approach for non-stationary and clustered bandits.
problem Solving non-stationary and clustered bandits with overlapping solutions.
method Test of homogeneity for seamless integration of non-stationary and clustered bandits.
result Unified solution framework for change detection and cluster identification.
Develops methods for constructing exact, non-stationary solutions to Euler equations.
problem Constructing exact, non-stationary solutions to the incompressible Euler equations.
method Arnold's geometric framework with a generalized Coriolis force.
result Explicit, smooth, global-in-time solutions on curved surfaces and three-dimensional manifolds.
Proposes a method to forecast non-stationary time series.
problem Challenges of non-stationary conditional distributions in deep learning.
method Bayesian dynamic model + deep conditional distribution model.
result Adapts to non-stationary time series better than state-of-the-art solutions.
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…
MetaCURL tackles non-stationary MDPs with optimal dynamic regret.
problem Online learning in non-stationary Markov decision processes.
method MetaCURL uses a meta-algorithm with multiple black-box algorithms and a sleeping expert framework.
result Achieves optimal dynamic regret without prior knowledge of MDP changes.
Adaptive Bayesian learning agent for non-stationary bandits.
problem Non-stationary rewards in reinforcement learning.
method Dynamic memory and statistical hypothesis testing.
result Adapts to changing rewards with minimal regret.
New method optimizes policies in non-stationary environments.
problem Optimizing policies in non-stationary, context-dependent environments.
method Two-phase approach: offline learning and online adaptation.
result Our method outperforms existing approaches in both synthetic and real-world datasets.
Reinforcement learning (RL) methods learn optimal decisions in the presence of a stationary environment. However, the stationary assumption on the environment is very restrictive. In many real world problems like traffic signal control, robotic applications, one often encounters situations with non-stationary environme…
Adaptive sparse GP model for non-stationary data.
problem Non-stationary environments require efficient model updates.
method Reformulated variational sparse GP with adaptive forgetting factor and single inducing point update.
result Fast convergence and efficient model update in non-stationary environments.
Paper uses RL for market making, improving stability in non-stationary markets.
problem Optimizing market making strategies in non-stationary limit order book dynamics.
method Reinforcement Learning (Proximal-Policy Optimization) applied to a simulator.
result RL agent outperforms closed-form optimal solution in non-stationary markets.
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.
BAM integrates new data while selectively remembering past observations.
problem Slow adaptation and convergence to incorrect parameter values in non-stationary environments.
method Bayes' theorem with adaptive memory selection.
result BAM generalizes and demonstrates continuous adaptation in changing environments.
Adaptive beamforming collapses in highly non-stationary environments, but the Universal Switching Beamformer resolves this by dynamically adjusting memory length.
problem Adaptive beamforming performance degrades in highly non-stationary environments.
method Integrating sequential prediction into the beamforming architecture.
result The USB achieves agility and precision in tracking highly non-stationary scenes.
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.
Paper introduces MN-DAG for modeling evolving causal relationships in multivariate time series.
problem Modeling causal relationships that evolve over time and occur at different scales.
method Probabilistic generative model based on spectral and causality theories, combined with Bayesian stochastic variational inference.
result MN-CASTLE outperforms baseline models in identifying causal relationships in multivariate time series data.
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 approach tackles non-stationary multi-agent games with black-box methods.
problem Challenges in learning equilibria in non-stationary multi-agent systems.
method Versatile black-box approach applicable to various games, including general-sum, potential, and Markov games.
result Achieves optimal regret bounds for non-stationary games, with or without knowledge of total variation.
Proposes a new algorithm for non-stationary bandits.
problem Non-stationary reward distributions in contextual bandits.
method Multiscale changepoint detection for adaptive learning.
result Regret bound analysis and superior performance in experiments.
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.
Study incentivizes exploration in non-stationary MAB with compensation.
problem Incentivized exploration for non-stationary stochastic bandits with biased feedback.
method Proposed algorithms for abruptly-changing and continuously-changing non-stationary environments.
result Achieves sublinear regret and compensation over time.
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.
New definitions of ESP for quantum reservoir computing handle non-stationary systems.
problem Traditional ESP does not apply to non-stationary systems.
method Introduce two new categories of ESP: non-stationary ESP and subset/subspace ESP.
result Demonstrates correspondence between non-stationary ESP and QRC with NARMA tasks.
Study combines VICReg and TNC for better encoding of non-stationary seismic signals.
problem Ineffective self-supervised learning on non-stationary time series.
method Combines VICReg and Temporal Neighborhood Coding (TNC).
result Effective for self-supervised learning on non-stationary seismic signals.
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-…
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.
This paper develops the first method for the exact simulation of reflected Brownian motion (RBM) with non-stationary drift and infinitesimal variance. The running time of generating exact samples of non-stationary RBM at any time t is uniformly bounded by O(1/γˉ2) where γˉ is the average drift of…
Unified review of methods for inferring non-stationary process parameters.
problem Inferring parameters of non-stationary processes without a known model.
method Unified review and categorization of algorithms for Parameter Inference from a Non-stationary Unknown Process (PINUP).
result Simple statistical features can perform well on non-stationary systems, highlighting gaps in existing methods.
Enhances DSN with multi-family wavelet transforms and sparsity.
problem Improving interpretability and expressive power of DSN.
method Multi-family wavelet transforms and optimal thresholding.
result Enhanced robustness and diversity of scattering coefficients.
In this paper, we obtain the finite-horizon and infinite-horizon ruin probability asymptotics for risk processes with claims of subexponential tails for non-stationary arrival processes that satisfy a large deviation principle. As a result, the arrival process can be dependent, non-stationary and non-renewal. We give t…
Non-stationarity appears in many online applications such as web search and advertising. In this paper, we study the online learning to rank problem in a non-stationary environment where user preferences change abruptly at an unknown moment in time. We consider the problem of identifying the K most attractive items and…
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.
The paper provides exact multivariate amplitude distributions for non-stationary Gaussian or algebraic fluctuations.
problem Capturing the statistical properties of fluctuating correlations in non-stationary systems.
method Developed a random matrix model to average multivariate amplitude distributions from short time scales to large time scales.
result Explicit multivariate distributions for non-stationary correlation systems are provided, capturing the degree of non-stationarity.
Efficient GP framework for scalable non-stationary processes.
problem Heavy memory and computational requirements in Gaussian process regression for large data sets.
method Exploits structure in the kernel matrix, uses multiple sets of non-equidistant inducing points, and employs Toeplitz and Kronecker structure for efficient inference.
result Demonstrated scalability on numerical examples and large biomedical datasets.
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.
This paper investigates sufficient conditions for a Feynman-Kac functional up to an exit time to be the generalized viscosity solution of a Dirichlet problem. The key ingredient is to find out the continuity of exit operator under Skorokhod topology, which reveals the intrinsic connection between overfitting Dirichlet …
Flexible GP model improves wind power prediction accuracy.
problem Accurate probabilistic prediction of wind power for grid stability.
method Heteroscedastic non-stationary Gaussian process with generalised spectral mixture kernel.
result The proposed model outperforms conventional GP models in wind power prediction.
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 fuzzy time series method for non-stationary data.
problem Forecasting in non-stationary environments with concept drift.
method Non-Stationary Fuzzy Time Series (NSFTS) with time-varying parameters.
result The method can adapt to dynamic changes in the stochastic process.
This work introduces a new model for complex stochastic processes.
problem Difficulties in representing non-stationary distributions with conventional models.
method Recurrent Autoregressive Flows using normalizing flows with recurrent neural connections.
result Demonstrates the effectiveness of the proposed model through experiments.
Extends geometric approach to model non-stationary extremal dependence.
problem Capturing evolving extremal dependence in multivariate data.
method Geometric framework for non-stationary multivariate extreme value modelling.
result Framework can capture various dependence forms and is robust to different model formulations.
Predictive sampling improves on Thompson sampling for non-stationary bandit environments.
problem Thompson sampling fails in non-stationary bandit environments.
method Proposes predictive sampling, which deprioritizes actions based on information loss rate.
result Predictive sampling outperforms Thompson sampling in all tested non-stationary environments.
Prototype-based generative replay framework for online continual regression.
problem Addressing the challenge of non-stationary data streams in regression tasks.
method Adaptive output-space discretization model for prototype-based generative replay.
result Reduces forgetting and provides more stable performance.
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(∣S∣1/2∣A∣1/2ΔT1/6T5/6) for both algorithms. Algorithm minimizes regret in non-stationary dueling bandits with unknown parameters.
problem Minimizing regret in dueling bandits with time-varying preferences.
method Proposes Beat the Winner Reset algorithm and meta-algorithms DETECT and Monitored Dueling Bandits.
result Proves bounds on expected weak and strong regret for non-stationary dueling bandits.
We characterize the sample size required for accurate graphical model selection from non-stationary samples. The observed data is modeled as a vector-valued zero-mean Gaussian random process whose samples are uncorrelated but have different covariance matrices. This model contains as special cases the standard setting …
Integrable flows on null curves in anti-de Sitter 3-space studied.
problem Analyzing integrable flows on null curves in anti-de Sitter 3-space.
method Formulated integrable flows related to the KdV hierarchy on null curves exploiting the geometry of anti-de Sitter 3-space.
result Explicitly found closed stationary solutions in terms of periodic solutions of a Lamé equation.
Generative models improve inverse problems by providing tailored priors.
problem Analyzing the error in inverse problems solved with generative priors.
method Quantitative error bounds for minimum Wasserstein-2 generative models.
result The error in the posterior due to the generative prior is bounded by the prior's error in Wasserstein-1 distance.