← Search

Wenjing Liao

8 accepted papers

2026

GemDepth: Geometry-Embedded Features for 3D-Consistent Video Depth

ICML 2026poster

Video depth estimation extends monocular prediction into the temporal domain to ensure coherence. However, existing methods often suffer from spatial blurring in fine-detail regions and temporal inconsistencies. We argue that current approaches, which primarily rely on temporal smoothing via Transfo…

Cited by 0SourceScholar
2026

Understanding In-Context Learning on Structured Manifolds: Bridging Attention to Kernel Methods

ICLR 2026poster

While in-context learning (ICL) has achieved remarkable success in natural language and vision domains, its theoretical understanding—particularly in the context of structured geometric data—remains unexplored. This paper initiates a theoretical study of ICL for regression of H\"older functions on m…

Cited by 0SourceScholar
2024

Understanding Scaling Laws with Statistical and Approximation Theory for Transformer Neural Networks on Intrinsically Low-dimensional Data

NeurIPS 2024poster

When training deep neural networks, a model's generalization error is often observed to follow a power scaling law dependent both on the model size and the data size. Perhaps the best known example of such scaling laws are for transformer-based large language models (**LLMs**), where networks with b…

2023

Effective Minkowski Dimension of Deep Nonparametric Regression: Function Approximation and Statistical Theories

ICML 2023poster

Existing theories on deep nonparametric regression have shown that when the input data lie on a low-dimensional manifold, deep neural networks can adapt to the intrinsic data structures. In real world applications, such an assumption of data lying exactly on a low dimensional manifold is stringent.…

Cited by 3SourcePDFScholar
2022

Benefits of Overparameterized Convolutional Residual Networks: Function Approximation under Smoothness Constraint

ICML 2022spotlight

Overparameterized neural networks enjoy great representation power on complex data, and more importantly yield sufficiently smooth output, which is crucial to their generalization and robustness. Most existing function approximation theories suggest that with sufficiently many parameters, neural net…

Cited by 18SourcePDFScholar
2022

On Deep Generative Models for Approximation and Estimation of Distributions on Manifolds

NeurIPS 2022accept

Deep generative models have experienced great empirical successes in distribution learning. Many existing experiments have demonstrated that deep generative networks can efficiently generate high-dimensional complex data from a low-dimensional easy-to-sample distribution. However, this phenomenon ca…

Cited by 12SourcePDFScholar
2021

Besov Function Approximation and Binary Classification on Low-Dimensional Manifolds Using Convolutional Residual Networks

ICML 2021spotlight

Most of existing statistical theories on deep neural networks have sample complexities cursed by the data dimension and therefore cannot well explain the empirical success of deep learning on high-dimensional data. To bridge this gap, we propose to exploit the low-dimensional structures of the real…

Cited by 43SourcePDFScholar
2019

Efficient Approximation of Deep ReLU Networks for Functions on Low Dimensional Manifolds

NeurIPS 2019poster

Deep neural networks have revolutionized many real world applications, due to their flexibility in data fitting and accurate predictions for unseen data. A line of research reveals that neural networks can approximate certain classes of functions with an arbitrary accuracy, while the size of the net…

Cited by 140SourcePDFScholar