Search arXiv⌕ Search

arXiv subjects

Haoyu Albert Wang

Publications and source records attributed to Haoyu Albert Wang.

2 recordsLinked to original sources

Full Lyapunov Spectra of Random Neural Networks, Part I: Finite-Time and Asymptotic Theory

We develop a dynamical mean-field framework for the full finite-time and stationary asymptotic Lyapunov spectra of random recurrent neural networks. At finite observation time, an exact log-determinant representation of tangent-propagator singular values leads to a closed-contour matrix Dyson equation for the smoothed spectral tail. In the stationary setting, a cocycle representation yields an operator equation for the asymptotic cumulative spectrum. Both formulations retain complete local gain histories and the repeated action of quenched connectivity. Direct singular-value calculations and network QR spectra support the predictions in the regimes examined, with sampling uncertainty and numerical cutoffs assessed separately. The stationary equation also recovers the known maximal exponent, and controlled gain-history replay illustrates how temporal correlations redistribute instability. This work was carried out in collaboration with ChatGPT 5.6 Sol. Toward the end of preparation we became aware of David G. Clark's contemporaneous work, \emph{Lyapunov spectrum of random neural networks}[arXiv:2610.12426], which reports overlapping mean-field results for the full Lyapunov spectrum using a cavity approach.

q-bio.NC↗

MacTok: Robust Continuous Tokenization for Image Generation

Continuous image tokenizers enable efficient visual generation, and those based on variational frameworks can learn smooth, structured latent representations through KL regularization. Yet this often leads to posterior collapse when using fewer tokens, where the encoder fails to encode informative features into the compressed latent space. To address this, we introduce \textbf{MacTok}, a \textbf{M}asked \textbf{A}ugmenting 1D \textbf{C}ontinuous \textbf{Tok}enizer that leverages image masking and representation alignment to prevent collapse while learning compact and robust representations. MacTok applies both random masking to regularize latent learning and DINO-guided semantic masking to emphasize informative regions in images, forcing the model to encode robust semantics from incomplete visual evidence. Combined with global and local representation alignment, MacTok preserves rich discriminative information in a highly compressed 1D latent space, requiring only 64 or 128 tokens. On ImageNet, MacTok achieves a competitive gFID of 1.44 at 256$\times$256 and a state-of-the-art 1.52 at 512$\times$512 with SiT-XL, while reducing token usage by up to 64$\times$. These results confirm that masking and semantic guidance together prevent posterior collapse and achieve efficient, high-fidelity tokenization.

cs.CV↗