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

117235352469 · Jun 202019922001200920172026
48 results for Increasing failure rate

Study extreme-case Value-at-Risk under IFR distributions, providing guidance for risk management.

problem Understanding extreme-case risk measures under distributional ambiguity and increasing failure rate.
method Characterized extreme-case range Value-at-Risk under mean and variance constraints with increasing failure rate.
result Characterized specific characteristics of extreme-case distributions under IFR constraints.

Study predicts P2P lending platform failures using machine learning.

problem Predicting failures of P2P lending platforms in China.
method Used machine learning models with filter and wrapper methods, forward selection, and backward elimination.
result Identified robust variables for predicting platform failures with high AUC and F1 scores.

CalNF models rare failures with limited data, improving safety in autonomous systems.

problem Challenges in modeling and debugging rare safety-critical failures due to limited data.
method CalNF, a self-regularized framework for posterior learning from limited data.
result Achieves state-of-the-art performance on data-limited failure modeling and inverse problems.

Study increasing profits in a flexible financial market model.

problem Characterize increasing profits in a 1D diffusion market with interest rates.
method Characterize increasing profits using an auxiliary deterministic signed measure and a canonical trading strategy.
result Existence and characterization of increasing profits in terms of νν and θθ.

BAMS uses Bayesian sampling to discover AV failures more efficiently and accurately.

problem Discovering potential failure cases in autonomous vehicles efficiently and accurately.
method Bayesian adaptive multifidelity sampling (BAMS) prioritizes exploration of low performance regions.
result BAMS discovers 10 times more issues than traditional methods with narrower rate estimates.

The paper calculates the likelihood of a financial market failure involving multiple major banks.

problem Estimating the probability of a market failure involving multiple globally important banks.
method Multivariate Cox process across G-SIBs, deriving various theorems on market failure probabilities.
result The probability of a market failure increases with the number of G-SIBs and is inevitable if there are too many.

BAxUS optimizes high-dimensional functions adaptively, avoiding performance degradation and failure.

problem State-of-the-art HDBO methods degrade or fail with increasing dimensions.
method BAxUS uses nested random subspaces to adaptively optimize high-dimensional functions.
result BAxUS outperforms state-of-the-art methods across various applications.

New approach uses dynamic programming to efficiently discover failures in autonomous vehicle simulations.

problem Efficiently discovering rare failure events in autonomous vehicle simulations.
method Approximate dynamic programming and scene decomposition to estimate failure distribution.
result Increased number of failures discovered compared to baseline approaches.

When will a server fail catastrophically in an industrial datacenter? Is it possible to forecast these failures so preventive actions can be taken to increase the reliability of a datacenter? To answer these questions, we have studied what are probably the largest, publicly available datacenter traces, containing more …

2017-08-14abs ↗pdf ↗

Method uses Seq2Seq learning to automatically generate recovery commands for ICT systems.

problem Manual decision-making for recovery commands is time-consuming and error-prone.
method Seq2Seq neural network model trained on past logs and commands.
result The model can estimate accurate recovery commands from new failures.

This paper proposes a cascading failure mitigation strategy based on Reinforcement Learning (RL) method. Firstly, the principles of RL are introduced. Then, the Multi-Stage Cascading Failure (MSCF) problem is presented and its challenges are investigated. The problem is then tackled by the RL based on DC-OPF (Optimal P…

2019-08-19abs ↗pdf ↗

Machine learning predicts failure in brittle materials with high accuracy.

problem Predicting failure in brittle materials under repetitive loads.
method Phase-field model combined with supervised machine learning.
result Framework predicts failure with acceptable accuracy even in noisy data.

Credit networks represent a way of modeling trust between entities in a network. Nodes in the network print their own currency and trust each other for a certain amount of each other's currency. This allows the network to serve as a decentralized payment infrastructure---arbitrary payments can be routed through the net…

2010-07-03abs ↗pdf ↗

Develops algorithms to optimize machine replacement schedules using operational data.

problem Optimizing machine replacement intervals when the lifetime distribution is unknown.
method Formulates as a stochastic multi-armed bandit problem and proposes Hoeffding- and Bernstein-based algorithms.
result Achieves optimal or near-optimal replacement intervals with minimal regret.

There are several distinct failure modes for overoptimization of systems on the basis of metrics. This occurs when a metric which can be used to improve a system is used to an extent that further optimization is ineffective or harmful, and is sometimes termed Goodhart's Law. This class of failure is often poorly unders…

2018-03-13abs ↗pdf ↗

The dynamic network of relationships among corporations underlies cascading economic failures including the current economic crisis, and can be inferred from correlations in market value fluctuations. We analyze the time dependence of the network of correlations to reveal the changing relationships among the financial,…

2010-11-16abs ↗pdf ↗

New research shows Byzantine failures hurt generalization more than data poisoning in robust distributed learning.

problem Generalization in robust distributed learning algorithms under Byzantine failures vs. data poisoning.
method Algorithmic stability analysis of robust distributed learning algorithms.
result Byzantine failures yield strictly worse generalization rates than data poisoning.

In this paper, we propose a general framework to learn a robust large-margin binary classifier when corrupt measurements, called anomalies, caused by sensor failure might be present in the training set. The goal is to minimize the generalization error of the classifier on non-corrupted measurements while controlling th…

2015-07-16abs ↗pdf ↗

Conformal prediction fails to cover minority classes in imbalanced datasets, but a class-conditional fix improves coverage.

problem Conformal prediction fails to cover minority classes in imbalanced datasets, leading to poor performance on rare labels.
method Class-conditional conformal prediction to improve coverage of minority classes.
result Class-conditional conformal prediction restores minority coverage to target with a modest increase in prediction-set size.

An interbank market lets participants pool the risk arising from the combination of illiquid investments and random withdrawals by depositors. But it also creates the potential for one bank's failure to trigger off avalanches of further failures. We simulate a model of interbank lending to study the interplay of these …

2001-04-04abs ↗pdf ↗

New bounds on trajectory safety in training models with Langevin Dynamics.

problem Bounding the probability of a model's trajectory staying away from a designated failure region.
method Analyzes Langevin dynamics on smooth, strongly convex loss landscapes, introducing shape-free and local relaxation bounds.
result The in-set probability relaxes to the static value after a burn-in time of order d, using only the global spectral gap of the loss.

The study proposes a framework to accept OOD data based on competence scores.

problem Silent failures in Domain Generalization where models reject OOD data without proper justification.
method A learning to reject framework using proxy incompetence scores to predict trustworthiness.
result Increasing incompetence scores are predictive of reduced accuracy, but not always favorable for accuracy/rejection trade-off.

Analysis of the 2007-8 credit crisis has concentrated on issues of relaxed lending standards, and the perception of irrational behaviour by speculative investors in real estate and other assets. Asset backed securities have been extensively criticised for creating a moral hazard in loan issuance and an associated incre…

2009-04-08abs ↗pdf ↗

The problem of stock hedging is reconsidered in this paper, where a put option is chosen from a set of available put options to hedge the market risk of a stock. A formula is proposed to determine the probability that the potential loss exceeds a predetermined level of Value-at-Risk, which is used to find the optimal s…

2011-10-02abs ↗pdf ↗

LLMs struggle to generate random numbers from statistical distributions, leading to biased results in applications.

problem LLMs' inability to generate random numbers accurately from specified distributions.
method Dual-protocol design: Batch Generation and Independent Requests, benchmarking 11 models across 15 distributions.
result Sampling fidelity degrades with distributional complexity and horizon, leading to systematic biases in downstream applications.

New federated learning protocols resist Byzantine failures and offer privacy guarantees.

problem Resisting Byzantine failures in federated learning.
method Proposes robust federated learning protocols with optimal statistical rates and privacy guarantees.
result Achieves nearly optimal statistical rates and tight rate in terms of all parameters for strongly convex losses.

The study reveals fundamental limits of fraud detection in card payment networks.

problem Fraud detection in card payment networks is challenging due to structural information impairments.
method Formalized card authorization as a sequential decision problem with delayed feedback, derived minimax regret lower bound.
result Improving issuer reporting quality or reducing censorship can yield larger reductions in the regret floor than increasing model complexity.

We consider a model of contagion in financial networks recently introduced in the literature, and we characterize the effect of a few features empirically observed in real networks on the stability of the system. Notably, we consider the effect of heterogeneous degree distributions, heterogeneous balance sheet size and…

2011-09-06abs ↗pdf ↗

Complex non-linear interactions between banks and assets we model by two time-dependent Erdős Renyi network models where each node, representing bank, can invest either to a single asset (model I) or multiple assets (model II). We use dynamical network approach to evaluate the collective financial failure---systemic ri…

2014-03-22abs ↗pdf ↗