NSF award 2626366 · Johns Hopkins University

Collaborative Research: CIF: Small: New Theory, Algorithms and Applications for Large-Scale Bilevel Optimization

Final report due

28 November 2027

in 406 days · The award ends on 31 July 2027.

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 extension2 Apr 2027in 166 days
award ending 2027-07-31 · Research.gov
This one is ours, not NSF’s.
Extension request16 Jun 2027in 241 days
award ending 2027-07-31 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice21 Jul 2027in 276 days
award ending 2027-07-31 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Nov 2027in 406 days
award ending 2027-07-31 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Nov 2027in 406 days
award ending 2027-07-31 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Nov 2027in 406 days
award ending 2027-07-31 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

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

NSF lists this award's end date as 31 July 2027.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 November 2027.

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: 2626366
Period of support: 1 Jul 2026 – 31 Jul 2027
Amount: $299,549
Awardee: Johns Hopkins University, Baltimore, MD
Program: Comm & Information Foundations
Directorate: CSE

Abstract

In recent years, the world has witnessed significant progress in optimization for emerging fields, including meta-learning, fine-tuning, automated hyperparameter selection, continual learning, fair batch selection, adversarial learning, and artificial intelligence (AI)-aware communication networks. Problems arising from these fields often exhibit a common nested optimization structure, which has motivated the study…

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.