English
Related papers

Related papers: FIST: A Feature-Importance Sampling and Tree-Based…

200 papers

We present a new tree boosting algorithm designed for the measurement of parameters in the context of effective field theory (EFT). To construct the algorithm, we interpret the optimized loss function of a traditional decision tree as the…

High Energy Physics - Phenomenology · Physics 2022-05-25 Suman Chatterjee , Nikolaus Frohner , Lukas Lechner , Robert Schöfbeck , Dennis Schwarz

Various modifications of decision trees have been extensively used during the past years due to their high efficiency and interpretability. Tree node splitting based on relevant feature selection is a key step of decision tree learning, at…

Machine Learning · Computer Science 2017-09-05 Dmitry Ignatov , Andrey Ignatov

Software fault prediction (SFP) is a critical task in software engineering, enabling early identification of faults in modules to improve software quality and reduce maintenance costs. This research investigates the combined effects of…

Software Engineering · Computer Science 2026-05-19 Ahmad Nauman Ghazi , Nagajyothi Devarapalli , Ashir Javeed , Sadi Alawadi , Fahed Alkhabbas , Khalid AlKharabsheh

We interleave sampling based motion planning methods with pruning ideas from minimum spanning tree algorithms to develop a new approach for solving a Multi-Goal Path Finding (MGPF) problem in high dimensional spaces. The approach alternates…

Multiagent Systems · Computer Science 2022-05-11 Nikhil Chandak , Kenny Chour , Sivakumar Rathinam , R. Ravi

Targeted data selection has emerged as a crucial paradigm for efficient instruction tuning, aiming to identify a small yet influential subset of training examples for a specific target task. In practice, influence is often measured through…

Machine Learning · Computer Science 2026-05-19 Guanghui Min , Tianhao Huang , Ke Wan , Chen Chen

Sampling-based algorithms, such as Rapidly Exploring Random Trees (RRT) and its variants, have been used extensively for motion planning. Control barrier functions (CBFs) have been recently proposed to synthesize controllers for…

Robotics · Computer Science 2022-06-03 Ahmad Ahmad , Calin Belta , Roberto Tron

The large models, as predicted by scaling raw forecasts, have made groundbreaking progress in many fields, particularly in natural language generation tasks, where they have approached or even surpassed human levels. However, the…

Computation and Language · Computer Science 2025-04-25 Luping Wang , Sheng Chen , Linnan Jiang , Shu Pan , Runze Cai , Sen Yang , Fei Yang

The Parameter-Efficient Fine-Tuning (PEFT) method, which adjusts or introduces fewer trainable parameters to calibrate pre-trained models on downstream tasks, has become a recent research interest. However, existing PEFT methods within the…

Computation and Language · Computer Science 2023-12-13 Jiacheng Ruan , Jingsheng Gao , Mingye Xie , Suncheng Xiang , Zefang Yu , Ting Liu , Yuzhuo Fu

Personalized text-to-image generation aims to create images tailored to user-defined concepts and textual descriptions. Balancing the fidelity of the learned concept with its ability for generation in various contexts presents a significant…

Computer Vision and Pattern Recognition · Computer Science 2025-02-11 Vera Soboleva , Maksim Nakhodnov , Aibek Alanov

Stochastic Gradient TreeBoost is often found in many winning solutions in public data science challenges. Unfortunately, the best performance requires extensive parameter tuning and can be prone to overfitting. We propose PaloBoost, a…

Machine Learning · Statistics 2018-07-24 Yubin Park , Joyce C. Ho

LLM-based recommender systems have made significant progress; however, the deployment cost associated with the large parameter volume of LLMs still hinders their real-world applications. This work explores parameter pruning to improve…

Information Retrieval · Computer Science 2025-07-10 Shanle Zheng , Keqin Bao , Jizhi Zhang , Yang Zhang , Fuli Feng , Xiangnan He

In path planning, anytime almost-surely asymptotically optimal planners dominate the benchmark of sampling-based planners. A notable example is Batch Informed Trees (BIT*), where planners iteratively determine paths to batches of vertices…

Supervised fine-tuning (SFT) is a pivotal approach to adapting large language models (LLMs) for downstream tasks; however, performance often suffers from the ``seesaw phenomenon'', where indiscriminate parameter updates yield progress on…

Computation and Language · Computer Science 2025-09-22 Yao Wang , Di Liang , Minlong Peng

Prompt-based methods have achieved promising results in most few-shot text classification tasks. However, for readability assessment tasks, traditional prompt methods lackcrucial linguistic knowledge, which has already been proven to be…

Computation and Language · Computer Science 2024-04-11 Ziyang Wang , Sanwoo Lee , Hsiu-Yuan Huang , Yunfang Wu

The success of the application of machine-learning techniques to compilation tasks can be largely attributed to the recent development and advancement of program characterization, a process that numerically or structurally quantifies a…

Programming Languages · Computer Science 2016-11-01 Pai-Shun Ting , Chun-Chen Tu , Pin-Yu Chen , Ya-Yun Lo , Shin-Ming Cheng

In generative modeling, we often wish to produce samples that maximize a user-specified reward such as aesthetic quality or alignment with human preferences, a problem known as \textit{guidance}. Despite their widespread use, existing…

Machine Learning · Computer Science 2026-05-21 Jerry Y. Huang , Justin Lin , Sheel Shah , Kartik Nair , Nicholas M. Boffi

Tabular data stands out as one of the most frequently encountered types in high energy physics. Unlike commonly homogeneous data such as pixelated images, simulating high-dimensional tabular data and accurately capturing their correlations…

Instrumentation and Detectors · Physics 2024-04-30 Cheng Jiang , Sitian Qian , Huilin Qu

The rise of deep learning has marked significant progress in fields such as computer vision, natural language processing, and medical imaging, primarily through the adaptation of pre-trained models for specific tasks. Traditional…

Machine Learning · Computer Science 2024-04-25 Charith Chandra Sai Balne , Sreyoshi Bhaduri , Tamoghna Roy , Vinija Jain , Aman Chadha

We propose a training-free conditional sampling method for flow matching models based on importance sampling. Because a na\"ive application of importance sampling suffers from weight degeneracy in high-dimensional settings, we modify and…

Machine Learning · Statistics 2026-02-16 Qianqian Qu , Jun S. Liu

The problem of parameterization is often central to the effective deployment of nature-inspired algorithms. However, finding the optimal set of parameter values for a combination of problem instance and solution method is highly…

Neural and Evolutionary Computing · Computer Science 2014-06-26 Matthew Crossley , Andy Nisbet , Martyn Amos