Friday, September 12, 2025

<< >>  
2025. 8
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
2025. 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
2025. 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
2025-09-16 / 16:00 ~ 17:00
SAARC 세미나 - SAARC 세미나: 인쇄
by 장경석(중앙대학교 AI학과)
Reinforcement learning (RL) focuses on achieving efficient learning and optimal decision-making from available trials. Recent breakthroughs such as ChatGPT, robotics, autonomous driving, and recommendation systems owe much to advancements in reinforcement learning. Reinforcement learning is often framed as the ‘exploration vs. exploitation’ dilemma. In each trial, the learning agent must decide between ‘exploring’ to discover new possible outcomes or ‘exploiting’ by choosing familiar actions that yield reliable rewards. Effective exploration is crucial to enabling the agent to understand its environment with fewer trials, thereby saving trial opportunities for exploitation, which ultimately maximizes cumulative reward. In this talk, we will delve into a deeper understanding of efficient exploration through two RL variants: the bandit problem and best-arm identification. Throughout the series of new results, we will discuss how to address the two key aspects of exploration research: the design of experiments and the stopping condition for exploration.
2025-09-16 / 16:00 ~ 17:00
SAARC 세미나 - 콜로퀴엄: 인쇄
by 장경석(중앙대학교 AI학과)
Reinforcement learning (RL) focuses on achieving efficient learning and optimal decision-making from available trials. Recent breakthroughs such as ChatGPT, robotics, autonomous driving, and recommendation systems owe much to advancements in reinforcement learning. Reinforcement learning is often framed as the ‘exploration vs. exploitation’ dilemma. In each trial, the learning agent must decide between ‘exploring’ to discover new possible outcomes or ‘exploiting’ by choosing familiar actions that yield reliable rewards. Effective exploration is crucial to enabling the agent to understand its environment with fewer trials, thereby saving trial opportunities for exploitation, which ultimately maximizes cumulative reward. In this talk, we will delve into a deeper understanding of efficient exploration through two RL variants: the bandit problem and best-arm identification. Throughout the series of new results, we will discuss how to address the two key aspects of exploration research: the design of experiments and the stopping condition for exploration.
2025-09-15 / 16:00 ~ 17:30
편미분방정식 통합연구실 세미나 - 편미분방정식: 인쇄
by 최범준()

2025-09-18 / 16:15 ~ 17:15
학과 세미나/콜로퀴엄 - 콜로퀴엄: 인쇄
by 김우연(카이스트 화학과)
Generative modeling has emerged as a powerful tool for molecular design and structure prediction, offering the ability for molecular discovery. However, challenges such as synthetic feasibility, novelty, diversity of generated molecules, and generalization remain critical for real-world applications, particularly in drug discovery. In this presentation, we provide a comprehensive overview of state-of-the-art generative models, including graph-based methods, generative flow networks, and diffusion methods, all aimed at addressing these challenges. First, we focus on strategies that improve molecular structural optimzation using geometric deep learning methods. Second, we show how generative modeling can be applied to design novel molecules with desired properties such as drug potency, binding affinities to a specific target protein. Third, we will consider synthesizability of generated molecules by incorporating chemical reaction templates, enabling the generation of novel compounds that are not only drug-like but also synthetically accessible. Moreover, advanced sampling techniques and adaptive learning allow these models to explore diverse molecular structures, including those composed of previously unseen building blocks, while optimizing for key properties such as binding affinity and drug-likeness. Through case studies in drug design and broader molecular applications, we demonstrate how these generative modeling can help accelerate molecular discovery, offering a pathway to more practical and innovative solutions across diverse chemistry domains.
2025-09-19 / 14:00 ~ 16:00
학과 세미나/콜로퀴엄 - 기타: Quillen's Higher Algebraic K-Theory 1 인쇄
by 우태윤(KAIST)
This is a reading seminar of a graduate student, following the Fields medal work of Daniel Quillen on the foundation of the higher algebraic K-theory.
2025-09-16 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: Excluding ladder and wheel as induced minor in graphs without induced stars 인쇄
by Mujin Choi(KAIST & IBS Discrete Mathematics Group)
We prove that for all positive integers $k$ and $d$, the class of $K_{1,d}$-free graphs not containing the $k$-ladder or the $k$-wheel as an induced minor has a bounded tree-independence number. Our proof uses a generalization of the concept of brambles to tree-independence number. This is based on joint work with Claire Hilaire, Martin Milanič, and Sebastian Wiederrecht.
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download