Automatic error function learning with interpretable compositional networks

DOI10.1007/S10472-022-09829-8MaRDI QIDQ6932027zbMATH OpenFDO

Authors Florian Richoux, Jean-François Baffier

Publication date 9 September 2025

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10472-022-09829-8

zbMATH Keywords

error functioncombinatorial optimizationconstraint programminginterpretable learningproblem modelingcombinatorial satisfaction

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 683338 (Why is no real title available?)
• scientific article; zbMATH DE number 2084723 (Why is no real title available?)
• scientific article; zbMATH DE number 2083802 (Why is no real title available?)
• A general approach for constraint solving by local search
• Constraint acquisition
• Constraint learning: an appetizer
• Constraint reasoning
• Essence: A constraint language for specifying combinatorial problems
• Global constraint catalogue: past, present and future
• Handbook of constraint programming.
• Hard and soft constraints for reasoning about qualitative conditional preferences
• In pursuit of the Holy Grail
• Large-scale parallelism for constraint-based local search: the costas array case study
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Progress towards the Holy Grail
• Stochastic local search. Foundations and applications.
• Valued constraint satisfaction problems

This page was built for publication: Automatic error function learning with interpretable compositional networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932027)