Scalable Set Encoding with Universal Mini-Batch Consistency and Unbiased Full Set Gradient Approximation
원문 초록
Recent work on mini-batch consistency (MBC) for set functions has brought attention to the need for sequentially processing and aggregating chunks of a partitioned set while guaranteeing the same output for all partitions. However, existing constraints on MBC architectures lead to models with limited expressive power. Additionally, prior work has not addressed how to deal with large sets during training when the full set gradient is required. To address these issues, we propose a Universally MBC (UMBC) class of set functions which can be used in conjunction with arbitrary non-MBC components while still satisfying MBC, enabling a wider range of function classes to be used in MBC settings. Furthermore, we propose an efficient MBC training algorithm which gives an unbiased approximation of the full set gradient and has a constant memory overhead for any set size for both train- and test-time. We conduct extensive experiments including image completion, text classification, unsupervised clustering, and cancer detection on high-resolution images to verify the efficiency and efficacy of our scalable set encoding framework. Our code is available at github.com/jeffwillette/umbc
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Making Language Model a Hierarchical Classifier and Generator
Robustness of Misinformation Classification Systems to Adversarial Examples Through BeamAttack
Prompt Candidates, then Distill: A Teacher-Student Framework for LLM-driven Data Annotation
PRL: Prompts from Reinforcement Learning
Guarded Query Routing for Large Language Models
The Ripple Effect: On Unforeseen Complications of Backdoor Attacks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.