Wooseok Ha: Semi-supervised domain adaptation via fine-tuning from multiple adaptive starts
Subscribe to the channel to get notified when we release a new video. Like the video to tell YouTube that you want more content like this on your feed. See our website for future seminars: https://sites.google.com/view/ocis/home Tuesday, Oct 21, 2025: Wooseok Ha (Korea Advanced Institute of Science and Technology) Title: When few labeled target data suffice: a theory of semi-supervised domain adaptation via fine-tuning from multiple adaptive starts Abstract: Semi-supervised domain adaptation (SSDA) aims to achieve high predictive performance in the target domain with limited labeled target data by exploiting abundant source and unlabeled target data. Despite its significance in numerous applications, theory on the effectiveness of SSDA remains largely unexplored, particularly in scenarios involving various types of source-target distributional shifts. In this talk, I will present a theoretical framework based on structural causal models (SCMs) which allows us to analyze and quantify the performance of SSDA methods when labeled target data is limited. Within this framework, I introduce three SSDA methods, each having a fine-tuning strategy tailored to a distinct assumption about the source and target relationship. Under each assumption, I demonstrate how extending an unsupervised domain adaptation (UDA) method to SSDA can achieve minimax-optimal target performance with limited target labels. Finally, when the relationship between source and target data is only vaguely known—a common practical concern—I will describe the Multi Adaptive-Start FineTuning (MASFT) algorithm, which fine-tunes UDA models from multiple starting points and selects the best-performing one based on a small hold-out target validation dataset. Combined with model selection guarantees, MASFT achieves near-optimal target predictive performance across a broad range of types of distributional shifts while significantly reducing the need for labeled target data. Discussant: Jason Kluswoski (Princeton University)

Surface Data vs. Deep Data

Carlos Cinelli: Long Story Short: Omitted Variable Bias in Causal Machine Learning

Variational Inference | Evidence Lower Bound (ELBO) | Intuition & Visualization

Zijun Gao: Explainability and Analysis of Variance

Don't waste 2026 learning the wrong tech skills (Meta Engineer's Take)

The Strange Math That Predicts (Almost) Anything

Nobel Prize lecture: Demis Hassabis, Nobel Prize in Chemistry 2024

Transformers, the tech behind LLMs | Deep Learning Chapter 5

Dean Eckles: Policy relevance of causal quantities in networks

HOLY ROSARY TODAY THURSDAY, JUNE 11, 2026 ST. JUDE THADDEUS & LUMINOUS MYSTERIES | DAILY HOLY ROSARY

How AI Cracked the Protein Folding Code and Won a Nobel Prize

What do tech pioneers think about the AI revolution? - The Engineers, BBC World Service

Something is jamming GPS over Europe. Here's what we found

Quantum Consciousness and the Origin of Life

Inside Anthropic, the $965 Billion AI Juggernaut | The Circuit

Markov Chain Monte Carlo Explained in 10 Minutes

Caleb Miles: Addressing a positivity violation to distinguish causal effects via separable effects

Naoki Egami: Conformal Policy Learning with Distribution-Free Safety Guarantees

Stanford CS229 I Machine Learning I Building Large Language Models (LLMs)

