Skip to the ledger

GrantClerk

NSF award 2510216 · University of Maryland, College Park

Applied Harmonic Analysis Methods for G-Invariant Representations and Matrix Analysis Problems

Final report due

29 December 2028

in 803 days · The award ends on 31 August 2028.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

  • Decide about an extension3 May 2028in 563 days

    award ending 2028-08-31 · Research.gov

  • Extension request17 Jul 2028in 638 days

    award ending 2028-08-31 · Research.gov

  • No-cost extension notice21 Aug 2028in 673 days

    award ending 2028-08-31 · Research.gov

  • Final report due29 Dec 2028in 803 days

    award ending 2028-08-31 · Research.gov

  • Project outcomes report due29 Dec 2028in 803 days

    award ending 2028-08-31 · Research.gov

  • Award is closed out29 Dec 2028in 803 days

    award ending 2028-08-31 · Research.gov

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

  1. NSF lists this award's end date as 31 August 2028.
  2. NSF rules say the final report is due no later than 120 days after that.
  3. So the final report is due by 29 December 2028.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number
2510216
Period of support
1 Sep 2025 – 31 Aug 2028
Amount
$270,000
Awardee
University of Maryland, College Park, College Park, MD
Program
APPLIED MATHEMATICS
Directorate
MPS

Abstract

This project aims to develop and analyze tools from applied harmonic analysis with the goal of understanding and capitalizing on the formal concept of redundancy in mathematics and applications. The mathematical challenges involved in this project are formulated to directly contribute to more interpretable and explainable machine learning algorithms as well as address complex optimization problems that are currently…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.