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 · Aug 202019922001200920182026
48 results for Deduction

The paper deals with bonus-malus systems with different claim types and varying deductibles. The premium relativities are softened for the policyholders who are in the malus zone and these policyholders are subject to per claim deductibles depending on their levels in the bonus-malus scale and the types of the reported…

2017-07-04abs ↗pdf ↗

Model analyzes debt recycling strategies under various fiscal regimes and jurisdictions.

problem Understanding debt recycling dynamics and their impact on repayment times and equity growth.
method Developed a calibrated model incorporating mortgage interest rates, borrowing costs, and tax shields.
result Introducing positive interest rates without tax shields contracts success regions and lengthens repayment times, but tax shields partially reverse these effects.

Neural model uses deductive database to predict events from past patterns.

problem Difficulty in predicting future events from past patterns when event types are large.
method Temporal deductive database with rules to prove facts from other facts and past events. Neural nets model fact states and probabilities.
result Neural models derived from concise Datalog programs improve prediction by encoding domain knowledge.

The paper explores optimal insurance contracts using various deviation measures.

problem Optimal insurance contracts with mean-deviation measures.
method Study of convex signed Choquet integrals and standard deviation as deviation measures, analyzing premium principles like expected value, Value-at-Risk, and Expected Shortfall.
result Characterization of optimal indemnities and deductibles under different premium principles.

The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial proof of Sperner's Lemma can be considered as a cochain-level version, written in…

2009-06-29abs ↗pdf ↗

Graph neural networks can perform approximate reasoning in latent space for mathematical statements.

problem Can neural networks perform steps of approximate reasoning in a fixed dimensional latent space?
method Design and conduct an experiment using graph neural networks to predict rewrite-success of mathematical statements in a latent space.
result Graph neural networks can make non-trivial predictions about rewrite-success of statements in latent space.

APL learns from surprising observations to quickly generalize from few examples.

problem Quickly generalize from limited data for intelligent systems.
method Approximates probability distributions by remembering surprising observations in an external memory module.
result APL performs as well as state-of-the-art baselines on few-shot classification benchmarks.

Withdrawal guarantees ensure the periodical deduction of a constant dollar-amount from a fund investment for a fixed number of periods. If the fund depletes before the last withdrawal, the guarantor has to finance the outstanding withdrawals. We derive a robust hedging strategy which leads to closed form solutions for …

2012-02-01abs ↗pdf ↗

HyperST-Net uses hypernetworks to improve spatio-temporal forecasting.

problem Forecasting spatio-temporal data is challenging due to complex spatial and temporal factors.
method Proposes a framework based on hypernetworks with three modules: spatial, temporal, and deduction.
result Models achieve significant improvements over state-of-the-art baselines.

A framework for clustering evolving high-dimensional data using LSTM networks.

problem Clustering evolving high-dimensional data with temporal evolution patterns.
method LSTM-ESCM framework exploiting self-expressive trait and LSTM networks.
result The proposed algorithm outperforms other methods in terms of run time and accuracy.

Study parameter sensitivities in bond pricing models with jumps.

problem Analyzing the impact of parameters on bond pricing models with jumps.
method Theoretical analysis and MATLAB simulations of a Brownian motion and compound Poisson process.
result Explicit call price formula and verification of sensitivities.

Biharmonic curves are a generalization of geodesics, with applications in elasticity theory and various branches of computer science. The paper proposes a first study of biharmonic curves in spaces with Finslerian geometry, covering the following topics: a deduction of their equations, existence of non-geodesic biharmo…

2013-04-19abs ↗pdf ↗

Combines neural networks and expert rules for concept-based learning.

problem Extending concept-based learning with machine learning models.
method Form constraints for joint probability distribution and represent feasible set as a convex polytope.
result Neural networks can be trained to satisfy expert rules without violating them.

The astonishing success of AlphaGo Zero\cite{Silver_AlphaGo} invokes a worldwide discussion of the future of our human society with a mixed mood of hope, anxiousness, excitement and fear. We try to dymystify AlphaGo Zero by a qualitative analysis to indicate that AlphaGo Zero can be understood as a specially structured…

2017-11-24abs ↗pdf ↗

This paper optimizes insurance reinsurance design under solvency constraints.

problem Optimizing risk transfer from an insurance company to a reinsurer under solvency constraints.
method Martingale method to derive optimal reinsurance design maximizing terminal value of surplus.
result Optimal reinsurance designs include a combination of proportional and stop-loss protection.

Optimal insurance strategy for maximizing RDEU under various premium principles.

problem Maximizing a risk-averse individual's RDEU with insurance priced by a distortion-deviation principle.
method Proved necessary and sufficient conditions for the optimal solution, considered ambiguity orders, and analyzed specific examples.
result Conditions for no insurance or deductible insurance to be optimal.

Study introduces indecomposability for varifolds, leading to geometric consequences.

problem Understanding the structure of varifolds and their connectedness properties.
method Introducing indecomposability and related concepts for varifolds.
result Substantial geometric consequences derived from the connectedness properties of varifolds.

A framework estimates categorical distributions under constraints, ensuring generality and uniqueness.

problem Estimating categorical distributions summarizing sample data under marginal constraints.
method Theoretical framework + Iterative Proportional Fitting (IPF) to estimate the distribution.
result A unique categorical distribution of Maximum Entropy under marginal constraints exists and is estimated.

A Kyle-inspired model with adaptive agents explains excess volatility and volatility clustering.

problem Reconciling asymmetrically informed traders with adaptive market hypothesis.
method Proposes a model with adaptive agents using inductive reasoning, reconciling Kyle model with Adaptive Market Hypothesis.
result Microfoundations for GARCH models and volatility clustering explained.

Study classifies 7-manifolds with specific homology and finds nonconnected moduli spaces of positive Ricci curvature metrics.

problem Classifying simply connected 7-manifolds with specific homology groups.
method Derived ss-invariants and applied to diffeomorphism classification and moduli space analysis.
result Found a simply connected 7-manifold with infinitely many path components in its moduli space of positive Ricci curvature metrics.

skscope simplifies sparsity-constrained optimization in Python.

problem Tedious mathematical deduction and programming for sparsity-constrained optimization.
method Introduces skscope, a Python library that allows users to solve sparsity-constrained optimization problems by just programming the objective function.
result skscope enables state-of-the-art solvers to quickly attain sparse solutions in high-dimensional spaces, achieving up to 80x speedup.

Critiques causal reductionism in financial studies, suggesting alternative approaches.

problem Limitations of unidirectional causation in self-referencing systems like finance.
method Critical assessment of causal inference in empirical finance, using ecological models.
result Current financial tools may be limited to ex post inference, especially in reflexive contexts.

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference …

2016-11-24abs ↗pdf ↗

Introduces CCR for constructing confidence regions from conformal predictions.

problem Challenges in constructing confidence regions for model parameters.
method Combines conformal prediction intervals for model outputs to establish confidence regions for parameters under minimal assumptions.
result Valid coverage guarantees for finite sample regime, applicable to various model types.

Optimizes tax payments for insurance companies using Lévy risk processes.

problem Maximizing expected accumulated discounted tax payments with a modified objective function.
method Loss-carry-forward tax system applied to spectrally negative Lévy processes until general draw-down time.
result Optimal tax return function and strategy derived.

We develop a Chern character map for twisted equivariant non-abelian cohomology.

problem Understanding non-abelian cohomology theories and their applications.
method General construction of the Chern character map for twisted equivariant non-abelian cohomology.
result Illustrated the construction by computing the equivariant Sullivan model of Cohomotopy.