TY - GEN
T1 - Regression with the optimised combination technique
AU - Garcke, Jochen
PY - 2006
Y1 - 2006
N2 - We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least squares approach, discretised by sparse grids and solved using the so-called combination technique, where a certain sequence of conventional grids is employed. The sparse grid solution is then obtained by addition of the partial solutions with combination coefficients dependent on the involved grids. This approach shows instabilities in certain situations and is not guaranteed to converge with higher discretisation levels. In this article we apply the recently introduced optimised combination technique, which repairs these instabilities. Now the combination coefficients also depend on the function to be reconstructed, resulting in a non-linear approximation method which achieves very competitive results. We show that the computational complexity of the improved method still scales only linear in regard to the number of data.
AB - We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least squares approach, discretised by sparse grids and solved using the so-called combination technique, where a certain sequence of conventional grids is employed. The sparse grid solution is then obtained by addition of the partial solutions with combination coefficients dependent on the involved grids. This approach shows instabilities in certain situations and is not guaranteed to converge with higher discretisation levels. In this article we apply the recently introduced optimised combination technique, which repairs these instabilities. Now the combination coefficients also depend on the function to be reconstructed, resulting in a non-linear approximation method which achieves very competitive results. We show that the computational complexity of the improved method still scales only linear in regard to the number of data.
UR - http://www.scopus.com/inward/record.url?scp=34250774501&partnerID=8YFLogxK
U2 - 10.1145/1143844.1143885
DO - 10.1145/1143844.1143885
M3 - Conference contribution
SN - 1595933832
SN - 9781595933836
T3 - ACM International Conference Proceeding Series
SP - 321
EP - 328
BT - ACM International Conference Proceeding Series - Proceedings of the 23rd International Conference on Machine Learning, ICML 2006
T2 - 23rd International Conference on Machine Learning, ICML 2006
Y2 - 25 June 2006 through 29 June 2006
ER -