paper-with-me

홈 › Papers

Model-based feature selection for neural networks: A mixed-integer programming approach

2023-02-20 · Shudian Zhao, Calvin Tsay, Jan Kronqvist

In this work, we develop a novel input feature selection framework for ReLU-based deep neural networks (DNNs), which builds upon a mixed-integer optimization approach. While the method is generally applicable to various classification tasks, we focus on finding input features for image classification for clarity of presentation. The idea is to use a trained DNN, or an ensemble of trained DNNs, to identify the salient input features. The input feature selection is formulated as a sequence of mixed-integer linear programming (MILP) problems that find sets of sparse inputs that maximize the classification confidence of each category. These ''inverse'' problems are regularized by the number of inputs selected for each category and by distribution constraints. Numerical results on the well-known MNIST and FashionMNIST datasets show that the proposed input feature selection allows us to drastically reduce the size of the input to $\sim$15\% while maintaining a good classification accuracy. This allows us to design DNNs with significantly fewer connections, reducing computational effort and producing DNNs that are more robust towards adversarial attacks.

📄 PDF Abstract BibTeX arXiv:2302.10344

Code (0)

등록된 구현이 없습니다.

Tasks

Classificationfeature selectionimage-classificationImage Classification

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 제목 키워드 기반

A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming

2023-07-14 · Mark Turner, Timo Berthold, Mathieu Besançon

The current cut selection algorithm used in mixed-integer programming solvers has remained largely unchanged since its creation. In this paper, we propose a set of new cut scoring measures, cut filtering techniques, and …

Beyond Local Selection: Global Cut Selection for Enhanced Mixed-Integer Programming

2025-03-20 · Shuli Zeng, Sijia Zhang, Shaoang Li, Feng Wu 외

In mixed-integer programming (MIP) solvers, cutting planes are essential for Branch-and-Cut (B&C) algorithms as they reduce the search space and accelerate the solving process. Traditional methods rely on hard-coded heur…

Adaptive Cut Selection in Mixed-Integer Linear Programming

2022-02-22 · Mark Turner, Thorsten Koch, Felipe Serrano, Michael Winkler

Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance. These solvers have million…

Mixed Integer Linear Programming for Active Contact Selection in Deep Brain Stimulation

2025-02-11 · Anna Franziska Frigge, Alexander Medvedev

Deep brain stimulation (DBS) programming remains a complex and time-consuming process, requiring manual selection of stimulation parameters to achieve therapeutic effects while minimizing adverse side-effects. This study…

Computational Efficiency

Learning Cut Generating Functions for Integer Programming

2024-05-22 · Hongyu Cheng, Amitabh Basu

The branch-and-cut algorithm is the method of choice to solve large scale integer programming problems in practice. A key ingredient of branch-and-cut is the use of cutting planes which are derived constraints that reduc…