Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

Quick Links:

C3.ai DTI Webpage

Events

Information on Call for Proposals

Proposal Matchmaking (Archive from 2020 CFP)

C3.ai DTI Training Materials

C3 Administration (password protected)


Have Questions? Please contact one of us:



Recent space activity

Recently Updated
typespage, comment, blogpost
max5
hideHeadingtrue
themesocial

Space contributors

Contributors
modelist
scopedescendants
limit5
showLastTimetrue
orderupdate


Announcing our Third Call for Proposals:

AI to Transform Cybersecurity and Secure Critical Infrastructure

It is anticipated that up to USD $10 million in Research Awards will be awarded from this Call for Proposals. Proposals can request funding of USD $100,000 to $1,000,000 for an initial period of one (1) year.

C3DTI will also make available up to USD $2 million in Azure Cloud computing resources, supercomputing resources at UIUC’s NCSA and LBNL’s NERSC, and free, unlimited access to the C3 AI Suite hosted on the Microsoft Azure Cloud. 

**** We will be offering a virtual session with information on the CFP including an opportunity to ask questions early in January. Please keep an eye out on you email and this wiki page for more information. ****

Proposals are Due February 7, 2022

Awards will be made in March 2022 with start dates of around June 1, 2022

Announcements

  • Colloquium on Digital Transformation Science
  • November 12, 3 pm CT

    Mathematics of Deep Learning

    René Vidal, Herschel L. Seder Professor of Biomedical Engineering and Director of the Mathematical Institute for Data Science, Johns Hopkins University

    REGISTER FOR ZOOM WEBINAR

    The past few years have seen a dramatic increase in the performance of recognition systems, thanks to the introduction of deep networks for representation learning. However, the mathematical reasons for this success remain elusive. For example, a key issue is that the neural network training problem is non-convex, hence optimization algorithms may not return a global minima. In addition, the regularization properties of algorithms such as dropout remain poorly understood. The first part of this talk will overview recent work on the theory of deep learning that aims to understand how to design the network architecture, how to regularize the network weights, and how to guarantee global optimality. The second part of this talk will present sufficient conditions to guarantee that local minima are globally optimal and that a local descent strategy can reach a global minima from any initialization. Such conditions apply to problems in matrix factorization, tensor factorization, and deep learning. The third part of this talk will present an analysis of the optimization and regularization properties of dropout for matrix factorization in the case of matrix factorization.

    René Vidal is the Herschel Seder Professor of Biomedical Engineering and Director of the Mathematical Institute for Data Science at Johns Hopkins University. He is also an Amazon Scholar, Chief Scientist at NORCE, and Associate Editor in Chief of TPAMI. His current research focuses on the foundations of deep learning and its applications in computer vision and biomedical data science. He is an AIMBE Fellow, IEEE Fellow, IAPR Fellow, and Sloan Fellow, and has received numerous awards for his work, including the D’Alembert Faculty Award, J.K. Aggarwal Prize, ONR Young Investigator Award, NSF CAREER Award, and best paper awards in machine learning, computer vision, controls, and medical robotics.


    Quick Links:

    C3.ai DTI Webpage

    Events

    Information on Call for Proposals

    Proposal Matchmaking

    C3.ai DTI Training Materials (password protected)

    C3 Administration (password protected)


    Have Questions? Please contact one of us:



    Recent space activity

    Recently Updated
    typespage, comment, blogpost
    max5
    hideHeadingtrue
    themesocial

    Space contributors

    Contributors
    modelist
    scopedescendants
    limit5
    showLastTimetrue
    orderupdate