SearcharxivSearch

arXiv subjects

Minhee Park

Publications and source records attributed to Minhee Park.

2 recordsLinked to original sources

Bilinear Coordinate Alignment for Training-Free Task-Vector Transfer

Fine-tuning large-scale pre-trained models is a recent prevalent paradigm for adapting general representations to specialized tasks. However, when a new version of a pre-trained model becomes available, expertise acquired through fine-tuning cannot be directly reused because it is tied to the parameterization of the original model, requiring another costly fine-tuning. To address this inefficiency, recent work uses task vectors, defined as the parameter difference between a fine-tuned model and its base model, to transfer expertise across models. While existing methods bridge disparate models by matching activations or gradients, a significant performance gap remains relative to direct fine-tuning, suggesting that these partial correspondences are insufficient. In this work, instead of viewing a task vector merely as a parameter offset, we revisit the formation of task vectors and show that they can be derived as accumulated bilinear interactions between input-side activations and output-side gradients. Motivated by this observation, we formulate task-vector transfer as a dual-space alignment problem and propose BiCo, a training-free framework for transferring task vectors through Bilinear Coordinate alignment. BiCo estimates orthogonal Procrustes mappings in both spaces using a single forward-backward pass on a small calibration set, without any parameter update. Across extensive computer vision and natural language processing benchmarks, BiCo consistently outperforms existing transfer methods across models that differ in width, depth, and pre-training configuration.

cs.LG

SCOPE-FE: Structured Control of Operator and Pairwise Exploration for Feature Engineering via Quality-Aware Candidate-Space Reduction

Automatic feature engineering can improve predictive performance on tabular data by generating diverse feature transformations. However, the candidate space induced by combinations of input features and operators grows rapidly with dimensionality, resulting in substantial computational cost. We propose SCOPE-FE, a framework that controls the search space before candidate generation. SCOPE-FE combines FeatureClustering, a structural pair gate based on mixed-type feature association, with OperatorProbing, a dataset-specific utility control over operators. Unlike conventional expand-and-reduce approaches that generate a large candidate set and prune it afterward, SCOPE-FE focuses computation on a smaller, data-dependent candidate pool. Across ten OpenFE benchmark datasets, SCOPE-FE achieves a median candidate-space reduction of 82.9% and lowers component-summed feature-engineering time-including separately measured FeatureClustering overhead-on all ten datasets, yielding a geometric-mean speedup of 2.66x and a maximum speedup of 5.48x. Despite this reduction, SCOPE-FE is within the stated practical-equivalence margin of OpenFE on 8 of 10 datasets. An exhaustive candidate audit shows enrichment above uniform-random expectation on 8 of 10 datasets, with a median enrichment of 1.35x. Against Random-Pair, SCOPE-FE has higher enrichment on 6 of 10 datasets, with 5 of 10 significant; against Random-Operator and Random-Joint, it has higher enrichment on 8 of 10 datasets, with 8 of 10 significant for each. These results demonstrate that pre-generation search-space control can substantially reduce feature-engineering time while retaining a utility-enriched candidate pool under the OpenFE-compatible evaluation protocol.

stat.ML