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

Trend · papers per month

4285127169 · Jun 202019922001200920172026
48 results for VA detection

Personalized deep learning reduces inappropriate shocks in VA detection.

problem High inappropriate shock rate in traditional VA detection methods.
method Personalized deep learning framework using CNN for real-time VA detection and collaborative inference.
result 6.6% reduction in inappropriate shock rate compared to traditional methods.

Diagrammatic reducibility DR and its generalization vertex asphericity VA are combinatorial tools developed for detecting asphericity of a 2-complex. Here we present tests for a relative version of VA that apply to pairs of 2-complexes (L,K)(L,K), where KK is a subcomplex of LL. We show that a relative weight test holds…

2019-12-28abs ↗pdf ↗

VA-LUCB identifies best arm with variance constraint, achieving optimal sample complexity.

problem Identifying the best arm with variance constraint under fixed confidence.
method Parameter-free algorithm VA-LUCB, analyzing sample complexity and proving lower bounds.
result Optimal sample complexity up to a logarithmic factor in HVAH_{VA}, demonstrated by experiments.

Variable annuities (VA) are popular insurance products. VAs provides the insured with a guaranteed accumulation rate on their premium at maturity. In addition, the insured may receive extra benefit if returns of underlying funds are high enough. Here we consider a special case of VA with high-water mark feature and Gua…

2011-08-22abs ↗pdf ↗

Study predicts lens performance using neural networks.

problem Predicting visual acuity from lens designs.
method Used a CNN to classify Landolt Cs and validate its ability to predict VA from induced defocus.
result Validation showed consistent offset of +0.20 logMAR from simulated VA, comparable to clinical repeatability.

This paper stems from the observation (arising from work of T. Delzant) that "most" Kähler groups virtually algebraically fiber, i.e. admit a finite index subgroup that maps onto Z\Bbb{Z} with finitely generated kernel. For the remaining ones, the Albanese dimension of all finite index subgroups is at most one, i.e. t…

2017-04-24abs ↗pdf ↗

Investigates optimal withdrawal strategies in VA contracts with tax and ratchet mechanisms.

problem Optimizing withdrawal strategies and behavior of policyholders in VA contracts with tax and ratchet mechanisms.
method Solving a backward dynamic programming problem to optimize cash flows from VA contracts, considering hybrid products and taxation effects.
result Tax-shielding effect of the cash fund enhances contract attractiveness, ratchet mechanism discourages early surrender, and cash fund discourages active withdrawals.

LDP speeds up causal discovery by partitioning, improving VAS recall and runtime.

problem Hard causal discovery in nonparametric settings with exponential complexity.
method Local Discovery by Partitioning (LDP) for causal inference around exposure-outcome pairs.
result LDP yields less biased and more precise estimates than baseline methods.

Automated extraction of concepts from patient clinical records is an essential facilitator of clinical research. For this reason, the 2010 i2b2/VA Natural Language Processing Challenges for Clinical Records introduced a concept extraction task aimed at identifying and classifying concepts into predefined categories (i.…

2016-11-25abs ↗pdf ↗

Paper develops a method for valid inference using language model predictions from verbal autopsy narratives.

problem Valid inference from verbal autopsy narratives for public health decision-making.
method Develops multiPPI++ method for valid inference using NLP techniques for COD prediction.
result Demonstrates the effectiveness of multiPPI++ in handling transportability issues and recovering ground truth estimates.

VA-OPE improves OPE by incorporating variance information, achieving tighter error bounds.

problem Estimating value function of a target policy from offline data collected by a behavior policy.
method Proposes VA-OPE, an algorithm that reweights Bellman residual using estimated variance of the value function.
result Achieves a tighter error bound than the best-known result.

Paper assesses GMMB in VAs using FST for accurate net liability calculations.

problem Risk management of GMMB under stochastic mortality and regime-switching.
method Net liability model with FST algorithm for accurate numeric solutions.
result FST algorithm provides reliable results for net liability of GMMB.

In the aftermath of the 2007 global financial crisis, banks started reflecting into derivative pricing the cost of capital and collateral funding through XVA metrics. Here XVA is a catch-all acronym whereby X is replaced by a letter such as C for credit, D for debt, F for funding, K for capital and so on, and VA stands…

2016-03-09abs ↗pdf ↗

In a market with stochastic volatility and jumps, we consider a VIX-linked fee structure for variable annuity contracts with guaranteed minimum withdrawal benefits (GMWB). Our goal is to assess the effectiveness of the VIX-linked fee structure in decreasing the sensitivity of the insurer's liability to volatility risk.…

2017-08-23abs ↗pdf ↗

Let GG be a finitely generated group that can be written as an extension \[ 1 \longrightarrow K \stackrel{i}{\longrightarrow} G \stackrel{f}{\longrightarrow} Γ\longrightarrow 1 \] where KK is a finitely generated group. By a study of the BNS invariants we prove that if b1(G)>b1(Γ)>0b_1(G) > b_1(Γ) > 0, then GG algebraically fi…

2019-12-22abs ↗pdf ↗

We prove that the homotopy class of a Morin mapping f: P^p --> Q^q with p-q odd contains a cusp mapping. This affirmatively solves a strengthened version of the Chess conjecture [DS Chess, A note on the classes [S_1^k(f)], Proc. Symp. Pure Math., 40 (1983) 221-224] and [VI Arnol'd, VA Vasil'ev, VV Goryunov, OV Lyashenk…

2003-01-31abs ↗pdf ↗

As part of the new regulatory framework of Solvency II, introduced by the European Union, insurance companies are required to monitor their solvency by computing a key risk metric called the Solvency Capital Requirement (SCR). The official description of the SCR is not rigorous and has lead researchers to develop their…

2016-10-06abs ↗pdf ↗

We study the space of L^2 harmonic forms on complete manifolds with metrics of fibred boundary or fibred cusp type. These metrics generalize the geometric structures at infinity of several different well-known classes of metrics, including asymptotically locally Euclidean manifolds, the (known types of) gravitational i…

2002-07-19abs ↗pdf ↗

This paper analyzes a novel type of mortality contingent-claim called a ruin-contingent life annuity (RCLA). This product fuses together a path-dependent equity put option with a "personal longevity" call option. The annuitant's (i.e. long position) payoff from a generic RCLA is \$1 of income per year for life, akin to…

2012-05-16abs ↗pdf ↗

Developing reliable workload predictive models can affect many aspects of clinical decision making procedure. The primary challenge in healthcare systems is handling the demand uncertainty over the time. This issue becomes more critical for the healthcare facilities that provide service for chronic disease treatment be…

2018-12-27abs ↗pdf ↗

This work studies the class of algorithms for learning with side-information that emerge by extending generative models with embedded context-related variables. Using finite mixture models (FMM) as the prototypical Bayesian network, we show that maximum-likelihood estimation (MLE) of parameters through expectation-maxi…

2015-07-29abs ↗pdf ↗

FGTSVA improves Thompson Sampling for contextual bandits with optimal variance-aware regret.

problem Optimizing regret bounds for Thompson Sampling in contextual bandits.
method Developed FGTSVA, a variance-aware Thompson Sampling algorithm for contextual bandits with a new decoupling coefficient.
result Achieved optimal regret bound of ildeO(dclogFt=1Tσt2+dc) ilde{O}(\sqrt{\mathrm{dc}\cdot\log|\mathcal{F}|\sum_{t=1}^Tσ_t^2}+\mathrm{dc}).

A new Mapper algorithm optimizes data visualization through automatic parameter tuning.

problem Manual parameter tuning and fixed intervals limit the performance of the standard Mapper algorithm.
method Introduces a soft Mapper framework based on Gaussian mixture models for automatic interval construction and optimization via stochastic gradient descent.
result Demonstrates effectiveness in capturing underlying topological structures and identifying distinct subgroups.

Diffusion-VAE tackles multi-step stock price prediction with stochastic noise.

problem Challenges in multi-step stock price prediction due to stochasticity and target price sequence.
method Combines hierarchical VAE and diffusion probabilistic techniques for seq2seq stock prediction.
result D-Va model outperforms state-of-the-art solutions in prediction accuracy and variance.

Graph energy helps detect communities in networks better than traditional methods.

problem Detecting communities in sparse networks where traditional methods fail.
method Using graph energy based on the full spectrum of adjacency matrices.
result The difference in graph energy between a planted partition model and an Erdős--Rényi network has a distinct transition at the detectability threshold.

Develops a method to detect changes in linear systems with temporal correlations.

problem Detect abrupt changes in time series data with temporal correlations.
method Data-dependent threshold for online change point detection in linear dynamical systems.
result Achieves a pre-specified upper bound on the probability of false alarms and provides a finite-sample-based bound for detection probability.

Tackles the computational hardness of HPC detection, conjecturing equivalence to PC detection.

problem Computational hardness of hypergraphic planted clique detection.
method No specific method mentioned; focuses on conjecturing equivalence.
result Equivalence of computational hardness between HPC and PC detection.