Out of Distribution Generalization in Machine Learning
원문 초록
Machine learning has achieved tremendous success in a variety of domains in recent years. However, a lot of these success stories have been in places where the training and the testing distributions are extremely similar to each other. In everyday situations when models are tested in slightly different data than they were trained on, ML algorithms can fail spectacularly. This research attempts to formally define this problem, what sets of assumptions are reasonable to make in our data and what kind of guarantees we hope to obtain from them. Then, we focus on a certain class of out of distribution problems, their assumptions, and introduce simple algorithms that follow from these assumptions that are able to provide more reliable generalization. A central topic in the thesis is the strong link between discovering the causal structure of the data, finding features that are reliable (when using them to predict) regardless of their context, and out of distribution generalization.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Positional Encoding meets Persistent Homology on Graphs
Pruning Spurious Subgraphs for Graph Out-of-Distribtuion Generalization
The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giants
LORE: Lagrangian-Optimized Robust Embeddings for Visual Encoders
On the Out-of-Distribution Generalization of Self-Supervised Learning
From Local Details to Global Context: Advancing Vision-Language Models with Attention-Based Selection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.