SearcharxivSearch

arXiv subjects

Yuxiao Guo

Publications and source records attributed to Yuxiao Guo.

9 recordsLinked to original sources

DeepStack: Facilitating Co-Design Exploration of 3D DRAM-Stacked Accelerators for Distributed LLM Inference

Advances in hybrid bonding and packaging have driven growing interest in 3D DRAM-stacked AI accelerators. As large language models (LLMs) scale to hundreds of billions or trillions of parameters, distributed inference across multiple 3D chips has become essential for AI serving. This trend makes cross-stack co-design critical because system-level parallelization and scheduling choices are tightly coupled with hardware characteristics such as memory organization, interconnects, and thermal constraints. We present DeepStack, an accurate performance model and efficient design space exploration (DSE) framework for distributed 3D-stacked LLM inference. At the hardware level, DeepStack captures transaction-aware memory bandwidth, bank activation constraints, buffering limitations, and thermal and power behavior. At the system level, it incorporates comprehensive parallelization strategies and execution scheduling. Through a dual-stage network abstraction and tile-level compute-communication overlap modeling, DeepStack achieves up to 100,000x faster evaluation than state-of-the-art simulators at comparable accuracy. We cross-validate DeepStack against our in-house 3D designs, an NS-3 backend with 2.12% error, and vLLM serving on eight B200 GPUs with 12.92% error. Combined with hierarchical search, DeepStack efficiently explores about 2.5 x 10^14 design points spanning the number of stacked DRAM layers, DRAM vertical connectivity, interconnects, compute-memory allocation, and distributed scheduling under thermal and area constraints. A search-space ablation shows that restricted DSE baselines can miss up to 9.5x modeled throughput. Beyond modeling and DSE, DeepStack derives design implications for distributed 3D AI systems and guides performance optimization across the stack. Source code and artifacts are available at https://github.com/tile-ai/DeepStack/tree/ae.

cs.AR

BugForge: Constructing and Utilizing DBMS Bug Repository to Enhance DBMS Testing

DBMSs are complex systems prone to bugs that may lead to system failures or compromise data integrity. Establishing unified DBMS bug repositories is crucial for systematically organizing bug-related data, enabling code improvement, and supporting automated testing. In particular, bug reports often contain valuable test inputs and bug-triggering clues that help explore rare execution paths and expose critical buggy behavior, thereby guiding automated DBMS testing. However, the heterogeneity of bug reports, along with their incomplete or inaccurate content, makes it challenging to build unified repositories and convert them into high-quality test cases. In this paper, we propose BugForge, a framework that constructs standardized DBMS bug repositories and leverages them to generate high-quality test cases to enhance DBMS testing. Specifically, BugForge progressively collects bug reports, then employs syntax-aware processing and input-adaptive raw PoC extraction to construct a DBMS bug repository. The repository stores structured bug-related data, including bug metadata and raw PoCs that entail potential bug-triggering semantics. These data are further refined into high-quality test cases through semantic-guided adaptation, thereby enabling enhanced DBMS testing methods, including DBMS fuzzing, regression testing, and cross-DBMS bug discovery. We implemented BugForge for PostgreSQL, MySQL, MariaDB, and MonetDB, totally integrated 37,632 bug reports spanning up to 28 years. Based on the repository, BugForge uncovered 35 previously unknown bugs with 22 confirmed by developers, demonstrating the value of constructing and utilizing bug repositories for DBMS testing.

cs.SE

3D Feature Prediction for Masked-AutoEncoder-Based Point Cloud Pretraining

Masked autoencoders (MAE) have recently been introduced to 3D self-supervised pretraining for point clouds due to their great success in NLP and computer vision. Unlike MAEs used in the image domain, where the pretext task is to restore features at the masked pixels, such as colors, the existing 3D MAE works reconstruct the missing geometry only, i.e, the location of the masked points. In contrast to previous studies, we advocate that point location recovery is inessential and restoring intrinsic point features is much superior. To this end, we propose to ignore point position reconstruction and recover high-order features at masked points including surface normals and surface variations, through a novel attention-based decoder which is independent of the encoder design. We validate the effectiveness of our pretext task and decoder design using different encoder structures for 3D training and demonstrate the advantages of our pretrained networks on various point cloud analysis tasks.

cs.CV

Double Hopf bifurcation in delayed reaction-diffusion systems

Double Hopf bifurcation analysis can be used to reveal some complicated dynamical behavior in a dynamical system, such as the existence or coexistence of periodic orbits, quasi-periodic orbits, or even chaos. In this paper, an algorithm for deriving the normal form near a codimension-two double Hopf bifurcation of a reaction-diffusion system with time delay and Neumann boundary condition is rigorously established, by employing the center manifold reduction technique and the normal form method. We find that the dynamical behavior near bifurcation points are proved to be governed by twelve distinct unfolding systems. Two examples are performed to illustrate our results: for a stage-structured epidemic model, we find that double Hopf bifurcation appears when varying the diffusion rate and time delay, and two stable spatially inhomogeneous periodic oscillations are proved to coexist near the bifurcation point; in a diffusive predator-prey system, we theoretically proved that quasi-periodic orbits exist on two- or three-torus near a double Hopf bifurcation point, which will break down after slight perturbation, leaving the system a strange attractor.

math.DS

Bautin bifurcation in delayed reaction-diffusion systems with application to the Segel-Jackson model

In this paper, we present an algorithm for deriving the normal forms of Bautin bifurcations in reaction-diffusion systems with time delays and Neumann boundary conditions. On the center manifold near a Bautin bifurcation, the first and second Lyapunov coefficients are calculated explicitly, which completely determine the dynamical behavior near the bifurcation point. As an example, the Segel-Jackson predator-prey model is studied. Near the Bautin bifurcation we find the existence of fold bifurcation of periodic orbits, as well as subcritical and supercritical Hopf bifurcations. Both theoretical and numerical results indicate that solutions with small (large) initial conditions converge to stable periodic orbits (diverge to infinity).

math.DS

DeepTracker: Visualizing the Training Process of Convolutional Neural Networks

Deep convolutional neural networks (CNNs) have achieved remarkable success in various fields. However, training an excellent CNN is practically a trial-and-error process that consumes a tremendous amount of time and computer resources. To accelerate the training process and reduce the number of trials, experts need to understand what has occurred in the training process and why the resulting CNN behaves as such. However, current popular training platforms, such as TensorFlow, only provide very little and general information, such as training/validation errors, which is far from enough to serve this purpose. To bridge this gap and help domain experts with their training tasks in a practical environment, we propose a visual analytics system, DeepTracker, to facilitate the exploration of the rich dynamics of CNN training processes and to identify the unusual patterns that are hidden behind the huge amount of training log. Specifically,we combine a hierarchical index mechanism and a set of hierarchical small multiples to help experts explore the entire training log from different levels of detail. We also introduce a novel cube-style visualization to reveal the complex correlations among multiple types of heterogeneous training data including neuron weights, validation images, and training iterations. Three case studies are conducted to demonstrate how DeepTracker provides its users with valuable knowledge in an industry-level CNN training process, namely in our case, training ResNet-50 on the ImageNet dataset. We show that our method can be easily applied to other state-of-the-art "very deep" CNN models.

cs.CV

Integrated structure investigation in complex networks by label propagation

The investigation of network structure has important significance to understand the functions of various complex networks. The communities with hierarchical and overlapping structures and the special nodes like hubs and outliers are all common structure features to the networks. Network structure investigation has attracted considerable research effort recently. However, existing studies have only partially explored the structure features. In this paper, a label propagation based integrated network structure investigation algorithm (LINSIA) is proposed. The main novelty here is that LINSIA can uncover hierarchical and overlapping communities, as well as hubs and outliers. Moreover, LINSIA can provide insight into the label propagation mechanism and propose a parameter-free solution that requires no prior knowledge. In addition, LINSIA can give out a soft-partitioning result and depict the degree of overlapping nodes belonging to each relevant community. The proposed algorithm is validated on various synthetic and real-world networks. Experimental results demonstrate that the algorithm outperforms several state-of-the-art methods.

cs.SI

Full-scale Cascade Dynamics Prediction with a Local-First Approach

Information cascades are ubiquitous in various social networking web sites. What mechanisms drive information diffuse in the networks? How does the structure and size of the cascades evolve in time? When and which users will adopt a certain message? Approaching these questions can considerably deepen our understanding about information cascades and facilitate various vital applications, including viral marketing, rumor prevention and even link prediction. Most previous works focus only on the final cascade size prediction. Meanwhile, they are always cascade graph dependent methods, which make them towards large cascades prediction and lead to the criticism that cascades may only be predictable after they have already grown large. In this paper, we study a fundamental problem: full-scale cascade dynamics prediction. That is, how to predict when and which users are activated at any time point of a cascading process. Here we propose a unified framework, FScaleCP, to solve the problem. Given history cascades, we first model the local spreading behaviors as a classification problem. Through data-driven learning, we recognize the common patterns by measuring the driving mechanisms of cascade dynamics. After that we present an intuitive asynchronous propagation method for full-scale cascade dynamics prediction by effectively aggregating the local spreading behaviors. Extensive experiments on social network data set suggest that the proposed method performs noticeably better than other state-of-the-art baselines.

cs.SI

An approach to normal forms of Kuramoto model with distributed delays and the effect of minimal delay

Heterogeneous delays with positive lower bound (gap) are taken into consideration in Kuramoto oscillators. We first establish a perturbation technique, by which universal normal forms and detailed dynamical behavior of this model can be obtained easily. Theoretically, a hysteresis loop is found near the subcritically bifurcated coherent state on the Ott-Antonsen's manifold. For Gamma distributed delay with fixed variance and mean, we find large gap destroys the loop and significantly increases in the number of coexisted coherent attractors. This result is also explained in the viewpoint of excess kurtosis.

math.DS