IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v37y2025i3p623-643.html

Multiobjective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks

Author

Listed:
  • Ambrogio Maria Bernardelli

    (Department of Mathematics, University of Pavia, 27100 Pavia, Italy)

  • Stefano Gualandi

    (Department of Mathematics, University of Pavia, 27100 Pavia, Italy)

  • Simone Milanesi

    (Department of Mathematics, University of Pavia, 27100 Pavia, Italy)

  • Hoong Chuin Lau

    (School of Computing and Information Systems, Singapore Management University, Singapore 178902, Singapore)

  • Neil Yorke-Smith

    (Socio-Technical Algorithmic Research (STAR) Laboratory, Delft University of Technology, 2600 GA Delft, Netherlands)

Abstract

Training neural networks (NNs) using combinatorial optimization solvers has gained attention in recent years. In low-data settings, the use of state-of-the-art mixed integer linear programming solvers, for instance, has the potential to exactly train an NN while avoiding computing-intensive training and hyperparameter tuning and simultaneously training and sparsifying the network. We study the case of few-bit discrete-valued neural networks, both binarized neural networks (BNNs) whose values are restricted to ±1 and integer-valued neural networks (INNs) whose values lie in the range { − P , … , P } . Few-bit NNs receive increasing recognition because of their lightweight architecture and ability to run on low-power devices: for example, being implemented using Boolean operations. This paper proposes new methods to improve the training of BNNs and INNs. Our contribution is a multiobjective ensemble approach based on training a single NN for each possible pair of classes and applying a majority voting scheme to predict the final output. Our approach results in the training of robust sparsified networks whose output is not affected by small perturbations on the input and whose number of active weights is as small as possible. We empirically compare this BeMi approach with the current state of the art in solver-based NN training and with traditional gradient-based training, focusing on BNN learning in few-shot contexts. We compare the benefits and drawbacks of INNs versus BNNs, bringing new light to the distribution of weights over the { − P , … , P } interval. Finally, we compare multiobjective versus single-objective training of INNs, showing that robustness and network simplicity can be acquired simultaneously, thus obtaining better test performances. Although the previous state-of-the-art approaches achieve an average accuracy of 51.1 % on the Modified National Institute of Standards and Technology data set, the BeMi ensemble approach achieves an average accuracy of 68.4% when trained with 10 images per class and 81.8% when trained with 40 images per class while having up to 75.3% NN links removed.

Suggested Citation

  • Ambrogio Maria Bernardelli & Stefano Gualandi & Simone Milanesi & Hoong Chuin Lau & Neil Yorke-Smith, 2025. "Multiobjective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 37(3), pages 623-643, May.
  • Handle: RePEc:inm:orijoc:v:37:y:2025:i:3:p:623-643
    DOI: 10.1287/ijoc.2023.0281
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2023.0281
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2023.0281?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Tómas Thorbjarnarson & Neil Yorke-Smith, 2023. "Optimal training of integer-valued neural networks with mixed integer programming," PLOS ONE, Public Library of Science, vol. 18(2), pages 1-17, February.
    2. Young, H. P., 1988. "Condorcet's Theory of Voting," American Political Science Review, Cambridge University Press, vol. 82(4), pages 1231-1244, December.
    3. Miten Mistry & Dimitrios Letsios & Gerhard Krennrich & Robert M. Lee & Ruth Misener, 2021. "Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1103-1119, July.
    4. David Bergman & Teng Huang & Philip Brooks & Andrea Lodi & Arvind U. Raghunathan, 2022. "JANOS: An Integrated Predictive and Prescriptive Modeling Framework," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 807-816, March.
    5. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chenbo Shi & Mohsen Emadikhiav & Leonardo Lozano & David Bergman, 2024. "Constraint Learning to Define Trust Regions in Optimization over Pre-Trained Predictive Models," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1382-1399, December.
    2. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
    3. Antonio Villar, 2025. "Old rockers: Borda and Condorcet revisited," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 13(1), pages 45-53, April.
    4. Noelia Rico & Camino R. Vela & Raúl Pérez-Fernández & Irene Díaz, 2021. "Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties," Mathematics, MDPI, vol. 9(12), pages 1-12, June.
    5. Chakravarty, Surajeet & Kaplan, Todd R. & Myles, Gareth, 2018. "When costly voting is beneficial," Journal of Public Economics, Elsevier, vol. 167(C), pages 33-42.
    6. Vrishabh Patil & Kara K. Hoppe & Yonatan Mintz, 2026. "Healthcare applications of 0-1 neural networks in prescriptive problems with observational data," Health Care Management Science, Springer, vol. 29(1), pages 1-44, March.
    7. Toyotaka Sakai, 2017. "Considering Collective Choice: The Route 328 Problem in Kodaira City," The Japanese Economic Review, Japanese Economic Association, vol. 68(3), pages 323-332, September.
    8. Eric Kamwa, 2019. "On the Likelihood of the Borda Effect: The Overall Probabilities for General Weighted Scoring Rules and Scoring Runoff Rules," Group Decision and Negotiation, Springer, vol. 28(3), pages 519-541, June.
    9. Ernst Maug & Bilge Yilmaz, 2002. "Two-Class Voting: A Mechanism for Conflict Resolution," American Economic Review, American Economic Association, vol. 92(5), pages 1448-1471, December.
    10. Andrea Aveni & Ludovico Crippa & Giulio Principi, 2024. "On the Weighted Top-Difference Distance: Axioms, Aggregation, and Approximation," Papers 2403.15198, arXiv.org, revised Mar 2024.
    11. Amani Kahloul & Rim Lahmandi-Ayed & Hejer Lasram & Didier Laussel, 2017. "Democracy and competition: Vertical differentiation and labor in a general equilibrium model," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 19(4), pages 860-874, August.
    12. Silviu Pitis & Michael R. Zhang, 2020. "Objective Social Choice: Using Auxiliary Information to Improve Voting Outcomes," Papers 2001.10092, arXiv.org.
    13. Hannu Nurmi & Madeleine O. Hosli, 2003. "Which Decision Rule for the Future Council?," European Union Politics, , vol. 4(1), pages 37-50, March.
    14. Eric Kamwa, 2018. "On the Likelihood of the Borda Effect: The Overall Probabilities for General Weighted Scoring Rules and Scoring Runoff Rules," Working Papers hal-01786590, HAL.
    15. Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2011. "Condorcet admissibility: Indeterminacy and path-dependence under majority voting on interconnected decisions," MPRA Paper 32434, University Library of Munich, Germany.
    16. Ben-Yashar, Ruth & Nitzan, Shmuel, 2019. "Skill, value and remuneration in committees," Economics Letters, Elsevier, vol. 174(C), pages 93-95.
    17. Baharad, Eyal & Ben-Yashar, Ruth & Patal, Tal, 2020. "On the merit of non-specialization in the context of majority voting," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 128-133.
    18. Daron Acemoglu & Munther A. Dahleh & Ilan Lobel & Asuman Ozdaglar, 2011. "Bayesian Learning in Social Networks," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 78(4), pages 1201-1236.
    19. Andranik Tangian, 2021. "MCDM Application of the Third Vote," Group Decision and Negotiation, Springer, vol. 30(4), pages 775-787, August.
    20. Ruth Ben-Yashar & Shmuel Nitzan & Tomoya Tajika, 2021. "Skill, power and marginal contribution in committees," Journal of Theoretical Politics, , vol. 33(2), pages 225-235, April.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:37:y:2025:i:3:p:623-643. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.