English
Related papers

Related papers: S-Shaped vs. V-Shaped Transfer Functions for Antli…

200 papers

The Balanced-Pairwise-Affinities (BPA) feature transform is designed to upgrade the features of a set of input items to facilitate downstream matching or grouping related tasks. The transformed set encodes a rich representation of high…

Machine Learning · Computer Science 2024-07-02 Daniel Shalam , Simon Korman

The two most important criteria for vectorial Boolean functions used as S-boxes in block ciphers are differential uniformity and nonlinearity. Previous work in this field has focused only on nonlinearity and a different criterion,…

Cryptography and Security · Computer Science 2013-01-30 James McLaughlin , John A. Clark

Automated Algorithm Selection (AAS) is a popular meta-algorithmic approach and has demonstrated to work well for single-objective optimisation in combination with exploratory landscape features (ELA), i.e., (numerical) descriptive features…

Neural and Evolutionary Computing · Computer Science 2026-02-03 Oliver Preuß , Jeroen Rook , Jakob Bossek , Heike Trautmann

Improving the performance of classifiers is the realm of feature mapping, prototype selection, and kernel function transformations; these techniques aim for reducing the complexity, and also, improving the accuracy of models. In particular,…

Machine Learning · Computer Science 2019-10-04 Jose Ortiz-Bejar , Eric S. Tellez , Mario Graff

Many computer vision and medical imaging problems are faced with learning from large-scale datasets, with millions of observations and features. In this paper we propose a novel efficient learning scheme that tightens a sparsity constraint…

Machine Learning · Statistics 2017-02-07 Adrian Barbu , Yiyuan She , Liangjing Ding , Gary Gramajo

We present a method to formulate algorithm discovery as program search, and apply it to discover optimization algorithms for deep neural network training. We leverage efficient search techniques to explore an infinite and sparse program…

This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We…

Quantum Physics · Physics 2025-07-22 Chloe Pomeroy , Aleksandar Pramov , Karishma Thakrar , Lakshmi Yendapalli

This chapter proposes using the Moth Flame Optimization (MFO) algorithm for finetuning a Deep Neural Network to recognize different underwater sonar datasets. Same as other models evolved by metaheuristic algorithms, premature convergence,…

Neural and Evolutionary Computing · Computer Science 2023-03-03 Mohammad Khishe , Mokhtar Mohammadi , Tarik A. Rashid , Hoger Mahmud , Seyedali Mirjalili

Large Language Models (LLMs) have demonstrated remarkable potential in automating software development tasks. While recent advances leverage Supervised Fine-Tuning (SFT) and Direct Preference Optimization (DPO) to align models with human…

Software Engineering · Computer Science 2025-12-09 Xin Yin , Chao Ni , Xiaohu Yang

With the extensive applications of machine learning models, automatic hyperparameter optimization (HPO) has become increasingly important. Motivated by the tuning behaviors of human experts, it is intuitive to leverage auxiliary knowledge…

Machine Learning · Computer Science 2022-06-07 Yang Li , Yu Shen , Huaijun Jiang , Wentao Zhang , Zhi Yang , Ce Zhang , Bin Cui

Feature selection is an important pre-processing step for many pattern classification tasks. Traditionally, feature selection methods are designed to obtain a feature subset that can lead to high classification accuracy. However,…

Machine Learning · Computer Science 2012-05-03 Rui Wang , Ke Tang

Bayesian Optimization (BO) is a method for globally optimizing black-box functions. While BO has been successfully applied to many scenarios, developing effective BO algorithms that scale to functions with high-dimensional domains is still…

Machine Learning · Computer Science 2024-02-13 Yihang Shen , Carl Kingsford

Feature selection problems have been extensively studied for linear estimation, for instance, Lasso, but less emphasis has been placed on feature selection for non-linear functions. In this study, we propose a method for feature selection…

Machine Learning · Computer Science 2020-07-28 Yutaro Yamada , Ofir Lindenbaum , Sahand Negahban , Yuval Kluger

It is not rare that the performance of one metaheuristic algorithm can be improved by incorporating ideas taken from another. In this article we present how Simulated Annealing (SA) can be used to improve the efficiency of the Ant Colony…

Artificial Intelligence · Computer Science 2017-05-03 Rafał Skinderowicz

%% Text of abstract The process of identifying the most suitable optimization algorithm for a specific problem, referred to as algorithm selection (AS), entails training models that leverage problem landscape features to forecast algorithm…

Machine Learning · Computer Science 2025-01-30 Gjorgjina Cenikj , Gašper Petelin , Moritz Seiler , Nikola Cenikj , Tome Eftimov

Stabilizing the complexity of Feedforward Neural Networks (FNNs) for the given approximation task can be managed by defining an appropriate model magnitude which is also greatly correlated with the generalization quality and computational…

Neural and Evolutionary Computing · Computer Science 2018-10-23 Saman Sadeghyan , Shahrokh Asadi

In this paper, a new feature selection algorithm, called SFE (Simple, Fast, and Efficient), is proposed for high-dimensional datasets. The SFE algorithm performs its search process using a search agent and two operators: non-selection and…

SigNet is a state of the art model for feature representation used for handwritten signature verification (HSV). This representation is based on a Deep Convolutional Neural Network (DCNN) and contains 2048 dimensions. When transposed to a…

Computer Vision and Pattern Recognition · Computer Science 2020-10-21 Victor L. F. Souza , Adriano L. I. Oliveira , Rafael M. O. Cruz , Robert Sabourin

Optimal transport is a machine learning problem with applications including distribution comparison, feature selection, and generative adversarial networks. In this paper, we propose feature-robust optimal transport (FROT) for…

Feature allocation models postulate a sampling distribution whose parameters are derived from shared features. Bayesian models place a prior distribution on the feature allocation, and Markov chain Monte Carlo is typically used for model…

Methodology · Statistics 2022-07-29 David B. Dahl , Devin J. Johnson , R. Jacob Andros
‹ Prev 1 4 5 6 7 8 10 Next ›