The problem of time-series clustering is considered in the case where each data-point is a sample generated by a piecewise stationary ergodic process. Stationary processes are perhaps the most general class of processes considered in non-parametric statistics and allow for arbitrary long-range dependence between variab…
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,695 papers · 148 categories
Trend · papers per month
48 results for “piecewise stationary”
A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Banditscs.LG
We investigate the piecewise-stationary combinatorial semi-bandit problem. Compared to the original combinatorial semi-bandit problem, our setting assumes the reward distributions of base arms may change in a piecewise-stationary manner at unknown time steps. We propose an algorithm, \texttt{GLR-CUCB}, which incorporat…
DAL enhances black-box bandit algorithms for non-stationary environments.
problem Non-stationary environments in bandit problems.
method DAL combines any stationary bandit algorithm with a change detector.
result DAL consistently outperforms state-of-the-art methods in various non-stationary scenarios.
Algorithm identifies best arm in piecewise stationary linear bandits with minimal samples.
problem Identifying the best arm in a piecewise stationary linear bandit model with unknown contexts and changepoints.
method Design of PSBAI algorithm, consisting of PSBAI and NBAI subroutines.
result PSBAI achieves optimal sample complexity up to a logarithmic factor.
Cascading bandit (CB) is a popular model for web search and online advertising, where an agent aims to learn the most attractive items out of a ground set of size during the interaction with a user. However, the stationary CB model may be too simple to apply to real-world problems, where user preferences may ch…
New algorithms detect changes in non-stationary MABs for better performance.
problem Non-stationary MAB environments where arm reward distributions change over time.
method Modular Detection Augmented Bandit (DAB) procedures with improved performance lower bounds.
result Modular DAB procedures achieve order-optimal regret bounds for various change detectors and bandit algorithms.
For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from to a compact Riemannian manifold without boundary. We generalize the notion of stationary harmonic map and prove the partial regularity. We also discuss the global Li…
Study shows nonstationary bandits require T-dependent regret even with minimal nonstationarity.
problem Understanding satisficing regret in nonstationary multi-armed bandits.
method Developed a novel Fano-based framework for nonstationary bandits with a post-interaction reference construction.
result Optimal regret scales with T even with minimal nonstationarity, contrasting with stationary case.
Study adapts combinatorial semi-bandit for piecewise stationary, causally related rewards.
problem Nonstationary environment with changing base arms' distributions and causal relationships.
method Upper Confidence Bound (UCB) algorithm with change-point detector and group restart strategy.
result Regret upper bound reflecting effects of structural and distribution changes.
The multi-armed bandit problem has been extensively studied under the stationary assumption. However in reality, this assumption often does not hold because the distributions of rewards themselves may change over time. In this paper, we propose a change-detection (CD) based framework for multi-armed bandit problems und…
We introduce GLR-klUCB, a novel algorithm for the piecewise iid non-stationary bandit problem with bounded rewards. This algorithm combines an efficient bandit algorithm, kl-UCB, with an efficient, parameter-free, changepoint detector, the Bernoulli Generalized Likelihood Ratio Test, for which we provide new theoretica…
Multi-armed bandit (MAB) is a class of online learning problems where a learning agent aims to maximize its expected cumulative reward while repeatedly selecting to pull arms with unknown reward distributions. We consider a scenario where the reward distributions may change in a piecewise-stationary fashion at unknown …
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.
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 , optimal modulo dependencies.
The Bivariate Dynamic Contagion Processes (BDCP) are a broad class of bivariate point processes characterized by the intensities as a general class of piecewise deterministic Markov processes. The BDCP describes a rich dynamic structure where the system is under the influence of both external and internal factors model…
Memory-based models can learn to approximate Bayes-optimal predictors for non-stationary data.
problem Learning from non-stationary data with unobserved switching points.
method Memory-based neural models, including Transformers, LSTMs, and RNNs, trained to minimize log loss.
result Memory-based models can accurately approximate known Bayes-optimal algorithms and perform Bayesian inference over latent switching points.
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.
Paper designs a bandit algorithm without reward distribution info.
problem Designing bandit algorithms without reward distribution info.
method Alternates between greedy rule and forced exploration.
result Achieves substantial regret upper bounds.
Improved algorithm detects changes in RL environments with non-stationary MDPs.
problem Learning in non-stationary reinforcement learning environments.
method R-BOCPD-UCRL2 algorithm for MDPs with multinomial state transitions.
result Near-optimal theoretical guarantees in terms of false-alarm rate and detection delay.
DARLING tackles non-stationary RL with guarantees, improving dynamic regret.
problem Non-stationary reinforcement learning in unknown change points.
method Detection Augmented Reinforcement Learning (DARLING) for tabular and linear MDPs.
result DARLING matches minimax lower bounds in tabular and linear MDPs.
New algorithm reduces dynamic regret for noisy gradient feedback with piecewise polynomial comparators.
problem Online estimation of piecewise polynomial trends with noisy feedback.
method Introduces variational constraint for piecewise polynomial comparators, designs adaptive algorithm.
result Achieves nearly optimal dynamic regret of $ ilde{O}(n^{ rac{1}{2k+3}}C_n^{ rac{2}{2k+3}})$.
New approach limits regret in non-stationary bandits.
problem Understanding worst case regret in time-varying bandits.
method Belief inertia argument to resist new evidence after changes.
result Linear worst case regret for classical and restarting algorithms.
Algorithm reduces decision-making errors in multi-agent bandit problems.
problem Minimizing decision errors in multi-agent multi-armed bandit problems.
method RBO-Coop-UCB algorithm with Bayesian change point detection.
result Expected group regret is upper bounded by .
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.
This paper introduces the Partition Tree Weighting technique, an efficient meta-algorithm for piecewise stationary sources. The technique works by performing Bayesian model averaging over a large class of possible partitions of the data into locally stationary segments. It uses a prior, closely related to the Context T…
New method uses PDMPs with sub-sampling for efficient sampling from posterior distributions.
problem Efficient sampling from posterior distributions with limited data access.
method Approximate simulation of PDMPs with sub-sampling and stochastic gradient estimation.
result Stochastic-gradient PDMPs are efficient and robust compared to Langevin dynamics.
This work studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued. We extend the graph trend filtering framework to denoising vector-valued graph signals with a family of non-convex regularizers, which exhibi…
We use partial actions, as formalized by Exel, to construct various commensurating actions. We use this in the context of groups piecewise preserving a geometric structure, and we interpret the transfixing property of these commensurating actions as the existence of a model for which the group acts preserving the geome…
Investigates stability of piecewise flat Ricci flow using analysis and simulations.
problem Stability of piecewise flat Ricci flow.
method Linear stability analysis and numerical simulations.
result Adaptations avoided numerical instability and led to convergence to smooth solutions.
Stochastic compliance/evasion dynamics in tax models: a piecewise deterministic Markov process approachphysics.soc-ph
New model predicts dynamic tax evasion with audits and imitation.
problem Static treatment of tax compliance and evasion in Bertotti and Modanese model.
method Piecewise Deterministic Markov Processes (PDMPs) for audits and imitation mechanisms.
result Model shows persistent fluctuations and stationary distribution, not extreme equilibrium.
Neural networks can represent complex piecewise functions efficiently.
problem Representing continuous piecewise affine functions with neural networks.
method Two hidden layers with ReLU activation, neurons for pieces.
result CPA functions can be represented by a neural network with linear size.
Theorem proves integrability for piecewise-smooth distributions.
problem Integrability of piecewise-smooth distributions.
method Generalizations of Frobenius integrability theorem.
result Sufficient criteria for complete integrability with bi-Lipschitz coordinates.
A new algorithm for personalized recommendations adapts to changing user interests.
problem Adapting to time-varying user interests in recommendation systems.
method Contextual bandit approach with models for disjoint and hybrid payoffs.
result Sublinear regret in time length T for abrupt reward changes.
Piecewise flat approximations for curvature in Euclidean and non-Euclidean spaces.
problem Approximating local extrinsic curvature on discrete manifolds.
method Constructing discrete curvature forms on piecewise flat manifolds, using weighted sums of hinge angles.
result Converges to smooth curvature values as mesh refinement occurs, favorably comparing with other discrete approaches.
New algorithm catches moving subspaces in bandit problems.
problem Adapt to changing low-dimensional latent subspaces in bandit settings.
method Piecewise-stationary low-rank linear contextual bandits with CUSUM-style boundary detection.
result Achieves intrinsic rank dynamic regret rate of .
Study geometrically characterizes piecewise circular curves with decreasing curvature.
problem Characterizing piecewise circular curves with decreasing curvature.
method Introducing moduli spaces and relating them to Legendrian polygons.
result Proves the moduli space contains a connected component homeomorphic to the Fock-Goncharov space of positive flags.
Center and torsion of a quotient of the group of piecewise linear homeomorphisms of the real linemath.GT
The center of a quotient group of piecewise linear homeomorphisms is trivial.
problem Understanding the structure of a specific group of homeomorphisms.
method Analyzing a quotient of piecewise linear homeomorphisms of the real line.
result The center of the quotient group is trivial.
GraN-GAN normalizes gradients for better GAN performance.
problem Improving image generation in GANs with piecewise linear discriminators.
method Piecewise Gradient Normalization (GraN) for input-dependent normalization.
result Significant performance gains in image generation across various datasets.
The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.
problem Creating an arbitrage-free interpolation for option pricing models.
method Generalizing the local variance gamma model to a piecewise quadratic local variance function.
result The quadratic model results in an arbitrage-free interpolation of class C3, reducing knots and computational cost.
This article provides an attempt to extend concepts from the theory of Riemannian manifolds to piecewise linear spaces. In particular we propose an analogue of the Ricci tensor, which we give the name of an Einstein vector field. On a given set of piecewise linear spaces we define and discuss (normalized) Ricci flows. …
We show that all finite-dimensional resolvable generalized manifolds with the piecewise disjoint arc-disk property are codimension one manifold factors. We then show how the piecewise disjoint arc-disk property and other general position properties that detect codimension one manifold factors are related. We also note …
PARC uses piecewise linear predictors for regression and classification.
problem Multivariate regression and classification problems.
method Alternates between ridge and softmax regression, and cluster assignment based on accuracy and separability.
result Converges to a local minimum in a finite number of steps.
A piecewise flat Finsler metric on a triangulated surface is a metric whose restriction to any triangle is a flat triangle in some Minkowski space with straight edges. One of the main purposes of this work is to study the properties of geodesics on a piecewise flat Finsler surface, especially when it meets a vertex…
Neural network models improve survival analysis with reduced computation time.
problem Limited expressiveness of standard survival models.
method Piecewise neural network models of hazard and density functions.
result Models outperform state-of-the-art models with less computation time.
New GP model estimates piecewise continuous functions.
problem Piecewise continuous regression functions in scientific and engineering applications.
method Local Gaussian process model with partitioned local data and joint estimation of boundaries.
result Superior performance over conventional GP models in estimating piecewise regression functions.
Paper proposes algorithms to accurately identify breakpoints in piecewise regression.
problem Identifying accurate breakpoints in piecewise regression for better data fitting.
method Proposes novel greedy algorithms to minimize error and determine optimal breakpoints.
result The proposed algorithms outperform existing methods in accuracy and efficiency.
Simplicial, piecewise-flat discretizations of manifolds provide a clear path towards curvature analysis on discrete geometries and for solutions of PDE's on manifolds of complex topologies. In this manuscript we review and expand on discrete exterior calculus methods using hybrid domains. We then analyze the geometric …
Global approximation for piecewise linear paths via signatures.
problem Global approximation theorems for piecewise linear paths.
method Using signatures of piecewise linear paths and their density in -norms.
result Linear functionals of signatures are dense in -norms under an integrability condition.