课题基金 / 基金详情

ATD: Collaborative Research: Theory and Algorithms for Real-Time Threat Detection from Massive Data Streams

ATD: Collaborative Research: Theory and Algorithms for Real-Time Threat Detection from Massive Data Streams
ATD:协作研究:海量数据流实时威胁检测的理论和算法
批准号:
1829955
负责人:
Dustin Mixon
金额:
$7.67万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2018
资助国家:
美国
项目状态:
已结题
起止时间:
2018-08-15 至 2021-07-31

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
国家安全利益要求提高对各种对手的行动的认识。这种对信息的贪婪胃口导致了铺天盖地的时空数据。为了有效地管理这种数据洪流,需要新的数学;本研究项目旨在为这一事业开发新的理论和算法。该方法以以下对威胁检测问题的抽象描述为指导:在给定海量时空数据流的情况下,任务是维持一个缓慢演变的“正常”模型,任何偏离该模型的情况都将被进一步调查为潜在的威胁。该项目将专注于以下两个目标:(1)开发处理海量数据流的算法和优化编码,以及(2)开发快速证书和尖端学习算法保证。为此,本研究旨在解决优化、框架理论和机器学习中的一些大的开放问题:(A)从流数据中快速解决NP-Hard无监督学习问题的凸松弛;(B)构造最优行包装,包括Zauner猜想存在的包装;(C)为NP-Hard学习问题寻找次线性后验近似证书;(D)解释生成对抗网络所表现出的良好的优化场景;以及(E)为黑匣子分类制定快速、事后的解释,使人们能够在充分了解情况下做出决策。该奖项反映了NSF的法定使命,并通过使用基金会的智力优势和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
National security interests demand a heightened awareness of the actions of various adversaries. This voracious appetite for information results in an overwhelming stream of spatiotemporal data. New mathematics is necessary to effectively manage this data deluge; this research project aims to develop new theory and algorithms for this cause. The approach is guided by the following abstract description of the threat detection problem: Given a massive stream of spatiotemporal data, the task is to maintain a slowly evolving model of "normalcy," any deviations from which are to be further investigated as potential threats. The project will focus on the following two objectives: (1) develop algorithms and optimal encodings to process massive data streams, and (2) develop fast certificates and guarantees for cutting-edge learning algorithms. To this end, the research aims to solve some of the big open problems in optimization, frame theory, and machine learning: (a) to quickly solve convex relaxations of NP-hard unsupervised learning problems from streaming data; (b) to construct optimal line packings, including the packings conjectured to exist by Zauner; (c) to find sub-linear a posteriori approximation certificates for NP-hard learning problems; (d) to explain the well-behaved optimization landscapes exhibited by generative adversarial networks; and (e) to develop fast, after-the-fact explanations for black-box classification, enabling well-informed human decision making.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(14)
专著(0)
科研奖励(0)
会议论文
DOI: 10.1002/jcd.21804
发表时间: 2021-01
期刊: Journal of Combinatorial Designs
影响因子: 0.7
作者: [Joseph W. Iverson;E. King;D. Mixon]
通讯作者: Joseph W. Iverson;E. King;D. Mixon
DOI: 10.1109/tit.2019.2962681
发表时间: 2020-06-01
期刊: IEEE TRANSACTIONS ON INFORMATION THEORY
影响因子: 2.5
作者: [McWhirter, Culver, Mixon, Dustin G., Villar, Soledad]
通讯作者: Villar, Soledad
Derandomizing Compressed Sensing With Combinatorial Design
通过组合设计去随机化压缩感知
DOI: 10.3389/fams.2019.00026
发表时间: 2019
期刊: Frontiers in Applied Mathematics and Statistics
影响因子: 1.4
作者: [Jung, Peter, Kueng, Richard, Mixon, Dustin G.]
通讯作者: Mixon, Dustin G.
OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS
有限群作用下的最佳线路封装
DOI: 10.1017/fms.2019.48
发表时间: 2020
期刊: Sigma
影响因子: --
作者: [IVERSON, JOSEPH W., JASPER, JOHN, MIXON, DUSTIN G.]
通讯作者: MIXON, DUSTIN G.
共 13 条
    海外基金