We consider the problem of , where part of the problem specification is provided through an image provided by a user. As a pedagogical example, we use the complete image of a Sudoku grid. While the rules of the puzzle are assumed to be known, the image must be interpreted by a neural network to extract the values in the grid. In this paper, we investigate (1) combining machine learning and constraint solving for , knowing that blank cells need to be both predicted as being blank and filled-in to obtain a full solution; (2) the effect of on joint inference; and (3) how to deal with cases where the constraints of the reasoning system are not satisfied. More specifically, in the case of handwritten in the image, a naive approach fails to obtain a feasible solution even if the interpretation is correct. Our framework human mistakes by using a constraint solver and helps the user to these mistakes. We evaluate the performance of the proposed techniques on images taken through the Sudoku Assistant Android app, among other datasets. Our experiments show that (1) joint inference can correct classifier mistakes, (2) overall calibration improves the solution quality on all datasets, and (3) estimating and discriminating between user-written and original visual input while reasoning makes for a more robust system, even in the presence of user errors.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11534853 | PMC |
http://dx.doi.org/10.1007/s10601-024-09372-9 | DOI Listing |
Sensors (Basel)
January 2025
Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China.
This paper presents an automated method for solving the initial structure of compact, high-zoom-ratio mid-wave infrared (MWIR) zoom lenses. Using differential analysis, the focal length variation process of zoom lenses under paraxial conditions is investigated, and a model for the focal power distribution and relative motion of three movable lens groups is established. The particle swarm optimization (PSO) algorithm is introduced into the zooming process analysis, and a program is developed in MATLAB to solve for the initial structure.
View Article and Find Full Text PDFStat Med
February 2025
Department of Biomedical Statistics, Graduate School of Medicine, Osaka University, Osaka, Japan.
In estimating the average treatment effect in observational studies, the influence of confounders should be appropriately addressed. To this end, the propensity score is widely used. If the propensity scores are known for all the subjects, bias due to confounders can be adjusted by using the inverse probability weighting (IPW) by the propensity score.
View Article and Find Full Text PDFBiomimetics (Basel)
December 2024
School of Computer Science and Engineering, Xi'an University of Technology, Xi'an 710048, China.
The shape design and optimization of complex disk curves is a crucial and intractable technique in computer-aided design and manufacturing (CAD/CAM). Based on disk Wang-Ball (DWB) curves, this paper defines a novel combined disk Wang-Ball (CDWB) curve with constrained parameters and investigates the shape optimization of CDWB curves by using the multi-strategy ameliorated chameleon swarm algorithm (MCSA). Firstly, in order to meet the various shape design requirements, the CDWB curves consisting of DWB curves are defined, and the G and G geometric continuity conditions for the curves are derived.
View Article and Find Full Text PDFEntropy (Basel)
January 2025
School of Electronic and Information, Northwestern Polytechnical University, Xi'an 710129, China.
Artificial intelligence plays an indispensable role in improving productivity and promoting social development, and causal discovery is one of the extremely important research directions in this field. Acyclic directed graphs (DAGs) are the most commonly used tool in causal modeling because of their excellent interpretability and structural properties. However, in the face of insufficient data, the accuracy and efficiency of DAGs learning are greatly reduced, resulting in a false perception of causality.
View Article and Find Full Text PDFConstraints
November 2024
Polytechnique Montréal, Montreal, Canada.
Constraint programming is known for being an efficient approach to solving combinatorial problems. Important design choices in a solver are the , designed to lead the search to the best solutions in a minimum amount of time. However, developing these heuristics is a time-consuming process that requires problem-specific expertise.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!