Skip to main content Accessibility help
×
Home
Hostname: page-component-cf9d5c678-dkwk2 Total loading time: 2.746 Render date: 2021-08-03T05:28:17.815Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Article contents

LEAST SQUARES APPROXIMATIONS OF MEASURES VIA GEOMETRIC CONDITION NUMBERS

Published online by Cambridge University Press:  20 December 2011

Gilad Lerman
Affiliation:
School of Mathematics, University of Minnesota, 127 Vincent Hall, 206 Church St. SE, Minneapolis 55455, U.S.A. (email: lerman@umn.edu)
J. Tyler Whitehouse
Affiliation:
Department of Mathematics, Vanderbilt University, 1326 Stevenson Center, Nashville 37240, U.S.A. (email: jonathan.t.whitehouse@vanderbilt.edu)
Corresponding

Abstract

For a probability measure μ on a real separable Hilbert space H, we are interested in “volume-based” approximations of the d-dimensional least squares error of μ, i.e., least squares error with respect to a best fit d-dimensional affine subspace. Such approximations are given by averaging real-valued multivariate functions which are typically scalings of squared (d+1)-volumes of (d+1)-simplices in H. Specifically, we show that such averages are comparable to the square of the d-dimensional least squares error of μ, where the comparison depends on a simple quantitative geometric property of μ. This result is a higher dimensional generalization of the elementary fact that the double integral of the squared distances between points is proportional to the variance of μ. We relate our work to two recent algorithms, one for clustering affine subspaces and the other for Monte-Carlo singular value decomposition based on volume sampling.

Type
Research Article
Copyright
Copyright © University College London 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Agarwal, S., Lim, J., Zelnik-Manor, L., Perona, P., Kriegman, D. and Belongie, S., Beyond pairwise clustering. In Proc. 2005 IEEE Computer Society Conf. Computer Vision and Pattern Recognition (CVPR’05), Vol. 2, 2005, 838845.Google Scholar
[2]Arias-Castro, E., Chen, G. and Lerman, G., Spectral clustering based on local linear approximations. Electron. J. Stat. 5 (2011), 15371587.CrossRefGoogle Scholar
[3]Brand, M., A fast greedy pairwise distance clustering algorithm and its use in discovering thematic structures in large data sets. Technical Report 406, MIT Media Lab, 1996.Google Scholar
[4]Chen, G. and Lerman, G., Foundations of a multi-way spectral clustering framework for hybrid linear modelling. Found. Comput. Math. 9(5) (2009), 517558.CrossRefGoogle Scholar
[5]Chen, G. and Lerman, G., Spectral curvature clustering (SCC). Int. J. Comput. Vis. 81(3) (2009), 317330.CrossRefGoogle Scholar
[6]David, G. and Semmes, S., Singular integrals and rectifiable sets in ℝn: au-delà des graphes Lipschitziens. Astérisque 193 (1991), 1145.Google Scholar
[7]Deshpande, A., Rademacher, L., Vempala, S. and Wang, G., Matrix approximation and projective clustering via volume sampling. Theory Comput. 2(12) (2006), 225247.CrossRefGoogle Scholar
[8]Deshpande, A. and Vempala, S., Adaptive sampling and fast low-rank matrix approximation. In Approximation, Randomization and Combinatorial Optimization (Lecture Notes in Computer Science 4110), Springer (Berlin, 2006), 292303.Google Scholar
[9]Fan, K., On a theorem of Weyl concerning eigenvalues of linear transformations. I. Proc. Natl. Acad. Sci. USA 35 (1949), 652655.CrossRefGoogle Scholar
[10]Gohberg, I., Goldberg, S. and Krupnik, N., Traces and Determinants of Linear Operators (Operator Theory: Advances and Applications 116), Birkhäuser (Basel, 2000).CrossRefGoogle Scholar
[11]Govindu, V., A tensor decomposition for geometric grouping and segmentation. In Proc. 2005 IEEE Computer Society Conf. Computer Vision and Pattern Recognition (CVPR’05), Vol. 1, 2005, 11501157.Google Scholar
[12]Halmos, P. R. and Sunder, V. S., Bounded Integral Operators on L 2 Spaces (Ergebnisse der Mathematik und ihrer Grenzgebiete [Results in Mathematics and Related Areas] 96), Springer (Berlin, 1978).CrossRefGoogle Scholar
[13]Léger, J. C., Menger curvature and rectifiability. Ann. of Math. (2) 149 (1999), 831869.CrossRefGoogle Scholar
[14]Lerman, G. and Whitehouse, J. T., High-dimensional Menger-type curvatures. II. d-separation and a menagerie of curvatures. Constr. Approx. 30(3) (2009), 325360.CrossRefGoogle Scholar
[15]Lerman, G. and Whitehouse, J. T., On d-dimensional d-semimetrics and simplex-type inequalities for high-dimensional sine functions. J. Approx. Theory 156(1) (2009), 5281.CrossRefGoogle Scholar
[16]Lerman, G. and Whitehouse, J. T., High-dimensional Menger-type curvatures—Part I: geometric multipoles and multiscale inequalities. Rev. Mat. Iberoam. 27(2) (2011), 493555.CrossRefGoogle Scholar
[17]Mattila, P., Melnikov, M. and Verdera, J., The Cauchy integral, analytic capacity, and uniform rectifiability. Ann. of Math. (2) 144(1) (1996), 127136.CrossRefGoogle Scholar
[18]McDiarmid, C., On the method of bounded differences. In Surveys in Combinatorics, 1989 (Norwich, 1989) (London Mathematical Society Lecture Note Series 141), Cambridge University Press (Cambridge, 1989), 148188.CrossRefGoogle Scholar
[19]Shashua, A., Zass, R. and Hazan, T., Multi-way clustering using super-symmetric non-negative tensor factorization. In Computer Vision – ECCV 2006 (Lecture Notes in Computer Science 3954), Springer (Berlin, 2006), 595608.CrossRefGoogle Scholar
[20]Strzelecki, P. and von der Mosel, H., Integral menger curvature for surfaces. Adv. Math. 226(3) (2011), 22332304.CrossRefGoogle Scholar
[21]Tolsa, X., Principal values for Riesz transforms and rectifiability. J. Funct. Anal. 254(7) (2008), 18111863.CrossRefGoogle Scholar
[22]Yafaev, D. R., Mathematical Scattering Theory (Translations of Mathematical Monographs 105), American Mathematical Society (Providence, RI, 1992) (translated from the Russian by J. R. Schulenberger).Google Scholar
2
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

LEAST SQUARES APPROXIMATIONS OF MEASURES VIA GEOMETRIC CONDITION NUMBERS
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

LEAST SQUARES APPROXIMATIONS OF MEASURES VIA GEOMETRIC CONDITION NUMBERS
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

LEAST SQUARES APPROXIMATIONS OF MEASURES VIA GEOMETRIC CONDITION NUMBERS
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *