paper-with-me

홈 › Papers

Parameter Averaging for Feature Ranking

2022-08-05 · Talip Ucar, Ehsan Hajiramezanali

Neural Networks are known to be sensitive to initialisation. The methods that rely on neural networks for feature ranking are not robust since they can have variations in their ranking when the model is initialized and trained with different random seeds. In this work, we introduce a novel method based on parameter averaging to estimate accurate and robust feature importance in tabular data setting, referred as XTab. We first initialize and train multiple instances of a shallow network (referred as local masks) with "different random seeds" for a downstream task. We then obtain a global mask model by "averaging the parameters" of local masks. We show that although the parameter averaging might result in a global model with higher loss, it still leads to the discovery of the ground-truth feature importance more consistently than an individual model does. We conduct extensive experiments on a variety of synthetic and real-world data, demonstrating that the XTab can be used to obtain the global feature importance that is not sensitive to sub-optimal model initialisation.

📄 PDF Abstract BibTeX arXiv:2208.03249

Code (0)

등록된 구현이 없습니다.

Tasks

Decision MakingFeature Importancefeature selection

Methods 이 논문이 사용한 방법론

Feature Selection Feature selection, also known as variable selection, attribute selection or variable subset selection, is the process of selecting a subset of relevant features (variables,…

Similar Papers 제목 키워드 기반

The Scaling Law of Evaluation Failure: Why Simple Averaging Collapses Under Data Sparsity and Item Difficulty Gaps, and How Item Response Theory Recovers Ground Truth Across Domains

2026-05-11 · Jung Min Kang arxiv

Benchmark evaluation across AI and safety-critical domains overwhelmingly relies on simple averaging. We demonstrate that this practice produces substantially misleading rankings when two conditions co-occur: (1) the eva…

Theoretical Analysis of Explicit Averaging and Novel Sign Averaging in Comparison-Based Search

2024-01-25 · Daiki Morinaga, Youhei Akimoto

In black-box optimization, noise in the objective function is inevitable. Noise disrupts the ranking of candidate solutions in comparison-based optimization, possibly deteriorating the search performance compared with a …

Distributed Weighted Parameter Averaging for SVM Training on Big Data

2015-09-30 · Ayan Das, Sourangshu Bhattacharya

Two popular approaches for distributed training of SVMs on big data are parameter averaging and ADMM. Parameter averaging is efficient but suffers from loss of accuracy with increase in number of partitions, while ADMM i…

Confidence-based Ranking with Adaptive Sampling for Noisy Black-Box Optimisation

2026-07-16 · Enrico Halim, Hemant Kumar Singh, Tapabrata Ray arxiv

Real-world optimization problems often involve black-box functions and uncertainties in their evaluation, widely referred to as noisy optimization problems (NOPs). Evolutionary algorithms (EA), including Evolutionary Str…

DM\_NLP at SemEval-2018 Task 12: A Pipeline System for Toponym Resolution

2019-06-01 · SEMEVAL 2019 6 · Xiaobin Wang, Chunping Ma, Huafei Zheng, Chu Liu 외

This paper describes DM-NLP{'}s system for toponym resolution task at Semeval 2019. Our system was developed for toponym detection, disambiguation and end-to-end resolution which is a pipeline of the former two. For topo…

Toponym Resolution