학과 세미나 및 콜로퀴엄




2024-05
Sun Mon Tue Wed Thu Fri Sat
      1 1 2 2 3 6 4
5 6 7 2 8 1 9 1 10 4 11
12 13 14 1 15 16 2 17 2 18
19 20 21 2 22 2 23 4 24 4 25
26 27 3 28 4 29 2 30 1 31 5  
2024-06
Sun Mon Tue Wed Thu Fri Sat
            1
2 3 1 4 2 5 1 6 7 2 8
9 10 11 1 12 13 14 1 15
16 17 18 2 19 1 20 1 21 3 22
23 24 2 25 1 26 27 1 28 2 29
30            

로그인 시, 세미나를 이메일로 구독할 수 있습니다.

Mr. Saqib Mushtaq Shah, a KAIX visiting graduate student from ISI Bangalore who will stay at KAIST for 8 weeks, is going to give a series of weekly talks on the Milnor K-theory from the beginning. It is part of his KAIX summer internship works.
Host: 박진현     Contact: 박진현 (2734)     영어     2024-06-25 14:21:52
Since the introduction of cluster algebras by Fomin and Zelevinsky in 2002, there has been significant interest in cluster algebras of surface type. These algebras are particularly noteworthy due to their ability to construct various combinatorial structures like snake graphs, T-paths, and posets, which are useful for proving key structural properties such as positivity or the existence of bases. In this talk, we will begin by presenting a cluster expansion formula that integrates the work of Musiker, Schiffler, and Williams with contributions from Wilson, utilizing poset representatives for arcs on triangulated surfaces. Using these posets and the expansion formula as tools, we will demonstrate skein relations, which resolve intersections or incompatibilities between arcs. Topologically, a skein relation replaces intersecting arcs or arcs with self-intersections with two sets of arcs that avoid the intersection differently. Additionally, we will show that all skein relations on punctured surfaces include a term that is not divisible by any coefficient variable. Consequently, we will see that the bangles and bracelets form spanning sets and exhibit linear independence. This work is done in collaboration with Esther Banaian and Elizabeth Kelley.
Host: Sang-il Oum     영어     2024-06-21 15:08:00
It has been well known that any closed, orientable 3-manifold can be obtained by performing Dehn surgery on a link in S^3. One of the most prominent problems in 3-manifold topology is to list all the possible lens spaces that can be obtained by a Dehn surgery along a knot in S^3, which has been solved by Greene. A natural generalization of this problem is to list all the possible lens spaces that can be obtained by a Dehn surgery from other lens spaces. Besides, considering surgeries between lens spaces is also motivated from DNA topology. In this talk, we will discuss distance one surgeries between lens spaces L(n, 1) with n ≥ 5 odd and lens spaces L(s, 1) for nonzero s and the corresponding band surgeries from T(2, n) to T(2, s), by using our Heegaard Floer d-invariant surgery formula, which is deduced from the Heegaard Floer mappping cone formula. We give an almost complete classification of the above surgeries.
Host: 박정환     미정     2024-05-24 13:14:58
This is a one-day workshop with young geometric topologists. Follow the link for more details
https://sites.google.com/site/hrbaik85/workshop-and-conferences-at-kaist/yggt-at-kaist?authuser=0
Host: Hyungryul Baik     한국어 (필요한 경우 영어 가능) ( )     2024-06-18 10:01:15
In this talk we present homogeneous nonprime ideals that can be used to produce, via an unprojection process, homogeneous prime ideals of high Castelnuovo-Mumford regularity. We thus provide counterexamples to the Eisenbud-Goto regularity conjecture other than those given by the Rees-like algebra method of J. McCullough and I. Peeva. Their construction was inspired by G. Caviglia (2004), J. Beder et al. (2011), and K. Borna-A. Mohajer (2015, arXiv).
Host: 곽시종     Contact: 김윤옥 (5745)     미정     2024-06-20 23:41:58
Let G be a numerical semigroup. We prove an upper bound for the Betti numbers of the semigroup ring of G which depends only on the width of G, that is, the difference between the largest and the smallest generators of G. In this way, we make progress towards a conjecture of Herzog and Stamate. Moreover, for 4-generated numerical semigroups, the first significant open case, we prove the Herzog-Stamate bound for all but finitely many values of the width. This is a joint work with A. Moscariello and A. Sammartano.
Host: 곽시종     Contact: 김윤옥 (5745)     미정     2024-06-17 16:05:20
A major trajectory in the development of statistical learning has been the expansion of mathematical spaces underlying observed data, extending from numbers to vectors, functions, and beyond. This expansion has fostered significant theoretical and computational breakthroughs. One notable direction involves analyzing sets where each set becomes an object of interest for inference. This perspective accommodates the intrinsic and non-ignorable heterogeneity inherent in data-generating processes. Among various theoretical frameworks to analyze sets, a principled approach is viewing a set as an empirical measure. In this talk, I revisit the concept of the median - a robust alternative to the mean as a centroid - and introduce a novel extension of this concept within the space of probability measures under the framework of optimal transport. I will present theoretical results and a generic computational pipeline that leverages existing algorithmic developments in the field, with examples. Furthermore, the potential benefits of this novel approach for scalable inference and scientific discovery will be explored.
Host: 박지원     미정     2024-05-03 10:37:01
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months. There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
Host: 박진현     Contact: 박진현 (2734)     미정     2024-05-24 16:59:31
In this talk, we will discuss the paper, “Computational screen for sex-specific drug effects in a cardiac fibroblast signaling network model”, by K.M. Watts, W. Nichols and W.J. Richardson, Scientific Reports, 2023. Abstract Heart disease is the leading cause of death in both men and women. Cardiac fibrosis is the uncontrolled accumulation of extracellular matrix proteins, which can exacerbate the progression of heart failure, and there are currently no drugs approved specifically to target matrix accumulation in the heart. Computational signaling network models (SNMs) can be used to facilitate discovery of novel drug targets. However, the vast majority of SNMs are not sex-specific and/or are developed and validated using data skewed towards male in vitro and in vivo samples. Biological sex is an important consideration in cardiovascular health and drug development. In this study, we integrate a cardiac fibroblast SNM with estrogen signaling pathways to create sex-specific SNMs. The sex-specific SNMs demonstrated high validation accuracy compared to in vitro experimental studies in the literature while also elucidating how estrogen signaling can modulate the effect of fibrotic cytokines via multi-pathway interactions. Further, perturbation analysis and drug screening uncovered several drug compounds predicted to generate divergent fibrotic responses in male vs. female conditions, which warrant further study in the pursuit of sex-specific treatment recommendations for cardiac fibrosis. Future model development and validation will require more generation of sex-specific data to further enhance modeling capabilities for clinically relevant sex-specific predictions of cardiac fibrosis and treatment.
Host: 김재경, Jae Kyoung Kim     영어     2024-06-05 17:35:49
박사후 연구 이야기- 박사과정 이후의 삶을 대비하는 방법, 국내 및 해외에서의 박사후연구원 생활과 필요한 준비사항 등
Host: 권순식     Contact: 조성혁 (2703)     한국어     2024-04-26 16:31:25
Pressure functions are key ideas in the thermodynamic formalism of dynamical systems. McMullen used the convexity of the pressure function to construct a metric, called a pressure metric, on the Teichmuller space and showed that it is a constant multiple of the Weil-Petersson metric. In the spirit of Sullivan's dictionary, McMullen applied the same idea to define a metric on the space of Blaschke products. In this talk, we will discuss Bridgeman-Taylor and McMullen's earlier works on the pressure metric, as well as recent developments in more generic settings. Then we will talk about pressure metrics on hyperbolic components in complex dynamics, as well as unsolved problems.
Host: Harry Hyungryul Baik     영어     2024-06-17 12:00:55
When does a topological branched self-covering of the sphere enjoy a holomorphic structure? William Thurston answered this question in the 1980s by using a holomorphic self-map of the Teichmuller space known as Thurston's pullback map. About 30 years later, Dylan Thurston took a different approach to the same question, reducing it to a one-dimensional dynamical problem. We will discuss both characterizations and their applications to various questions in complex dynamics.
Host: Harry Hyungryul Baik     영어     2024-06-17 11:59:35
We provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum graphs. These graphs give a unified perspective of studying various graphs defined by polynomials over finite fields, such as Paley graphs, Paley sum graphs, and graphs associated with Diophantine tuples and their generalizations from number theory. As an application, we provide new lower bounds on the clique number and independence number of general quasi-random graphs. In particular, we give a sufficient condition for the clique number of quasi-random graphs of order $n$ to be at least $(1-o(1))\log_{3.008}n$. Such a condition applies to many classical quasi-random graphs, including Paley graphs and Paley sum graphs, as well as some new Paley-like graphs we construct. If time permits, we also discuss some problems of diophantine tuples arising from number theory, which is our original motivation. This is joint work with Seoyoung Kim and Chi Hoi Yip.
Host: Sang-il Oum     영어     2024-05-28 10:12:47
In this talk, we discuss the paper, “Powerful and accurate detection of temporal gene expression patterns from multi-sample multi-stage single-cell transcriptomics data with TDEseq” by Y. Fan, L. Li and S. Sun, Genome Biology, 2024. Abstract We present a non-parametric statistical method called TDEseq that takes full advantage of smoothing splines basis functions to account for the dependence of multiple time points in scRNA-seq studies, and uses hierarchical structure linear additive mixed models to model the correlated cells within an individual. As a result, TDEseq demonstrates powerful performance in identifying four potential temporal expression patterns within a specific cell type. Extensive simulation studies and the analysis of four published scRNA-seq datasets show that TDEseq can produce well-calibrated p-values and up to 20% power gain over the existing methods for detecting temporal gene expression patterns. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: 김재경, Jae Kyoung Kim     영어     2024-06-05 17:34:11
We will discuss recent progress on the topic of induced subgraphs and tree-decompositions. In particular this talk with focus on the proof of a conjecture of Hajebi that asserts that (if we exclude a few obvious counterexamples) for every integer t, every graph with large enough treewidth contains two anticomplete induced subgraphs each of treewidth at least t. This is joint work with Sepher Hajebi and Sophie Spirkl.
Host: Sang-il Oum     영어     2024-05-28 10:13:50
Deep learning has shown remarkable success in various fields, and efforts continue to develop investment methodologies using deep learning in the financial sector. Despite numerous successes, the fact is that the revolutionary results seen in areas such as image processing and natural language processing have not been seen in finance. There are two reasons why deep learning has not led to disruptive change in finance. First, the scarcity of financial data leads to overfitting in deep learning models, so excellent backtesting results do not translate into actual outcomes. Second, there is a lack of methodological development for optimizing dynamic control models under general conditions. Therefore, I aim to overcome the first problem by artificially augmenting market data through an integration of Generative Adversarial Networks (GANs) and the Fama-French factor model, and to address the second problem by enabling optimal control even under complex conditions using policy-based reinforcement learning. The methods of this study have been shown to significantly outperform traditional linear financial factor models such as the CAPM and value-based approaches such as the HJB equation.
"CausalXtract: a flexible pipeline to extract causal effects from live-cell time-lapse imaging data”, by Franck Simon et.al., bioRxiv, 2024, will be discussed in the Journal Club. The abstract is the following : Live-cell microscopy routinely provides massive amount of time-lapse images of complex cellular systems under various physiological or therapeutic conditions. However, this wealth of data remains difficult to interpret in terms of causal effects. Here, we describe CausalXtract, a flexible computational pipeline that discovers causal and possibly time-lagged effects from morphodynamic features and cell-cell interactions in live-cell imaging data. CausalXtract methodology combines network-based and information-based frameworks, which is shown to discover causal effects overlooked by classical Granger and Schreiber causality approaches. We showcase the use of CausalXtract to uncover novel causal effects in a tumor-on-chip cellular ecosystem under therapeutically relevant conditions. In particular, we find that cancer associated fibroblasts directly inhibit cancer cell apoptosis, independently from anti-cancer treatment. CausalXtract uncovers also multiple antagonistic effects at different time delays. Hence, CausalXtract provides a unique computational tool to interpret live-cell imaging data for a range of fundamental and translational research applications. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: 김재경, Jae Kyoung Kim     영어     2024-06-05 17:31:31
This talk presents a uniform framework for computational fluid dynamics in porous media based on finite element velocity and pressure spaces with minimal degrees of freedom. The velocity space consists of linear Lagrange polynomials enriched by a discontinuous, piecewise linear, and mean-zero vector function per element, while piecewise constant functions approximate the pressure. Since the fluid model in porous media can be seen as a combination of the Stokes and Darcy equations, different conformities of finite element spaces are required depending on viscous parameters, making it challenging to develop a robust numerical solver uniformly performing for all viscous parameters. Therefore, we propose a pressure-robust method by utilizing a velocity reconstruction operator and replacing the velocity functions with a reconstructed velocity. The robust method leads to error estimates independent of a pressure term and shows uniform performance for all viscous parameters, preserving minimal degrees of freedom. We prove well-posedness and error estimates for the robust method while comparing it with a standard method requiring an impractical mesh condition. We finally confirm theoretical results through numerical experiments with two- and three-dimensional examples and compare the methods' performance to support the need for our robust method.
Host: Youngjoon Hong     한국어 (필요한 경우 영어 가능) ( )     2024-05-30 14:58:22

심사위원장: 예종철, 심사위원: 강완모, 김동환, 이창옥, 홍영준
미정     2024-05-31 14:08:02
A vertex colouring of a hypergraph is $c$-strong if every edge $e$ sees at least $\min\{c, |e|\}$ distinct colours. Let $\chi(t,c)$ denote the least number of colours needed so that every $t$-intersecting hypergraph has a $c$-strong colouring. In 2012, Blais, Weinstein and Yoshida introduced this parameter and initiated study on when $\chi(t,c)$ is finite: they showed that $\chi(t,c)$ is finite whenever $t \geq c$ and unbounded when $t\leq c-2$. The boundary case $\chi(c-1, c)$ has remained elusive for some time: $\chi(1,2)$ is known to be finite by an easy classical result, and $\chi(2,3)$ was shown to be finite by Chung and independently by Colucci and Gyárfás in 2013. In this talk, we present some recent work with Kevin Hendrey, Freddie Illingworth and Nina Kamčev in which we fill in this gap by showing that $\chi(c-1, c)$ is finite in general.
Host: Sang-il Oum     영어     2024-05-18 08:24:18

심사위원장: 김용정, 심사위원: 강문진, 권순식, 김재경, 윤창욱(충남대학교)
미정     2024-05-31 14:09:53
Deep learning has emerged as a dominant approach in machine learning and has achieved remarkable success in various domains such as computer vision and natural language processing. Its influence has progressively extended to numerous research areas within the fields of science and engineering. In this presentation, I will outline our work on the design and training of a foundation model, named PDEformer, which aims to serve as a flexible and efficient solver across a spectrum of parametric PDEs. PDEformer is specifically engineered to facilitate a range of downstream tasks, including but not limited to parameter estimation and system identification. Its design is tailored to accommodate applications necessitating repetitive solving of PDEs, where a balance between efficiency and accuracy is sought. This is a joint workshop with the Serabol program.
Host: Youngjoon Hong     영어     2024-04-25 17:06:55
This is an introductory reading seminar presented by a senior undergraduate student, Jaehak Lee, who is studying the subject.
Host: 박진현     Contact: 박진현 (2734)     한국어     2024-05-14 12:54:51
"Data driven governing equations approximation using deep neural networks", Journal of Computational Physics (2019) will be discussed in this Journal Club. We present a numerical framework for approximating unknown governing equations using observation data and deep neural networks (DNN). In particular, we propose to use residual network (ResNet) as the basic building block for equation approximation. We demonstrate that the ResNet block can be considered as a one-step method that is exact in temporal integration. We then present two multi-step methods, recurrent ResNet (RT-ResNet) method and recursive ReNet (RS-ResNet) method. The RT-ResNet is a multi-step method on uniform time steps, whereas the RS-ResNet is an adaptive multi-step method using variable time steps. All three methods presented here are based on integral form of the underlying dynamical system. As a result, they do not require time derivative data for equation recovery and can cope with relatively coarsely distributed trajectory data. Several numerical examples are presented to demonstrate the performance of the methods. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     영어     2024-04-30 10:30:15
We discuss how optimal transport, which is a theory for matching different distributions in a cost effective way, is applied to the supercooled Stefan problem, a free boundary problem that describes the interface dynamics of supercooled water freezing into ice. This problem exhibits a highly unstable behaviour and its mathematical study has been limited mostly to one space dimension, and widely open for multi-dimensional cases. We consider a version of optimal transport problem that considers stopping of the Brownian motion, whose solution is then translated into a solution to the supercooled Stefan problem in general dimensions.
Host: 권순식     Contact: 김송이 (042-350-2786)     미정     2024-05-02 10:09:41
In this talk, we consider the Boltzmann equation in general 3D toroidal domains with a specular reflection boundary condition. So far, it is a well-known open problem to obtain the low-regularity solution for the Boltzmann equation in general non-convex domains because there are grazing cases, such as inflection grazing. Thus, it is important to analyze trajectories which cause grazing. We will provide new analysis to handle these trajectories in general 3D toroidal domains.
Contact: 강문진 (0423502743)     미정     2024-03-25 10:13:23

심사위원장: 김재경, 심사위원:김용정, 정연승, 김진수(포항공과대학교), 이승규(고려대학교)
미정     2024-05-31 14:05:01
Post-critically finite (PCF) rational maps are a fascinating class of dynamical systems with rich mathematical structures. In this minicourse, we explore the interplay between topology, geometry, and dynamics in the study of PCF rational maps. [Lecture 3: Geometry of PCF rational maps] Geometry of PCF rational maps The topological models for PCF rational maps we discuss define canonical quasi-symmetric classes of metrics on their Julia sets. We investigate the conformal dimensions of Julia sets, which measure their geometric complexity and provide insights into the underlying dynamics. Through this exploration, we uncover the intricate relationship between the topology, geometry, and dynamics of PCF rational maps.
Host: Hyungryul Baik     미정     2024-05-22 09:39:23

심사위원장: 황강욱, 심사위원: 강완모, 김용정, 전현호, 문일철(산업및시스템공학과)
미정     2024-05-31 14:06:05
Weak discuss existence of singular solutions for Stokes and the Navier-Stokes equations in the half-space. We construct their solutions whose normal derivatives are unbounded for the Stokes and Navier-Stokes equations near boundary away from support of singular data. 
Host: 이지운 교수     Contact: saarc (042-350-8117)     미정     2024-03-04 14:12:16
The finite quotient groups of étale fundamental groups of algebraic curves in positive characteristic are precisely determined, but without explicit construction of quotient maps, by well-known results of Raynaud, Harbater and Pop, previously known as Abhyankar's conjecture. Katz, Rojas León and Tiep have been studying the constructive side of this problem using certain "easy to remember" local systems. In this talk, I will discuss the main results and methods of this project in the case of a specific type of local systems called hypergeometric sheaves.
Host: Bo-Hae Im     미정     2024-03-29 09:15:57
Two-way online correlated selection (two-way OCS) is an online algorithm that, at each timestep, takes a pair of elements from the ground set and irrevocably chooses one of the two elements, while ensuring negative correlation in the algorithm's choices. OCS was initially invented by Fahrbach, Huang, Tao, and Zadimoghaddam (FOCS 2020, JACM 2022) to break a natural long-standing barrier in edge-weighted online bipartite matching. They posed two open questions, one of which was the following: Can we obtain n-way OCS for $n >2$, in which the algorithm can be given $n >2$ elements to choose from at each timestep? In this talk, we affirmatively answer this open question by presenting a three-way OCS which is simple to describe: it internally runs two instances of two-way OCS, one of which is fed with the output of the other. Contrast to its simple construction, we face a new challenge in analysis that the final output probability distribution of our three-way OCS is highly elusive since it requires the actual output distribution of two-way OCS. We show how we tackle this challenge by approximating the output distribution of two-way OCS by a flatter distribution serving as a safe surrogate. This is joint work with Hyung-Chan An.
Host: Sang-il Oum     영어     2024-04-19 16:42:16
Post-critically finite (PCF) rational maps are a fascinating class of dynamical systems with rich mathematical structures. In this minicourse, we explore the interplay between topology, geometry, and dynamics in the study of PCF rational maps. [Lecture 2: Topology of PCF rational maps] W.Thurston's and D.Thurston's characterizations provide powerful frameworks for understanding the topological dynamics of rational maps. We delve into these characterizations, exploring their implications for the dynamics of PCF rational maps. Additionally, we discuss finite subdivision rules and topological surgeries, such as matings, tunings, and decompositions, as tools for constructing and analyzing PCF rational maps in topological ways.
Host: Hyungryul Baik     영어     2024-05-22 09:37:26

심사위원장: 강완모, 심사위원: 김동환, 황강욱, 윤세영(김재철AI대학원), 민승기(산업및시스템공학과)
미정     2024-05-31 14:08:54
Quantum embedding is a fundamental prerequisite for applying quantum machine learning techniques to classical data, and has substantial impacts on performance outcomes. In this study, we present Neural Quantum Embedding (NQE), a method that efficiently optimizes quantum embedding beyond the limitations of positive and trace-preserving maps by leveraging classical deep learning techniques. NQE enhances the lower bound of the empirical risk, leading to substantial improvements in classification performance. Moreover, NQE improves robustness against noise. To validate the effectiveness of NQE, we conduct experiments on IBM quantum devices for image data classification, resulting in a remarkable accuracy enhancement. In addition, numerical analyses highlight that NQE simultaneously improves the trainability and generalization performance of quantum neural networks, as well as of the quantum kernel method.
We provide general upper and lower bounds for the Gromov–Hausdorff distance d_GH(S^m, S^n) between spheres S^m and S^n (endowed with the round metric) for 0 <= m < n <= 1. Some of these lower bounds are based on certain topological ideas related to the Borsuk–Ulam theorem. Via explicit constructions of (optimal) correspondences, we prove that our lower bounds are tight in the cases of d_GH(S^0, S^n), d_GH(S^m, S^\infty), d_GH(S^1, S^2), d_GH(S^1, S^3), and d_GH(S^2, S^3). We also formulate a number of open questions.
Host: 김우진     영어     2024-05-14 00:03:50
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months. There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
Host: 박진현     Contact: 박진현 (2734)     한국어     2024-04-05 00:04:14
"PenDA, a rank-based method for personalized differential analysis: Application to lung cancer", Plos Comp. Biol. (2020) will be discussed in this Journal Club. The hopes of precision medicine rely on our capacity to measure various high-throughput genomic information of a patient and to integrate them for personalized diagnosis and adapted treatment. Reaching these ambitious objectives will require the development of efficient tools for the detection of molecular defects at the individual level. Here, we propose a novel method, PenDA, to perform Personalized Differential Analysis at the scale of a single sample. PenDA is based on the local ordering of gene expressions within individual cases and infers the deregulation status of genes in a sample of interest compared to a reference dataset. Based on realistic simulations of RNA-seq data of tumors, we showed that PenDA outcompetes existing approaches with very high specificity and sensitivity and is robust to normalization effects. Applying the method to lung cancer cohorts, we observed that deregulated genes in tumors exhibit a cancer-type-specific commitment towards up- or down-regulation. Based on the individual information of deregulation given by PenDA, we were able to define two new molecular histologies for lung adenocarcinoma cancers strongly correlated to survival. In particular, we identified 37 biomarkers whose up-regulation lead to bad prognosis and that we validated on two independent cohorts. PenDA provides a robust, generic tool to extract personalized deregulation patterns that can then be used for the discovery of therapeutic targets and for personalized diagnosis. An open-access, user-friendly R package is available at https://github.com/bcm-uga/penda. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     영어     2024-04-30 10:27:21

심사위원장: 권순식, 심사위원: 강문진, 변재형, 배명진, 조용근(전북대학교)
미정     2024-05-31 14:07:02
Reinforcement learning (RL) has become one of the most central problems in machine learning, showcasing remarkable success in recommendation systems, robotics and super-human level game plays. Yet, existing literature predominantly focuses on (almost) fully observable environments, overlooking the complexities of real-world scenarios where crucial information remains hidden. In this talk, we consider reinforcement learning in partially observable systems through the proposed framework of the Latent Markov Decision Process (LMDP). In LMDPs, an MDP is randomly drawn from a set of possible MDPs at the beginning of the interaction, but the context -- the latent factors identifying the chosen MDP -- is not revealed to the agent. This opacity poses new challenges for decision-making, particularly in scenarios like recommendation systems without sensitive user data, or medical treatments for undiagnosed illnesses. Despite the significant relevance of LMDPs to real-world problems, existing theories rely on restrictive separation assumptions -- an unrealistic constraint in practical applications. We present a series of new results addressing this gap: from leveraging higher-order information to develop sample-efficient RL algorithms, to establishing lower bounds and improved results under more realistic assumptions within Latent MDPs.
Host: 김동환     한국어 (필요한 경우 영어 가능) ( )     2024-05-17 17:03:41
Post-critically finite (PCF) rational maps are a fascinating class of dynamical systems with rich mathematical structures. In this minicourse, we explore the interplay between topology, geometry, and dynamics in the study of PCF rational maps. [Lecture 1: What are PCF rational maps?] We begin by introducing PCF rational maps, highlighting their significance in complex dynamics.
Host: Hyungryul Baik     미정     2024-05-22 09:34:23
This presentation focuses on unbiased simulation methods for quantities associated with sample paths from stochastic differential equations. Unbiased simulation methods can be found by changing probability measures with appropriately selecting the Radon-Nikodym derivative processes. I propose an unbiased Monte-Carlo simulation method that can be used even when the Girsanov kernel for the change of probability measures is not bounded. Then, I illustrate its practical application through an example involving unbiased Monte Carlo simulation for pricing the continuously averaging arithmetic Asian options under the Black-Scholes model.
Host: 이지운 교수     Contact: saarc (042-350-8117)     미정     2024-03-04 14:11:24
Very little is known about critical properties of graphs in the hierarchy of monotone classes, i.e. classes closed under taking (not necessarily induced) subgraphs. We distinguish four important levels in this hierarchy and discuss possible new levels by focusing on the Hamiltonian cycle problem. In particular, we obtain a number of results for this problem on monotone classes.
Host: Sang-il Oum     영어     2024-05-07 09:37:48
This is an introductory reading seminar presented by a senior undergraduate student, Jaehak Lee, who is studying the subject.
Host: 박진현     Contact: 박진현 (2734)     한국어     2024-04-05 00:09:55
"Optimal-Transport Analysis of Single-Cell Gene Expression Identifies Developmental Trajectories in Reprogramming", Cell (2019) will be discussed in this Journal Club. Understanding the molecular programs that guide differentiation during development is a major challenge. Here, we introduce Waddington-OT, an approach for studying developmental time courses to infer ancestor-descendant fates and model the regulatory programs that underlie them. We apply the method to reconstruct the landscape of reprogramming from 315,000 single-cell RNA sequencing (scRNA-seq) profiles, collected at half-day intervals across 18 days. The results reveal a wider range of developmental programs than previously characterized. Cells gradually adopt either a terminal stromal state or a mesenchymal-to-epithelial transition state. The latter gives rise to populations related to pluripotent, extra-embryonic, and neural cells, with each harboring multiple finer subpopulations. The analysis predicts transcription factors and paracrine signals that affect fates and experiments validate that the TF Obox6 and the cytokine GDF9 enhance reprogramming efficiency. Our approach sheds light on the process and outcome of reprogramming and provides a framework applicable to diverse temporal processes in biology. If you want to participate in the seminar, you need to enter IBS builiding (https://www.ibs.re.kr/bimag/visiting/). Please contact if you first come IBS to get permission to enter IBS building.
Host: Jae Kyoung Kim     영어     2024-04-30 10:24:33
Given a smooth manifold or orbifold M and a Lie group G acting transitively on a space X, we consider the space of all (G, X)-structures on M up to an appropriate equivalence relation. This space, known as the deformation space of (G, X)-structures on M, encodes information about how one can "deform" the (G, X)-manifold M. In this talk, I will provide a general definition of deformation spaces and character varieties, which capture the local structure of the deformation space. Additionally, I will introduce a class of orbifolds called the Coxeter orbifolds, for which deformation spaces can be computed using an approach due to the foundational work of E. Vinberg.
1. 데이터 분석 업무의 이해(김준범)- 데이터 분석가의 역할 소개 2. 초거대 언어 모델 동향(김정섭)-GPT-3 부터 Llama-3까지 이미 우리 삶 속에 깊숙이 자리잡은 초거대 언어 모델의 동향 3. 데이터 분석가에서 공직으로 오게된 과정과 앞으로의 계획(심규석)- 삼성화재에서의 데이터 분석 및 AI 모델링 업무, 행정안전부에서의 데이터 분석과제 기획·관리 및 공무원의 데이터 분석 역량지원 업무 전반에 관한 설명과 함께 각 기관을 지원하게 된 동기, 지원방법, 준비사항 등
Host: 권순식     Contact: 조성혁 (2703)     한국어     2024-04-26 16:25:31
A cross-cap drawing of a graph G is a drawing on the sphere with g distinct points, called cross-caps, such that the drawing is an embedding except at the cross-caps, where edges cross properly. A cross-cap drawing of a graph G with g cross-caps can be used to represent an embedding of G on a non-orientable surface of genus g. Mohar conjectured that any triangulation of a non-orientable surface of genus g admits a cross-cap drawing with g cross-caps in which each edge of the triangulation enters each cross-cap at most once. Motivated by Mohar’s conjecture, Schaefer and Stefankovic provided an algorithm that computes a cross-cap drawing with a minimal number of cross-caps for a graph G such that each edge of the graph enters each cross-cap at most twice. In this talk, I will first outline a connection between cross-cap drawings and an algorithm coming from computational biology to compute the signed reversal distance between two permutations. This connection will then be leveraged to answer two computational problems on graphs embedded on surfaces. First, I show how to compute a “short” canonical decomposition for a non-orientable surface with a graph embedded on it. Such canonical decompositions were known for orientable surfaces, but the techniques used to compute them do not generalize to non-orientable surfaces due to their more complex nature. Second, I explain how to build a counter example to a stronger version of Mohar’s conjecture that is stated for pseudo-triangulations. This is joint work with Alfredo Hubard and Arnaud de Mesmay.
Host: Sang-il Oum     영어     2024-03-30 23:07:22
The qualitative theory of dynamical systems mainly provides a mathematical framework for analyzing the long-time behavior of systems without necessarily finding solutions for the given ODEs. The theory of dynamical systems could be related to deep learning problems from various perspectives such as approximation, optimization, generalization, and explainability. In this talk, we first introduce the qualitative theory of dynamical systems. Then, we present numerical results as the application of the qualitative theory of dynamical systems to deep learning problems.
Host: Youngjoon Hong     영어     2024-05-03 15:29:47
This is part of an informal seminar series to be given by Mr. Jaehong Kim, who has been studying the book "Hodge theory and Complex Algebraic Geometry Vol 1 by Claire Voisin" for a few months. There will be 6-8 seminars during Spring 2024, and it will summarize about 70-80% of the book.
Host: 박진현     Contact: 박진현 (2734)     한국어     2024-04-05 00:02:49
EO strata are subvarieties in the moduli space of g-dimensional abelian varieties in characterstic p which classify points with given isomorphism type of p-torson subgroups. We are interested in how automorphism groups of points vary in supersingular EO strata. We show that when g is even and p>3, there is an open dense of the maximal supersingular EO stratum in which every point has automorphism group {\pm 1}, and prove Oor's conjecture in this case. This is joint work in progress with Valentijn Karemaker.
Host: 임보해     Contact: 김윤옥 (5745)     미정     2024-05-01 15:17:39
This lecture explores the topics and areas that have guided my research in computational mathematics and machine learning in recent years. Numerical methods in computational science are essential for comprehending real-world phenomena, and deep neural networks have achieved state-of-the-art results in a range of fields. The rapid expansion and outstanding success of deep learning and scientific computing have led to their applications across multiple disciplines, ranging from fluid dynamics to material sciences. In this lecture, I will focus on bridging machine learning with applied mathematics, specifically discussing topics such as scientific machine learning, numerical PDEs, and mathematical approaches of machine learning, including generative models and adversarial examples.
Host: 백형렬     영어     2024-02-22 11:29:34
The Tomas-Stein inequality is a fundamental inequality in Fourier Analysis. It measures the L^4 norm of the Fourier transform of the sphere surface measure in terms of the L^2 norm. It is possible because the sphere has a positive Gaussian curvature. In this talk we will present what is an extremizer problem to this inequality and what is the progress of this problem.
Host: 권순식     미정     2024-05-02 09:58:15
We introduce a general equivalence problems for geometric structures arising from minimal rational curves on uniruled complex projective manifolds. To study these problems, we need approaches fusing differential geometry and algebraic geometry. Among such geometric structures, those associated to homogeneous manifolds are particularly accessible to differential-geometric methods of Cartan geometry. But even in these cases, only a few cases have been worked out so far. We review some recent developments.
Host: 박진형     Contact: 박진형 (042-350-2747)     한국어     2024-03-28 14:50:43
In 2017, Aharoni proposed the following generalization of the Caccetta-Häggkvist conjecture for digraphs. If G is a simple n-vertex edge-colored graph with n color classes of size at least r, then G contains a rainbow cycle of length at most ⌈n/r⌉. In this talk, we prove that Aharoni’s conjecture holds up to an additive constant. Specifically, we show that for each fixed r, there exists a constant c such that if G is a simple n-vertex edge-colored graph with n color classes of size at least r, then G contains a rainbow cycle of length at most n/r+c. This is joint work with Patrick Hompe.
Host: Sang-il Oum     영어     2024-03-29 09:30:28
Deep learning techniques are increasingly applied to scientific problems, where the precision of networks is crucial. Despite being deemed as universal function approximators, neural networks, in practice, struggle to reduce the prediction errors below O(10−5) even with large network size and extended training iterations. To address this issue, we developed the multi-stage neural networks that divides the training process into different stages, with each stage using a new network that is optimized to fit the residue from the previous stage. Across successive stages, the residue magnitudes decreases substantially and follows an inverse power-law relationship with the residue frequencies. The multi-stage neural networks effectively mitigate the spectral biases associated with regular neural networks, enabling them to capture the high frequency feature of target functions. We demonstrate that the prediction error from the multi-stage training for both regression problems and physics-informed neural networks can nearly reach the machine-precision O(10−16) of double-floating point within a finite number of iterations. Such levels of accuracy are rarely attainable using single neural networks alone.
Host: Youngjoon Hong     영어     2024-04-20 14:25:54
Link prediction (LP), inferring the connectivity between nodes, is a significant research area in graph data, where a link represents essential information on relationships between nodes. Although graph neural network (GNN)-based models have achieved high performance in LP, understanding why they perform well is challenging because most comprise complex neural networks. We employ persistent homology (PH), a topological data analysis method that helps analyze the topological information of graphs, to explain the reasons for the high performance. We propose a novel method that employs PH for LP (PHLP) focusing on how the presence or absence of target links influences the overall topology. The PHLP utilizes the angle hop subgraph and new node labeling called degree double radius node labeling (Degree DRNL), distinguishing the information of graphs better than DRNL. Using only a classifier, PHLP performs similarly to state-of-the-art (SOTA) models on most benchmark datasets. Incorporating the outputs calculated using PHLP into the existing GNN-based SOTA models improves performance across all benchmark datasets. To the best of our knowledge, PHLP is the first method of applying PH to LP without GNNs. The proposed approach, employing PH while not relying on neural networks, enables the identification of crucial factors for improving performance. https://arxiv.org/abs/2404.15225
Host: 김우진     한국어     2024-04-24 19:44:17
This is an introductory reading seminar presented by a senior undergraduate student, Jaehak Lee, who is studying the subject.
Host: 박진현     Contact: 박진현 (2734)     한국어     2024-04-05 00:08:09
최신 논문 리뷰: Rapid Convergence of Unadjusted Langevin Algorithm (Vempala et al) and Score-Based Generative Models(Song et al)
Host: Youngjoon Hong     한국어     2024-04-20 14:22:18
I tell a personal story of how a mathematician working in complex algebraic geometry had come to discover the relevance of Cartan geometry, a subject in differential geometry, in an old problem in algebraic geometry, the problem of deformations of Grassmannians as projective manifolds, which originated from the work of Kodaira and Spencer. In my joint work with Ngaiming Mok, we used the theory of minimal rational curves to study such deformations and it reduced the question to a problem in Cartan geometry.
Host: 박진형     Contact: 박진형 (042-350-2747)     한국어     2024-03-28 14:49:38
This talk aims to consider the attainability of the Hardy-type inequality in the bounded smooth domain with average-zero type constraint. Since the criteria of the attainability depends to the concentration-compactness type arguments, we will briefly introduce the results for some classical Hardy-type inequalities and the concentration-compactness arguments. Subsequently, we propose new function spaces that well define the new inequalities. Finally, we will discuss the attainability of the optimal constant of the inequality in the general smooth domain.
In this talk, we will introduce support properties of solutions to nonlinear stochastic reaction-diffusion equations driven by random noise ˙W : ∂tu = aijuxixj + biuxi + cu + ξσ(u) ˙W , (ω, t, x) ∈ Ω × R+ × Rd; u(0, ·) = u0, where aij , bi, c and ξ are bounded and random coefficients. The noise ˙W is spacetime white noise or spatially homogeneous colored noise satisfying reinforced Dalang’s condition. We present examples of conditions on σ(u) that guarantee the compact support property of the solution. In addition, we suggest potential generalization of these conditions. This is joint work with Kunwoo Kim and Jaeyun Yi.
Host: 이지운 교수     Contact: saarc (042-350-8117)     미정     2024-03-04 14:10:21