Peihao Wang

Peihao Wang

Auto-generated profile, based on publicly available information

Peihao Wang

The University of Texas at Austin

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 October 2022
Verified
Book Chapter
Closed access
PDF file
ZFZhiwen Fan
Zhiwen Fan
YJYifan Jiang
Yifan Jiang
PWPeihao Wang
Peihao Wang
XGXinyu Gong
Xinyu Gong
DXDejia Xu
Dejia Xu
ZWZhangyang (Atlas) Wang
Zhangyang (Atlas) Wang

11 May 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
Tianlong ChenTianlong Chen
Tianlong Chen
KZKaixiong Zhou
Kaixiong Zhou
KDKeyu Duan
Keyu Duan
WZWenqing Zheng
Wenqing Zheng
PWPeihao Wang
Peihao Wang
ZWZhangyang (Atlas) Wang
Zhangyang (Atlas) Wang
Training deep graph neural networks (GNNs) is notoriously hard. Besides the standard plights in training deep architectures such as vanishing gradients and overfitting, it also uniquely suffers from over-smoothing, information squashing, and so on, which limits their potential power for encoding the high-order neighbor structure in large-scale graphs. Although numerous efforts are proposed to address these limitations, such as various forms of skip connections, graph normalization, and random dropping, it is difficult to disentangle the advantages brought by a deep GNN architecture from those tricks" necessary to train such an architecture. Moreover, the lack of a standardized benchmark with fair and consistent experimental settings poses an almost insurmountable obstacle to gauging the effectiveness of new mechanisms. In view of those, we present the first fair and reproducible benchmark dedicated to assessing the tricks" of training deep GNNs. We categorize existing approaches, investigate their hyperparameter sensitivity, and unify the basic configuration. Comprehensive evaluations are then conducted on tens of representative graph datasets including the recent large-scale Open Graph Benchmark, with diverse deep GNN backbones. We demonstrate that an organic combo of initial connection, identity mapping, group, and batch normalization attains the new state-of-the-art results for deep GNNs on large datasets.

19 November 2024 in ACM Transactions on Graphics
Verified
Journal Article
Open access
JWJian Wang
Jian Wang
SMSizhuo Ma
Sizhuo Ma
KBKarl Bayer
Karl Bayer
YZYi Zhang
Yi Zhang
PWPeihao Wang
Peihao Wang
GKGurunandan Krishnan
Gurunandan Krishnan
Augmented reality (AR) mirrors are novel displays that have great potential for commercial applications such as virtual apparel try-on. Typically the camera is placed beside the display, leading to distorted perspectives during user interaction. In this paper, we present a novel approach to address this problem by placing the camera behind a transparent display, thereby providing users with a perspective-aligned experience. Simply placing the camera behind the display can compromise image quality due to optical effects. We meticulously analyze the image formation process, and present an image restoration algorithm that benefits from physics-based data synthesis and network design. Our method significantly improves image quality and outperforms existing methods especially on the underexplored wire and backscatter artifacts. We then carefully design a full AR mirror system including display and camera selection, real-time processing pipeline, and mechanical design. Our user study demonstrates that the system is exceptionally well-received by users, highlighting its advantages over existing camera configurations not only as an AR mirror, but also for video conferencing. Our work represents a step forward in the development of AR mirrors, with potential applications in retail, cosmetics, fashion, etc. The image restoration dataset and code are available at https://perspective-armirror.github.io/.

2 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
PWPeihao Wang
Peihao Wang
RPRameswar Panda
Rameswar Panda
LHLucas Torroba Hennigen
Lucas Torroba Hennigen
PGPhilip Greengard
Philip Greengard
LKLeonid Karlinsky
Leonid Karlinsky
YKYoon Kim
Yoon Kim
Scaling transformers has led to significant breakthroughs in many domains, leading to a paradigm in which larger versions of existing models are trained and released on a periodic basis. New instances of such models are typically trained completely from scratch, despite the fact that they are often just scaled-up versions of their smaller counterparts. How can we use the implicit knowledge in the parameters of smaller, extant models to enable faster training of newer, larger models? This paper describes an approach for accelerating transformer training by learning to grow pretrained transformers, where we learn to linearly map the parameters of the smaller model to initialize the larger model. For tractable learning, we factorize the linear transformation as a composition of (linear) width- and depth-growth operators, and further employ a Kronecker factorization of these growth operators to encode architectural knowledge. Extensive experiments across both language and vision transformers demonstrate that our learned Linear Growth Operator (LiGO) can save up to 50% computational cost of training from scratch, while also consistently outperforming strong baselines that also reuse smaller pretrained models to initialize larger models.

1 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
KDKeyu Duan
Keyu Duan
ZLZirui Liu
Zirui Liu
PWPeihao Wang
Peihao Wang
WZWenqing Zheng
Wenqing Zheng
KZKaixiong Zhou
Kaixiong Zhou
ZWZhangyang Wang
Zhangyang Wang
Large-scale graph training is a notoriously challenging problem for graph neural networks (GNNs). Due to the nature of evolving graph structures into the training process, vanilla GNNs usually fail to scale up, limited by the GPU memory space. Up to now, though numerous scalable GNN architectures have been proposed, we still lack a comprehensive survey and fair benchmark of this reservoir to find the rationale for designing scalable GNNs. To this end, we first systematically formulate the representative methods of large-scale graph training into several branches and further establish a fair and consistent benchmark for them by a greedy hyperparameter searching. In addition, regarding efficiency, we theoretically evaluate the time and space complexity of various branches and empirically compare them w.r.t GPU memory usage, throughput, and convergence. Furthermore, We analyze the pros and cons for various branches of scalable GNNs and then present a new ensembling training manner, named EnGCN, to address the existing issues. Our code is available at https://github.com/VITA-Group/Large_Scale_GCN_Benchmarking.

8 May 2025 in arXiv
Verified
Preprint
Open access
PDF file
PWPeihao Wang
Peihao Wang
YWYuehao Wang
Yuehao Wang
DWDilin Wang
Dilin Wang
SMSreyas Mohan
Sreyas Mohan
ZFZhiwen Fan
Zhiwen Fan
RRRakesh Ranjan
Rakesh Ranjan
3D Gaussian Splatting (3DGS) has emerged as a powerful technique for real-time, high-resolution novel view synthesis. By representing scenes as a mixture of Gaussian primitives, 3DGS leverages GPU rasterization pipelines for efficient rendering and reconstruction. To optimize scene coverage and capture fine details, 3DGS employs a densification algorithm to generate additional points. However, this process often leads to redundant point clouds, resulting in excessive memory usage, slower performance, and substantial storage demands - posing significant challenges for deployment on resource-constrained devices. To address this limitation, we propose a theoretical framework that demystifies and improves density control in 3DGS. Our analysis reveals that splitting is crucial for escaping saddle points. Through an optimization-theoretic approach, we establish the necessary conditions for densification, determine the minimal number of offspring Gaussians, identify the optimal parameter update direction, and provide an analytical solution for normalizing off-spring opacity. Building on these insights, we introduce SteepGS, incorporating steepest density control, a principled strategy that minimizes loss while maintaining a compact point cloud. SteepGS achieves a ~50% reduction in Gaussian points without compromising rendering quality, significantly enhancing both efficiency and scalability.