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,742 papers · 148 categories

Trend · papers per month

10.7%21.3%32.0%42.6% · Jun 202019922001200920172026
48 results for faulty data

This paper proposes a novel Gaussian process approach to fault removal in time-series data. Fault removal does not delete the faulty signal data but, instead, massages the fault from the data. We assume that only one fault occurs at any one time and model the signal by two separate non-parametric Gaussian process model…

2015-07-02abs ↗pdf ↗

Fault-tolerant federated learning for non-uniform data.

problem Faulty workers corrupting data in federated learning.
method Fault-resilient proximal gradient (FRPG) algorithm with Nesterov's acceleration and local FRPG for reduced communication.
result FRPG and LFRPG converge faster than robust stochastic aggregation.

New algorithm for clustering with faulty oracle achieves optimal queries and efficiency.

problem Clustering with a faulty oracle, especially for multiple clusters.
method Built on stochastic block model, provides nearly-optimal query complexity.
result Time-efficient algorithm with nearly-optimal query complexity for all constant k and any δ.

This paper considers the problem of Byzantine fault tolerance in distributed linear regression in a multi-agent system. However, the proposed algorithms are given for a more general class of distributed optimization problems, of which distributed linear regression is a special case. The system comprises of a server and…

2019-03-20abs ↗pdf ↗

SignSGD improves distributed learning by tolerating faulty devices, including Byzantine adversaries.

problem Faulty devices, including Byzantine adversaries, disrupt convergence in distributed learning.
method Developed SignSGD from SGD, proving its robustness to Byzantine adversaries with upper bound convergence rate.
result SignSGD converges in the presence of Byzantine adversaries, providing a fault-tolerant solution.

Fault-tolerant neural networks inspired by biological error correction codes.

problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.

Paper addresses fault-tolerance in distributed machine learning with stochastic gradient descent.

problem Fault-tolerance in distributed stochastic gradient descent (D-SGD) for machine learning.
method Proposes norm-based comparative gradient elimination (CGE) to robustify D-SGD against Byzantine faulty agents.
result CGE guarantees fault-tolerance against a bounded fraction of Byzantine agents under standard stochastic assumptions.

From a sequence of similarity networks, with edges representing certain similarity measures between nodes, we are interested in detecting a change-point which changes the statistical property of the networks. After the change, a subset of anomalous nodes which compares dissimilarly with the normal nodes. We study a sim…

2016-12-05abs ↗pdf ↗

New algorithm estimates eigenspace with faulty nodes, matching performance of existing methods.

problem Estimating eigenspace in distributed systems with node failures.
method Develops an eigenspace estimation algorithm for distributed environments with arbitrary node failures.
result Matches performance of existing non-robust estimator up to an additive error.

Algorithms that fuse multiple input sources benefit from both complementary and shared information. Shared information may provide robustness against faulty or noisy inputs, which is indispensable for safety-critical applications like self-driving cars. We investigate learning fusion algorithms that are robust against …

2019-06-11abs ↗pdf ↗

This work uses adversarial learning to detect and correct feature shifts in various datasets.

problem Detecting and correcting feature shifts in real-world datasets.
method Adversarial learning applied to multiple discriminators to detect and correct feature shifts.
result Mainstream classifiers can effectively localize and correct feature shifts, outperforming existing techniques.

Due to recent technological developments, Machine Learning (ML), a subfield of Artificial Intelligence (AI), has been successfully used to process and extract knowledge from a variety of complex problems. However, a thorough ML approach is complex and highly dependent on the problem at hand. Additionally, implementing …

2018-09-06abs ↗pdf ↗

Proposes a transformer-based approach for anomaly detection in time series data.

problem Inadequate evaluation metrics and inability to capture temporal features in time series anomaly detection.
method Introduces a proper evaluation metric and proposes a transformer-based approach for anomaly detection in time series data.
result Transformer-based approach outperforms state-of-the-art detectors in detecting sequential anomalies.

It was shown recently that the KK L1-norm principal components (L1-PCs) of a real-valued data matrix XRD×N\mathbf X \in \mathbb R^{D \times N} (NN data samples of DD dimensions) can be exactly calculated with cost O(2NK)\mathcal{O}(2^{NK}) or, when advantageous, O(NdKK+1)\mathcal{O}(N^{dK - K + 1}) where $d=\mathrm{rank}(\mathbf …

2016-10-06abs ↗pdf ↗

The paper investigates how reducing memory supply voltage improves DNN accuracy under bit-cell faults.

problem Reducing energy consumption in deep neural networks by lowering memory supply voltage introduces bit-cell faults.
method The authors explore the robustness of DNN architectures to bit-cell faults and propose a regularizer to mitigate their effects.
result Operating the system in a faulty regime can save energy without significantly reducing accuracy.

We develop parallel and distributed Frank-Wolfe algorithms; the former on shared memory machines with mini-batching, and the latter in a delayed update framework. Whenever possible, we perform computations asynchronously, which helps attain speedups on multicore machines as well as in distributed environments. Moreover…

2014-09-22abs ↗pdf ↗

Develops a data-driven fault diagnosis framework for time-series data.

problem Fault diagnosis of dynamic systems using imbalanced and unknown fault classes.
method Kullback-Leibler divergence, data-driven fault classification, open-set classification.
result Framework handles imbalanced datasets, class overlapping, and unknown faults.

Quantum computing improves fault diagnosis in industrial processes.

problem Fault detection and diagnosis in industrial process systems.
method Integrates quantum computing and deep learning to extract features and diagnose faults.
result Quantum-assisted deep learning achieves high fault detection rates (79.2% and 99.39%).

The paper discusses safety assessment for AI systems, focusing on machine learning models.

problem Safety assessment of AI systems, especially machine learning models, in safety-related applications.
method Analyzed AI models as statistical models and proposed a new budget allocation for AI safety.
result Safety assessment of AI systems requires a new approach focusing on the model used, not just the system.

Training data-driven approaches for complex industrial system health monitoring is challenging. When data on faulty conditions are rare or not available, the training has to be performed in a unsupervised manner. In addition, when the observation period, used for training, is kept short, to be able to monitor the syste…

2019-07-15abs ↗pdf ↗

Poor economies not only produce less; they typically produce things that involve fewer inputs and fewer intermediate steps. Yet the supply chains of poor countries face more frequent disruptions---delivery failures, faulty parts, delays, power outages, theft, government failures---that systematically thwart the product…

2017-07-19abs ↗pdf ↗

Paper addresses Byzantine attacks in decentralized optimization over networks.

problem Byzantine attacks in decentralized stochastic optimization over static and time-varying networks.
method Formulate a TV norm-penalized approximation of the problem, solve using stochastic subgradient method.
result Proposed method reaches a neighborhood of the Byzantine-free optimal solution.

Study explores factors influencing saving behavior among Dhaka employees.

problem Factors influencing saving behavior among Dhaka employees.
method Quantitative approach with cross-sectional survey design, structured questionnaire, descriptive statistics, reliability analysis, regression analysis.
result Only financial management practices had a significant positive relationship with saving behavior.

Societies often rely on human experts to take a wide variety of decisions affecting their members, from jail-or-release decisions taken by judges and stop-and-frisk decisions taken by police officers to accept-or-reject decisions taken by academics. In this context, each decision is taken by an expert who is typically …

2018-05-25abs ↗pdf ↗

Predictive Q-learning algorithm for IoT networks with human operators.

problem Resilient and predictive actions for IoT networks with faulty components.
method Predictive and resilient Q-learning algorithm considering historical data and human operator feedback.
result Optimal scheduling policies avoiding attacked locations and faults.

Proposes KIL-AdaVAE for fault detection and segmentation of unknown fault types.

problem Lack of labeled data for fault types in safety-critical systems.
method Implicit supervision with Deep Variational Autoencoders (VAE).
result Significant performance improvements in fault detection and segmentation.