Monday, March 27, 2023

<< >>  
2023. 2
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
2023. 3
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
2023. 4
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
2023-04-03 / 16:30 ~ 17:30
학과 세미나/콜로퀴엄 - 계산수학 세미나: 인쇄
by 전수민 교수(동아대 정보수학과)
In this talk, we look at the results of various studies in which computational mathematics is used in medical imaging. Through the various scope of research from mathematical modeling to data-based methodology, we can think about the future direction by examining what we can do in data science can contribute and what contribution we can make to medical imaging.
2023-03-31 / 12:00 ~ 13:00
학과 세미나/콜로퀴엄 - 응용 및 계산수학 세미나: 인쇄
by ()
Bayesian Physics Informed Neural Networks (B-PINNs) have gained significant attention for inferring physical parameters and learning the forward solutions for problems based on partial differential equations. However, the overparameterized nature of neural networks poses a computational challenge for high-dimensional posterior inference. Existing inference approaches, such as particle-based or variance inference methods, are either computationally expensive for highdimensional posterior inference or provide unsatisfactory uncertainty estimates. In this paper, we present a new efficient inference algorithm for B-PINNs that uses Ensemble Kalman Inversion (EKI) for high-dimensional inference tasks. By reframing the setup of B-PINNs as a traditional Bayesian inverse problem, we can take advantage of EKI’s key features: (1) gradient-free, (2) computational complexity scales linearly with the dimension of the parameter spaces, and (3) rapid convergence with typically O(100) iterations. We demonstrate the applicability and performance of the proposed method through various types of numerical examples. We find that our proposed method can achieve inference results with informative uncertainty estimates comparable to Hamiltonian Monte Carlo (HMC)-based B-PINNs with a much reduced computational cost. These findings suggest that our proposed approach has great potential for uncertainty quantification in physics-informed machine learning for practical applications.
2023-03-27 / 16:00 ~ 17:00
IBS-KAIST 세미나 - 수리생물학: 인쇄
by Cho Sungwoong(Stochastic Analysis & Application Research Center)
Fast and accurate predictions for complex physical dynamics are a big challenge across various applications. Real-time prediction on resource-constrained hardware is even more crucial in the real-world problems. The deep operator network (DeepONet) has recently been proposed as a framework for learning nonlinear mappings between function spaces. However, the DeepONet requires many parameters and has a high computational cost when learning operators, particularly those with complex (discontinuous or non-smooth) target functions. In this study, we propose HyperDeepONet, which uses the expressive power of the hypernetwork to enable learning of a complex operator with smaller set of parameters. The DeepONet and its variant models can be thought of as a method of injecting the input function information into the target function. From this perspective, these models can be viewed as a special case of HyperDeepONet. We analyze the complexity of DeepONet and conclude that HyperDeepONet needs relatively lower complexity to obtain the desired accuracy for operator learning. HyperDeepONet was successfully applied to various operator learning problems using low computational resources compared to other benchmarks.
2023-03-28 / 16:00 ~ 18:00
IBS-KAIST 세미나 - IBS-KAIST 세미나: Mini-course on pluripotential theory and complex Monge-Ampere equations 인쇄
by Sławomir Kolodziej(Jagiellonian University)

2023-03-27 / 16:00 ~ 18:00
IBS-KAIST 세미나 - IBS-KAIST 세미나: Mini-course on pluripotential theory and complex Monge-Ampere equations 인쇄
by Sławomir Kolodziej(Jagiellonian University)
TBA
2023-03-28 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: On the maximum number of edges in k-critical graphs 인쇄
by Tianchi Yang(National University of Singapore)
In this talk, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is k, but any proper subgraph has a chromatic number less than k. The problem remains open for any integer k ≥ 4. Our presentation will showcase an improvement on previous results achieved by employing a combination of extremal graph theory and structural analysis. We will introduce a key lemma, which may be of independent interest, as it sheds light on the partial structure of dense k-critical graphs. This is joint work with Cong Luo and Jie Ma.
2023-03-30 / 16:15 ~ 17:15
학과 세미나/콜로퀴엄 - 콜로퀴엄: 인쇄
by ()
We will first introduce Homogeneous dynamics, especially the mixing property of flows on spaces of hyperbolic nature. We will then survey applications of homogeneous dynamics to various problems in Number theory. (Part of the talk is based on joint work with Keivan Mallahi-Karai and Jiyoung Han.)
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download