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

2515027531,004 · Jun 202019922001200920172026
48 results for fault-tolerant neural networks

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.

Deep Learning Accelerators are prone to faults which manifest in the form of errors in Neural Networks. Fault Tolerance in Neural Networks is crucial in real-time safety critical applications requiring computation for long durations. Neural Networks with high regularisation exhibit superior fault tolerance, however, at…

2019-07-06abs ↗pdf ↗

Finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in fault-tolerant devices represents a significant challenge. In this paper we introduce several decoding algorithms complemented by deep neural decoders and apply them to analyze several fault-tolerant error correctio…

2018-02-18abs ↗pdf ↗

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.

We introduce a differential geometric framework for describing families of quantum error-correcting codes and for understanding quantum fault tolerance. This work unifies the notion of topological fault tolerance with fault tolerance in other kinds of quantum error-correcting codes. In particular, we use fibre bundles …

2013-09-26abs ↗pdf ↗

Paper models entropy-based impact of soft errors on neural network inference.

problem Estimating impact of radiation-induced faults on neural network inference.
method Entropy-based statistical models for SEU and MBU across layers.
result Accurate models to evaluate error-resiliency of neural network topologies.

We analyze the adversarial examples problem in terms of a model's fault tolerance with respect to its input. Whereas previous work focuses on arbitrarily strict threat models, i.e., εε-perturbations, we consider arbitrary valid inputs and propose an information-based characteristic for evaluating tolerance to diverse …

2018-11-30abs ↗pdf ↗

Quantum models are rephrased as kernel methods, improving performance.

problem Improving quantum machine learning models by encoding data into quantum states.
method Rephrasing quantum models as kernel methods and using support vector machines.
result Kernel-based training finds better quantum models than variational circuit training.

Noise-driven neural networks emerge modular structures, improving robustness and generalization.

problem Artificial neural networks struggle with modular solutions, leading to poor generalization and robustness.
method Inspired by brain's modular architecture, the study uses neural noise and nonlinear responses to drive the emergence of modular solutions.
result Noise-driven modularisation improves robustness and generalization in neural networks.

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.

In this paper, we present a framework to control a self-driving car by fusing raw information from RGB images and depth maps. A deep neural network architecture is used for mapping the vision and depth information, respectively, to steering commands. This fusion of information from two sensor sources allows to provide …

2019-02-12abs ↗pdf ↗

GKP codes connect quantum gates to algebraic curves, enabling fault-tolerant quantum computation.

problem Implementing fault-tolerant quantum computation in quantum harmonic oscillator systems.
method Exploring the topological and algebraic structure of GKP codes, showing how gates correspond to symplectic automorphisms and mapping class groups of surfaces.
result GKP Clifford gates are identified with symplectic automorphisms of GKP lattices and mapping class groups of surfaces, providing a topological interpretation of fault tolerance.

Machine learning (ML) training algorithms often possess an inherent self-correcting behavior due to their iterative-convergent nature. Recent systems exploit this property to achieve adaptability and efficiency in unreliable computing environments by relaxing the consistency of execution and allowing calculation errors…

2018-10-17abs ↗pdf ↗

Federated learning poses new statistical and systems challenges in training machine learning models over distributed networks of devices. In this work, we show that multi-task learning is naturally suited to handle the statistical challenges of this setting, and propose a novel systems-aware optimization method, MOCHA,…

2017-05-30abs ↗pdf ↗

New fault-tolerant quantum gates for homological LDPC codes with constant or almost-constant rate.

problem Fault-tolerant quantum computing for homological LDPC codes with constant or almost-constant encoding rate.
method Derive generic formula for transversal and logical gates acting on 3-manifolds, using higher symmetries and cup product cohomology.
result Parallelizable logical gates for homological LDPC codes with constant or almost-constant rate.

Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.

problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.

Training machine learning (ML) models on large datasets requires considerable computing power. To speed up training, it is typical to distribute training across several machines, often with specialized hardware like GPUs or TPUs. Managing a distributed training job is complex and requires dealing with resource contenti…

2019-03-24abs ↗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.

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 ↗

Develops an analytic theory for quantum imaginary time evolution.

problem Lack of a first-principle understanding of quantum imaginary time evolution.
method Interprets QITE as a form of VQA trained with QNGD and connects it to the geometric geodesic distance in the quantum Fisher information metric.
result QITE converges faster than vanilla gradient descent-based VQAs, though the advantage is suppressed by Hilbert space dimensionality.

In predictive maintenance, model performance is usually assessed by means of precision, recall, and F1-score. However, employing the model with best performance, e.g. highest F1-score, does not necessarily result in minimum maintenance cost, but can instead lead to additional expenses. Thus, we propose to perform model…

2018-09-28abs ↗pdf ↗

Improves VQAs by balancing classical and quantum training resources.

problem Challenges in trainability and resource costs of VQAs on quantum hardware.
method Adopting HELIA Ansatz and combining classical and quantum methods for gradient estimation and training.
result Achieves higher accuracy and success rates in VQE and improved test accuracy in quantum phase classification.

The next generation of AI applications will continuously interact with the environment and learn from these interactions. These applications impose new and demanding systems requirements, both in terms of performance and flexibility. In this paper, we consider these requirements and present Ray---a distributed system t…

2017-12-16abs ↗pdf ↗

New algorithm improves decentralized learning in the presence of Byzantine faults.

problem Byzantine faults in decentralized learning on arbitrary graphs.
method Proposes ClippedGossip for Byzantine-robust consensus and optimization.
result First to provably converge to a specified neighborhood of the stationary point for non-convex objectives.

Topological theory for qLDPC codes enables non-Clifford gates and magic state injection.

problem Fault-tolerant quantum computation in qLDPC codes with non-Clifford gates and magic state resources.
method Developed a topological theory using simplicial or CW complex structures and deformation retraction.
result Achieved non-Clifford gates and magic state injection in qLDPC codes with constant rate and polynomial distance.

Many machine learning models, such as logistic regression~(LR) and support vector machine~(SVM), can be formulated as composite optimization problems. Recently, many distributed stochastic optimization~(DSO) methods have been proposed to solve the large-scale composite optimization problems, which have shown better per…

2016-01-30abs ↗pdf ↗

Mango automates hyperparameter tuning for large-scale ML training.

problem Manual hyperparameter tuning is tedious and inefficient for large-scale machine learning.
method Parallel hyperparameter tuning with intelligent search strategies and flexible abstractions.
result Mango achieves comparable performance to Hyperopt while supporting distributed computing.