Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

James-A. Goulet

dblp:129/3307 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 6 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 64% Trustworthy machine learning · 18% Reinforcement learning · 18%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models › bayesian deep learning
bayesian neural networks
1.122022
Analytically Tractable Hidden-States Inference in Bayesian Neural Networks · J. Mach. Learn. Res. 2022
Tractable Approximate Gaussian Inference for Bayesian Neural Networks · J. Mach. Learn. Res. 2021
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.612022
Analytically Tractable Hidden-States Inference in Bayesian Neural Networks · J. Mach. Learn. Res. 2022
Machine learning › Reinforcement learning › continuous control
continuous action reinforcement learning
0.612022
Analytically Tractable Hidden-States Inference in Bayesian Neural Networks · J. Mach. Learn. Res. 2022
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
approximate inference
0.512021
Tractable Approximate Gaussian Inference for Bayesian Neural Networks · J. Mach. Learn. Res. 2021
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
tractable inference
0.512021
Tractable Approximate Gaussian Inference for Bayesian Neural Networks · J. Mach. Learn. Res. 2021

Methods — techniques the papers use, named apart from their topics

tractable approximate gaussian inference · 0.6gradient-based optimization · 0.6backpropagation · 0.5analytical gaussian inference · 0.5
YearPublicationVenuePosition
2026 Time series anomaly detection with residuals stationarity intervention on state-space models
Zhanwen Xin, James-A. Goulet
Adv. Eng. Informatics2
2025 Scalable probabilistic deterioration model based on visual inspections and structural attributes from large networks of bridges
abstract
Visual inspections of large networks of bridges yield millions of data points scattered across thousands of structural elements. Alongside visual inspections, structural attributes such as age, location and traffic load provide contextual information about the deterioration patterns in the network. Leveraging this network-scale data for modeling deterioration is challenging, especially when each structural element has few inspections over a long period of time. Moreover, as new bridge information and inspections are added each year, it is strictly important for deterioration models to be scalable. This paper addresses these challenges by proposing a scalable probabilistic approach for modeling deterioration of large networks of bridges. The new framework consists of state-space models (SSM) for modeling the deterioration based on visual inspections and a Bayesian neural network (BNN) that factors-in information about structural attributes. The role of the BNN model is to learn the mapping between the initial distribution of the deterioration speed and the structural attributes of each bridge. The new framework is shown to be computationally efficient and can seamlessly incorporate a large number of structural attributes, which alleviates the need for feature selection. In addition, the proposed framework incorporates a new approach for learning the inspectors’ uncertainty parameters which is shown to provide better generalization. The experiments in this study are based on real data from the network of bridges in the province of Quebec, Canada. • Scalable probabilistic deterioration model for large networks of bridges. • Deterioration modeling is based on visual inspections while considering structural attributes. • A new approach for quantifying the uncertainty associated with each inspector. • Validation analyses on inspection data from the network of bridges in the Quebec province.
Said Ali Kamal Fakhri, Zachary Hamida, James-A. Goulet
Adv. Eng. Informatics3
2024 Analytically tractable heteroscedastic uncertainty quantification in Bayesian neural networks for regression tasks
Bhargob Deka, Luong Ha Nguyen, James-A. Goulet
Neurocomputing3
2022 Analytically Tractable Hidden-States Inference in Bayesian Neural Networks
abstract
With few exceptions, neural networks have been relying on backpropagation and gradient descent as the inference engine in order to learn the model parameters, because closed-form Bayesian inference for neural networks has been considered to be intractable. In this paper, we show how we can leverage the tractable approximate Gaussian inference's (TAGI) capabilities to infer hidden states, rather than only using it for inferring the network's parameters. One novel aspect is that it allows inferring hidden states through the imposition of constraints designed to achieve specific objectives, as illustrated through three examples: (1) the generation of adversarial-attack examples, (2) the usage of a neural network as a black-box optimization method, and (3) the application of inference on continuous-action reinforcement learning. In these three examples, the constrains are in (1), a target label chosen to fool a neural network, and in (2 and 3) the derivative of the network with respect to its input that is set to zero in order to infer the optimal input values that are either maximizing or minimizing it. These applications showcase how tasks that were previously reserved to gradient-based optimization approaches can now be approached with analytically tractable inference.
Luong Ha Nguyen, James-A. Goulet
J. Mach. Learn. Res.2
2021 Tractable Approximate Gaussian Inference for Bayesian Neural Networks
abstract
In this paper, we propose an analytical method for performing tractable approximate Gaussian inference (TAGI) in Bayesian neural networks. The method enables the analytical Gaussian inference of the posterior mean vector and diagonal covariance matrix for weights and biases. The method proposed has a computational complexity of $\mathcal{O}(n)$ with respect to the number of parameters $n$, and the tests performed on regression and classification benchmarks confirm that, for a same network architecture, it matches the performance of existing methods relying on gradient backpropagation.
James-A. Goulet, Luong Ha Nguyen, Saeid Amiri
J. Mach. Learn. Res.1
2017 Measurement system design for civil infrastructure using expected utility
Romain Pasquier, James-A. Goulet, Ian F. C. Smith
Adv. Eng. Informatics2
2017 A machine learning approach for characterizing soil contamination in the presence of physical site discontinuities and aggregated samples
abstract
Rehabilitation of contaminated soils in urban areas is in high demand because of the appreciation of land value associated with the increased urbanization. Moreover, there are financial incentives to minimize soil characterization uncertainties. Minimizing uncertainty is achieved by providing models that are better representation of the true site characteristics. In this paper, we propose two new probabilistic formulations compatible with Gaussian Process Regression (GPR) and enabling (1) to model the experimental conditions where contaminant concentration is quantified from aggregated soil samples and (2) to model the effect of physical site discontinuities. The performance of approaches proposed in this paper are compared using a Leave One Out Cross-Validation procedure (LOO-CV). Results indicate that the two new probabilistic formulations proposed outperform the standard Gaussian Process Regression.
Alyssa Ngu-Oanh Quach, Lucie Tabor, Dany Dumont, Benoit Courcelles, James-A. Goulet
Adv. Eng. Informatics5
2014 Exploring approaches to improve the performance of autonomous monitoring with imperfect data in location-aware wireless sensor networks
William J. O'Brien, Fernanda Leite, James-A. Goulet
Adv. Eng. Informatics4
2013 Model falsification diagnosis and sensor placement for leak detection in pressurized pipe networks
James-A. Goulet, Sylvain Coutu, Ian F. C. Smith
Adv. Eng. Informatics1