no code implementations • 18 Apr 2023 • Tengyao Wang, Edgar Dobriban, Milana Gataric, Richard J. Samworth
We propose a new method for high-dimensional semi-supervised learning problems based on the careful aggregation of the results of a low-dimensional procedure applied to many axis-aligned random projections of the data.
1 code implementation • 7 Nov 2022 • Jie Li, Paul Fearnhead, Piotr Fryzlewicz, Tengyao Wang
We show how to automatically generate new offline detection methods based on training a neural network.
no code implementations • 10 Nov 2020 • Andrey Ignatov, Radu Timofte, Ming Qian, Congyu Qiao, Jiamin Lin, Zhenyu Guo, Chenghua Li, Cong Leng, Jian Cheng, Juewen Peng, Xianrui Luo, Ke Xian, Zijin Wu, Zhiguo Cao, Densen Puthussery, Jiji C V, Hrishikesh P S, Melvin Kuriakose, Saikat Dutta, Sourya Dipta Das, Nisarg A. Shah, Kuldeep Purohit, Praveen Kandula, Maitreya Suin, A. N. Rajagopalan, Saagara M B, Minnu A L, Sanjana A R, Praseeda S, Ge Wu, Xueqin Chen, Tengyao Wang, Max Zheng, Hulk Wong, Jay Zou
This paper reviews the second AIM realistic bokeh effect rendering challenge and provides the description of the proposed solutions and results.
no code implementations • 7 Mar 2020 • Yudong Chen, Tengyao Wang, Richard J. Samworth
We introduce a new method for high-dimensional, online changepoint detection in settings where a $p$-variate Gaussian data stream may undergo a change in mean.
no code implementations • 15 Dec 2017 • Milana Gataric, Tengyao Wang, Richard J. Samworth
We introduce a new method for sparse principal component analysis, based on the aggregation of eigenvector information from carefully-selected axis-aligned random projections of the sample covariance matrix.
no code implementations • NeurIPS 2016 • Tengyao Wang, Quentin Berthet, Yaniv Plan
The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models.
no code implementations • 22 Aug 2014 • Tengyao Wang, Quentin Berthet, Richard J. Samworth
In this paper, we show that, under a widely-believed assumption from computational complexity theory, there is a fundamental trade-off between statistical and computational performance in this problem.