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 ~ 11:00
학과 세미나/콜로퀴엄 - 박사논문심사: 점근원뿔에 작용하는 군의 핵에 관한 연구 인쇄
by 장원용(KAIST)

2024-10-30 / 10:00 ~ 11:30
학과 세미나/콜로퀴엄 - 대수기하학: 인쇄
by ()
Let $C$ be a general rational curve of degree $d$ in a Grassmannian $G(k, n)$. The natural expectation is that its normal bundle is balanced, i.e., isomorphic to $\bigoplus O(e_i)$ with all $|e_i - e_j| \leq 1$. In this talk, I will describe several counterexamples to this expectation, propose a suitably revised conjecture, and describe recent progress towards this conjecture.
2024-11-05 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: Monadic stability and monadic dependence 인쇄
by Michał Pilipczuk(Institute of Informatics, University of Warsaw)
We will give an overview of the recent attempts of building a structure theory for graphs centered around First-Order transductions: a notion of containment inspired by finite model theory. Particularly, we will speak about the notions of monadic dependence and monadic stability, their combinatorial characterizations, and the developments on the algorithmic front.
2024-11-01 / 13:30 ~ 14:30
학과 세미나/콜로퀴엄 - Topology, Geometry, and Data Analysis: 인쇄
by ()
The Gromov-Wasserstein (GW) distance is a generalization of the standard Wasserstein distance between two probability measures on a given ambient metric space. The GW distance assumes that these two probability measures might live on different ambient metric spaces and therefore implements an actual comparison of pairs of metric measure spaces. A metric-measure space is a triple (X,dX,muX) where (X,dX) is a metric space and muX is a fully supported Borel probability measure over X. In Machine Learning and Data Science applications, this distance is estimated either directly via gradient based optimization approaches, or through the computation of lower bounds which arise from distributional invariants of metric-measure spaces. One particular such invariant is the so-called ‘global distance distribution’ which precisely encodes the distribution of pairwise distances between points in a given metric measure space. This invariant has been used in many applications yet its classificatory power is not yet well understood. This talk will overview the construction of the GW distance, the stability of distributional invariants, and will also discuss some results regarding the injectivity of the global distribution of distances for smooth planar curves, hypersurfaces, and metric trees.
2024-10-30 / 14:30 ~ 15:30
학과 세미나/콜로퀴엄 - 대수기하학: 인쇄
by ()
We'll present the results of Ein-Lazarsfeld and Park on asymptotic syzygies of a higher dimensional variety.
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 by 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