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

8172533 · Nov 201919922001200920172026
48 results for mortality-linked securities

Study optimal investment strategy for pension schemes to hedge longevity risk.

problem Hedging longevity risk in defined contribution pension schemes.
method Transformed optimal investment problem into an unconstrained problem using dynamic programming and numerical studies.
result Longevity risk significantly impacts investment strategies, supporting the use of mortality-linked securities.

Develops a bi-variate stochastic framework to model mortality and interest rates with long-range dependence.

problem Captures long-range dependence and instantaneous correlation in mortality and interest rates.
method Mixed fractional Brownian motions, analytical solutions, risk-neutral measure, sequential parameter estimation.
result Explicit pricing of zero-coupon bonds and extreme mortality bonds, practical implications for pricing and risk management.

The paper examines bounds for stop-loss payoffs using transformed random variables.

problem Bounding stop-loss payoffs for a difference of two random variables.
method Analyzes crossing points of cdfs of original and transformed random variables.
result Unique pairwise crossing points for mortality-linked securities under symmetric copulas.

We propose the use of statistical emulators for the purpose of valuing mortality-linked contracts in stochastic mortality models. Such models typically require (nested) evaluation of expected values of nonlinear functionals of multi-dimensional stochastic processes. Except in the simplest cases, no closed-form expressi…

2015-08-03abs ↗pdf ↗

Optimizes a portfolio for an investor preferring accepted securities over a reference security.

problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.

We say that a pair of points x and y is secure if there exist a finite set of blocking points such that any geodesic between x and y passes through one of the blocking points. The main point of this paper is to exhibit new examples of blocking phenomena both in the manifold and the billiard table setting. As an approac…

2007-07-03abs ↗pdf ↗

Sparse oblique decision tree improves security rules for renewable power systems.

problem Identifying secure operating conditions in power systems with high renewable energy.
method Sparse weighted oblique decision tree to learn and embed linear security rules.
result The method significantly increases secure states and reduces solution time.

A riemannian manifold is secure if the geodesics between any pair of points in the manifold can be blocked by a finite number of point obstacles. Compact, flat manifolds are secure. A standing conjecture says that these are the only secure, compact riemannian manifolds. The conjecture claims, in particular, that a riem…

2008-06-22abs ↗pdf ↗

Securely trains regression models with secret sharing for data collaboration.

problem Balancing data collaboration for technological improvements with security concerns.
method Secret sharing scheme for scalable and efficient secure multiparty training.
result Scalable and efficient protocols for training linear and logistic regression models.

This paper reviews ML and DL for IoT security, highlighting gaps and future directions.

problem Security and privacy issues in IoT networks due to resource constraints and dynamic behavior.
method Systematic review of current security solutions and ML/ DL approaches.
result ML and DL are essential for IoT security due to resource constraints and dynamic behavior.

Explores security challenges of machine learning in real-world systems.

problem Vulnerabilities in machine learning models deployed in safety-critical systems.
method Broadens systems security view of ML vulnerabilities, identifies novel challenges, proposes mitigation suggestions.
result Highlights novel challenges and proposes mitigation strategies for securing ML systems.

In this paper are presented methods of impact analysis on informatics system security accidents, qualitative and quantitative methods, starting with risk and informational system security definitions. It is presented the relationship between the risks of exploiting vulnerabilities of security system, security level of …

2013-03-07abs ↗pdf ↗

Optimizes crypto-oriented neural architectures for faster secure inference.

problem Privacy conflicts between model users and providers in neural network applications.
method Proposes a novel Partial Activation layer to optimize the initial design of crypto-oriented neural architectures.
result Significant improvement in the efficiency of secure inference on common evaluation metrics.

Unified market-based description of returns and variances of trades.

problem Market-based variance of trades and market portfolio.
method Unified market-based approach to describe returns and variances of trades and market portfolio.
result Market-based variance accounts for random volumes of trades and differs from Markowitz's portfolio variance.

This paper discusses adversarial attacks on cyber security systems using machine learning.

problem Adversarial attacks limit the use of machine learning in cyber security.
method Characterizes adversarial attack methods and their applications in cyber security.
result Highlights unique challenges and future research directions for adversarial attacks in cyber security.

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.

Contextual bandit framework improves revenue optimization in securities lending market.

problem Optimizing revenue for agent lenders in a dynamic securities lending market.
method Utilized contextual bandit frameworks to address dynamic pricing problems in an e-commerce-like securities lending market.
result Contextual bandit approach consistently outperforms traditional methods by at least 15% in total revenue generated.

Study assesses how much security restaking protocols need to pay for.

problem Determining the optimal security level for restaking protocols using token incentives.
method Expanding a model by Durvasula and Roughgarden to include strategic attackers and node operators, constructing an approximation algorithm for token-based incentives.
result Restaking protocols can be secure with proper incentive management, even against strategic adversaries.

The paper explores how mining costs, rewards, and blockchain security are interconnected.

problem Understanding the interdependencies between mining costs, mining rewards, and blockchain security.
method Theoretical derivation and empirical analysis using daily crypto market data and autoregressive distributed lag approach.
result Cryptocurrency price and mining rewards are intrinsically linked to blockchain security outcomes.

The study calculates securities lending haircuts and indemnification costs.

problem Managing borrower default risk in securities markets.
method Repo haircut model applied to securities lending transactions; quantifies haircuts and indemnification costs.
result Computed borrower-dependent haircuts and indemnification costs for US Treasuries and equities.

Secure XGB for privacy-preserving machine learning in federated learning.

problem Privacy-preserving machine learning in federated learning with practical gradient tree boosting models.
method Secure multi-party computation, distributed model storage, secure permutation protocols.
result Our XGB models provide competitive accuracy and practical performance.

This paper improves federated learning efficiency by auto-tuning secure aggregation parameters.

problem Efficient communication in federated learning with quantized updates.
method Auto-tuning secure aggregation parameters based on random rotation properties.
result Improved communication efficiency in federated learning with secure aggregation.

The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.

problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M\mathbb{M} and Model S\mathbb{S} through convex optimization and game-theoretic lens.
result Model S\mathbb{S} achieves tighter security guarantees through single validator sets and aggregated slashing logic.

Two econometric models forecast security volatility using various data sources.

problem Forecasting security volatility using low, high, and option data.
method Proposes two GARCH models integrating low, high, and option data.
result GARCH-Itô-OI and GARCH-Itô-IV models outperform other models in 5-minute high-frequency data.

Secure and efficient distributed learning on devices with limited communication.

problem Limited communication and security in distributed on-device learning.
method Proposes SLSGD, a robust distributed optimization algorithm with efficient communication and attack tolerance.
result Stabilizes convergence and tolerates data poisoning on a small number of workers.

The emph{securities market} is the fundamental theoretical framework in economics and finance for resource allocation under uncertainty. Securities serve both to reallocate risk and to disseminate probabilistic information. emph{Complete} securities markets - which contain one security for every possible state of natur…

2013-01-16abs ↗pdf ↗

FastSecAgg improves federated learning security and efficiency.

problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.

In this paper, we consider the problem of optimization of a portfolio consisting of securities. An investor with an initial capital, is interested in constructing a portfolio of securities. If the prices of securities change, the investor shall decide on reallocation of the portfolio. At each moment of time, the prices…

2017-12-02abs ↗pdf ↗

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

A pair of points in a riemannian manifold MM is secure if the geodesics between the points can be blocked by a finite number of point obstacles; otherwise the pair of points is insecure. A manifold is secure if all pairs of points in MM are secure. A manifold is insecure if there exists an insecure point pair, and to…

2009-08-08abs ↗pdf ↗