Wednesday, October 30, 2024

<< >>  
2024. 9
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30
2024. 10
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31
2024. 11
Sun Mon Tue Wed Thu Fri Sat
1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
2024-11-01 / 10:00 ~ 12:00
SAARC 세미나 - SAARC 세미나: 인쇄
by ()
The objective of the tutorial Computer-Assisted Proofs in Nonlinear Analysis is to introduce participants to fundamental concepts of a posteriori validation techniques. This mini-course will cover topics ranging from finite-dimensional problems, such as finding periodic orbits of maps, to infinite-dimensional problems, including solving the Cauchy problem, proving the existence of periodic orbits, and computing invariant manifolds of equilibria. Each session will last 2 hours: 1 hour of theory followed by 1 hour of hands-on practical applications. The practical exercises will focus on implementing on implementing computer-assisted proofs using the Julia programming language.
2024-10-30 / 10:00 ~ 12:00
SAARC 세미나 - SAARC 세미나: 인쇄
by ()
The objective of the tutorial Computer-Assisted Proofs in Nonlinear Analysis is to introduce participants to fundamental concepts of a posteriori validation techniques. This mini-course will cover topics ranging from finite-dimensional problems, such as finding periodic orbits of maps, to infinite-dimensional problems, including solving the Cauchy problem, proving the existence of periodic orbits, and computing invariant manifolds of equilibria. Each session will last 2 hours: 1 hour of theory followed by 1 hour of hands-on practical applications. The practical exercises will focus on implementing on implementing computer-assisted proofs using the Julia programming language.
2024-11-01 / 14:00 ~ 16:00
학과 세미나/콜로퀴엄 - 기타: About birational classification of smooth projective surfaces I 인쇄
by 김재홍(KAIST)
This is a reading seminar to be given Mr. Jaehong Kim (a graduate student in the department) on foundations of the intersection theory and the classification theory of complex algebraic surfaces. He will give three 2-hour long talks.
2024-10-31 / 11:50 ~ 12:40
대학원생 세미나 - 대학원생 세미나: 인쇄
by 송윤민()
TBA
2024-11-05 / 16:00 ~ 17:00
SAARC 세미나 - SAARC 세미나: 인쇄
by 홍영준(KAIST)
This lecture explores the mathematical foundations underlying neural network approximation, focusing on the development of rigorous theories that explain how and why neural networks approximate functions effectively. We talk about key topics such as error estimation, convergence analysis, and the role of activation functions in enhancing network performance. Additionally, the lecture will demonstrate convergence analysis in the context of scientific machine learning, further bridging the gap between empirical success and theoretical understanding. Our goal is to provide deeper insights into the mechanisms driving neural network efficiency, reliability, and their applications in scientific computing.
2024-10-31 / 16:15 ~ 17:15
학과 세미나/콜로퀴엄 - 콜로퀴엄: 인쇄
by ()
Distances such as the Gromov-Hausdorff distance and its Optimal Transport variants are nowadays routinely invoked in applications related to data classification. Interestingly, the precise value of these distances on pairs of canonical shapes is known only in very limited cases. In this talk, I will describe lower bounds for the Gromov-Hausdorff distance between spheres (endowed with their geodesic distances) which we prove to be tight in some cases via the construction of optimal correspondences. These lower bounds arise from a certain version of the Borsuk-Ulam theorem for discontinuous functions.
2024-10-30 / 16:00 ~ 17:00
IBS-KAIST 세미나 - IBS-KAIST 세미나: 인쇄
by ()
Latent space dynamics identification (LaSDI) is an interpretable data-driven framework that follows three distinct steps, i.e., compression, dynamics identification, and prediction. Compression allows high-dimensional data to be reduced so that they can be easily fit into an interpretable model. Dynamics identification lets you derive the interpretable model, usually some form of parameterized differential equations that fit the reduced latent space data. Then, in the prediction phase, the identified differential equations are solved in the reduced space for a new parameter point and its solution is projected back to the full space. The efficiency of the LaSDI framework comes from the fact that the solution process in the prediction phase does not involve any full order model size. For the identification, various approaches are possible, e.g., a fixed form as in dynamic mode decomposition and thermodynamics-based LaSDI, a regression form as in sparse identification of nonlinear dynamics (SINDy) and weak SINDy, and a physics-driven form as projection-based reduced order model. Various physics prob- lems were accurately accelerated by the family of LaSDIs, achieving a speed-up of 1000x, e.g., kinetic plasma simulations, pore collapse, and computational fluid problems.
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download