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

Trend · papers per month

13274053 · Oct 202519922001200920172026
48 results for bridge deterioration

Federated CTMC model estimates bridge deterioration hazards without sharing raw data.

problem Bridge inspection data privacy and cross-organizational data sharing constraints.
method Federated CTMC hazard model with local optimization and FedAvg aggregation.
result Federated model converges on global benchmark parameters without data transfer.

Novel framework identifies pump-specific deterioration rates using Bayesian hierarchical hazard modeling and causal discovery.

problem Challenges in asset management due to heterogeneous deterioration rates in pump equipment.
method Bayesian hierarchical hazard modeling with causal discovery, GPU-accelerated No-U-Turn Sampling (NUTS), and DirectLiNGAM.
result Identified striking heterogeneity in deterioration rates, with negative effects 400 times larger than positive effects.

Proposes a framework to explain KS deterioration in credit risk models.

problem Inconsistent and ad hoc diagnosis of KS decline in credit risk models.
method Counterfactual diagnostic framework attributing KS decline to sampling variability, portfolio composition, covariate shift, and residual deterioration.
result The proposed approach provides more interpretable and governance-relevant explanations than threshold-based review alone.

Proposes efficient algorithm for system-level I&M decisions under uncertainty.

problem Optimal management strategies for deteriorating civil engineering systems.
method Factored partially observable Markov decision process with Bayesian networks and DDMAC reinforcement learning.
result DDMAC policies offer substantial benefits over heuristic approaches in system-level cost optimization.

Accelerated gradient method's stability deteriorates exponentially with steps.

problem Algorithmic stability of Nesterov's accelerated gradient method.
method Analysis of two notions of algorithmic stability for Nesterov's accelerated gradient method.
result Stability of Nesterov's accelerated method deteriorates exponentially with the number of gradient steps.

Graph structured data provide two-fold information: graph structures and node attributes. Numerous graph-based algorithms rely on both information to achieve success in supervised tasks, such as node classification and link prediction. However, node attributes could be missing or incomplete, which significantly deterio…

2019-07-23abs ↗pdf ↗

The Lasso is a computationally efficient regression regularization procedure that can produce sparse estimators when the number of predictors (p) is large. Oracle inequalities provide probability loss bounds for the Lasso estimator at a deterministic choice of the regularization parameter. These bounds tend to zero if …

2014-03-18abs ↗pdf ↗

Self-consistency improves the accuracy of model comparison methods.

problem Improving the accuracy of model comparison methods when simulation models are misspecified.
method Supplement traditional simulation-based training with a self-consistency loss on unlabeled real data.
result Self-consistency training improves model comparison accuracy, especially in open-world scenarios.

Machine learning improves early detection of patient deterioration in Brazilian hospitals.

problem Challenges in recognizing clinical deterioration in hospital settings.
method Application of machine learning to analyze EHR data from multiple hospitals.
result Machine learning models outperformed traditional protocols by 25 percentage points in AUC.

The paper develops a method to predict the latent deterioration phase in limit order books before stress is observed.

problem Limit order books can transition rapidly from stable to stressed conditions, making it difficult to detect the latent deterioration phase.
method The paper formalizes a three-regime causal data-generating process and proposes a trigger-based detector combining MAX aggregation of complementary signal channels, a rising-edge condition, and adaptive thresholding.
result The proposed method achieves mean lead-time of +18.6 timesteps with perfect precision and moderate coverage, outperforming classical change-point and microstructure baselines.

Study quantifies firm risks from nature decline, showing significant equity losses.

problem Estimating the financial impact of nature deterioration on companies.
method Developed metrics (Country Degradation Index, Nature Risk Score) and assessed five environmental hazards.
result Global equities lose 26.8% in a nature decline scenario, with worst firms losing 75%.

Study on neural networks' performance in sequential task learning.

problem Understanding the performance of neural networks in sequential task learning.
method Theoretical analysis of generalization performance in continual learning using statistical mechanical analysis of kernel ridge-less regression.
result Characteristic transitions from positive to negative transfer observed in neural networks.

The paper provides examples of keen weakly reducible bridge spheres for links in b-bridge position.

problem Characterizing and finding examples of keen weakly reducible bridge spheres.
method Analyzing bridge spheres and their properties in terms of compressing disks and width complex.
result Infinitely many examples of keen weakly reducible bridge spheres for links in b-bridge position.

We establish linear regret bounds for convex smooth losses using Fenchel-Young losses.

problem Establishing linear regret bounds for convex smooth losses.
method Constructing a convex smooth surrogate loss using Fenchel-Young losses generated by the convolutional negentropy.
result We derive a smooth loss with a linear surrogate regret bound.

DeepDPM clusters images without knowing the number of clusters.

problem Clustering images with an unknown number of clusters.
method Deep learning with a split/merge framework, dynamic architecture, and a novel loss function.
result DeepDPM outperforms existing methods in clustering images without knowing the number of clusters.

Suppose a knot in a 33-manifold is in nn-bridge position. We consider a reduction of the knot along a bridge disk DD and show that the result is an (n1)(n-1)-bridge position if and only if there is a bridge disk EE such that (D,E)(D, E) is a cancelling pair. We apply this to an unknot KK, in nn-bridge position with re…

2016-06-23abs ↗pdf ↗

Deep neural networks tackle high-dimensional nonparametric interaction models.

problem Estimating structured regression functions in high-dimensional data.
method Analyze kthk^{th} order nonparametric interaction models in growing and high dimensions, introducing debiasing techniques.
result Debiased deep neural networks achieve optimal rates of convergence in both growing and high dimensions.

We show that if KK is a knot in S3S^3 and ΣΣ is a bridge sphere for KK with high distance and 2n2n punctures, the number of perturbations of KK required to interchange the two balls bounded by ΣΣ via an isotopy is nn. We also construct a knot with two different bridge spheres with 2n2n and 2n12n-1 bridges respecti…

2009-08-25abs ↗pdf ↗

Paper explores link and plat presentations, showing equivalence under bridge isotopy.

problem Relationship between links in bridge position and plat presentations.
method Established equivalence between Hilden double coset classes of plat presentations and bridge positions up to isotopy.
result Revealed equivalence of Hilden double coset classes for n-bridge unknot and torus knots in plat position.

For any given number of crossings cc, there exists a formula to determine the number of 2-bridge knots of cc crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of whether a given (prime) knot is a 2-bridge knot remains a nontrivial exercise, and …

2004-09-20abs ↗pdf ↗

The purpose of this note is to announce complete answers to the following questions. (1) For an essential simple loop on a 2-bridge sphere in a 2-bridge link complement, when is it null-homotopic in the link complement? (2) For two distinct essential simple loops on a 2-bridge sphere in a 2-bridge link complement, when…

2011-04-18abs ↗pdf ↗