Model-Based Reasoning
Enhancing Oceanic Variables Forecast in the Santos Channel by Estimating Model Error with Random Forests
Moreno, Felipe M., Netto, Caio F. D., de Barros, Marcel R., Coelho, Jefferson F., de Freitas, Lucas P., Mathias, Marlon S., Neto, Luiz A. Schiaveto, Dottori, Marcelo, Cozman, Fabio G., Costa, Anna H. R., Gomi, Edson S., Tannuri, Eduardo A.
In this work we improve forecasting of Sea Surface A recent and promising line of work consists of combining Height (SSH) and current velocity (speed and direction) ML with physics-based models -- often referred to as in oceanic scenarios. We do so by resorting Physics-Informed Machine Learning (PIML). Such an approach to Random Forests so as to predict the error of a numerical aims to take advantage of both the power of pattern forecasting system developed for the Santos recognition given by ML approaches and the power of generalization Channel in Brazil. We have used the Santos Operational in unseen scenarios given by the physics-based Forecasting System (SOFS) and data collected model. in situ between the years of 2019 and 2021. This work expands on our previous work [Moreno et al., In previous studies we have applied similar methods 2022] where PIML was used to correct the error predicted for current velocity in the channel entrance, in by a numerical model of the speed of water current in a this work we expand the application to improve the measuring station. Our main contribution here consists of SHH forecast and include four other stations in the inserting a correction for the direction of the water current channel. We have obtained an average reduction and the sea surface height (SSH) predicted by the numerical of 11.9% in forecasting Root-Mean Square Error model into the PIML model. In addition, we expand the (RMSE) and 38.7% in bias with our approach. We corrections to other measurement stations in the Santos-Sรฃo also obtained an increase of Agreement (IOA) in 10 Vicente-Bertioga Estuarine System region on the Brazilian of the 14 combinations of forecasted variables and coast.
Theoretical Advances in Current Estimation and Navigation from a Glider-Based Acoustic Doppler Current Profiler (ADCP)
Stevens-Haas, Jacob, Webster, Sarah E., Aravkin, Aleksandr
We examine acoustic Doppler current profiler (ADCP) measurements from underwater gliders to determine glider position, glider velocity, and subsurface current. ADCPs, however, do not directly observe the quantities of interest; instead, they measure the relative motion of the vehicle and the water column. We examine the lineage of mathematical innovations that have previously been applied to this problem, discovering an unstated but incorrect assumption of independence. We reframe a recent method to form a joint probability model of current and vehicle navigation, which allows us to correct this assumption and extend the classic Kalman smoothing method. Detailed simulations affirm the efficacy of our approach for computing estimates and their uncertainty. The joint model developed here sets the stage for future work to incorporate constraints, range measurements, and robust statistical modeling.
Positive Dependency Graphs Revisited
Fandinno, Jorge, Lifschitz, Vladimir
Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program. We describe a modification of that concept and show that the new understanding of positive dependency makes it possible to strengthen some of these results.
La veille de la cybersรฉcuritรฉ
Building artificial intelligence (AI) that aligns with human values is an unsolved problem. Here we developed a human-in-the-loop research pipeline called Democratic AI, in which reinforcement learning is used to design a social mechanism that humans prefer by majority. A large group of humans played an online investment game that involved deciding whether to keep a monetary endowment or to share it with others for collective benefit. Shared revenue was returned to players under two different redistribution mechanisms, one designed by the AI and the other by humans. The AI discovered a mechanism that redressed initial wealth imbalance, sanctioned free riders and successfully won the majority vote.
Human-centred mechanism design with Democratic AI
Building artificial intelligence (AI) that aligns with human values is an unsolved problem. Here we developed a human-in-the-loop research pipeline called Democratic AI, in which reinforcement learning is used to design a social mechanism that humans prefer by majority. A large group of humans played an online investment game that involved deciding whether to keep a monetary endowment or to share it with others for collective benefit. Shared revenue was returned to players under two different redistribution mechanisms, one designed by the AI and the other by humans. The AI discovered a mechanism that redressed initial wealth imbalance, sanctioned free riders and successfully won the majority vote. By optimising for human preferences, Democratic AI offers a proof of concept for value-aligned policy innovation.
La veille de la cybersรฉcuritรฉ
The split led to the myth that while it was easier to automate man's higher reasoning functions, it was harder to automate the functions that humans shared with other animals. Last week, Twitter turned into a battleground in the discussion around the significance of symbolic models in AI versus deep learning. Melanie Mitchell, author and Davis Professor at the Santa Fe Institute, posted a Twitter thread speaking about how the main ideas under artificial intelligence were transforming with time. Mitchell notes that AI was defined as a study of intelligence from the context of symbolic systems and problem-solving. On the other hand, continuous systems, pattern recognition, learning and neural networks were believed to be in the domain of cybernetics.
Engineering Design Process: Definition and Steps
The Engineering Design Process is a series of steps that engineers follow to find a solution to a problem. Steps include problem solving processes, for example, determining your objectives and constraints, prototyping, testing and evaluating. This process is critical to the work TWI does and is something we can provide support for. While the design process is iterative, it follows a predetermined set of steps, some of which may need to be repeated before moving on to the next one. This will vary depending on the project, but allows for lessons to be learned from failures and improvements to be made.
Survey and Evaluation of Causal Discovery Methods for Time Series
Assaad, Charles K. (Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG, EasyVista) | Devijver, Emilie (Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG) | Gaussier, Eric (Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG)
We introduce in this survey the major concepts, models, and algorithms proposed so far to infer causal relations from observational time series, a task usually referred to as causal discovery in time series. To do so, after a description of the underlying concepts and modelling assumptions, we present different methods according to the family of approaches they belong to: Granger causality, constraint-based approaches, noise-based approaches, score-based approaches, logic-based approaches, topology-based approaches, and difference-based approaches. We then evaluate several representative methods to illustrate the behaviour of different families of approaches. This illustration is conducted on both artificial and real datasets, with different characteristics. The main conclusions one can draw from this survey is that causal discovery in times series is an active research field in which new methods (in every family of approaches) are regularly proposed, and that no family or method stands out in all situations. Indeed, they all rely on assumptions that may or may not be appropriate for a particular dataset.
The efficacy and generalizability of conditional GANs for posterior inference in physics-based inverse problems
Ray, Deep, Ramaswamy, Harisankar, Patel, Dhruv V., Oberai, Assad A.
In this work, we train conditional Wasserstein generative adversarial networks to effectively sample from the posterior of physics-based Bayesian inference problems. The generator is constructed using a U-Net architecture, with the latent information injected using conditional instance normalization. The former facilitates a multiscale inverse map, while the latter enables the decoupling of the latent space dimension from the dimension of the measurement, and introduces stochasticity at all scales of the U-Net. We solve PDE-based inverse problems to demonstrate the performance of our approach in quantifying the uncertainty in the inferred field. Further, we show the generator can learn inverse maps which are local in nature, which in turn promotes generalizability when testing with out-of-distribution samples.