LISTSERV mailing list manager LISTSERV 16.5

Help for MATHTALK Archives


MATHTALK Archives

MATHTALK Archives


MATHTALK@LISTSERV.UTK.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

MATHTALK Home

MATHTALK Home

MATHTALK  May 2022

MATHTALK May 2022

Subject:

Virtual CAM Seminar Today @ 3:35pm

From:

asalgad1 <[log in to unmask]>

Reply-To:

asalgad1 <[log in to unmask]>

Date:

Wed, 4 May 2022 15:40:15 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (1 lines)

Fellow members of the Math Department,

There will be a Virtual CAM Seminar today @ 3:30.

The pertinent information is below.

Best,
Abner

=================================

Hi there, 

Abner J. SalGATO is inviting you to a scheduled Zoom meeting. 

Topic: CAM Seminar
Time: May 4, 2022 03:30 PM Eastern Time (US and Canada) 

Join from PC, Mac, Linux, iOS or Android: 
https://tennessee.zoom.us/j/95760710360

Or iPhone one-tap (US Toll):  +13126266799,95760710360#  or
+16468769923,95760710360# 

Or Telephone:
    Dial:
    +1 312 626 6799 (US Toll)
    +1 646 876 9923 (US Toll)
    +1 301 715 8592 (US Toll)
    +1 346 248 7799 (US Toll)
    +1 669 900 6833 (US Toll)
    +1 253 215 8782 (US Toll)
    Meeting ID: 957 6071 0360
    International numbers available: 
https://tennessee.zoom.us/u/aBDkHdOU3

Or an H.323/SIP room system:
    H.323: 162.255.37.11 (US West) or 162.255.36.11 (US East) 
    Meeting ID: 957 6071 0360

    SIP: [log in to unmask]

=====================
Speaker: Harbir Antil, George Mason University
Host: Xiaobing Feng
 

Title: Optimization Based Deep Neural Networks 

Abstract:

This talk will introduce novel deep neural networks (DNNs) as
constrained optimization problems. In particular, the talk will
introduce DNNs with memory, which helps overcome the vanishing gradient
challenge. The talk will also explore reducing the computational
complexity of DNNs by  introducing a bias ordering. Approximation
properties of the DNNs will also be discussed. 

These proposed DNNs will be shown to be excellent  surrogates to
parameterized (nonlinear) partial differential equations (PDEs),
Bayesian inverse problems, and data  assimilation problems, with
multiple advantages over the traditional approaches. The DNNs will also
be applied to chemically reacting flow problems. The latter requires
solving a system of stiff ODEs and fluid flow equations. These are
highly challenging problems, for instance, for combustion the number of
reactions can be significant (over 100). Due to the large CPU
requirements of chemical reactions (over 99% of total CPU time), a
large number of flow and combustion problems are presently beyond the
capabilities of even the largest supercomputers.


=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-

To leave the list go here:
https://listserv.utk.edu/cgi-bin/wa?SUBED1=MATHTALK&A=1

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
May 2021
April 2021
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018

ATOM RSS1 RSS2



LISTSERV.UTK.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager