MEDIC: Zero-Shot Music Editing & Domain Generalization

• The paper introduces a dual meta-learning approach that constructs balanced decision boundaries for both known and unseen classes.
• It utilizes domain and class splits to align gradients, mitigating misclassification in open-set conditions and ensuring robust rejection of unknown samples.
• Empirical results on benchmarks like PACS and Digits-DG demonstrate enhanced open set metrics and improved OSCR performance.

Zero-Shot Music Editing with Disentangled Inversion Control (MEDIC) refers to a framework for open set domain generalization that operates under domain and class mismatches between training and deployment, primarily focused on constructing generalizable decision boundaries robust to previously unseen classes and domains. The method, originally detailed as "Dualistic Meta-Learning for Open Set Domain Generalization" (Wang et al., 2023), is not specific to music editing; rather, MEDIC’s core mechanisms have been applied to domain generalization in vision tasks, offering foundational strategies for zero-shot recognition and editing in any domain where open set and domain shifts occur.

1. Problem Formulation: Open Set Domain Generalization

Open Set Domain Generalization (OSDG) addresses the challenge of training models on source domains $$\mathcal{S} = \{\mathcal{D}_1, \ldots, \mathcal{D}_S\}$$, each sharing a known label set $\mathcal{C}$, to generalize to target domains containing both known and previously unseen classes ($$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$), with domain distribution shift. Close set DG assumes $U = \emptyset$, but OSDG permits $U \neq \emptyset$ at test time. In practice, standard DG methods—domain-invariant feature extraction, meta-learning, or augmentation—are insufficient, as they misclassify unseen classes and form overly strict decision boundaries that leave no margin for rejection. Formally, the objective is to learn parameters $\Theta$ such that, for $x$ from an unseen domain and $y \in \mathcal{C} \cup \mathcal{U}$, the model correctly predicts if $y \in \mathcal{C}$, or rejects (flags as unknown) if $y \in \mathcal{U}$, given only labeled training data with $\mathcal{C}$0.

2. MEDIC Framework: Dualistic Meta-Learning and Open-Set Loss

MEDIC (Dualistic MEta-learning with joint DomaIn-Class matching) advances OSDG by integrating two novel components:

1. A dualistic meta-learning scheme performing gradient alignment simultaneously across domains and classes.
2. An open-set loss merging close-set (softmax) and one-vs-all (OVA, multi-binary) heads to form balanced decision boundaries.

Dualistic meta-learning iterates as follows: at each update, source domains are split into two disjoint sets $\mathcal{C}$1, $\mathcal{C}$2 (domain-wise split), and known classes $\mathcal{C}$3 into disjoint halves $\mathcal{C}$4, $\mathcal{C}$5 (class-wise split). Four mini-tasks are constructed:

• $\mathcal{C}$6: $\mathcal{C}$7
• $\mathcal{C}$8: $\mathcal{C}$9
• $$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$0: $$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$1
• $$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$2: $$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$3

Meta-train uses $$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$4 and meta-test uses $$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$5 in each update, thus entangling inter-domain and inter-class gradient matching.

Meta-objective (abbreviated notation):

$$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$6

• Inner update: $$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$7
• Outer update:

$$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$8

Taylor expansion yields a final objective regularizing the alignment of meta-train and meta-test gradients over both domains and classes:

$$\mathcal{C} \cup \mathcal{U},\ \mathcal{U}\cap\mathcal{C} = \emptyset$$9

Open-set loss consists of:

• $U = \emptyset$0: standard cross-entropy on softmax head (close-set)
• $U = \emptyset$1: OVA head penalizing the hardest negative

The total loss for a mini-batch $U = \emptyset$2 is $U = \emptyset$3, with both heads operating over the same extracted features $U = \emptyset$4.

3. Architectural and Training Protocols

MEDIC utilizes a shared feature backbone $U = \emptyset$5 (e.g., ResNet18/50) and two parallel classification heads (softmax, OVA). The training pseudocode is:

$\Theta$1

Typical hyperparameters: meta-inner learning rate $U = \emptyset$6, meta-outer $U = \emptyset$7 likewise; meta-weight $U = \emptyset$8. Empirically best values are near $U = \emptyset$9 and $U \neq \emptyset$0 in $U \neq \emptyset$1. Each split batch size 32.

4. Decision Boundary Characterization

The OVA structure yields $U \neq \emptyset$2 parallel binary boundaries ("inlier" versus "outlier" for each class). Dualistic gradient matching prevents the classic OVA collapse—where boundaries shrink too tightly on positives or drift excessively toward negatives—by regularizing the class-wise margins. This construction ensures balanced, equidistant decision boundaries permitting rejection of unknowns (open set). At inference, two confidence measures are available:

• $U \neq \emptyset$3
• $U \neq \emptyset$4, with $U \neq \emptyset$5

If confidence falls below threshold $U \neq \emptyset$6, $U \neq \emptyset$7 is labeled as unknown.

5. Empirical Performance and Comparative Results

Comparative evaluation across PACS (Art, Cartoon, Photo, Sketch; 6:1 known:unknown class split), Office-Home (four domains, 65 classes), and Digits-DG (MNIST, MNIST-M, SVHN, SYN; 6:4 split) under leave-one-domain-out protocol demonstrates MEDIC’s superiority in open set metrics:

Benchmark	Prior SOTA (OSCR)	MEDIC-bcls (OSCR)	Closed-set Acc.
PACS ResNet50	DAML: ~73.7%	~84.9%	—
Digits-DG ConvNet	MLDG: ~68.4%	~71.2%	—
Office-Home	SWAD: —	—	~71.2%

For PACS, MEDIC-bcls outperforms DAML by $U \neq \emptyset$81.7%, and boosts OSCR on Digits-DG by $U \neq \emptyset$92.8% over MLDG. MEDIC maintains close-set accuracy competitive with or exceeding top DG methods (e.g., ~71.2% for Office-Home vs. 70.6% for SWAD).

Ablation studies indicate that:

• ERM (no meta) + bcls: H ~79.9 / OSCR ~81.0,
• MLDG (domain-wise meta only) + bcls: H ~79.9 / OSCR ~82.5,
• MEDIC (domain- & class-wise meta) + bcls: H ~83.0 / OSCR ~84.9.

Both domain- and class-wise gradient matching are necessary for full efficacy.

6. Implementation Guidance and Limitations

Implementation should begin from a robust DG baseline (e.g., MLDG, ERM+MixStyle), then integrate the OVA head and MEDIC meta-learning steps. Threshold $\Theta$0 should be tuned via H-score on held-out source domains, with OSCR curves providing further guidance. Parameter sharing between OVA and softmax heads reduces overhead with negligible loss of accuracy.

Potential extensions include alternative gradient alignment methods (variance matching as in Fishr) or adversarial synthesis of pseudo-unknowns. MEDIC’s limitations include its dependence on a tunable threshold for unknown rejection—which may drift on extreme domain shifts—and possible challenge in separating semantically similar unknown classes due to OVA margin blurring.

7. Context Within Open Domain Generalization Research

MEDIC directly addresses challenges highlighted by previous OSDG and OpenDG works such as DAML (Shu et al., 2021), which meta-learn over augmented domains/labels; in contrast, MEDIC regularizes class- and domain-wise gradients to construct robust OVA boundaries in a single shared backbone, enhancing both open- and close-set performance. The paradigm shift from augmenting source domain coverage (DAML) to directly sculpting decision boundaries (MEDIC) is empirically validated by superior open set metrics while retaining closed set capacity.

A plausible implication is that this approach, while developed for vision tasks, is adaptable to other modalities (such as music editing or audio-visual domains) wherever domain shift and unknown classes pose practical deployment barriers.