Deep neural networks improve AFT model for non-linear predictors.
problem Nonlinearity in predictors of AFT models.
method Apply DNNs to fit AFT models using Gehan-type loss and sub-sampling.
result DeepR-AFT outperforms parametric and semiparametric models.
XGBoost implements AFT models for survival regression.
problem Survival regression for time-to-event data.
method Loss functions for AFT models in XGBoost.
result XGBoost's AFT model improves generalization and training speed.
A new boosting model handles dependent censoring in time-to-event data.
problem Independent censoring assumption leads to biased predictions in time-to-event analysis.
method Clayton-boost, a boosting approach using Clayton copula.
result Clayton-boost outperforms other methods in handling dependent censoring.
Proposes a new model for time-to-event prediction with uncertainty quantification.
problem Lack of uncertainty in time-to-event predictions using recurrent neural networks.
method Deep Kernel Accelerated Failure Time models combining RNN and sparse Gaussian Process.
result Model delivers better uncertainty estimates compared to related methods.
New method identifies subgroups in censored data.
problem Identifying meaningful patterns in heterogeneous populations.
method Combining inverse probability weighting, M-estimation, and concave pairwise fusion penalization.
result Robust approach for censored data under heterogeneous AFT models.
Evaluation and validation of complicated control systems are crucial to guarantee usability and safety. Usually, failure happens in some very rarely encountered situations, but once triggered, the consequence is disastrous. Accelerated Evaluation is a methodology that efficiently tests those rarely-occurring yet critic…
Proposes a new AFT model for nonlinear survival data.
problem Limited ability of classical AFT models to represent nonlinear relationships and handle complex covariate structures.
method Structured nonparametric extension using Kolmogorov--Arnold representations and unified censoring-adjusted losses.
result Method captures nonlinear effects and recovers linear structure when appropriate.
Economics tool predicts failure times in reliability systems.
problem Predicting optimal failure times in weighted k-out-of-n reliability systems with heterogeneous component failure.
method Using rational expectations to analyze and predict failure times in reliability systems with heterogeneous component failure.
result Different measures are optimal for predicting system failure depending on component failure distributions.
While autonomous vehicle (AV) technology has shown substantial progress, we still lack tools for rigorous and scalable testing. Real-world testing, the de-facto \textit{de-facto} de-facto evaluation method, is dangerous to the public. Moreover, due to the rare nature of failures, billions of miles of driving are needed to statisticall…
Deep unfolding accelerates MCMC-based COP solvers.
problem Optimizing combinatorial problems with MCMC and gradient descent.
method Combines MCMC and gradient descent, trains step sizes, uses variance estimation for non-differentiable MCMC.
result Significantly accelerates convergence speed for COPs.
Unified model predicts multi-mode failure with multi-sensor data.
problem Independent failure mode and RUL prediction ignores inherent relationship.
method Hierarchical Bayesian framework with Cox model, Gaussian process, and multinomial distributions.
result Robust uncertainty quantification and accurate prediction of multi-mode failure.
The paper develops deep learning models for personalized treatment rules in survival analysis.
problem Deriving optimal treatment rules for bivariate survival outcomes in randomized trials.
method Adaptive prediction-powered learning using deep neural networks and stochastic policies.
result Maximizes joint survival probability beyond fixed time points ( t 1 , t 2 ) (t_1, t_2) ( t 1 , t 2 ) . FTX's failure linked to Terra-Luna collapse and Binance's influence.
problem FTX's collapse due to misuse of native token and reliance on leverage.
method Analyzed on-chain data, studied cryptocurrency dependency structures, and examined public trades.
result FTX's downfall was accelerated by Binance's tweets and public reaction.
Paper improves DNN accelerator robustness against bit errors with energy savings.
problem Bit errors in quantized DNN weights reduce energy efficiency.
method Combines robust fixed-point quantization, weight clipping, and random bit error training.
result Significantly improves robustness against random bit errors with high energy savings.
AFTNet uses a network-constrained Weibull model for biomarker discovery.
problem Discovering biomarkers from survival data with correlated predictors.
method Survival analysis method based on Weibull AFT model, incorporating network constraints and penalized likelihood for variable selection.
result Theoretical consistency and efficient algorithm for AFTNet estimator validated on synthetic and real data.
Risk Advisor predicts and mitigates ML deployment failures.
problem Predicting and mitigating test-time failure risks of ML systems.
method Post-hoc meta-learner for estimating failure risks and uncertainties.
result Reliably predicts deployment-time failure risks across various ML models.
We aim to predict and explain service failures in supply-chain networks, more precisely among last-mile pickup and delivery services to customers. We analyze a dataset of 500,000 services using (1) supervised classification with Random Forests, and (2) Association Rules. Our classifier reaches an average sensitivity of…
Proposes a deep neural network for early disk drive failure prediction.
problem Early prediction of disk drive failure using multivariate time series sensor data.
method Enriched features derived from sensor data through transformations, combined with ensemble learning and deep neural network architecture.
result Significantly improved classification accuracy in predicting disk drive failure.
New method identifies critical states to improve RL agent explainability and speed.
problem Challenges in RL agent explainability and action selection timing.
method Identify critical states based on action-based variance in Q-function, prioritize exploitation on these states.
result Identified critical states accelerate RL in grid worlds and deep RL tasks.
A new method reduces the computational cost of Sinkhorn algorithm for OT and UOT problems.
problem High computational complexity of Sinkhorn algorithm for OT and UOT problems.
method Importance sparsification method called Spar-Sink to efficiently approximate entropy-regularized OT and UOT solutions.
result The method reduces computational cost from O ( n 2 ) O(n^2) O ( n 2 ) to O ~ ( n ) \widetilde{O}(n) O ( n ) , and is consistent under mild regularity conditions. Framework predicts remaining useful life of DSH subsystems under unknown failure modes.
problem Predicting remaining useful life of DSH subsystems with unknown failure modes.
method Unsupervised framework using mixture of Gaussian regressions and Expectation-Maximization algorithm.
result Improved prediction accuracy and interpretability of RUL.
Study constructs balanced datasets for seismic failure prediction.
problem Imbalanced datasets limit machine learning performance in seismic failure prediction.
method Framework with three steps: GMF identification, probability density estimation, and sample transformation.
result Framework improves machine learning performance in seismic failure mode prediction.
SSH-Net: A Deep Neural Network for Predicting Failure Time Distribution Functions under Competing Risks with GPU Data
problem Predicting failure time distribution functions under competing risks
method Structured Segmented Hazard Deep Neural Network (SSH-Net)
result Prediction accuracy validated through simulation studies and GPU data
DeepSIP predicts network failures' impact using CNN from syslog and traffic data.
problem Predicting service impact from network failures.
method Temporal multimodal CNN for predicting time to recovery and traffic loss.
result DeepSIP reduced prediction error by approximately 50%.
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.
A new algorithm learns from failures to optimize under constraints efficiently.
problem Optimizing under unknown constraints with limited failure tolerance.
method Excursion search controls risk as a function of a failure budget.
result The algorithm achieves lower regret and uses failures budget more efficiently.
Given key performance indicators collected with fine granularity as time series, our aim is to predict and explain failures in storage environments. Although explainable predictive modeling based on spiky telemetry data is key in many domains, current approaches cannot tackle this problem. Deep learning methods suitabl…
Enhances PHM solutions by augmenting scarce multivariate time series data.
problem Data scarcity in failure prognostics.
method Extends autoregressive models for data augmentation.
result Significantly improves PHM solution performance.
Accelerated gradient methods play a central role in optimization, achieving optimal rates in many settings. While many generalizations and extensions of Nesterov's original acceleration method have been proposed, it is not yet clear what is the natural scope of the acceleration concept. In this paper, we study accelera…
Bayesian DOE accelerates experimental design with improved efficiency.
problem Enhancing experimental design efficiency and reliability.
method Bayesian framework, conditional density estimation, informative data selection.
result Significantly improved computational efficiency of experimental design.
Robust algorithm for distributed optimization resistant to Byzantine failures.
problem Resilient optimization in the presence of unreliable agents.
method Temporal and spatial robust aggregation, gradient normalization.
result Convergence for strongly convex and non-convex functions.
Enhances patient failure prediction using dynamic survival models.
problem Lack of precise individual level prediction in conventional models.
method Developed counterfactual dynamic survival model (CDSM).
result Inflection point of estimated survival curves predicts patient failure time.
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.
HF-opt uses Hamiltonian dynamics to optimize functions, achieving accelerated rates with randomized integration time.
problem Optimizing functions efficiently and accelerating convergence rates.
method Randomized Hamiltonian flow (RHF) with accelerated convergence rates.
result RHGD achieves accelerated convergence rates similar to Nesterov's AGD.
Study uses satellite data to predict tailings dam collapse risk.
problem Detecting early signs of tailings dam instability.
method Spectral analysis of satellite InSAR displacement time series data.
result Algorithm detects risk milestones up to 5 months before dam collapse.
System predicts respiratory failure up to 8 hours early.
problem Early detection of respiratory failure in ICU patients.
method Machine learning on ICU patient monitoring data.
result System outperforms traditional clinical decision-making.
In survival analysis, estimating the failure time distribution is an important and difficult task, since usually the data is subject to censoring. Specifically, in this paper we consider current status data, a type of data where all of the observations are censored. The format of the data is such that the failure time …
Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.
problem Accelerating convex optimization
method Hamiltonian dynamics
result Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.
Determining possible failure scenarios is a critical step in the evaluation of autonomous vehicle systems. Real-world vehicle testing is commonly employed for autonomous vehicle validation, but the costs and time requirements are high. Consequently, simulation-driven methods such as Adaptive Stress Testing (AST) have b…
Accelerators with power-law memory are proposed in the framework of the discrete time approach. To describe discrete accelerators we use the capital stock adjustment principle, which has been suggested by Matthews.The suggested discrete accelerators with memory describe the economic processes with the power-law memory …
GE finds failures in autonomous systems without domain heuristics.
problem Finding failures in autonomous systems without domain-specific heuristics.
method Adaptive stress testing using go-explore (GE) algorithm.
result GE finds failures in scenarios other RL techniques cannot solve.
Study identifies failure modes of machine learning models in out-of-distribution settings.
problem Machine learning models fail to generalize well to new, unseen data.
method Theoretical study of gradient-descent-trained linear classifiers on easy-to-learn tasks, followed by experiments on modern neural networks.
result Two failure modes of spurious correlations are uncovered: geometric and statistical.
An accurate model of a patient's individual survival distribution can help determine the appropriate treatment for terminal patients. Unfortunately, risk scores (e.g., from Cox Proportional Hazard models) do not provide survival probabilities, single-time probability models (e.g., the Gail model, predicting 5 year prob…
Accelerates sampling from Gibbs distributions using ARWP method.
problem Sampling from Gibbs distributions efficiently.
method ARWP method, combining Nesterov acceleration and regularized Wasserstein proximal.
result ARWP exhibits higher contraction rate and faster tail exploration.
Already before systems malfunction one has to know if hardware components will fail in near future in order to counteract in time. Thus, unplanned downtime is ought to be avoided. In medical imaging, maximizing the system's uptime is crucial for patients' health and healthcare provider's daily business. We aim to predi…
Proposes a federated learning approach for RUL prediction from nonparametric degradation and failure signals.
problem Cost-effective RUL prediction from limited, non-shared CM signals with unknown parametric forms.
method Joint modeling of nonlinear degradation signals and failure events using federated learning.
result Superior RUL prediction compared to alternatives, validated through simulations and real data.
Interpretable survival analysis improves heart failure risk prediction.
problem Improving heart failure risk prediction using survival analysis.
method Survival stacking, ControlBurn, Explainable Boosting Machines.
result Achieves state-of-the-art performance and provides novel insights.
New method finds failures in high-fidelity simulators with fewer steps.
problem Finding failures in high-fidelity simulators is expensive and impractical.
method Adaptive stress testing with backward algorithm adaptation from low-fidelity to high-fidelity.
result Significantly fewer high-fidelity simulation steps needed to find failures.