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.

169,051 papers · 148 categories

Trend · papers per month

1223 · Sep 202019922001200920182026
42 results for CURE

A Markov-chain model is developed for the purpose estimation of the cure rate of non-performing loans. The technique is performed collectively, on portfolios and it can be applicable in the process of calculation of credit impairment. It is efficient in terms of data manipulation costs which makes it accessible even to…

2018-05-30abs ↗pdf ↗

New model identifies cell-specific genes for cancer prognosis.

problem No statistical model to integrate multiscale cancer data.
method Bayesian generalized promotion time cure models (GPTCMs).
result Improves cancer prognosis by identifying cell-specific genes.

New method optimizes processes under constraints using bivariate Gaussian models.

problem Optimizing processes with constraints using traditional methods.
method Developed a constrained expected improvement acquisition function using bivariate Gaussian process models.
result Demonstrated improved performance in a manufacturing cure process optimization.

To cure the lack of predictive power of general relativity Geroch proposed to complete the theory with an additional postulate that only "hole-free" spacetimes are permitted. I argue that this postulate is too strong -- it prohibits even the Minkowski space.

2009-03-24abs ↗pdf ↗

Study identifies risk factors for subsequent suicide attempts in youth.

problem Uncertainty in suicide attempt identification from medical claims data.
method Integrative Cox cure model with regularization for survival analysis with uncertain events.
result Identifies risk factors for subsequent suicide attempts and distinguishes susceptibility from timing.

CURE extracts relations without supervision by clustering similar entity pairs.

problem Extracting relations unsupervised without considering sentence correlations.
method CURE uses Encoder-Decoder architecture for self-supervised learning and clustering similar relations.
result CURE outperforms state-of-the-art models on NYT and UNPC datasets.

Dan Lovallo and Daniel Kahneman must be commended for their clear identification of causes and cures to the planning fallacy in "Delusions of Success: How Optimism Undermines Executives' Decisions" (HBR July 2003). Their look at overoptimism, anchoring, competitor neglect, and the outside view in forecasting is highly …

2013-04-19abs ↗pdf ↗

We reconsider the multivariate Kyle model in a risk-neutral setting with a single, perfectly informed rational insider and a rational competitive market maker, setting the price of n correlated securities. We prove the unicity of a symmetric, positive definite solution for the impact matrix and provide insights on its …

2018-06-20abs ↗pdf ↗

This essay suggests that a proper assessment of the presently unfolding financial crisis, and its cure, requires going back at least to the late 1990s, accounting for the cumulative effect of the ITC, real-estate and financial derivative bubbles. We focus on the deep loss of trust, not only in Wall Street, but more imp…

2008-10-25abs ↗pdf ↗

Divide-and-conquer method speeds sparse factorization for large matrices.

problem Sparse factorization of large matrices for statistical learning.
method Statistical problem formulation, divide-and-conquer approach, stagewise learning.
result Efficient algorithm with lower complexity than existing methods.

Geometric flows help solve the swampland problem by preserving Einstein equations.

problem Addressing the swampland conjecture in string theory.
method Analyzing scalar and metric bubble solutions under Perelman's flow, deriving geometric flow equations, and introducing an additional energy-momentum tensor term.
result A supplementary energy-momentum tensor term precisely reproduces the infinite tower of states with exponentially dropping masses.

Framework creates fast, interpretable surrogates for stochastic simulators with unbounded randomness.

problem Creating accurate and fast approximations for stochastic simulators with unbounded randomness.
method Probabilistic surrogate networks that retain structure of reference simulators and enable amortized inference.
result Surrogates accurately model stochastic programs with unbounded random variables and significantly speed up inference.

Paper tackles distribution shifts in prediction models with unobserved confounding.

problem Distribution shifts in prediction models with unobserved confounding.
method Linear structural causal model, invariant covariate representations, data-driven representation learning method.
result Optimizes for a lower-dimensional linear subspace and a prediction model confined to that subspace, achieving nearly ideal gap between target and source risk.

Deep learning identifies cervical spondylosis from sEMG signals.

problem Early identification of cervical spondylosis for improved cure rate and reduced costs.
method Convolutional neural network-based multi-channel algorithm.
result Significant improvement in CS identification compared to previous methods.

Deep learning classifies keratoconus patients with high accuracy.

problem Accurately identifying keratoconus patients for early intervention.
method Unsupervised and semi-supervised machine learning models using corneal topography and clinical data.
result Unsupervised method with 29 variables shows better classification accuracy.

GGFPS improves model performance by sampling molecules more efficiently.

problem Improving model performance and reducing data costs in chemistry problems.
method Gradient-Guided Furthest Point Sampling (GGFPS) that leverages molecular force norms.
result GGFPS leads to superior data efficiency and model robustness compared to other sampling methods.

Project predicts Alzheimer's progression using neural networks and novel data processing.

problem Difficulty in early identification of Alzheimer's patients.
method Used machine learning, specifically neural networks, and a novel pre-processing technique.
result Neural network model accurately predicts AD progression with high accuracy.

We address feature interpretation and reproducibility issues in dense nets, proposing a modified loss function.

problem Feature interpretation and reproducibility issues in dense nets.
method Proposed a modified loss function to circumvent basis collapse.
result Substantially concise nets with 100x fewer parameters and lower MSE loss.

The ability to compare two degenerate probability distributions (i.e. two probability distributions supported on two distinct low-dimensional manifolds living in a much higher-dimensional space) is a crucial problem arising in the estimation of generative models for high-dimensional observations such as those arising i…

2017-06-01abs ↗pdf ↗

Paper proposes machine learning model for early Alzheimer's diagnosis.

problem Early and accurate diagnosis of Alzheimer's Disease.
method Machine learning models, demographic, biomarker, and cognitive test data.
result 90% accuracy and 87% accuracy in predicting Alzheimer's development.

Deep neural network classifies DaTscan SPECT images for Parkinson's Disease.

problem Early diagnosis of Parkinson's Disease through objective analysis of SPECT images.
method InceptionV3 architecture with custom binary classifier, 10-fold cross validation.
result Deep neural network achieves high accuracy in classifying DaTscan SPECT images.

A new model combines deep learning and Gaussian Processes with hyperdata learning.

problem Combining deep learning and Gaussian Processes for expressive and robust learning.
method Conditional Deep Gaussian Process (DGP) with hyperdata learning and approximate inference.
result Conditional DGP offers better expressiveness and robustness compared to existing methods.

Improved KAN model explains brain dynamics through edge learning and synaptic strength.

problem Explaining brain dynamics and frequencies in different brain regions.
method ELKAN (Edge Learning KNN) model with edge learning and trimming, inspired by brain science.
result ELKAN model outperforms KAN in explaining brain frequencies and dynamics.