A Case Study on Numerical Analysis of a Path Computation Algorithm

• URL: http://arxiv.org/abs/2411.14372v1
• Date: Thu, 21 Nov 2024 18:08:34 GMT
• Title: A Case Study on Numerical Analysis of a Path Computation Algorithm
• Authors: Grégoire Boussu, Nikolai Kosmatov, Franck Védrine,
• Abstract summary: Lack of numerical precision in control software can lead to costly or even catastrophic consequences. Various tools have been proposed to analyze the precision of program computations.
• Score: 0.5543867614999909
• License:
• Abstract: Lack of numerical precision in control software -- in particular, related to trajectory computation -- can lead to incorrect results with costly or even catastrophic consequences. Various tools have been proposed to analyze the precision of program computations. This paper presents a case study on numerical analysis of an industrial implementation of the fast marching algorithm, a popular path computation algorithm frequently used for trajectory computation. We briefly describe the selected tools, present the applied methodology, highlight some attention points, summarize the results and outline future work directions.

Related papers

• Design Space Exploration of Approximate Computing Techniques with a Reinforcement Learning Approach [49.42371633618761]
  We propose an RL-based strategy to find approximate versions of an application that balance accuracy degradation and power and computation time reduction. Our experimental results show a good trade-off between accuracy degradation and decreased power and computation time for some benchmarks.
  arXiv  Detail & Related papers  (2023-12-29T09:10:40Z)
• From Conception to Deployment: Intelligent Stroke Prediction Framework using Machine Learning and Performance Evaluation [0.0]
  This paper proposes an intelligent stroke prediction framework based on a critical examination of machine learning prediction algorithms in the literature. The five most used machine learning algorithms for stroke prediction are evaluated using a unified setup for objective comparison. Comparative analysis and numerical results reveal that the Random Forest algorithm is best suited for stroke prediction.
  arXiv  Detail & Related papers  (2023-04-01T07:11:31Z)
• Quantum-Enhanced Topological Data Analysis: A Peep from an Implementation Perspective [22.137388773023854]
  This paper presents an implementation of one such algorithm for calculating Betti numbers. The step-by-step instructions for the chosen quantum algorithm and the aspects of how it can be used for machine learning tasks are provided. We provide encouraging results on using Betti numbers for classification and give a preliminary analysis of the effect of the number of shots and precision qubits on the outcome of the quantum algorithm.
  arXiv  Detail & Related papers  (2023-02-19T12:18:13Z)
• Scalable computation of prediction intervals for neural networks via matrix sketching [79.44177623781043]
  Existing algorithms for uncertainty estimation require modifying the model architecture and training procedure. This work proposes a new algorithm that can be applied to a given trained neural network and produces approximate prediction intervals.
  arXiv  Detail & Related papers  (2022-05-06T13:18:31Z)
• Trajectory-based Algorithm Selection with Warm-starting [2.3823600586675724]
  We study the quality and accuracy of performance regression and algorithm selection models in the scenario of predicting different algorithm performances. We show promising performance of the trajectory-based per-run algorithm selection with warm-starting.
  arXiv  Detail & Related papers  (2022-04-13T14:00:55Z)
• Amortized Implicit Differentiation for Stochastic Bilevel Optimization [53.12363770169761]
  We study a class of algorithms for solving bilevel optimization problems in both deterministic and deterministic settings. We exploit a warm-start strategy to amortize the estimation of the exact gradient. By using this framework, our analysis shows these algorithms to match the computational complexity of methods that have access to an unbiased estimate of the gradient.
  arXiv  Detail & Related papers  (2021-11-29T15:10:09Z)
• A Fresh Approach to Evaluate Performance in Distributed Parallel Genetic Algorithms [5.375634674639956]
  This work proposes a novel approach to evaluate and analyze the behavior of multi-population parallel genetic algorithms (PGAs) In particular, we deeply study their numerical and computational behavior by proposing a mathematical model representing the observed performance curves. The conclusions based on the real figures and the numerical models fitting them represent a fresh way of understanding their speed-up, running time, and numerical effort.
  arXiv  Detail & Related papers  (2021-06-18T05:07:14Z)
• Quantum Algorithms for Data Representation and Analysis [68.754953879193]
  We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning. The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis. Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
  arXiv  Detail & Related papers  (2021-04-19T00:41:43Z)
• Beyond the Worst-Case Analysis of Algorithms (Introduction) [13.965228845332865]
  Worst-case analysis summarizes the performance profile of an algorithm by its worst performance on any input of a given size. This chapter surveys several alternatives to worst-case analysis that are discussed in detail later in the book.
  arXiv  Detail & Related papers  (2020-07-26T23:18:19Z)
• Coded Distributed Computing with Partial Recovery [56.08535873173518]
  We introduce a novel coded matrix-vector multiplication scheme, called coded computation with partial recovery (CCPR) CCPR reduces both the computation time and the decoding complexity by allowing a trade-off between the accuracy and the speed of computation. We then extend this approach to distributed implementation of more general computation tasks by proposing a coded communication scheme with partial recovery.
  arXiv  Detail & Related papers  (2020-07-04T21:34:49Z)
• Approximation Algorithms for Sparse Principal Component Analysis [57.5357874512594]
  Principal component analysis (PCA) is a widely used dimension reduction technique in machine learning and statistics. Various approaches to obtain sparse principal direction loadings have been proposed, which are termed Sparse Principal Component Analysis. We present thresholding as a provably accurate, time, approximation algorithm for the SPCA problem.
  arXiv  Detail & Related papers  (2020-06-23T04:25:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.