For a variety of well-known approaches, optimum predictors and estimators are determined in relation to the asymmetrical LINEX loss function. The applications of an iteratively practicable lowest mean squared error estimation of the regression disturbance variation with the LINEX loss function are discussed in this research. This loss is a symmetrical generalisation of the quadratic loss function. Whenever the LINEX loss function is applied, we additionally look at the risk performance of the feasible virtually unbiased generalised Liu estimator and practicable generalised Liu estimator. Whenever the variation is specified, we get all acceptable linear estimation in the class of linear estimation techniques, and when is undetermined, we get all acceptable linear estimation in the class of linear estimation techniques. During position transformations, the proposed Liu estimators are stable. The estimators’ biases and hazards are calculated and evaluated. We utilize an asymmetrical loss function, the LINEX loss function, to calculate the actual hazards of several error variation estimators. The employment of , which is easy to use and maximin, is recommended in the conclusions.
30 April 2022 in Computational Intelligence and Neuroscience
The LINEX loss function, which climbs exponentially with one-half of zero and virtually linearly on either side of zero, is employed to analyze parameter analysis and prediction problems. It can be used to solve both underestimation and overestimation issues. This paper explained the Bayesian estimation of mean, Gamma distribution, and Poisson process. First, an improved estimator for is provided (which employs a variation coefficient). Under the LINEX loss function, a better estimator for the square root of the median is also derived, and an enhanced estimation for the average mean in such a negatively exponential function. Second, giving a gamma distribution as a prior and a likelihood function as posterior yields a gamma distribution. The LINEX method can be used to estimate an estimator using posterior distribution. After obtaining , the hazard function and the function of survival estimators are used. Third, the challenge of sequentially predicting the intensity variable of a uniform Poisson process with a linear exponentially (LINEX) loss function and a constant cost of production time is investigated using a Bayesian model. The APO rule is offered as an approximation pointwise optimal rule. LINEX is the loss function used. A variety of prior distributions have already been studied, and Bayesian estimation methods have been evaluated against squared error loss function estimation methods. Finally, compare the results of Maximum Likelihood Estimation (MLE) and LINEX estimation to determine which technique is appropriate for such information by identifying the lowest Mean Square Error (MSE). The displaced estimation method under the LINEX loss function was also examined in this research, and an improved estimation was proposed.
The navigation of autonomous vehicles should be accurate and reliable to navigate safely in changing and unpredictable conditions. This paper proposes an advanced autonomous vehicle navigation framework that integrates probabilistic graphical models, Markov Chain Monte Carlo methods, and Bayesian optimization to enable reliable, real-time decision-making in uncertain environments. Due to dynamic and unpredictable surroundings, autonomous navigation is highly challenged in uncertainty quantification and adaptive parameter tuning. By leveraging PGMs, the framework can first determine probabilistic dependencies between critical variables, i.e., nodes and edges, such as vehicle speed, obstacle proximity, and environmental factors, to create a robust foundation for situational awareness. Then, Bayesian inference is obtained using MCMC: the system updates its real-time beliefs as new sensor data become available. The inference layer allows adaptation to unexpected obstacles by revising trajectories or controlling a vehicle’s speed while improving safety and reliability. Finally, Bayesian optimization fine-tunes key parameters within the system, such as sensor thresholds and control variables, maximizing efficiency without exhaustive manual tuning of these parameters. Using a multi-sensor data source with images, LiDAR, radar, and annotated environmental features, the Lyft Level 5 Perception Dataset tested real-world navigation scenarios against the framework. This proposed framework’s accuracy was around 99.01% and signified good decision-making capabilities for an autonomous vehicle navigating through complex environments with reliable performance. The autonomous vehicle system is also intended to provide improved safety and flexibility in complex environments, promising the development of more resilient and dependable AI-driven solutions for navigation.
This paper investigates a class of Leonardo polynomials defined by a nonhomogeneous recurrence relation, whose algebraic structure differs significantly from that of classical Fibonacci-type polynomial families. First, we develop a new connection formula expressing Leonardo polynomials in terms of Fibonacci polynomials, and then we derive the corresponding inverse connection formula. These two identities are subsequently employed to develop an explicit power-form representation of the Leonardo polynomials together with its corresponding monomial inversion formula. Building upon these fundamental representations, the paper derives new derivative and connection formulas involving generalized Fibonacci and generalized Lucas polynomial families in terms of the Leonardo basis. Several consequences for the classical Fibonacci and Lucas polynomials are also established. Furthermore, new product identities involving Leonardo polynomials are developed. The derived representations also reveal parity-dependent symmetry patterns in the Leonardo polynomial coefficients and clarify how these patterns are inherited from the associated Fibonacci- and Lucas-type bases. Many of the resulting coefficients are expressed in terms of terminating hypergeometric functions, yielding compact representations that are expected to be useful in approximation theory and operational methods for differential equations.
This paper introduces and investigates a family of non-symmetric Fibonacci polynomials (NSFPs) characterized by three parameters, generalizing well-known variants. We develop a series of structural formulas for these polynomials that elucidate their relationship with classical and certain generalized Fibonacci-type sequences. Additionally, we derive the generating function, a Binet-type representation, a connection formula with classical Fibonacci polynomials, and an explicit series expression. Furthermore, we establish standard and mixed linearization formulas, derivative expansions as linear combinations of classical Fibonacci and Lucas polynomial bases, and moment formulas for derivatives. We also deduce derivative expansions in terms of several symmetric and non-symmetric polynomial bases, using the corresponding classical inversion formulas. We extend the NSFPs to negative indices, yielding corresponding connection and linearization identities. In addition, the negative-to-positive connection is used to eliminate negative-index terms from the first-derivative expansion and to construct a finite first-order differentiation operational matrix for the NSFP basis. The resulting identities broaden the structural framework of the NSFPs and provide explicit tools for their future use in approximation methods and numerical algorithms.
We investigate the Euler polynomials of the second kind (EPs2) and develop a collection of structural identities for this modified Euler family. The analysis begins with an explicit expansion and a compact inverse relation, followed by connections with the classical Euler basis. We then obtain formulas governing differentiated moments and products, together with linearization relations. Higher-order derivatives are expanded in symmetric and non-symmetric bases, including Bernoulli, Laguerre, Jacobi, and generalized Fibonacci and Lucas polynomials. Converse expansions are established as well. We then evaluate several definite integrals to illustrate how the derived identities can be applied.