SearcharxivSearch

arXiv subjects

Chunmao Huang

Publications and source records attributed to Chunmao Huang.

10 recordsLinked to original sources

AverageTime: Enhance Long-Term Time Series Forecasting with Simple Averaging

Multivariate long-term time series forecasting aims to predict future sequences by utilizing historical observations, with a core focus on modeling intra-sequence and cross-channel dependencies. Numerous studies have developed diverse architectures to capture these patterns, achieving significant improvements in forecasting accuracy. Among them, iTransformer, a representative method for channel information extraction, leverages the Transformer architecture to model channel-wise dependencies, thereby facilitating sequence transformation for enhanced forecasting performance. Building upon iTransformer's channel extraction concept, we propose AverageTime, a simple, efficient, and scalable forecasting model. Beyond iTransformer, AverageTime retains the original sequence information and reframes channel extraction as a stackable and extensible architecture. This allows the model to generate multiple novel sequences through various structural mechanisms, rather than being limited to transforming the original input. Moreover, the newly extracted sequences are not restricted to channel processing; other techniques such as series decomposition can also be incorporated to enhance predictive accuracy. Additionally, we introduce a channel clustering technique into AverageTime, which substantially improves training and inference efficiency with negligible performance loss. Experiments on real-world datasets demonstrate that with only two straightforward averaging operations, applied to both the extracted sequences and the original series. AverageTime surpasses state-of-the-art models in forecasting performance while maintaining near-linear complexity. This work offers a new perspective on time series forecasting: enriching sequence information through extraction and fusion. The source code is available at https://github.com/ UniqueoneZ/AverageTime.

cs.LG

Central limit theorem and Berry-Esseen bounds for a branching random walk with immigration in a random environment

We consider a branching random walk on $d$-dimensional real space with immigration in a time-dependent random environment. Let $Z_n(\mathbf t)$ be the so-called partition function of the process, namely, the moment generating function of the counting measure describing the dispersion of individuals at time $n$. For $\mathbf t$ fixed, the logarithm $\log Z_n(\mathbf t)$ satisfies a central limit theorem. By studying the logarithmic moments of the intrinsic submartingale of the system and its convergence rates, we establish the uniform and non-uniform Berry-Esseen bounds corresponding to the central limit theorem, and discover the exact convergence rate in the central limit theorem.

math.PR

Large and moderate deviations for a $\mathbb{R}^d$-valued branching random walk with a random environment in time

We consider a $\mathbb{R}^d$-valued branching random walk with a stationary and ergodic environment $ξ=(ξ_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. With the help of the uniform convergence of martingale and the multifractal analysis, we establish a large deviation result for the measures $Z_n$ as well as a moderate deviation principle.

math.PR

Convergence of martingale and moderate deviations for a branching random walk with a random environment in time

We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $ξ=(ξ_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$ and $\tilde Z_n(t)=\int e^{tx}Z_n(dx)$ be its Laplace transform. We show the $L^p$ convergence rate and the uniform convergence of the martingale $\tilde Z_n(t)/\mathbb E[\tilde Z_n(t)|ξ]$, and establish a moderate deviation principle for the measures $Z_n$.

math.PR

Branching random walk with a random environment in time

We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $ξ=(ξ_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. For the case where the corresponding branching process $\{Z_n(\mathbb{R})\}$ $ (n\in\mathbb{N})$ is supercritical, we establish large deviation principles, central limit theorems and a local limit theorem for the sequence of counting measures $\{Z_n\}$, and prove that the position $R_n$ (resp. $L_n$) of rightmost (resp. leftmost) particles of generation $n$ satisfies a law of large numbers.

math.PR

Moments for multi-dimensional Mandelbrot's cascades

We consider the distributional equation $\textbf{Z}\stackrel{d}{=}\sum_{k=1}^N\textbf{A}_k\textbf{Z}(k) $, where $N$ is a random variable taking value in $\mathbb N_0=\{0,1,\cdots\}$, $\textbf{A}_1,\textbf{A}_2,\cdots$ are $p\times p$ non-negative random matrix, and $\textbf{Z},\textbf{Z}(1),\textbf{Z}(2),\cdots$ are $i.i.d$ random vectors in in $\mathbb{R}_+^p$ with $\mathbb{R}_+=[0,\infty)$, which are independent of $(N,\textbf{A}_1,\textbf{A}_2,\cdots)$. Let $\{\mathbf Y_n\}$ be the multi-dimensional Mandelbrot's martingale defined as sums of products of random matrixes indexed by nodes of a Galton-Watson tree plus an appropriate vector. Its limit $\mathbf Y$ is a solution of the equation above. For $α>1$, we show respectively a sufficient condition and a necessary condition for $\mathbb E\|\mathbf Y\|^α\in(0,\infty)$. Then for a non-degenerate solution $\mathbf Z$ of the equation above, we show the decay rates of $\mathbb E e^{-\mathbf t\cdot \mathbf Z}$ as $\|\mathbf t\|\rightarrow\infty$ and those of the tail probability $\mathbb P(\mathbf y\cdot \mathbf Z\leq x)$ as $x\rightarrow 0$ for given $\mathbf y=(y^1,\cdots,y^p)\in \mathbb R_{+}^p$, and the existence of the harmonic moments of $\mathbf y\cdot \mathbf Z$. As application, these above results about the moments (of positive and negative orders) of $\mathbf Y$ are applied to a special multitype branching random walk. Moreover, for the case where all the vectors and matrixes of the equation above are complex, a sufficient condition for the $L^α$ convergence and the $α$th-moment of the Mandelbrot's martingale $\{\mathbf Y_n\}$ is also established.

math.PR

Convergence in $L^p$ and its exponential rate for a branching process in a random environment

We consider a supercritical branching process $(Z_n)$ in a random environment $ξ$. Let $W$ be the limit of the normalized population size $W_n=Z_n/E[Z_n|ξ]$. We first show a necessary and sufficient condition for the quenched $L^p$ ($p>1$) convergence of $(W_n)$, which completes the known result for the annealed $L^p$ convergence. We then show that the convergence rate is exponential, and we find the maximal value of $ρ>1$ such that $ρ^n(W-W_n)\rightarrow 0$ in $L^p$, in both quenched and annealed sense. Similar results are also shown for a branching process in a varying environment.

math.PR

Weak law of large numbers for some Markov chains along non homogeneous genealogies

We consider a population with non-overlapping generations, whose size goes to infinity. It is described by a discrete genealogy which may be time non-homogeneous and we pay special attention to branching trees in varying environments. A Markov chain models the dynamic of the trait of each individual along this genealogy and may also be time non-homogeneous. Such models are motivated by transmission processes in the cell division, reproduction-dispersion dynamics or sampling problems in evolution. We want to determine the evolution of the distribution of the traits among the population, namely the asymptotic behavior of the proportion of individuals with a given trait. We prove some quenched laws of large numbers which rely on the ergodicity of an auxiliary process, in the same vein as \cite{guy,delmar}. Applications to time inhomogeneous Markov chains lead us to derive a backward (with respect to the environment) law of large numbers and a law of large numbers on the whole population until generation $n$. A central limit is also established in the transient case.

math.PR

Convergence rates for a branching process in a random environment

Let $(Z_n)$ be a supercritical branching process in a random environment $ξ$. We study the convergence rates of the martingale $W_n = Z_n/ E[Z_n| ξ]$ to its limit $W$. The following results about the convergence almost sur (a.s.), in law or in probability, are shown. (1) Under a moment condition of order $p\in (1,2)$, $W-W_n = o (e^{-na})$ a.s. for some $a>0$ that we find explicitly; assuming only $EW_1 \log W_1^{α+1} < \infty$ for some $α>0$, we have $W-W_n = o (n^{-α})$ a.s.; similar conclusions hold for a branching process in a varying environment. (2) Under a second moment condition, there are norming constants $a_n(ξ)$ (that we calculate explicitly) such that $a_n(ξ) (W-W_n)$ converges in law to a non-degenerate distribution. (3) For a branching process in a finite state random environment, if $W_1$ has a finite exponential moment, then so does $W$, and the decay rate of $P(|W-W_n| > ε)$ is supergeometric.

math.PR

Moments, moderate and large deviations for a branching process in a random environment

Let $(Z_{n})$ be a supercritical branching process in a random environment $ξ$, and $W$ be the limit of the normalized population size $Z_{n}/\mathbb{E}[Z_{n}|ξ]$. We show large and moderate deviation principles for the sequence $\log Z_{n}$ (with appropriate normalization). For the proof, we calculate the critical value for the existence of harmonic moments of $W$, and show an equivalence for all the moments of $Z_{n}$. Central limit theorems on $W-W_n$ and $\log Z_n$ are also established.

math.PR