Application of Greedy Approximations in Numerical Integration and Learning Theory

该项目的目标是设计和研究贪婪型近似方法，在数值积分和学习理论中实际可实现。高维问题是当代应用数学面临的最大挑战之一。在金融、量子化学、生物、医学和其他领域，具有数百甚至数千维度的高维问题自然会出现。这类问题的典型问题是数值积分和统计估计。最根本的问题是如何构造好的数值积分（培养公式）和统计估计方法。近年来的研究表明，贪心型逼近方法适用于各种高维问题，包括数值积分问题和学习理论问题。研究者和他的同事研究贪心逼近在数值积分和学习理论中的应用。初步研究表明，贪心型近似方法在高维条件下具有良好的效果，可以作为一些强概率方法的建设性确定性替代方法。贪婪近似有可能成为数值积分和学习理论的一个变革性概念。理解智能以及它如何学习和吸收信息是这个十年最大的科学挑战之一。有效地分析数据和提取重要信息是设计系统的关键。研究智力这方面的科学学科被称为学习理论。它在国防和民用领域有无数现有的和潜在的应用。例如，管理大型数据库，如通过监控获得的安全数据库，需要对数据集进行分类，以便加快提取重要特征或特定信息。学习理论发现了允许从已经分类的过去数据中分类新数据的规则。典型的应用程序是搜索大型数据库（例如电子邮件），以确定哪些可能与恐怖活动有联系。这个项目的目标是利用近似和统计中的基本概念来清楚地定义和量化学习挑战，并设计新的，更有效的技术（贪婪算法）。

TemlyakovDMS-0906260 The goal of the project is to design and study greedy type approximation methods that are practically implementable in numerical integration and learning theory. One of the biggest challenges of contemporary applied mathematics is high-dimensional problems. High-dimensional problems with dimensions of hundreds, and even thousands, arise naturally in finance, quantum chemistry, biology, medicine, and other areas. Typical problems of this kind are numerical integration and statistical estimation. The fundamental question is how to construct good methods of numerical integration (cubature formulas) and statistical estimation. Recent investigations show that greedy type approximation methods are good for different high-dimensional problems, including problems from numerical integration and learning theory. The investigator and his colleagues study application of greedy approximations in numerical integration and learning theory. Preliminary investigations show that greedy type approximation methods work well in high dimensions and can be considered as a constructive deterministic alternative to some powerful probabilistic methods. The greedy approximation has potential to become a transformative concept of numerical integration andlearning theory. Understanding intelligence and how it learns and assimilates information is one of the great scientific challenges of this decade. It is key to designing systems to efficiently analyze data and extract essential information. The scientific discipline that studies this aspect of intelligence is called learning theory. It has a myriad of existing and potential applications in both the defense and civilian sectors. For instance, managing large data bases such as security data bases obtained through surveillance requires classification of the data sets in order to speed up extraction of significant features or specific information. Learning theory discovers rules that allow the classification of new data from past data that have already been classified. A prototypical application is the search through a large data base (for example emails) to determine which of these have possible links to terrorist activities. It is the goal of this project to utilize fundamental concepts in approximation and statistics to clearly define and quantify the learning challenge and design new, more efficient techniques (greedy algorithms).