惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

美团技术团队
T
The Blog of Author Tim Ferriss
C
Check Point Blog
博客园_首页
J
Java Code Geeks
云风的 BLOG
云风的 BLOG
L
LangChain Blog
小众软件
小众软件
Stack Overflow Blog
Stack Overflow Blog
爱范儿
爱范儿
Vercel News
Vercel News
博客园 - Franky
V
V2EX
IT之家
IT之家
U
Unit 42
N
Netflix TechBlog - Medium
腾讯CDC
Apple Machine Learning Research
Apple Machine Learning Research
Microsoft Azure Blog
Microsoft Azure Blog
罗磊的独立博客
博客园 - 叶小钗
H
Help Net Security
V
Visual Studio Blog
GbyAI
GbyAI

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Limit Theorems for step reinforced random walks with regu...
[Submitted on 9 May 2025 (v1), last revised 4 Aug 2026 (this ver · 2025-05-09 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study and prove limit theorems for a class of generalized step reinforced random walks. At every step, the walker chooses a step from the past with probability proportional to a given regularly varying sequence, called the memory sequence. Then it either repeats the chosen step with probability $p$ or uses an innovation with probability $1-p$. We provide functional law of large numbers for the linearly scaled process, viewed at a linearly scaled time. The convergence is almost sure and in $L^1$ under finite mean assumption of the innovation steps. A stronger finite variance assumption gives us $L^2$ convergence.
Under finite variance assumption, the suitably scaled walk exhibits a novel phase transition based on the boundedness of a sequence related to the memory sequence. For the subcritical regime, the scaling is diffusive, while it is superdiffusive otherwise.
The most interesting contribution of the paper is in the critical regime. We show that the process convergence of the scaled walk, viewed in the linear time scale, can be either in distribution or almost sure, depending on the choice of the memory sequence. We argue that the exponential time scale for the critical regime, traditionally used in the literature, is not natural and we obtain the asymptotic behavior under the linear time scale. In addition, we provide novel scalings other than $\sqrt{n \log n}$ in the critical regime. We also raise some open problems.

Submission history

From: Krishanu Maulik [view email]
[v1] Fri, 9 May 2025 09:49:32 UTC (44 KB)
[v2] Mon, 1 Jun 2026 20:03:05 UTC (44 KB)
[v3] Tue, 4 Aug 2026 16:03:05 UTC (43 KB)