L-HNNs improve Bayesian inference by reducing gradient requirements and improving ESS.
problem Efficient Bayesian inference with complex target densities.
method Latent Hamiltonian Neural Networks (L-HNNs) with NUTS, incorporating online error monitoring.
result L-HNNs in NUTS with online error monitoring required 1--2 orders of magnitude fewer numerical gradients and improved ESS by an order of magnitude.
A novel neural network training method reduces gradient variance for faster and better reinforcement learning.
problem Improving convergence and generalization in deep reinforcement learning.
method Gradient Monitoring (GM) approach to dynamically adjust the learning process based on feedback.
result The proposed methods, especially AM-WGM, significantly enhance model performance and generalization.
Paper optimizes a big data and ML risk monitoring system for financial markets.
problem Traditional risk monitoring methods are inadequate for modern financial markets due to data complexity and volume.
method Four-layer architecture integrating big data and advanced ML algorithms (LSTM, RF, GB).
result Significantly enhances efficiency and accuracy in risk management, especially in market crash risk detection.
New framework monitors neural network training and reveals regularisation mechanisms.
problem Overfitting in neural networks and the need for explicit regularizers.
method Model Gradient Similarity (MGS) framework to measure and monitor regularisation.
result Explicit regularizers increase Model Gradient Similarity (MGS).
A framework monitors and diagnoses concept drift in supervised learning models.
problem Changes in predictive relationships over time render models suboptimal.
method Score vector monitoring using exponentially weighted moving average.
result Score-based approach detects concept drift more effectively than error-based methods.
Paper develops a robust federated recommendation system against poisoning attacks.
problem Low-cost poisoning attacks degrade federated recommendation systems' performance.
method Develops a robust learning strategy using gradients to filter out Byzantine clients.
result Empirically validated robust learning strategy on four datasets.
Optimizes state monitoring in Markovian systems with cost constraints.
problem Balancing state queries with prediction costs in Markovian systems.
method Greedy policy and SGD-based learning variant for optimal predict-query tradeoff.
result Greedy policy is suboptimal but performs close to optimal under certain conditions.
Develops anytime-valid stopping rules for SGD based on observed trajectory.
problem Stopping stochastic gradient descent (SGD) based on observed trajectory.
method Develops anytime-valid confidence sequences for stochastic gradient methods.
result Statistically valid, time-uniform stopping rules for SGD across convex and nonconvex settings.
Online monitor detects classifier drift and adapts predictions.
problem Silent degradation of classifier accuracy under distributional shift.
method Sliding-window KS statistic with calibrated alarm thresholds.
result 86.6% valid detection across various shift conditions.
L-HNNs improve Bayesian inference efficiency by reducing gradient computation.
problem Efficient Bayesian inference with minimal gradient computation.
method Integrating L-HNNs into NUTS with online error monitoring.
result L-HNNs in NUTS outperform NUTS in complex posterior densities.
Generative Adversarial Networks create synthetic data for structural damage detection.
problem Data scarcity in structural damage detection.
method 1-D Wasserstein Deep Convolutional Generative Adversarial Networks (1-D WDCGAN-GP) for synthetic data generation.
result Generated synthetic data improves damage detection accuracy in 1-D Deep Convolutional Neural Networks.
NeCPD improves online tensor decomposition using SGD with Hessian analysis and NAG.
problem Efficiently decompose multi-way tensors in online data processing.
method NeCPD solver based on SGD with Hessian analysis and NAG.
result NeCPD provides more accurate results than existing methods.
AI systems that explain their decisions can be monitored for harmful intentions.
problem Monitoring AI systems' decision-making processes for harmful intentions is imperfect and can miss some misbehavior.
method Monitoring the chain of thought (CoT) of AI systems that communicate in human language.
result CoT monitoring is a promising but fragile approach to AI safety.
In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a prob…
In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a prob…
Direct proof shows adaptive gradient descent converges near-linearly for convex functions.
problem Proving near-linear convergence of adaptive gradient descent for convex functions.
method Direct Lyapunov-based argument for convex functions with unique minimizer.
result Direct proof of near-linear convergence for convex functions.
A new deep learning method for energy disaggregation.
problem Energy disaggregation or non-intrusive load monitoring (NILM) to identify individual appliance power usage.
method Sequence to Point Learning based on Bidirectional Dilated Residual Network (BRDN).
result Our method outperforms state-of-the-art approaches in all appliances on REDD and UK-DALE datasets.
Paper uses ML to predict insulator flashover risk.
problem Predicting flashover risk of aging insulators.
method Supervised ML with XGBoost, using LC and voltage features.
result Model accurately estimates insulator flashover probability.
Simple online monitor detects unsafe LLM outputs.
problem LLMs generate unsafe outputs despite training.
method Thresholding external verifier signal to decide alarms.
result Simple design competitive with advanced methods.
ScoreStop uses gradient tests to stop gradient boosting early.
problem Overfitting in gradient boosted decision trees.
method ScoreStop uses a functional score test based on gradients to stop boosting.
result ScoreStop is competitive with loss-based early stopping methods.
This research tackles monitoring machine learning algorithms post-deployment, addressing performativity issues.
problem Monitoring machine learning algorithms after deployment, especially when they affect their own data-generating process.
method Uses causal inference techniques to navigate performativity and compares different monitoring criteria and data sources.
result Different monitoring systems have varying operating characteristics and implications for ML monitoring design.
Paper improves ETF tail-risk monitoring reliability.
problem Unreliable ETF risk monitoring under degraded data.
method Combines quality checks, prediction, scoring, and adjustment.
result Improves tail-risk monitoring, especially during stressed periods.
PITMonitor monitors model calibration over time with formal error guarantees.
problem Fixed-sample tests applied to models over time can lead to false alarms.
method PITMonitor uses mixture e-processes to detect distributional shifts in probability integral transforms.
result PITMonitor achieves competitive detection rates on river's FriedmanDrift benchmark.
The paper adds explanation to predictive process monitoring.
problem Equipping predictive business process monitoring with explanation capabilities.
method Used game theory of Shapley Values to obtain robust explanations.
result First time explanations given in predictive business process monitoring.
IDS algorithm optimizes sequential decisions in various monitoring settings.
problem Optimizing sequential decisions in complex monitoring scenarios.
method Information-directed sampling (IDS) algorithm for linear partial monitoring.
result IDS achieves nearly worst-case rate optimality in finite-action games.
A new method monitors unstructured 3D shapes without registration.
problem Error-prone registration and mesh reconstruction steps in PCD monitoring.
method Intrinsic geometric properties of shapes, using Laplacian and geodesic distances.
result Effective monitoring of defects without registration and mesh reconstruction.
Focuses on monitoring and explaining models in real-world applications.
problem Ensuring high quality machine learning services in production environments.
method Statistical techniques for model performance and data monitoring, explanations of predictions.
result Challenges and solutions for implementing monitoring and explanation in production models.
A new method detects changes in machine learning models over time.
problem Automatic monitoring of machine learning models trained on evolving data.
method Score-based statistical hypothesis test for change detection.
result The method can detect changes in any number of model components.
Neural system optimizes glucose levels in diabetics.
problem Limited research on continuous glucose maintenance devices.
method Differential predictive control with neural policy and differentiable modeling.
result Improves glucose level optimization in real-time.
We present a numerical scheme to calculate fluctuation identities for exponential Lévy processes in the continuous monitoring case. This includes the Spitzer identities for touching a single upper or lower barrier, and the more difficult case of the two-barriers exit problem. These identities are given in the Fourier-L…
Optimal probing framework for scalable network monitoring.
problem Efficiently monitor growing cloud networks with limited budgets.
method A- and E-optimal experimental designs, Frank-Wolfe algorithm approximations.
result Significant reduction in probing budget with low estimation errors.
The paper proposes a method to create efficient remote monitoring models.
problem Large and complex machine learning models are unsuitable for remote monitoring on edge devices.
method Decompose the model into a simple local monitoring function and a complex correction term evaluated on the server.
result The proposed framework learns monitoring models with significantly reduced complexity that maintain safety.
New monitoring method detects ML risk models' performance changes in medical interventions.
problem Monitoring ML risk models in healthcare is complicated by confounding medical interventions.
method Developed a new score-based CUSUM monitoring procedure with dynamic control limits.
result Valid inference is possible if conditional exchangeability or time-constant selection bias hold.
Emerging wearable sensors have enabled the unprecedented ability to continuously monitor human activities for healthcare purposes. However, with so many ambient sensors collecting different measurements, it becomes important not only to maintain good monitoring accuracy, but also low power consumption to ensure sustain…
Study explores algorithmic collusion in repeated games using various learning dynamics.
problem Understanding algorithmic collusion in repeated games with different learning dynamics.
method Examines Q-learning, gradient learning, and other dynamics in a general repeated game setting. result Characterizes the set of payoff vectors achievable by these dynamics, revealing possibilities for collusion.
Risk monitoring detects when TTA models degrade at test time.
problem Detecting when TTA models degrade at test time.
method Extended risk monitoring tools based on sequential testing with confidence sequences.
result Demonstrated effectiveness of TTA monitoring framework across various datasets and methods.
For using neural networks in safety critical domains, it is important to know if a decision made by a neural network is supported by prior similarities in training. We propose runtime neuron activation pattern monitoring - after the standard training process, one creates a monitor by feeding the training data to the ne…
The significance of air pollution and the problems associated with it are fueling deployments of air quality monitoring stations worldwide. The most common approach for air quality monitoring is to rely on environmental monitoring stations, which unfortunately are very expensive both to acquire and to maintain. Hence e…
Structural health monitoring is a condition-based field of study utilised to monitor infrastructure, via sensing systems. It is therefore used in the field of aerospace engineering to assist in monitoring the health of aerospace structures. A difficulty however is that in structural health monitoring the data input is …
Adaptive-stepsize MCMC sampling inspired by Adam optimizer.
problem Improving numerical stability and convergence speed in MCMC sampling.
method Time-rescaled Langevin dynamics with an auxiliary relaxation equation and adaptive stepsize control.
result Automatic stepsize control improves accuracy and stability in numerical experiments.
A monitoring procedure improves machine learning forecasts for digital platforms.
problem Maintaining accurate and stable forecasts for data streams at digital platforms.
method Developed a monitoring procedure to determine when to retrain machine learning algorithms.
result Monitor-based retraining produces accurate forecasts compared to benchmarks.
Novel framework monitors cardiac image segmentation models in real-time.
problem Ensuring continuous high model performance and segmentation results in clinics.
method Formulated as anomaly detection, the framework derives surrogate quality measures for segmentation.
result Demonstrated accurate, fast, and scalable quality control monitoring.
New Thompson sampling algorithm for stochastic partial monitoring achieves logarithmic regret.
problem Limited feedback in sequential learning problems.
method Developed a novel Thompson-sampling-based algorithm to sample from the posterior distribution exactly.
result Achieved logarithmic regret bound of O(log T) for a linearized variant of the problem.
Paper monitors DNN accuracy to enhance trustworthiness.
problem Varying DNN accuracy in practice and lack of ground truth labels.
method Post-hoc accuracy monitor model using Monte-Carlo dropout ensemble.
result Accuracy monitor provides close-to-true accuracy estimation.
Proposes real-time risk monitoring for machine learning systems under unknown shifts.
problem Dynamic distribution shifts challenge real-world machine learning systems' risk assurances.
method Sequential hypothesis testing with 'testing by betting' to detect risk violations.
result Effective real-time risk monitoring under various unknown shifts.
A registration-free framework monitors shape and color in 4D point clouds.
problem Monitoring shape and color changes in complex parts without registration.
method Laplace-Beltrami operator spectral properties for geometric and color feature capture; combined monitoring scheme for shape and color anomalies.
result Effective detection of shape deformations and color anomalies without registration or mesh reconstruction.
Adaptive stepsizing improves sampling in Bayesian neural networks.
problem Scalable sampling of posterior distributions in Bayesian neural networks.
method SA-SGLD, employing time rescaling to adapt stepsize dynamically.
result SA-SGLD achieves more accurate posterior sampling than SGLD.
IDS optimizes regret in stochastic partial monitoring with linear rewards.
problem Optimizing decision-making in uncertain environments with linear rewards.
method Information Directed Sampling (IDS) for stochastic partial monitoring.
result Achieves optimal regret rates in all observable game regimes.