Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

72144215287 · Jun 202019922001200920172026
48 results for Graph 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.

This work builds a sensor graph from DC sensors for anomaly detection.

problem Anomaly detection in data centers with complex sensor relationships.
method Data-driven pipeline (ts2graph) to build a sensor graph from sensor time series.
result Graph neural network (GNN) outperforms existing methods by 2-3 times in anomaly detection.

Proposes a model combining graph networks and variational Bayes for graph data.

problem Probabilistic modeling of graph structured data.
method Combines graph networks and variational Bayes for probabilistic modeling of graph data.
result Demonstrates effectiveness on wind farm monitoring and Gaussian Process data.

Online CPD for weighted and directed graphs using RDPG model.

problem Monitoring and detecting changes in weighted and directed graph data.
method Spectral embeddings of RDPG models for online updates and error-rate control.
result A lightweight online CPD algorithm with improved detection resolution and delay.

Graph neural networks improve equipment health monitoring from multisensor data.

problem Leveraging complex machinery structure for condition-based maintenance.
method Captured machinery structure as a graph and used graph neural networks (GNNs) to model time-series data.
result GNN-based RUL estimation model outperforms RNNs and CNNs on turbofan engine benchmark.

GraphSVR forecasts urban air pollution robustly across stations and seasons.

problem Nonlinear, nonstationary, spatiotemporally dependent urban air pollution forecasting challenges.
method Combines graph convolutional learning and support vector regression.
result GraphSVR improves predictive accuracy and maintains stable performance across seasons and outlier-prone episodes.

New methods solve graph sparsity optimization problems faster.

problem Complex graph sparsity optimization problems in disease outbreak monitoring and social network analysis.
method Stochastic variance-reduced gradient-based methods GraphSVRG-IHT and GraphSCSG-IHT.
result Our methods achieve linear convergence speed.

We introduce propagation kernels, a general graph-kernel framework for efficiently measuring the similarity of structured data. Propagation kernels are based on monitoring how information spreads through a set of given graphs. They leverage early-stage distributions from propagation schemes such as random walks to capt…

2014-10-13abs ↗pdf ↗

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.

New MMD estimators detect differences in missing paired data.

problem Handling missing data in matched pairs with complex distributions.
method Maximum mean discrepancy (MMD) estimators for complex data with missing values.
result Valid and consistent estimators detect differences in data distributions.

New algorithms reduce regret in both stochastic and adversarial partial monitoring problems.

problem Partial monitoring with kk-actions and dd-outcomes.
method Follow-the-regularized-leader framework, exploration by optimization, adaptive learning rate.
result Best-of-both-worlds algorithms with favorable regret bounds in stochastic and adversarial settings.

A new metric assesses causal graphs using node permutations to detect inconsistencies.

problem Quantifying the goodness of causal graphs and distinguishing them from random graphs.
method Constructing a baseline through node permutations and comparing inconsistencies.
result The proposed metric can distinguish between true and wrong causal graphs.

New approach models computer network activity as mixtures of sources.

problem Malicious activity detection in computer networks using standard algorithms is ineffective.
method Source separation approach to model short-term dynamics of computer network activity.
result Qualitative and quantitative experiments validate the approach.

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.

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.

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 framework explains GNN predictions by simulating graph structure and feature changes.

problem Lack of transparency in GNN predictions hinders understanding.
method TraP2 framework using a three-layer architecture: Translation, Perturbation, and Paraphrase layers.
result TraP2 achieves 10.2% higher explanation accuracy than state-of-the-art methods.

New algorithm for multiway spectral clustering on Grassmann manifolds.

problem Efficiently computing multiple eigenvectors of a nonlinear graph Laplacian.
method Direct multiway spectral clustering in pp-norm, reformulated as minimization on Grassmann manifold.
result Monotonic decrease of balanced graph cuts leads to optimal solutions.

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.

The paper uses a graph autoencoder to learn unbiased plant-pollinator interaction embeddings.

problem Sampling bias in citizen science data affects ecological network analysis.
method Bipartite graph variational autoencoder with HSIC for fairness.
result The method mitigates sampling bias and provides unbiased embeddings.

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.

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…

2018-09-18abs ↗pdf ↗

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.