Fernando Jiménez

Anthony Bloch, Leonardo Colombo, Fernando Jiménez

In this paper we investigate a variational discretization for the class of mechanical systems in presence of symmetries described by the action of a Lie group which reduces the phase space to a (non-trivial) principal bundle. By introducing a discrete connection we are able to obtain the discrete constrained higher-order Lagrange-Poincaré equations. These equations describe the dynamics of a constrained Lagrangian system when the Lagrangian function and the constraints depend on higher-order derivatives such as the acceleration, jerk or jounces. The equations, under some mild regularity conditions, determine a well defined (local) flow which can be used to define a numerical scheme to integrate the constrained higher-order Lagrange-Poincaré equations. Optimal control problems for underactuated mechanical systems can be viewed as higher-order constrained variational problems. We study how a variational discretization can be used in the construction of variational integrators for optimal control of underactuated mechanical systems where control inputs act soley on the base manifold of a principal bundle (the shape space). Examples include the energy minimum control of an electron in a magnetic field and two coupled rigid bodies attached at a common center of mass.

Leonardo Colombo, Fernando Jimenez, David Martin de Diego

In this paper we will discuss some new developments in the design of numerical methods for optimal control problems of Lagrangian systems on Lie groups. We will construct these geometric integrators using discrete variational calculus on Lie groups, deriving a discrete version of the second-order Euler-Lagrange equations. Interesting applications as, for instance, a discrete derivation of the Euler-Poincaré equations for second-order Lagrangians and its application to optimal control of a rigid body, and of a Cosserat rod are shown at the end of the paper.

Fernando Jimenez, Juergen Scheurle

In this paper we explore the discretization of Euler-Poincaré-Suslov equations on $SO(3)$, i.e. of the Suslov problem. We show that the consistency order corresponding to the unreduced and reduced setups, when the discrete reconstruction equation is given by a Cayley retraction map, are related to each other in a nontrivial way. We give precise conditions under which general and variational integrators generate a discrete flow preserving the constraint distribution. We establish general consistency bounds and illustrate the performance of several discretizations by some plots. Moreover, along the lines of [14] we show that any constraints-preserving discretization may be understood as being generated by the exact evolution map of a time-periodic non-autonomous perturbation of the original continuous-time nonholonomic system.

Raquel Espinosa, Fernando Jiménez, José Palma

Time series forecasting plays a crucial role in diverse fields, necessitating the development of robust models that can effectively handle complex temporal patterns. In this article, we present a novel feature selection method embedded in Long Short-Term Memory networks, leveraging a multi-objective evolutionary algorithm. Our approach optimizes the weights and biases of the LSTM in a partitioned manner, with each objective function of the evolutionary algorithm targeting the root mean square error in a specific data partition. The set of non-dominated forecast models identified by the algorithm is then utilized to construct a meta-model through stacking-based ensemble learning. Furthermore, our proposed method provides an avenue for attribute importance determination, as the frequency of selection for each attribute in the set of non-dominated forecasting models reflects their significance. This attribute importance insight adds an interpretable dimension to the forecasting process. Experimental evaluations on air quality time series data from Italy and southeast Spain demonstrate that our method substantially improves the generalization ability of conventional LSTMs, effectively reducing overfitting. Comparative analyses against state-of-the-art CancelOut and EAR-FS methods highlight the superior performance of our approach.

Raquel Espinosa, Gracia Sánchez, José Palma et al.

Feature selection is a critical step in the analysis of high-dimensional data, where the number of features often vastly exceeds the number of samples. Effective feature selection not only improves model performance and interpretability but also reduces computational costs and mitigates the risk of overfitting. In this context, we propose a novel feature selection method for high-dimensional data, based on the well-known permutation feature importance approach, but extending it to evaluate subsets of attributes rather than individual features. This extension more effectively captures how interactions among features influence model performance. The proposed method employs a multi-objective evolutionary algorithm to search for candidate feature subsets, with the objectives of maximizing the degradation in model performance when the selected features are shuffled, and minimizing the cardinality of the feature subset. The effectiveness of our method has been validated on a set of 24 publicly available high-dimensional datasets for classification and regression tasks, and compared against 9 well-established feature selection methods designed for high-dimensional problems, including the conventional permutation feature importance method. The results demonstrate the ability of our approach in balancing accuracy and computational efficiency, providing a powerful tool for feature selection in complex, high-dimensional datasets.

Fernando Jiménez, Gracia Sánchez, José Palma et al.

Gene expression datasets are usually of high dimensionality and therefore require efficient and effective methods for identifying the relative importance of their attributes. Due to the huge size of the search space of the possible solutions, the attribute subset evaluation feature selection methods tend to be not applicable, so in these scenarios feature ranking methods are used. Most of the feature ranking methods described in the literature are univariate methods, so they do not detect interactions between factors. In this paper we propose two new multivariate feature ranking methods based on pairwise correlation and pairwise consistency, which we have applied in three gene expression classification problems. We statistically prove that the proposed methods outperform the state of the art feature ranking methods Clustering Variation, Chi Squared, Correlation, Information Gain, ReliefF and Significance, as well as feature selection methods of attribute subset evaluation based on correlation and consistency with multi-objective evolutionary search strategy.

Luis Miralles-Pechuán, Fernando Jiménez, José Manuel García

Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. This system works like a global auction where advertisers bid to display their impressions in the publishers' ad slots. The most popular system to select which advertiser wins each auction is the Generalized second-price auction in which the advertiser that offers the most wins the bet and is charged with the price of the second largest bet. In this paper, we propose an alternative betting system with a new approach that not only considers the economic aspect but also other relevant factors for the functioning of the advertising system. The factors that we consider are, among others, the benefit that can be given to each advertiser, the probability of conversion from the advertisement, the probability that the visit is fraudulent, how balanced are the networks participating in RTB and if the advertisers are not paying over the market price. In addition, we propose a methodology based on genetic algorithms to optimize the selection of each advertiser. We also conducted some experiments to compare the performance of the proposed model with the famous Generalized Second-Price method. We think that this new approach, which considers more relevant aspects besides the price, offers greater benefits for RTB networks in the medium and long-term.

Luis Miralles-Pechuán, Fernando Jiménez, Hiram Ponce et al.

Whenever countries are threatened by a pandemic, as is the case with the COVID-19 virus, governments should take the right actions to safeguard public health as well as to mitigate the negative effects on the economy. In this regard, there are two completely different approaches governments can take: a restrictive one, in which drastic measures such as self-isolation can seriously damage the economy, and a more liberal one, where more relaxed restrictions may put at risk a high percentage of the population. The optimal approach could be somewhere in between, and, in order to make the right decisions, it is necessary to accurately estimate the future effects of taking one or other measures. In this paper, we use the SEIR epidemiological model (Susceptible - Exposed - Infected - Recovered) for infectious diseases to represent the evolution of the virus COVID-19 over time in the population. To optimize the best sequences of actions governments can take, we propose a methodology with two approaches, one based on Deep Q-Learning and another one based on Genetic Algorithms. The sequences of actions (confinement, self-isolation, two-meter distance or not taking restrictions) are evaluated according to a reward system focused on meeting two objectives: firstly, getting few people infected so that hospitals are not overwhelmed with critical patients, and secondly, avoiding taking drastic measures for too long which can potentially cause serious damage to the economy. The conducted experiments prove that our methodology is a valid tool to discover actions governments can take to reduce the negative effects of a pandemic in both senses. We also prove that the approach based on Deep Q-Learning overcomes the one based on Genetic Algorithms for optimizing the sequences of actions.

Fernando Jiménez, Sina Ober-Blöbaum

We deliver a novel approach towards the variational description of Lagrangian mechanical systems subject to fractional damping by establishing a restricted Hamilton's principle. Fractional damping is a particular instance of non-local (in time) damping, which is ubiquitous in mechanical engineering applications. The restricted Hamilton's principle relies on including fractional derivatives to the state space, the doubling of curves (which implies an extra mirror system) and the restriction of the class of varied curves. We will obtain the correct dynamics, and will show rigorously that the extra mirror dynamics is nothing but the main one in reversed time; thus, the restricted Hamilton's principle is not adding extra physics to the original system. The price to pay, on the other hand, is that the fractional damped dynamics is only a sufficient condition for the extremals of the action. In addition, we proceed to discretise the new principle. This discretisation provides a set of numerical integrators for the continuous dynamics that we denote Fractional Variational Integrators (FVIs). The discrete dynamics is obtained upon the same ingredients, say doubling of discrete curves and restriction of the discrete variations. We display the performance of the FVIs, which have local truncation order 1, in two examples. As other integrators with variational origin, for instance those generated by the discrete Lagrange-d'Alembert principle, they show a superior performance tracking the dissipative energy, in opposition to direct (order 1) discretisations of the dissipative equations, such as explicit and implicit Euler schemes.